|
|
Discrete Simulation of Programmable Systems
Mynář, Pavel ; Zuzaňák, Jiří (referee) ; Mlích, Jozef (advisor)
The subject of this thesis is the design and implementation of software library for discrete simulation of programmable units and their mutual communication and implementation of several illustrative examples based on it. The library is designed to be platform independent and as robust and simple to use as possible.
|
|
|
Globally Controlled Cellular Automata
Švantner, Martin ; Žaloudek, Luděk (referee) ; Sekanina, Lukáš (advisor)
This master's thesis deals with cellular automata and further deals possibility of their global control. It describes the implementation of simulator of globally controlled cellular automata. The goal is, design and test the classification of globally controlled cellular automata. Classification is based on evaluation of influence of each parameter of automata on their dynamics.
|
|
|
Realistic Model of the Sky
Brtník, Jan ; Herout, Adam (referee) ; Beran, Vítězslav (advisor)
The simulation of natural phenomena such as clouds, smoke, fire and water is one of the most important research areas in computer graphics. Clouds are an essential component of any outdoor virtual environment, they add an important element of visual detail without which the environment would feel unrealistic. This paper describes an approach for setting up a cloud simulation. Clouds in our system are modeled using cellular automaton. To accelerate the simulation and its visualization, we implement both entirely on programmable floating-point graphics hardware. The main part of the algorithm is implemented in a fragment shader and therefore takes full advantage of the highly parallel structure. The algorithm can generate result at real-time or near real-time frame rates. We also simulate the interaction of clouds with light, including self-shadowing.
|
|
|
Structural Design Using Cellular Automata
Bezák, Jakub ; Vašíček, Zdeněk (referee) ; Bidlo, Michal (advisor)
The aim of this paper is to introduce the readers to the field of cellular automata, their design and their usage for structural design. Genetic algorithms are usually involved in designing complicated cellular automata, and because of that they are also briefly described here. For the purposes of this work sorting networks are considered as suitable structures to be designed using cellular automata, however, they are not a part of the automata but they are generated separately by modified rules of a local transition function.
|
|
| |
|
|
Cellular Automata Design Optimization
Jílek, Tomáš ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
Focus of this master's thesis is on evolutionary design of cellular automata and it's optimalization. There are described Evolutionary algorithms and Cellular automata in first part. Thereafter, one of the new ways of transition function representation and its possible evolutionary design is presented. Name of this method is Conditionally Matching Rules. This is followed by description of realized experiments with detailed results. Finally, success with optimalization for some tasks is presented in last chapter along with discussion.
|
|
|
Artificial Life Simulator
Popek, Miloš ; Grulich, Lukáš (referee) ; Martinek, David (advisor)
Area of artificial life is very extensive. Simulations with reactive agents are the target of this work. Simulator of artificial life and language for definition agent's behavior are described in this work. Porposals a results of simulation made are described in this work.
|
|
|
Cellular Automaton in Evolutionary Process
Hejč, Michal ; Herrman, Tomáš (referee) ; Bidlo, Michal (advisor)
The aim of this master's theses it to focuse on the usage of genetic algorithms in combination with a technique of biologically inspired development in cellular automata. The principles of the proposed method is described. The main part of this work deals with the design of combinational logic circuits. The genetic algorithm is utilized to design a nonuniform one-dimensional cellular automaton (in particular, the local transition functions) which serves as a circuit generator. Experiments have been conducted to design of basic types of combinational circuits and polymorphic circuits. Finally, the results are presented and compared with the results obtained in the previous work in which a uniform cellular automaton was applied.
|
|
|
Development of Operating System Based on Evolutionary and Genetic Algorithms
Skorkovský, Petr ; Moučka,, Jiří (referee) ; Kovár, Martin (referee) ; Chvalina, Jan (advisor)
The main goal of the work is to introduce new ideas how traditional approaches for designing an operation system and associated software can be improved to be a part of automatic software evolution. It is generally supposed that algorithms found by the genetic programming processes cannot be used for exact calculations but only for approximate solutions. Several examples of software evolution are introduced, to show that quite precise solutions can be achieved. To reach this goal, characteristics of tree-like structures with approaches based on cellular automata features are combined in a new promising technique of algorithm representation, joining benefits of both concepts. An application has been developed based on these new genetic programming concepts and it is supposed it can be a part of a future automatic software evolution process.
|
|
|
Interactive simulation by means of Flash technology
Látal, Pavel ; Šedá, Jitka (referee) ; Matoušek, Radomil (advisor)
This bachelor thesis is interested in designing of six interactive simulations by means of Flash technology. The presented interactive simulations are follows: an extended version of Conway’s cellular automata which was realized on orthogonal and hexagonal grid, simulation of 1D cellular automata, demonstration of selected selection principles of evolutionary algorithms, possible graphic representation of 2D Turing machine, and application for demonstration of ant colony behavior.
|
guest ::
