|
|
Cellular Automata Simulator
Martinek, Dominik ; Polášek, Petr (referee) ; Peringer, Petr (advisor)
This work describes concept and implementation of cellular automata simulator. It is resolved into three thematic parts. First part is devoted to describe many kinds of cellular automata.In second part is concept of simulator. Thirt part contains procedure of implementation and some test and exemplary models.
|
|
|
Intelligent Control of Traffic Lights
Skoták, Miloš ; Samek, Jan (referee) ; Malačka, Ondřej (advisor)
In this thesis is analyzed Multi-Agent system for intelligent control of traffic lights. For the simulation of a real situation was implemented a simulator of a traffic situation written in Java language, which is based on a cellular automata. In Multi-Agent system can be found not only communication between the agent and environment, but also communication among agents. To implement the rules was used extended AgentSpeak language model based on BSD with Jason interpreter. Experiments were done on a real road section in the city Brno.
|
|
|
Prediction of the Secondary Structure of Proteins by Cellular Automaton
Šalanda, Vojtěch ; Vogel, Ivan (referee) ; Bendl, Jaroslav (advisor)
This thesis presents a new approach to the prediction of the secondary structure of proteins. It employs a new method based on cellular automata and its characteristic properties. The main objective is to increase speed of the prediction even at the cost of slight decrease of overall accuracy. Optimal parameters of cellular automata was found by genetic algorithm using suitable genetic operators. These parameters are incorporated into developed application for prediction. Finally, the results was compared with results of other tools for this purpose.
|
|
|
Evolution of Emergent Behavior in Cellular Systems
Novák, Radim ; Žaloudek, Luděk (referee) ; Bidlo, Michal (advisor)
This master's thesis deals with the topic of cellular automata and their utilization in the research of self-replication, especially with the focus on self-replicating loops. It also shows several possible approaches how to optimize the replication process. The first part is focused on theoretical aspects of cellular automata. It acquaints the readers with the questions of self-replication in the cellular automata and present some of the existing self-replicating loops, starting with the widely known Langton's loop. The second part presents the optimization of the replication process considering two selected variants of self-repricating loops - Byl's loop and Chou-Reggia loop. Two approaches are introduced together with their possible combination. The first approach is based on multiple self-replication. The second one is based on the reduction of the number of steps of the cellular automaton needed to create a copy of the loop.
|
|
|
Simulation of Physical Phenomena Using Cellular Automata
Martinek, Dominik ; Smrčka, Aleš (referee) ; Peringer, Petr (advisor)
This master's thesis deals with modelling and simulation of physical phenomena by cellular automata. The basic methods which model physical phenomena is enumerated and descibed in this thesis. One of the important part of this thesis is a set of demonstration models. Each model is focused on one selected area of physical phenomena. All models are described by transtition rules and the procedure of derivation of these rules is also presented here. There rules were used in implemented models. Another part of this thesis contains of a simulation application for these models. The real application had been implemented in accord with this design and it has been used to perform the simulation experiments with exemplary models. Results of the simulation experiments are discussed in conclusion of this thesis. One exemplary model had also been adapted for parallel processing. The performances on a computer with different count of working processors were measured and are also discussed in the conclusion of this thesis
|
|
|
Acceleration of Microscopic Urban Traffic Simulation Using OpenCL
Urminský, Andrej ; Kajan, Michal (referee) ; Korček, Pavol (advisor)
As the number of vehicles on our roads increases, the problems related to this phenomenon emerge more dramatically. These problems include car accidents, congestions and CO2 emissions production, increasing CO2 concentrations in the atmosphere. In order to minimize these impacts and to use the road infrastructure eff ectively, the use of traffic simulators can come in handy. Thanks to these tools, it is possible to evaluate the evolution of a traffic flow with various initial states of the simulation and thus know what to do and how to react in different states of the real-world traffic situations. This thesis deals with acceleration of microscopic urban traffic simulation using OpenCL. Supposing it is necessary to simulate a large network traffic, the need to accelerate the simulation is necessary. For this purpose, it is possible, for example, to use the graphics processing units (GPUs) and the technique of GPGPU for general purpose computations, which is used in this work. The results show that the performance gains of GPUs are significant compared to a parallel implementation on CPU.
|
|
|
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.
|
|
|
Self-Replication in Cellular Systems
Komenda, Tomáš ; Bidlo, Michal (referee) ; Sekanina, Lukáš (advisor)
This thesis deals with cellular systems and their applications to self - replication data structures. The sector cellular automats is a very interesting and inspiring area which seems now as a very suitable environment for the simulation of various phenomen. One of these phenomen may be, for example, artificial life or self- replication the structure, which transmits some useful information or carry out the necessary calculations. In this thesis is detailed subscribe cellular automats and their division. It focuses on Langtons loop, Codds automata, Byls loop, Chou-Reggia loop, Tempesti loop, Perrier loop, SDSR loop, Evoloop and Sexyloop. Part of the work is to accelerate replication Byls loops through change to the rules of cellular automat and the addition of functionality to the ability to release space to the completion of replication loops. At thesis, I also dealt with the evolutionary design of the rules of cellular automata.
|
|
|
A Nanocomputer Simulator Using Cellular Automaton
Kmeť, Dušan ; Bidlo, Michal (referee) ; Sekanina, Lukáš (advisor)
This master thesis deals with the realization of a simulator based on asynchronous cellular automata simulating delay insensitive circuits. In connection with nanotechnology, cellular automata have several interesting properties, such as self-replication, regular structure and high parallelism that make them very useful as models for some types of nanocomputers. This text describes the relationship between cellular automata and nanotechnology. Emphasis is given to the possibility of using asynchronous timing mode. Asynchronous cellular arrays based on asynchronous cellular automata could prove to be a suitable architecture for future nanocomputer, which was the reason for implementation of this simulator. The simulator's functionality was verified by experiments.
|
|
|
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.
|
guest ::
