|
|
Document Classification
Marek, Tomáš ; Škoda, Petr (referee) ; Otrusina, Lubomír (advisor)
This thesis deals with a document classification, especially with a text classification method. Main goal of this thesis is to analyze two arbitrary document classification algorithms to describe them and to create an implementation of those algorithms. Chosen algorithms are Bayes classifier and classifier based on support vector machines (SVM) which were analyzed and implemented in the practical part of this thesis. One of the main goals of this thesis is to create and choose optimal text features, which are describing the input text best and thus lead to the best classification results. At the end of this thesis there is a bunch of tests showing comparison of efficiency of the chosen classifiers under various conditions.
|
|
|
Information System for a School Including Automated Timetabling
Švadlenka, Jiří ; Jurka, Pavel (referee) ; Chmelař, Petr (advisor)
This thesis devote itself to use of information system for school agenda administration. Schools are forced to administer big amounts of informations, not only referred to their students. Broad issue is very extensive and disparate, so the most common types of data and demands on school information system operation are stated. The system for automatic generation of timetables is part of the school information system. At the first, basic conceptions of scheduling scope are defined and tied together with them are methods and algorithms for timetable creation problem solving. School timetabling is problem of scheduling lessons with certain limitative conditions. Further, thesis is engaged in design of school information system, data organization in such system and solving of system design problems. Designed information system accentuates on easy expandability and wide range of usage possibilities. Also suggested algorithm for solving of defined school timetabling is stated in this part of thesis.
|
|
|
Evolutionary algorithms
Haupt, Daniel ; Polách, Petr (referee) ; Honzík, Petr (advisor)
The first part of this work deals with the optimization and evolutionary algorithms which are used as a tool to solve complex optimization problems. The discussed algorithms are Differential Evolution, Genetic Algorithm, Simulated Annealing and deterministic non-evolutionary algorithm Taboo Search.. Consequently the discussion is held on the issue of testing the optimization algorithms through the use of the test function gallery and comparison solution all algorithms on Travelling salesman problem. In the second part of this work all above mentioned optimization algorithms are tested on 11 test functions and on three models of placement cities in Travelling salesman problem. Firstly, the experiments are carried out with unlimited number of accesses to the fitness function and secondly with limited number of accesses to the fitness function. All the data are processed statistically and graphically.
|
|
|
Reliability-based structural optimization
Slowik, Ondřej ; Pukl, Radomír (referee) ; Novák, Drahomír (advisor)
This thesis presents the reader the importance of optimization and probabilistic assessment of structures for civil engineering problems. Chapter 2 further investigates the combination between previously proposed optimization techniques and probabilistic assessment in the form of optimization constraints. Academic software has been developed for the purposes of demonstrating the effectiveness of the suggested methods and their statistical testing. 3th chapter summarizes the results of testing previously described optimization method (called Aimed Multilevel Sampling), including a comparison with other optimization techniques. In the final part of the thesis, described procedures have been demonstrated on the selected optimization and reliability problems. The methods described in text represents engineering approach to optimization problems and aims to introduce a simple and transparent optimization algorithm, which could serve to the practical engineering purposes.
|
|
|
Performance comparison of methods for design of experiments for analysis of tasks involving random variables
Martinásková, Magdalena ; Novák, Drahomír (referee) ; Vořechovský, Miroslav (advisor)
The thesis presents methods and criteria for creation and optimization of design of computer experiments. Using the core of a program Freet the optimized designs were created by combination of these methods and criteria. Then, the suitability of the designs for statistical analysis of the tasks vith input random variables was assessed by comparison of the obtained results of six selected functions and the exact (analytically obtained) solutions. Basic theory, definitions of the evaluated functions, description of the setting of optimization and the discussion of the obtained results, including recommendations related to identified weaknesses of certain designs, are presented. The thesis also contains a description of an application that was created to display the results.
|
|
|
Simulation models of human operator.
Boháč, Petr ; Horák, Karel (referee) ; Havlíková, Marie (advisor)
This paper deals with simulation models of the human operator controlling lateral position of simulated vehicle. I am comparing parameters and quality of the McRuer human driver model and the PID controller. Simulated system is single-track vehicle model. Simulated driver is tasked to pass a Moose test with this vehicle model. I am using the simulated annealing method to find optimal parameters of the driver model and then I visualize realized test in 2D and 3D visualization. In the end of this paper I compare simulations of the driver models and assess achieved results.
|
|
|
Ant colony
Hart, Pavel ; Hynčica, Ondřej (referee) ; Honzík, Petr (advisor)
First part of the thesis is about literature research of optimization algorithms. Three of the algorithms were implemented and tested, concretely the ant colony algorithm, tabu search and simulated annealing. All three algorithms were implemented to solve the traveling salesman problem. In second part of the thesis the algorithms were tested and compared. In last part the influence of the ant colony parameters was evaluated.
|
|
|
MATLAB/ Global Optimization Toolbox: Solving Optimization Problems
Švihálková, Kateřina ; Dvořák, Jiří (referee) ; Lang, Stanislav (referee) ; Matoušek, Radomil (advisor)
The bachelor thesis deals with basic description of global optimization methods which are implemented in MATLAB environment. First part of this thesis describes two MATLAB's toolboxes -- Optimization Toolbox and Global Optimization Toolbox. This study also describes chosen algorithms from those toolboxes (Genetic Algorithms, Simulated Annealing, Pattern Search and Fminsearch) and describes it's implementation. The last part is focused on the solving of optimization problems. Rosenbrock's function, Rastrigin's function, Traveling Salesman Problem and Stepped Cantilever Beam Design Problem are being solved by methods mentioned above. Reached results of every task are compared to each other and evaluated.
|
|
|
Metaheuristic optimalization for routing problems
Novák, Vít ; Fábry, Jan (advisor) ; Melechovský, Jan (referee)
Routing problems are ones of the most famous members of the group of the classical optimalization combinatorial problems. Travelling salesman problem and problems derived from it have been attracting mathematics and analysts, since they were firstly formulated, and accelerating a development of new methods and approaches that can be used for a wide range of another real-life problems. This thesis aims to demonstrate an usefulness and a flexibility of shown metaheristic methods. Results are compared with outputs of alternative algorithms or known optimal solutions where it is possible. To fulfill this goal the VBA application has been developed. The results of experiments are presented and the application is decribed in a second part of this thesis. A reader should be sufficiently instructed which way he could choose to solve similar types of problems
|
|
| |
guest ::
