|
|
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.
|
|
|
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.
|
|
|
Optimizing design of electric machines
Šporcr, Viktor ; Klíma, Jiří (referee) ; Janda, Marcel (advisor)
Semester theses focus on optimisation methods useful for construction electric machines. Contain elementary sorting optimization methods and brief description of their algorithms. In these theses is foreshadow how shape of asynchronous stator core should be optimized for better effectivity. Next chaps are discuss about application optimization methods to concrete induction motor.
|
|
|
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.
|
|
|
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.
|
|
|
Quantum-Inspired Optimisation Algorithms
Kosík, Dominik ; Sekanina, Lukáš (referee) ; Bidlo, Michal (advisor)
The focus of this work is an implementation of the chosen quantum-inspired optimisation algorithm and its modifications, which will be compared at the end of the work. As the optimisation algorithm was chosen simulated quantum annealing algorithm. The first part of the work will lay the theoretical groundwork of standard optimisation algorithms used in this work, physics from which the inspiration for the simulated quantum annealing originates, and a description of the chosen algorithm. The second part will focus on the implementation of the algorithms on the selected problems. The selected problems are travelling salesman problem, searching rules for cellular automaton and MAX-SAT problem. The last part will contain the proposed modifications of the simulated quantum annealing, a comparison of the basic variant and standard optimisations algorithms, and an evaluation of the results.
|
|
|
Prediction of Multiple Time Series at Stock Market Trading
Palček, Peter ; Zbořil, František (referee) ; Rozman, Jaroslav (advisor)
The diploma thesis comprises of a general approach used to predict the time series, their categorization, basic characteristics and basic statistical methods for their prediction. Neural networks are also mentioned and their categorization with regards to the suitability for prediction of time series. A program for the prediction of the progress of multiple time series in stock market is designed and implemented, and it's based on a model of flexible neuron tree, whose structure is optimized using immune programming and parameters using a modified version of simulated annealing or particle swarm optimization. Firstly, the program is tested on its ability to predict simple time series and then on its ability to predict multiple time series.
|
guest ::
