|
|
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)
|
|
|
Tool for Designing Procedural Textures
Číž, Miloslav ; Polok, Lukáš (referee) ; Milet, Tomáš (advisor)
This thesis deals with implementation of a program library for designing and generating two-dimensional procedural textures and its GUI supportive tool. Attention was paid to common methods as well as to other computer graphics areas with effort for modifying the algorithms in order to achieve unique results. An effective way of texture representation and its concrete implementation is also presented.
|
|
|
An Implementation of CellMatrix in FPGA
Martinák, Jan ; Bidlo, Michal (referee) ; Sekanina, Lukáš (advisor)
Reconfigurable hardware architecture represents a modern trend in development of the new curcuits. Rising demands on such architecture lead in efforts to create curcuit, that is able to reconfigure itself in parallel and locally. One of such technologies is the Cell Matrix which is based on principles of cellular automata. The purpose of this thesis is to inform the reader about Cell Matrix architecture and to show its advantages, functions and potentialities by implementation in FPGA on FITkit development kit.
|
|
|
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.
|
|
|
Traffic Modelling Based on Cellular Automata
Hodaňová, Andrea ; Martinek, David (referee) ; Peringer, Petr (advisor)
Among many other fields of science, cellular automata play an important role also in the microsimulations of traffic. In this thesis, we analyze the characteristics of a wide range of cellular automata traffic models from the most simple deterministic ones to complex stochastic automata derived from the pivotal Nagel-Schreckenberg model, which is thoroughly described. As a result of this analysis, a generally usable traffic simulator is designed and implemented in the Java programming language. Its graphical user interface can visualise the state of a road CA to display the key features of the implemented traffic models to the user.
|
|
|
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.
|
|
|
Rendering Clouds in Real Time
Dostál, Radek ; Španěl, Michal (referee) ; Herout, Adam (advisor)
This thesis is about algorithms which render clouds in real time. The theoretical section deals with clouds in real world and also describes some algorithms for modeling and rendering them. The aim of practical section is implement one of these real time algorithms and develop demonstrational application.
|
|
|
Design of Computing Structures in Cellular Automata
Luža, Jindřich ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
The goal of this master thesis is to examine possibilities of realizing comptutational structures in cellular automata. The work describes the fundamental principles of cellular automata and summarizes some ways of how to achive the specified goal. An overview of Turing-complete and other specialized computational tasks is proposed considering both 1D and 2D cellular automata. It is shown that different computational scenarios in cellular automata can be considered with various setups of the input and output arrangements. With regard to showed inputs and outputs arrangement, sets of tests is designed to find solutions of choosen computational structures on cellular automata with use of choosen evolutionary algorithm. Found solutions are compared by computational resources consumption and difficulty of discovery later.
|
|
|
Procedurally Generated City
Hájíček, Lukáš ; Polok, Lukáš (referee) ; Šolony, Marek (advisor)
This work is about procedural generation of cities. There are defined the different stages of city development and existing methods used to achieve them. The following describes the procedures used to implement a system capable of generating cities. The resulting generator is able to generate cities based on given parameters such as density of streets.
|
|
|
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.
|
guest ::
