|
|
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)
|
|
|
Spatial modeling of brain tissue
John, Pavel ; Neruda, Roman (advisor) ; Brom, Cyril (referee)
Neural connections in the human brain are known to be modified by experiences. Yet, little is known about the mechanism of the modification and its implications on the brain function. The aim of this thesis is to investigate what impact the spatial properties of brain tissue can have on learning and memory. In particular, we focus on the dendritic plasticity. We present a model where the tissue is represented by a two-dimensional grid and its structure is characterized by various connections between the grid cells. We provide a formal definition of the model and we prove it to be computational as strong as the Turing machine. An adaptation algorithm proposed enables the model to reflect the environmental feedback, while evolutionary algorithms are employed to search for a satisfactory architecture of the model. Implementation is provided and several experiments are driven to demonstrate the key properties of the model. Powered by TCPDF (www.tcpdf.org)
|
|
|
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.
|
|
|
Mobile robot path planning by means of cellular automata
Holoubek, Tomáš ; Šoustek, Petr (referee) ; Dvořák, Jiří (advisor)
This thesis deals with a path planning using cellular automata algorithms in a rectangular grid environment. Theoretical part starts with an overview of commonly used approaches for path planning and later on focuses on existing cellular automata solutions and capabilities in detail. Implemented cellular automata algorithms and the commonly used path planning algorithms are together with a map generator described in the practical part. Conclusion of this thesis contains results completed in a special application.
|
|
|
Complexity in Cellular Automata
Hudcová, Barbora ; Mikolov, Tomáš (advisor) ; Kupsa, Michal (referee)
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
|
|
|
Self-Modifying Cellular Automata
Szabo, Peter ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
This work deals with cellular automata with a concept of self- modification and their comparsion against regular cellular automatons . For this task we constructed a simulator , that lets us define the logic of artificial inteligence, number generator and statistical test, which are used by the automata , on their own . Consequently two experiments are carried out that demonstrate the concept of self- modification .
|
|
| |
|
|
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.
|
|
|
Interactive Processing of Volumetric Data
Kolomazník, Jan ; Pelikán, Josef (advisor) ; Czanner, Silvester (referee) ; Dokládal, Petr (referee)
Title: Interactive Processing of Volumetric Data Author: Jan Kolomazník Department: Department of Software and Computer Science Education Supervisor: RNDr. Josef Pelikán, Department of Software and Computer Science Education Abstract: Interactive visualization and segmentation of volumetric data are quite lim- ited due to the increased complexity of the task and size of the input data in comparison to two-dimensional processing. A special interactive segmentation workflow is presented, based on minimal graph-cut search. The overall execution time was lowered by implementing all the computational steps on GPU, which required a design of massively parallel algorithms (using thousands of threads). To lower the computational burden even further the graph is constructed over the image subregions com- puted by parallel watershed transformation. As a suitable formalism for a range of massively parallel algorithms was chosen cellular automata. A set of cellular automata extensions was defined, which allows efficient mapping and computation on GPU. Several variants of parallel watershed transformation are then defined in the form of cellular automaton. A novel form of 2D transfer function was presented, to improve direct volume visualization of the input data, suited for discriminating image features by their shape and...
|
|
|
Diploma work
Němec, Jakub ; Magid, Václav (referee) ; Mikyta, Svätopluk (advisor)
The aim of my work is to reflect expression coincidence that reflects the theoretical basis of cellular automata and quantum mechanics. I think that art should point to examples of accurate knowledge and in this way spread among potential viewers. This is how I try to get closer to the subjective utopian society WERP-VEGA. I am not entirely convinced that fine arts can change the political situation or address fundamental civilization complications, but I believe that art is able to predict freely one of the possible scenarios of the future because one is only able to do what he can imagine.
|
guest ::
