|
|
Acceleration of Microscopic Urban Traffic Simulation Using OpenCL
Urminský, Andrej ; Kajan, Michal (referee) ; Korček, Pavol (advisor)
As the number of vehicles on our roads increases, the problems related to this phenomenon emerge more dramatically. These problems include car accidents, congestions and CO2 emissions production, increasing CO2 concentrations in the atmosphere. In order to minimize these impacts and to use the road infrastructure eff ectively, the use of traffic simulators can come in handy. Thanks to these tools, it is possible to evaluate the evolution of a traffic flow with various initial states of the simulation and thus know what to do and how to react in different states of the real-world traffic situations. This thesis deals with acceleration of microscopic urban traffic simulation using OpenCL. Supposing it is necessary to simulate a large network traffic, the need to accelerate the simulation is necessary. For this purpose, it is possible, for example, to use the graphics processing units (GPUs) and the technique of GPGPU for general purpose computations, which is used in this work. The results show that the performance gains of GPUs are significant compared to a parallel implementation on CPU.
|
|
|
Instruction-Controlled Cellular Automata
Bendl, Jaroslav ; Žaloudek, Luděk (referee) ; Bidlo, Michal (advisor)
The thesis focuses on a new concept of cellular automata control based on instructions. The instruction can be understood as a rule that checks the states of cells in pre-defined areas in the cellular neighbourhood. If a given condition is satisfied, the state of the central cell is changed according to the definition of the instruction. Because it's possible to perform more instructions in one computational step, their sequence can be understood as a form of a short program. This concept can be extended with simple operations applied to the instruction's prescription during interpretation of the instructions - an example of such operation can be row shift or column shift. An advantage of the instruction-based approach lies in the search space reduction. In comparison with the table-based approach, it isn't necessary to search all the possible configurations of the cellular neighbouhood, but only several areas determined by the instructions. While the groups of the inspected cells in the cellular neighbourhood are designed manually on the basis of the analysis of the solved task, their sequence in the chromosome is optimized by genetic algorithm. The capability of the proposed method of cellular automata control is studied on these benchmark tasks - majority, synchronization, self-organization and the design of combinational circuits.
|
|
|
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.
|
|
|
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.
|
|
|
Prediction of Secondary Structure of Proteins Using Cellular Automata
Brigant, Vladimír ; Drahošová, Michaela (referee) ; Bendl, Jaroslav (advisor)
This work describes a method of the secondary structure prediction of proteins based on cellular automaton (CA) model - CASSP. Optimal model and CA transition rule parameters are acquired by evolutionary algorithm. Prediction model uses only statistical characteristics of amino acids, so its prediction is fast. Achieved results was compared with results of other tools for this purpose. Prediction cooperation with a existing tool PSIPRED was also tested. It didn't succeed to beat this existing tool, but partial improvement was achieved in prediction of only alpha-helix secondary structure motif, what can be helful if we need the best prediction of alpha-helices. It was developed also a web interface of designed system.
|
|
|
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.
|
|
|
Applying System Dynamics and Agent-based Modelling in Archaeological Simulation
Olševičová, K. ; Danielisová, Alžběta
We apply the social simulation to the cultural milieu of the late Iron Age in Central Europe and its economic strategies, especially on the subsistence and the carrying capacity of the settlement agglomeration in relation to the daily economic needs of its inhabitants. By means of the computational models of the economics of the particular central settlement (Staré Hradisko oppidum) and its hinterland we aim to verify hypotheses about the economic sustainability in case self-supplying is applied. To achieve this, the agent-based modelling, cellular automata approach and system dynamics modelling are used. In the paper we present four alternative scenarios of population dynamics (baseline and three versions of depopulation) and four alternative scenarios of food production and agricultural practices (baseline and three types of external events). The set of models for all scenarios was implemented in NetLogo and Stella. Outputs of the models are subject of interests of archaeologists and according to their feedback the models will be refined and extended.
|
|
|
New suspect in the investigation into the cause of flash floods
Bíl, M. ; Fürst, T. ; Vodák, R. ; Pražák, Josef ; Šír, Miloslav ; Tesař, Miroslav
The aim of this contribution is to introduce a new possibility of the description of unsaturated porous media flow. The approach presented here is entirely different from the traditional ways (e.g. the Richards‘ Equation). It will be explained why the traditional models often fail to describe various observed phenomena. The new approach provides certain interesting forecasts, among others a possible mechanism for flash-flood formation. The authors explain why they think that, under specific conditions, porous medium discharge may substantially exceed the infiltration due to rainfall.
|
guest ::
