|
| |
|
|
Structural Design Using Cellular Automata
Bezák, Jakub ; Vašíček, Zdeněk (referee) ; Bidlo, Michal (advisor)
The aim of this paper is to introduce the readers to the field of cellular automata, their design and their usage for structural design. Genetic algorithms are usually involved in designing complicated cellular automata, and because of that they are also briefly described here. For the purposes of this work sorting networks are considered as suitable structures to be designed using cellular automata, however, they are not a part of the automata but they are generated separately by modified rules of a local transition function.
|
|
|
Procedural Generation of Dungeon Type Structures
Šipoš, Marek ; Rychlý, Marek (referee) ; Bartík, Vladimír (advisor)
The main aim of this bachelor thesis was to design and develop a library for procedural generation of dungeons and web application for its practical use. The library offers a configuration interface, output generation according to this configuration and file support. The web application allows the visualization of the obtained input. The implementation was done in Java language.
|
|
|
Prediction of Secondary Structure of Proteins Using Cellular Automata
Brigant, Vladimír ; Drahošová, Michaela (referee) ; Bendl, Jaroslav (advisor)
This work describes a method of the secondary structure prediction of proteins based on cellular automaton (CA) model - CASSP. Optimal model and CA transition rule parameters are acquired by evolutionary algorithm. Prediction model uses only statistical characteristics of amino acids, so its prediction is fast. Achieved results was compared with results of other tools for this purpose. Prediction cooperation with a existing tool PSIPRED was also tested. It didn't succeed to beat this existing tool, but partial improvement was achieved in prediction of only alpha-helix secondary structure motif, what can be helful if we need the best prediction of alpha-helices. It was developed also a web interface of designed system.
|
|
|
Discrete Simulation of Programmable Systems
Mynář, Pavel ; Zuzaňák, Jiří (referee) ; Mlích, Jozef (advisor)
The subject of this thesis is the design and implementation of software library for discrete simulation of programmable units and their mutual communication and implementation of several illustrative examples based on it. The library is designed to be platform independent and as robust and simple to use as possible.
|
|
| |
|
|
Editor and Simulator of Traffic by Cellular Automata
Vašátko, Libor ; Zbořil, František (referee) ; Žák, Jakub (advisor)
This thesis deals with cellular automata, mainly with their application in traffic simulation. Existing simulation models Nagel-Schreckenberg and Brake-light are analyzed, and their extension to simulate intersections is designed. Application for editing and simulating of any intersection is designed and implemented. This application allows to compare different simulation models also allows to add new simulation model created by user. In the end, designed extension for simulation models is tested.
|
|
|
Calibration of the high-speed traffic microsimulation
Korček, Pavol ; Apeltauer, Tomáš (referee) ; Pospíchal, Jiří (referee) ; Sekanina, Lukáš (advisor)
Tato disertační práce je zaměřena na vysokorychlostní simulace dopravy a jejich přesnou kalibraci pomocí různých typů dopravních dat. Práce se po úvodním popisu motivace pro samotný výzkum nejdříve věnuje současnému stavu poznání, a dále rozdělení simulátorů dopravy, zejména podle typu dat, se kterými se v nich pracuje. Úpravou existujícího řešení je navržen vlastní mikrosimulační model, který je založen na principu celulárního automatu. S tímto novým modelem je pak experimentováno, zpočátku z pohledu rychlosti simulace a další rozšiřitelnosti. Je navržena a popsána technika, kterou je možné navržený model významně akcelerovat a následně provádět simulace rychleji než v reálném čase i pro rozsáhlá území. Práce dále přistupuje k samotné kalibraci modelu, ke které byl využit evoluční přístup. Je představena metoda pro efektivní způsob optimalizace parametrů mikrosimulačního modelu, která nevyžaduje citlivostní analýzu a je schopná nalézt jinak obtížně nastavitelné parametry modelu. Kvalita získaných optimalizovaných modelů byla analyzována jak pomocí makroskopických, tak i mikroskopických dopravních dat, a to i s ohledem na jejich reálné vlastnosti, tj. chybějící vzorky. Dále jsou zhodnoceny výkonnostní a jiné kvalitativní parametry vlastního přístupu v porovnání s existujícími řešeními, přičemž bylo dosaženo významného zlepšení. Nakonec jsou představeny nástroje, které v rámci řešení vznikly. Na závěr je uvedeno další zaměření výzkumu, a to zejména s ohledem na využití výsledků práce v praxi.
|
|
|
Instruction-Controlled Cellular Automata
Bendl, Jaroslav ; Žaloudek, Luděk (referee) ; Bidlo, Michal (advisor)
The thesis focuses on a new concept of cellular automata control based on instructions. The instruction can be understood as a rule that checks the states of cells in pre-defined areas in the cellular neighbourhood. If a given condition is satisfied, the state of the central cell is changed according to the definition of the instruction. Because it's possible to perform more instructions in one computational step, their sequence can be understood as a form of a short program. This concept can be extended with simple operations applied to the instruction's prescription during interpretation of the instructions - an example of such operation can be row shift or column shift. An advantage of the instruction-based approach lies in the search space reduction. In comparison with the table-based approach, it isn't necessary to search all the possible configurations of the cellular neighbouhood, but only several areas determined by the instructions. While the groups of the inspected cells in the cellular neighbourhood are designed manually on the basis of the analysis of the solved task, their sequence in the chromosome is optimized by genetic algorithm. The capability of the proposed method of cellular automata control is studied on these benchmark tasks - majority, synchronization, self-organization and the design of combinational circuits.
|
|
|
Game for Oculus Quest
Kryštůfek, Jakub ; Novák, Jiří (referee) ; Pomikálek, Jiří (advisor)
The aim of this bachelor thesis is to create a prototype of a videogame in virtual reality for target platform Oculus Quest 2. The game was created with game engine Unity with emphasis on optimalization and extensibility of implemented systems. Within the implemented game was created system of autonomous agents via finite state machines and planning architecture goal-oriented action planning. One of the most insteresting game mechanics is fire propagation system implemented with cellular automaton.
|
guest ::
