|
|
Creating Timetables Using Genetic Algorithms
Horký, Aleš ; Matoušek, Jiří (referee) ; Minařík, Miloš (advisor)
This bachelor thesis contains design and implementation of two-phase genetic algorithm intended for creating timetable schedules at primary schools. The algorithm is designed for maximum reduction of state space of solved problem without decrease of its universality. The implementated program in C++ language is applicable for creating timetable schedules at small and medium sized schools.
|
|
|
Application of optimisation methods for MRI data segmentation
Olešová, Kristína ; Mézl, Martin (referee) ; Chmelík, Jiří (advisor)
This thesis deals with a segmentation of brain tissues from MRI image data and its implementation in MATLAB. Segmentation problematic is described with attention to formulating segmentation as optimization problem and segmentation of given images with different metaheuristic algorithm consequently. This approach was chosen due to information from last specialized publications, where it was accentuated for its fast computational speed and universality. This thesis tries to prove this statement with segmentation of brain images with brain tumours that have different types, number, stage of illness and phase of therapy.
|
|
|
Native XML Interface for a Relational Database
Piwko, Karel ; Burget, Radek (referee) ; Chmelař, Petr (advisor)
XML has emerged as leading document format for exchanging data. Because of vast amounts of XML documents available and transfered, there is a strong need to store and query information in these documents. However, the most companies are still using a RDBMS for their data warehouses and it is often necessary to combine legacy data with the ones in XML format, so it might be useful to consider storage possibilities for XML documents in a relation database. In this thesis we focused on structured and semi-structured data-based XML documents, because they are the most common when exchanging data and they can be easily validated against an XML schema. We propose a slightly modified Hybrid algorithm to shred doc- uments into relations using an XSD scheme and we allowed redundancy to make queries faster. Our goal was not to provide an academic solution, but fully working system supporting latest standards, which will beat up native XML databases both by performance and vertical scalability.
|
|
|
Optimization of cogeneration system
Stacha, Radek ; Turek, Vojtěch (referee) ; Jegla, Zdeněk (advisor)
Master thesis is focused on optimization of cogeneration system for purpose of rating optimization methods and evaluating properties of these methods. For each method there is description together with block schemes. First part of thesis is devoted to description of methods and their comparison. Second part consists of development of hybrid algorithm, which is used to optimize cogeneration systém model. Each algorithm compared is together with hybrid algorithms included in annexes.
|
|
|
Hybrid Algorithms in Optimization
Zamazal, Petr ; Hrabec, Pavel (referee) ; Popela, Pavel (advisor)
This work deals with the solution of an integer programming task using a hybrid algorithm. Mentioned task is a minimum cost network flow problem with option of adding new edges. The hybrid algorithm is based on a genetic algorithm using the network simplex method. Implementation is in the Python programming language.
|
|
|
New Hybrid Methods for Robust and Automated Parameter Estimation of Mechatronic Systems
Najman, Jan ; Štefek, Alexandr (referee) ; Opluštil, Vladimír (referee) ; Grepl, Robert (advisor)
The thesis deals with the development of a new hybrid optimization algorithm for mechatronic models. The introductory chapters are devoted to a general description of the problem of estimating unknown system parameters, based on the developed mathematical model and measured data. Furthermore, an overview and a brief description of available optimization algorithms that are suitable for solving this type of problem is given. Based on the research study, the specific objectives of the paper are then formulated. In the second part of the thesis, a newly developed set of mechatronic models created using physical modelling tools is described. Subsequently, a comparative test of the speed and success rate of the selected optimization algorithms is performed using these models. Based on the results of this test, the design of a new hybrid algorithm is proposed, which is then tested and compared with the other algorithms. Finally, several new auxiliary functions and tools are presented to detect and analyze improperly designed parameter estimation problems.
|
|
|
Hybrid Algorithms in Optimization
Zamazal, Petr ; Hrabec, Pavel (referee) ; Popela, Pavel (advisor)
This work deals with the solution of an integer programming task using a hybrid algorithm. Mentioned task is a minimum cost network flow problem with option of adding new edges. The hybrid algorithm is based on a genetic algorithm using the network simplex method. Implementation is in the Python programming language.
|
|
|
Application of optimisation methods for MRI data segmentation
Olešová, Kristína ; Mézl, Martin (referee) ; Chmelík, Jiří (advisor)
This thesis deals with a segmentation of brain tissues from MRI image data and its implementation in MATLAB. Segmentation problematic is described with attention to formulating segmentation as optimization problem and segmentation of given images with different metaheuristic algorithm consequently. This approach was chosen due to information from last specialized publications, where it was accentuated for its fast computational speed and universality. This thesis tries to prove this statement with segmentation of brain images with brain tumours that have different types, number, stage of illness and phase of therapy.
|
|
|
Creating Timetables Using Genetic Algorithms
Horký, Aleš ; Matoušek, Jiří (referee) ; Minařík, Miloš (advisor)
This bachelor thesis contains design and implementation of two-phase genetic algorithm intended for creating timetable schedules at primary schools. The algorithm is designed for maximum reduction of state space of solved problem without decrease of its universality. The implementated program in C++ language is applicable for creating timetable schedules at small and medium sized schools.
|
|
|
Native XML Interface for a Relational Database
Piwko, Karel ; Burget, Radek (referee) ; Chmelař, Petr (advisor)
XML has emerged as leading document format for exchanging data. Because of vast amounts of XML documents available and transfered, there is a strong need to store and query information in these documents. However, the most companies are still using a RDBMS for their data warehouses and it is often necessary to combine legacy data with the ones in XML format, so it might be useful to consider storage possibilities for XML documents in a relation database. In this thesis we focused on structured and semi-structured data-based XML documents, because they are the most common when exchanging data and they can be easily validated against an XML schema. We propose a slightly modified Hybrid algorithm to shred doc- uments into relations using an XSD scheme and we allowed redundancy to make queries faster. Our goal was not to provide an academic solution, but fully working system supporting latest standards, which will beat up native XML databases both by performance and vertical scalability.
|
guest ::
