|
|
Applications of Ant Algorithms
Kaščák, Imrich ; Vašíček, Zdeněk (referee) ; Bidlo, Michal (advisor)
The presented thesis focuses on the basic optimization algorithm of Ant Colony Optimization (ACO) - Ant System (AS) and its extension, Ant Colony System (ACS) on Traveling Salesman Problem (TSP). The essence of these algorithms is to find the optimal solution (the shortest path) in a specified instance containing several locations. The thesis demonstrates verification of behaviour of both algorithms, experimental study of impact of adjustable parameters of ant algorithms on result. Furthermore, the thesis is focused on examining the idea of optimizing detection of image edges by introducing a modification into an existing solution. Modified solution experiments are performed and compared to the original.
|
|
|
FM Transmitter on Rasberry Pi
Kohoutek, Jan ; Bidlo, Michal (referee) ; Vašíček, Zdeněk (advisor)
Aim of this bachelor thesis is to desing and implement player, which will be able to play its own files in FM band. The player consists of transmitter based on Rapsberry Pi and mobile application that allows wireless control of this player. Technical report is divided into three main parts. The initial part describes technologies for transmission of audio signal in FM band. Followed by description of suggested solution and its implementation. Concluding part describes the designed prototype and assesment of its parameters.
|
|
| |
|
| |
|
|
Localization of Objects in Wireless Sensor Network Environment
Vícha, Tomáš ; Bidlo, Michal (referee) ; Šimek, Václav (advisor)
This thesis deals with the use of spatial awareness methods within technologies designed for creation of short-range wireless sensor networks. The thesis analyzes several techniques that can be used to estimate position of objects within the sensor network. For a practical solution, a method based on measuring the time differences of the sent messages was chosen. A circuit implementation of a network node based on the DW1000 chip, which works on ultra-wideband transmission technology, was implemented. A sensor network with the appropriate user application for its operation and display of localization results was also implemented.
|
|
|
Evolutionary Design Using Rewriting Systems
Nétková, Barbora ; Hyrš, Martin (referee) ; Bidlo, Michal (advisor)
This master’s thesis proposes a method for the evolutionary design of rewriting systems. In particular, genetic algorithm will be applied to design rewriting rules for a specific variant of Lindenmayer system. The evolved rules of such grammar will be applied to generate growing sorting networks. Some distinct approaches to the rewriting process and construction of the sorting networks will be investigated. It will be shown that the evolution is able to successfully design rewriting rules for the proposed variants of rewriting processes. The results obtained exhibit abilities to successfully create partially growing sorting networks, which was evolved to grow for fewer inputs and in subsequent iterations grows up to 36 inputs.
|
|
|
Access System Controller Supporting More Types of Identification
Havlíček, Lukáš ; Bidlo, Michal (referee) ; Vašíček, Zdeněk (advisor)
This thesis deals with design and implementation of access system control unit supporting more types of identification. Designed system supports identification using access cards MIFARE and detection of Bluetooth Low Energy devices. Device is realised using the ESP32 development board. The display of passage history and system configuration is solved using a web interface, which is provided by a web server running on this device.
|
|
| |
|
|
Portable Stimulus Scenarios Specification for RISC-V Processor Modules
Bardonek, Petr ; Bidlo, Michal (referee) ; Zachariášová, Marcela (advisor)
The thesis is focused on the design and implementation of the portable stimulus verification scenarios for selected Berkelium processor modules based on RISC-V architecture from Codasip. The aim of this work is to use new standard for Portable Stimulus developed by Accellera organization to design and implement portable stimulus scenarios using the Questa InFact tool from Mentor. The proposed portable stimulus scenarios are then linked to the already existing verification environments of the UVM methodology and then they are used for verification of the Berkelium processor modules based on RISC-V architecture. The last part of the thesis is the evaluation of portability of the implemented scenarios to the individual levels of the Berkelium processor based on RISC-V architecture (IP blocks, subsystems, system level), in which it tries to use the proposed scenarios across all verificated levels.
|
|
|
DNA Computing and Applications
Fiala, Jan ; Petrlík, Jiří (referee) ; Bidlo, Michal (advisor)
This thesis focuses on the design and implementation of an application involving the principles of DNA computing simulation for solving some selected problems. DNA computing represents an unconventional computing paradigm that is totally different from the concept of electronic computers. The main idea of DNA computing is to interpret the DNA as a medium for performing computation. Despite the fact, that DNA reactions are slower than operations performed on computers, they may provide some promising features in the future. The DNA operations are based on two important aspects: massive parallelism and principle of complementarity. There are many important problems for which there is no algorithm that would be able to solve the problem in a polynomial time using conventional computers. Therefore, the solutions of such problems are searched by exploring the entire state space. In this case the massive parallelism of the DNA operations becomes very important in order to reduce the complexity of finding a solution.
|
guest ::
