|
| |
|
|
Association Rule Mining
Šabatka, Ondřej ; Stryka, Lukáš (referee) ; Bartík, Vladimír (advisor)
This bachelor's thesis is concerned with the association rule mining. The first part is devoted to the explanation of data mining technology and theory, which are necessary pre-steps for getting acquainted with association analysis. The next part focuses on the association analysis itself and explains the principals of algorithm Apriori in detail. The last part of the thesis describes the implementation and testing of algorithm Apriori in the Java programming language.
|
|
|
The Comparison of the Algorithms for the Solution of Travel Sales Problem
Kopřiva, Jan ; Všetička, Martin (referee) ; Dostál, Petr (advisor)
The Master Thesis deals with logistic module innovation of information system ERP. The principle of innovation is based on implementation of heuristic algorithms which solve Travel Salesman Problems (TSP). The software MATLAB is used for analysis and tests of these algorithms. The goal of Master Thesis is the comparison of selections algorithm, which are suitable for economic purposes (accuracy of solution, speed of calculation and memory demands).
|
|
|
Optimization Algorithms Inspired by Nature
Babjarčiková, Lenka ; Zbořil, František (referee) ; Zbořil, František (advisor)
This thesis deals with four optimization algorithms inspired by nature. It describes ant colony optimization algorithm, marriage in honeybees optimization algorithm, grey wolf optimization algorithm and simulated annealing algorithm. The main part of this thesis is the application of these algorithms for solving three optimization problems. One of the problems is travelling salesman problem, which is solved by ant colony optimization, next problem is searching for extreme of function solved by grey wolf optimization and simulated annealing algorithms and the last is boolean satisfiability problem solved by marriage in honeybees optimization algorithm. Thesis contains experiments with these algorithms and reviews gained results.
|
|
|
Multiagent system for traffic flow simulation and analysis
Koutný, Vladimír ; Hynčica, Ondřej (referee) ; Honzík, Petr (advisor)
This diploma thesis deals with an oriented graph processing applying a multi-agent system designated for traffic simulation. The thesis was written as a research study. Based on the study, a simulation environment was created able to respond to various stimuli. Meant as the agents, there are vehicles and their drivers that have various features, based on which they respond to the given stimuli. Communication is conducted via a so-called super-agent that monitors all action on the map and passes this information on particular agents. The agents are able to respond in advance to traffic jams (closures, accidents). In such situations, an algorithm designated for a new route finding is conducted. Besides the controlled ones, there can operate on the map also agents simulating common traffic.
|
|
|
Composite Subband Adaptive Speech Enhancement
Hovorka, Jaroslav ; Vlček, Čestmír (referee) ; Křesálek,, Vojtěch (referee) ; Sysel, Petr (advisor)
The thesis deals with single channel and multiple channel algorithms for speech enhancement. The goal of this work is to perform the deep analysis of both single channel and multiple channel algorithms in sense of their behaviour in noisy environment of combat vehicles and platforms. Based on this analysis a new composite speech enhancement algorithm will be designed. This new approach is expected to increase quality of the processed speech in military communications systems. These systems are characterised by their operation under very noisy conditions where background noise is very high and signal-to-noise ratio extremely low. These noisy conditions are typical for the range of military and combat platforms and vehicles.
|
|
| |
|
|
Scrabble for Mobil Phones
Kaněčka, Ondřej ; Kunc, Michael (referee) ; Schönecker, Rudolf (advisor)
This paper deals with an usage of searching algorithms and lexical data structures for platforms with limited computing power and accessible memory (celluar phones and similar) in SCRABBLE brand crossword game. There are also shown its advantages and disadvantages on this platform. The Appel-Jacobson searching algorithm is used to search possible moves. The lexicon with all words is available for this algorithm. It's stored in Directed Acyclic Word Graph (DAWG), which provides fast data searching and data compression too, so the size of the lexicon is comparatively small considering the target platform. The final Java application for celluar phones (MIDP 2.0) adds graphical interface and game control so it provides playing SCRABBLE brand crossword game against artificial intelligence or against human.
|
|
|
Development of ABS Control Algorithm for Heavy Commercial Vehicle
Slepánek, David ; Porteš, Petr (referee) ; Fojtášek, Jan (advisor)
This thesis is concerned with ABS algorithm project for commercial vehicles. In the first part the reader is introduced to the history and first usage of the anti-blocking system, its principles and main functions. There are also driving algorithms and functionality system control. The second part is dedicated to the dynamic model, programs and ADAMS Car and MATLAB Simulink interfaces. It also contains the description of the algorithm, its parameters and basic functionality assay. Simulation, program interlink, testing and tuning are also described. The concluding part deals with results and their assessment.
|
|
|
Advanced methods of mobile robot path planning
Maňáková, Lenka ; Šoustek, Petr (referee) ; Dvořák, Jiří (advisor)
This work is focused on advanced methods of mobile robot's path planning. The theoretical part describes selected graphical methods, which are useful for speeding up the process of finding the shortest paths, for example through reduction of explored nodes of the state space. In the practical part was created simulate environment in the Python language and in this environment, selected algorithms was implemented.
|
guest ::
