|
|
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 .
|
|
|
Design and Implementation of a Codec for Iwadari Code
Křivánek, Jan ; Drábek, Vladimír (referee) ; Sekanina, Lukáš (advisor)
This thesis deals with the design, the implementation and oncoming testing of circuits implementing the encoder and the decoder of the Iwadari code with universal correction ability. The design according to the theory of forward error correction systems is well-founded by mathematic modeling. Describing of the implementation prefers VHDL language. The implemented encoder and decoder were simulated in specialized development environments to verify their correct operation. Final demonstrational physical implementation of testing connection of the encoder and the decoder in experimental educational platform FIT-kit was made to show their function and mechanism.
|
|
|
Acceleration of Burrows-Wheeler Transform Using GPU
Zahradníček, Tomáš ; Drábek, Vladimír (referee) ; Šimek, Václav (advisor)
This thesis deals with Burrows-Wheeler transform (BWT) and possibilities of acceleration of this transform on graphics processing unit (GPU). Methods of compression based on BWT are introduced, as well as software libraries CUDA and OpenCL for writing programs for GPU. Parallel variants of BWT are implemented, as well as following steps necessary for compression, using CUDA library. Amount of compression of used approaches are tested and parallel versions are compared to their sequential counterparts.
|
|
|
Optimization Using Ant Algorithms
Válek, Matěj ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
This bachelor thesis will deal with various applications of ant colony optimisation. In particular, Ant Colony System will be applied on the optimisation of traveling salesman problem and the design of rules for the development of cellular automata. The obtained results will be statistically analysed. Moreover, a GUI-based application has been developed which allows to interactively observe the progress of Ant Colony System for the educational purposes.
|
|
|
Novel Applications of Ant Algorithms
Korgo, Jakub ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
Ant algorithms have been used for a variety of combinatorial optimization problems. One of these problems, where ant algorithms haven't been used, is the design of transition rules for cellular automata (CA). Which is a problem that this master's thesis is focused on. This work begins with an introduction into ant algorithms and a overview of its applications, followed by an introduction into CA. In the next part the author proposes a way how to encode rules of CA into a graph which is used in ant algorithms. The last part of this thesis contains an application of encoded graph on elitist ant system and MAX-MIN ant system. This is followed by experimental results of creating transition rules for CA problems by these algorithms.
|
|
|
Network Architecture and Interconnection of Embedded Systems
Trchalík, Roman ; Drábek, Vladimír (referee) ; Srovnal, Vilém (referee) ; Švéda, Miroslav (advisor)
The thesis focuses on the architecture of embedded systems. It summarizes the current state of accepted standards from IEEE 1451 family, which deals with creating an environment for the sensors and their involvement in various networks. These standards describe the open, network-independent communication architecture for a sensor-based system. One of the main outcomes of this work is the architectures presented as case studies, which can be used as design patters for embedded applications. They are demonstrated on ZigBee technology suitable mainly for small devices with very low power consumption. Based on these studies the new design of universal gateway was proposed. Its major advantage is that it allows interconnection of the endpoints based on different sensor network technologies. Additionally, the thesis deals with modifying the routing protocol of ZigBee network in order to reduce power consumption required to transmit one data packet.
|
|
|
Effect of Noise on Video Compression
Anton, Matyáš ; Drábek, Vladimír (referee) ; Bařina, David (advisor)
Videos are in fact image signals and as such, they are susceptible to distortions in the form of noise. This thesis' goal was to determine how the presence of noise can affect the results of image data compression as well as what impact might the lossy compression have on the noise present. Four contemporary compression formats were chosen, namely H.264, H.265, Motion JPEG 2000 and DIRAC, representing different approaches to the video compression, especially the contrast between a discrete cosine transform and a discrete wavelet transform.
|
|
|
Representation Techniques for Evolutionary Design of Cellular Automata
Kovács, Martin ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
The aim of this thesis is to experimentally evaluate the performance of several distinct representations of transition functions for cellular automata. Cellular automata have many potential applications for simulating various phenomena (e.g. natural processes, physical systems, etc.). Parallel computation of cellular automata is based on local cell interactions. Such computation, however, may prove difficult to program the CA, which is the reason for applying evolutionary techniques for the design of cellular automata in many cases. Evolutionary algorithms, based on Darwin's theory of evolution, have been used to find human-competitive solutions to many problems. In order to perform the evolutionary design of cellular automata, special encodings of the candidate solutions are often necessary. For this purpose the performance testing of various representations of the transition functions will be investigated. In particular, table representation, conditionally matching rules, and genetic programming will be treated. The problem of square calculations in cellular automata will be considered as a case study.
|
|
| |
|
| |
guest ::
RSS feed.