|
|
Self-Replication in Cellular Automata
Mikeš, Martin ; Bidlo, Michal (referee) ; Žaloudek, Luděk (advisor)
This thesis introduces cellular automata as an environment suitable for simulating complex and massively parallel systems, built from a large number of simple cooperating units. The thesis explores self-replication and self-replicating loops - structures operating within the cellular space, particularly those capable of carrying out useful tasks. The thesis provides a description of implementation of three such loops, executing following tasks: coloring of the space within a loop, construction of letters "MM" and binary addition. A practical usability is discussed at the end.
|
|
|
Acceleration of Particles Tracking on CBM Experiment
Roth, Michael ; Kolář, Martin (referee) ; Musil, Petr (advisor)
The focus of this work is to research various methods of particle track reconstruction in the CBM experiment, and the problem of hardware acceleration of these methods. The advantages and disadvantages of the extended methods were discussed and a reconstruction method based on cellular automata and Kalman filters was selected for further study. In particular, the thesis details the development of a simulation model suitable for generating test data to facilitate future implementation of the selected tracking algorithm. Two different particle simulators have been developed and will be used in the following work to calculate the prediction step of the extended Kalman filter and to test the quality of the implemented reconstruction method.
|
|
|
Artificial life
Weigl, František ; Šoustek, Petr (referee) ; Dvořák, Jiří (advisor)
This bachelor thesis deals with the issue of artificial life. The first part provides a brief overview of the history of artificial life and the current division of artificial life. The second part describes some important software models of artificial life. The last part of the work contains simple experiments with a cellular automaton.
|
|
|
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.
|
|
|
Modified Genetic Algorithms for Cellular Automata Design
Magdolen, Matej ; Vašíček, Zdeněk (referee) ; Bidlo, Michal (advisor)
This bachelor’s thesis aims to examine possibilities of designing a transition function enabling a cellular automaton to solve a given problem using a genetic algorithm. It contains an introduction to cellular automata, evolution algorithms and conditionally matching rules, a method of descripting a transition function suitable for evolutionary development. A set of experiments is conducted using the standard version of genetic algorithms to determine its optimal configuration. Additionally, modifications of this standard algorithm are proposed, effect of which on the algorithm’s performance is then evaluated by further experiments.
|
|
|
Fluid Dynamics Simulation Using Cellular Automata
Režňák, Michal ; Janoušek, Vladimír (referee) ; Peringer, Petr (advisor)
The main objective of this work was to create application for fluid flow simulation using Lattice Gas Cellular Automata. Used simulation models are HPP, FHP-I, FHP-II and FHP-III. The program is implemented in a C++ language in a way that it can run in WebAssembly web standard. Part of the work is comparison between wasm, ams.js formats and native desktop (x86_64). This shows that time for application loading in web browser is much smaller for wasm format than for asm.js and application performance in wasm format is about 24% higher than asm.js but 50% smaller than a native desktop. The application is suitable for educational purpose as a presentation of cellular automata simulation and also as an introduction to the Lattice Boltzmann method for fluid flow simulation.
|
|
|
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.
|
|
|
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.
|
|
|
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.
|
|
|
Generating Pseudo-Random Numbers by Means of Cellular Automata
Krofingerová, Lada ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
This thesis deals with generating pseudo-random number by means of cellular automat. The methods which are already used were explored, including steps which were used to design the cellular automata. As follow-up to these methods the four state celullular automaton was designed for the purpose of improving the quality of generated numbers. For design of the rule table was used the genetic algorithm. For comparision with already used methods were used the statistical tests. They showed that even though the four state cellular automaton is good generator of the pseudo-random numbers, in state which it was designed it isn’t better in generating then already used cellular automata.
|
guest ::
