|
|
Theory and Applications of Monte Carlo Methods
Hruda, Petr ; Šimek, Václav (referee) ; Bidlo, Michal (advisor)
This bachelor thesis deals with applications of Monte Carlo methods on various problems. In particular, Metropolis algorithm and Simulated Annealing were applied on optimization of Traveling Salesman Problem and the problem of graph coloring. Moreover, "traditional" Monte Carlo approach was utilized for statistical analysis of electronic circuits in which the values of components exhibit random variations with a given tolerance. The results are evaluated for different setups of Monte Carlo methods.
|
|
|
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.
|
|
|
Shopping Advisor
Kocourek, Jakub ; Bartík, Vladimír (referee) ; Kolář, Dušan (advisor)
The attached bachelor thesis deals with nding the shortest ways in a shop for the selected purchase. The different technologies of creating web pages are described. As for the state space search algorithms are given for nding the shortest path between two points and for solving the travel salesmen problem. The thesis continues with the description of a design and implementation of application with all used technologies (PHP, Nette, MySQL, JS, JQuery) applying the Dijkstra's algorithm for nding the shortest path and genetic algorithm for solving the travel salesmen problem.
|
|
|
Graphic Animation of Problem Solving Methods
Macek, Jiří ; Jurka, Pavel (referee) ; Zbořil, František (advisor)
There are many kinds of implementation artificial intelligence for automatic solving problems by computer technology. The main topics of this bachelor's thesis are some typical methods, describing of their features, comparing them among and shows some useful techniques of algoritmization and implementation too. Main purpose of this thesis is creating application, which clearly demonstrates at chosen problems methods of their solving.
|
|
|
Optimization Methods for SIMLIB/C++ Simulation Library
Chlebík, Jakub ; Janoušek, Vladimír (referee) ; Peringer, Petr (advisor)
This thesis addresses the topic of parametric optimization of simulation models. It introduces theoretical foundation of optimization and its uses in simulation analysis. Furthermore, it suggests the extension of SIMBLI/C++ library by module for optimization methods. Some of the chosen methods are then theoretically described, implemented in C++ language, demonstrates its uses and evaluates their success.
|
|
|
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.
|
|
| |
|
|
Test Application Methodology Based On the Identification of Testable blocks
Herrman, Tomáš ; Plíva, Zdeněk (referee) ; Racek, Stanislav (referee) ; Kotásek, Zdeněk (advisor)
The PhD thesis deals with the analysis of digital systems described on RT level. The methodology of data paths analysis is decribed, the data path controller analysis is not solved in the thesis. The methodology is built on the concept of Testable Block (TB) which allows to divide digital component to such segments which can be tested through their inputs/outputs, border registers and primary inputs/outputs are used for this purpose. As a result, lower number of registers is needed to be included into scan chain - border registers are the only ones which are scanned. The segmentation allows also to reduce the volume of test vectors, tests are generated for segments, not for the complete component. To identify TBs, two evolutionary algorithms are used, they operate on TB formal model which is also defined in the thesis.
|
|
|
Evolutionary Design of Ultrasound Treatment Plans
Masárová, Mária ; Sekanina, Lukáš (referee) ; Jaroš, Jiří (advisor)
Použitie zameraného ultrazvuku pomáha zachraňovať a uľahčovať ľudské životy, nakoľko práve jeho využitím môžeme liečiť epilepsiu, ničiť rakovinové bunky a zastavovať vnútorné krvácanie neinvazívnou cestou, ktorá predstavuje pre človeka prijateľnejšie a bezpečnejšie riešenie. Vzhľadom na to, že bezpečnosť a zdravie človeka je prioritou pri liečení závažných ochorení, sa táto práca zaoberá porovnaním rôznych evolučných algoritmov a ich použitím pri návrhu evolučných ultrazvukových operačných plánov. V práci sa využívajú dva typy médií, a to homogénne médium a heterogénne médium. Pri vyhodnocovaní algoritmov sa zameriavame na efektivitu s ohľadom na veľkosť populácie, počet evaluácií fitness funkcie a výpočetný čas. V homogénnom médiu sa ako najlepší algoritmus ukázal CMA-ES, ktorý v priebehu 20 sekúnd dokázal nájsť optimálne riešenie so 100% pokrytím cieľovej oblasti pre rotované zrnko ryže. Heterogénne médium je ale oveľa zložitejší problém, predovšetkým kvôli lebke, ktorá odráža a pohlcuje veľkú časť ultrazvuku. Tu sa ako najlepší preukázal algoritmus SA, ktorý našiel výsledok s 23% pokrytím cieľovej oblasti v prvom testovacom scenári. Doba výpočtu trvala približne 1 hodinu a 18 minút, čo značí že je čas veľmi znemožňujúci ("drahý") faktor.
|
|
|
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.
|
guest ::
