|
|
Construction of Periodic Railway Timetables
Kalický, Andrej ; Babilon, Robert (advisor) ; Pergel, Martin (referee)
In the propounded thesis author studies the periodic railway timetable. The aim of this thesis is to construct time shifts among train lines so that transfers between lines would be planned in the best possible way. Author discusses the problem to solve, and its differences from standard processing of periodic railway timetable construction. Author propounds and code 2 algorithms for optimization of given timetable. At the end of thesis the solutions and algorithms are compared based on statistical data related with the process of periodic railway timetable construction.
|
|
|
High Performance Analytics
Kalický, Andrej ; Kyjonka, Vladimír (advisor) ; Holubová, Irena (referee)
This thesis explains Big Data Phenomenon, which is characterised by rapid growth of volume, variety and velocity of data - information assets, and thrives the paradigm shift in analytical data processing. Thesis aims to provide summary and overview with complete and consistent image about the area of High Performance Analytics (HPA), including problems and challenges on the pioneering state-of-art of advanced analytics. Overview of HPA introduces classification, characteristics and advantages of specific HPA method utilising the various combination of system resources. In the practical part of the thesis the experimental assignment focuses on analytical processing of large dataset using analytical platform from SAS Institute. The experiment demonstrates the convenience and benefits of In-Memory Analytics (specific HPA method) by evaluating the performance of different analytical scenarios and operations. Powered by TCPDF (www.tcpdf.org)
|
|
|
Construction of Periodic Railway Timetables
Kalický, Andrej ; Pergel, Martin (referee) ; Babilon, Robert (advisor)
In the propounded thesis author studies the periodic railway timetable. The aim of this thesis is to construct time shifts among train lines so that transfers between lines would be planned in the best possible way. Author discusses the problem to solve, and its differences from standard processing of periodic railway timetable construction. Author propounds and code 2 algorithms for optimization of given timetable. At the end of thesis the solutions and algorithms are compared based on statistical data related with the process of periodic railway timetable construction.
|
|
| |
guest ::
