|
|
Mating criteria evolution
Kraut, Tomáš ; Holan, Tomáš (advisor) ; Mráz, František (referee)
This work is concerned on implementating an environment for simulation of artiffcial world and studying the evolution of simple artifficial creatures. First, the basic principles od this model are described, as its creation, changing, growth of food, lifetime of individual creatur and means ot their reproduction. Next, this environment is implemented in C++ language, there is explained, how to use implemented program, automatic changes in simulation by scripts is described and also how to get statistical data for next elaboration.
|
|
|
Compiler generator based on restarting automata
Procházka, Jan ; Mráz, František (advisor) ; Plátek, Martin (referee)
Restarting automata, in their most general form, represent a very strong theoretical model recognizing much wider class of languages than the class of context-free ones. Hence, our goal was to design a tool which for a given restarting automaton (in human-readable format) generates a program computing the meaning of an input text. In order to enable that, this thesis extends the model of restarting automata by adding semantics to its meta-instruction. The resulting program is a compiler-compiler (CCRA) inspired by the tools such as flex or bison. However, the CCRA uses restarting automaton instead of a context-free grammar. The implementation as well as the output are realized in C++ which ensures the compatibility with both Windows and Linux systems.
|
|
|
Self-organization and morphing
Lessner, Daniel ; Mrázová, Iveta (advisor) ; Mráz, František (referee)
Morphing is a well-known visual effect. It is based on a uent transition of one image into another one, metamorphosis of a movie character into a bear is a possible example. Realization of such an effect requires accurate, concentrated and expensive effort of an animator. Development of tools and methods for problem solving comparable with human intelect is the subject of arti tial intelligence. Systems working with no human adjustments are often based on self-organisation. Self-organisation of a system is the appearance of complex behavior that isolated parts of the system couldn't reach. This thesis examines possibilities of application of self-organisational methods of artifi tial intelligence in morphing with the goal of reduction of the human assistence. The thesis includes information about some drafted techniques and results of experiments with the most successful technique. Experiments imply that it is possible to reach good results without human assistance if certain conditions are met.
|
|
|
IVA Movement Quality Improvement for the Virtual Environment of Unreal Tournament 2004
Macháč, Bohuslav ; Gemrot, Jakub (advisor) ; Mráz, František (referee)
Title: IVA Movement Quality Improvement for the Virtual Environment of Unreal Tournament 2004 Author: Bohuslav Macháč Department / Institute: Department of Software and Computer Science Education Supervisor of the master thesis: Mgr. Jakub Gemrot, Department of Software and Computer Science Education Abstract: PogamutUT2004 is an extension of the Pogamut platform designed for developing intelligent virtual agents (IVAs) in Unreal Tournament 2004. Navigation of IVAs in Pogamut is handled by a navigation system, which uses a navigation graph as an environment abstraction. Navigation mesh is a new, more advanced abstraction, but the existing navigation system is not capable of using its advantages. We created a new navigation system, which exploits advantages of the navigation mesh and solves several other issues of the old one. We show that the new navigation system improves the quality of navigation. To demonstrate the quality improvement, an evaluation framework was created for the comparison of navigation systems. Systems were compared in terms of total number of significant paths on the map, which the system is able to follow, length of the path and time of the navigation. We selected 18 different maps for thorough evaluation and we performed the basic evaluation on 58 other maps. The new system is more...
|
|
|
Object Oriented Library for Controlling an e-Puck Robot
Plátek, Ondřej ; Mráz, František (advisor) ; Černo, Peter (referee)
E-Puck is an educational robot with differential drive and it is sufficiently equipped with sensors. The result of present thesis is the C# object oriented Elib library, which allows to control an e-Puck robot from a host computer over the Bluetooth wireless technology. The model examples in the TestElib console application presents the usage of the Elib library in program for the e-Puck robot. Moreover, it offers a comfortable system of help and documentation. Enclosed sets of tools allows more effective debugging of programs, which use the Elib library.
|
|
|
Attractors of cellular automata
Zahradník, Ondřej ; Kůrka, Petr (advisor) ; Mráz, František (referee)
Two heuristic algorithms Omega and Spread are described in this thesis. Algorithm Omega searches for maximal attractors of given cellular automaton. Attractors are constructed as forward images of the join of simple invariant subshifts of finite type, which are contained in the maximal attractor. This join is still contained in the maximal attractor. Afterwards the algorithm searches for a invariant image of this join. The maximal attractor was found if the invariant image was found and if such image has special property of decreasing preimages. The construction of maximal attractor was generalized to shift-invariant attractors by algorithm Spread, which searches for spreading sets of given cellular automaton. There are three undecidable questions. The search for the invariant image, test if such invariant image has the property of decreasing preimages and the search for spreading sets of given cellular automaton. Both algorithms has been tested on the class of elementary cellular automata.
|
|
|
Improving and extending the multiple sequence alignment suite PRALINE
Hudeček, Jan ; Mráz, František (advisor) ; Petříčková, Zuzana (referee)
The aim of this work is to study potential improvements in the core routines of multiple sequence alignment suite PRALINE. A general overview of multiple sequence alignment methods used with emphasis on representation of the alignment core is given. A new option for aligning sequence profiles was implemented and its usefulness assessed. This option allows a user to input a profile which is used in an advanced phase of the progressive protocol as if it was a result of the previous steps. Two new protocols using profile Hidden Markov models (HMM) and their alignment were implemented and tested. The HMMGUIDE protocol creates for each sequence a preprofile consisting of segments of other sequences with high local similarity. HMM is generated from each preprofile by HMMER, and alignment of every pair is scored by PRC. The protocol then progressively aligns the sequence whose HMMs achieved the best score. The PRCALIGN protocol works similarly but aligns the sequences according to the best alignment of the HMMs. While not all test alignments were finished successfully for both protocols, the results constitute a statistically significant improvement over the original PRALINE protocol.
|
|
| |
|
|
Using genetic programming in robot evolution
Babor, Petr ; Mráz, František (advisor) ; Neruda, Roman (referee)
Artificial neural networks learned by evolutionary algorithms are commonly used to control the robots. Neural networks can be encoded either directly as a list of weights or indirectly as a weight generator. Unlike direct coding indirect encoding allows to encode a large network using a short genetic code. HyperNEAT is a neuroevolutionary algorithm, which encodes the neural network indirectly, through another (producing) network, which computes synaptic weights. A different algorithm called HyperGP is an alternative to HyperNEAT. In HyperGP, the producing network is replaced by an arithmetic expression, which is being evolved using a genetic programming (GP). We have designed enhancements for HyperGP, using techniques that are either known in a different context of GP or completely new. Algorithm and enhancements have been implemented and experimentally tested on a task of controlling virtual walking robot. The results were compared with HyperNEAT and with the original HyperGP. We have shown that most of the proposed enhancements are effective and, on the given task, HyperGP is better than HyperNEAT. GP thus can successfully replace NEAT in hyper-encoding scheme and improve its efficiency. Powered by TCPDF (www.tcpdf.org)
|
|
|
Analysis and visualization of a social network
Kudělka, Miloš ; Mráz, František (advisor) ; Skopal, Tomáš (referee)
The present work starts with study of past and current methods from the field of analysis and visualization of social networks. Selected methods are then described in detail. Following part is devoted to research of current software. Selected applications are tested and evaluated according to their capability of showing a development in dynamic social networks -- networks with temporal data. Based on these researches an application is designed and implemented. This application can be used for analysis and visualization of a development of dynamic networks in time. Finally, the application is tested on co-authorship social network by means of the bibliographic database of scientific papers DBLP. The work also presents the results of the experiments with implemented algorithms.
|
guest ::
