|
|
Geocaching Support on Pocket PCs with GPS
Kuchta, Michal ; Bidlo, Michal (referee) ; Novosad, Petr (advisor)
Modern technologies of pocket computers (personal digital asistents, PDA) and navigation systems - how to combine them to have a fun? This is the question, that this work tries to answer. In the first few chapters, the work informs reader about the GPS technology, about Geocaching stash hunting game and about technology of pocket computers. A Concept and implementation of WMGeo program, which could be the Geocaching solution for the PocketPC, is presented.
|
|
|
Evolutionary Analogue Amplifier Optimisation
Bielik, Marek ; Zachariášová, Marcela (referee) ; Bidlo, Michal (advisor)
Táto práca demonštruje možnosti využitia evolučných algoritmov, konkrétne evolučných stratégií, v doméne dizajnu analógových zosilňovačov. Do implementácie je zahrnutý ngSPICE simulátor, ktorý je použitý na vyhodnotenie optimalizovaných riešení a v práci je navrhnutých niekoľko vyhodnocovacích metód. Práca tiež zahŕňa experimenty a ich výsledky, ktoré boli použité na určenie najvodnejších parametrov evolučných stratégií. Cieľom bolo optimalizovať hodnoty súčiastok jedno a dvoj stupňových zosilňovačov s bipolárnymi tranzistormi v zapojení so spoločným emitorom. Výsledkom je nástroj umožňujúci návrh zosilňovačov s ľubovoľným zosilnením v rámci možností daného obvodu bez použitia akéhokoľvek matematického aparátu.
|
|
|
Self-Modifying Cellular Automata
Szabo, Peter ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
This work deals with cellular automata with a concept of self- modification and their comparsion against regular cellular automatons . For this task we constructed a simulator , that lets us define the logic of artificial inteligence, number generator and statistical test, which are used by the automata , on their own . Consequently two experiments are carried out that demonstrate the concept of self- modification .
|
|
| |
|
|
Evolutionary Design of Image Classifier
Koči, Martin ; Bidlo, Michal (referee) ; Drahošová, Michaela (advisor)
This thesis deals with evolutionary design of image classifier with help of genetic programming, specifically with cartesian genetic programming. Thesis discribes teoretical basics of machine learing, evolutionary algorithms and genetic programming. Part of this thesis is described design of the program and its implementation. Futhermore, experiments are performed on two solved tasks for the classification of handwritten digits and the classification of cube drawings, which can be used to determine the rate of dementia in Parkinson's disease. The best designed solution for digits is with AUC of 0.95 and for cubes 0.86. Designed solutions are compared by other methods, namely convolutional neural networks (CNN) and the support vector machines (SVM). The resulting AUC for the classification of digits for both CNN and SVM is 0.99, for cubes CNN has a final AUC 0.81 and SVM 0.69. The cubes are then compared with existing solution, which resulted in AUC 0.70, so that the results of the experiments show an improvement in the method used in this thesis.
|
|
| |
|
|
New Cellular Automata Design Techniques
Baláž, Martin ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
The aim of this master thesis is to introduce a new technique for the design of cellular automata which will provide a better possibilities for the implementation and solving given problems in an environment of non-uniform automata. In this work, the theoretical foundations of cellular automata have been summarized and the possibilities of their design were examined using two evolutionary principles that have commonly been used - genetic algorithm and cellular programming. Two principally different issues were selected on which the possibilities and capabilities of these techniques were proven: the synchronization problem and the system of implementation of logic gates in an environment of cellular automata. Based on a review of the implementation properties and the initial results of usage of these methods a new design method for cellular automata was created - cellular evolution. The cellular evolution with its method of "prediction of the future state of surrounding cells" provides new possibilities in the design of cellular automata since it operates with structured genes which allow the gene to be active for a variety of cellular surroundings. In the conclusion of this work, all three methods were compared on two selected problems and their abilities were summarized in a detailed overview.
|
|
|
Genetic Programming for Design of Digital Circuits
Hejtmánek, Michal ; Bidlo, Michal (referee) ; Gajda, Zbyšek (advisor)
The goal of this work was the study of evolutionary algorithms and utilization of them for digital circuit design. Especially, a genetic programming and its different manipulation with building blocks is mentioned in contrast to a genetic algorithm. On the basis of this approach, I created and tested a hybrid method of electronic circuit design. This method uses spread schemes according to the genetic algorithm for the pattern problems witch are solved by the genetic programming. The method is more successful and have faster convergence to a solution in difficult electronic circuits design than a common algorithm of the genetic programming.
|
|
|
Smart Home Security System
Dragúň, Peter ; Bidlo, Michal (referee) ; Vašíček, Zdeněk (advisor)
This thesis deals with the security of flats and houses using Bluetooth Low Energy (BLE) technology. The aim of the thesis is to develop an electronic security system for access and intrusion control exploiting the possibilities of Bluetooth Low Energy technology for improved user experience. The thesis describes security systems, BLE technology and ESP32 microcontroller. The creation of a mobile application that is used to set up the system and its management is included, as well. The thesis also describes the design, construction of a prototype and its implementation. The last part is the verification of functionality, testing and suggestions of possibilities for further improvement of the created prototype.
|
|
|
Novel Applications of Ant Algorithms
Korgo, Jakub ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
Ant algorithms have been used for a variety of combinatorial optimization problems. One of these problems, where ant algorithms haven't been used, is the design of transition rules for cellular automata (CA). Which is a problem that this master's thesis is focused on. This work begins with an introduction into ant algorithms and a overview of its applications, followed by an introduction into CA. In the next part the author proposes a way how to encode rules of CA into a graph which is used in ant algorithms. The last part of this thesis contains an application of encoded graph on elitist ant system and MAX-MIN ant system. This is followed by experimental results of creating transition rules for CA problems by these algorithms.
|
guest ::
