|
|
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.
|
|
|
Advanced Evolutionary Image Filtering
Saranová, Ivana ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
This work aims to use cellular automata with a transition function of conditionally matching rules designed by the evolution strategy for the removal of noises of different types and intensities from digital images. The proposed method improves the original concept of conditionally matching rules by modifying the right side of the rule, extending it from a single value to a selection of functions. Furthermore, various evolution strategy setups were explored, including usage of different noise models for evolution, training on partially damaged images, and other setups, resulting in high-quality filters for each noise model. Comparing these filters to the existing methods shows great improvement from the original approach and the ability to evolutionarily design filters that are placed among the top methods quality-wise.
|
|
|
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 Extended 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 the implementation of the selected tracking algorithm, which was subsequently sped up using distributed computing methods. Two different particle simulation models and a reconstruction algorithm were implemented, with the reconstruction algorithm offering up to 800 per cent speed up factor in respect to the sequential algorithm and up to four orders of magnitude lower memory complexity.
|
|
|
Complexity in Cellular Automata
Hudcová, Barbora ; Mikolov, Tomáš (advisor)
In order to identify complex systems capable of modeling artificial life, we study the notion of complexity within a class of dynamical systems called cellu- lar automata. We present a novel classification of cellular automata dynamics, which helps us identify interesting behavior in large automaton spaces. We give a detailed comparison of our results to previous methods of dynamics classification. In the second part of the thesis, we study the backward dynamics of cellular au- tomata. We present a novel representation of one-dimensional cellular automata, which can be used to charcterize all their garden of eden configurations. We demonstrate the usefulness of this method on examples. 1
|
|
|
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.
|
|
|
Using Cellular Automata for Data Encryption
Dvořák, Martin ; Trunda, Otakar (advisor) ; Mráz, František (referee)
Cellular automata are discrete systems with very simple rules but very diverse behaviour. Some cellular automata can generate high-quality pseudorandom bit sequences. This leads us to the question of whether cellular automata could be used in cryptography, as a replacement for stream ciphers for instance. We will create and compare various methods for generating long one-time-pads from short keys, where our methods will utilize cellular automata. Besides direct design of cryptographical algorithms, we will also create an evolutionary algorithm, which will try to connect our building blocks in the best possible way. The outcome of our work will be a Windows desktop application for file encryption. Powered by TCPDF (www.tcpdf.org)
|
guest ::
