National Repository of Grey Literature 29 records found  1 - 10nextend  jump to record: Search took 0.00 seconds. 
Generating Pseudo-Random Numbers by Means of Cellular Automata
Krofingerová, Lada ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
This thesis deals with generating pseudo-random number by means of cellular automat. The methods which are already used were explored, including steps which were used to design the cellular automata. As follow-up to these methods the four state celullular automaton was designed for the purpose of improving the quality of generated numbers. For design of the rule table was used the genetic algorithm. For comparision with already used methods were used the statistical tests. They showed that even though the four state cellular automaton is good generator of the pseudo-random numbers, in state which it was designed it isn’t better in generating then already used cellular automata.
Advanced Evolutionary Image Filtering
Saranová, Ivana ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
This work aims to use cellular automata with a transition function of conditionally matching rules designed by the evolution strategy for the removal of noises of different types and intensities from digital images. The proposed method improves the original concept of conditionally matching rules by modifying the right side of the rule, extending it from a single value to a selection of functions. Furthermore, various evolution strategy setups were explored, including usage of different noise models for evolution, training on partially damaged images, and other setups, resulting in high-quality filters for each noise model. Comparing these filters to the existing methods shows great improvement from the original approach and the ability to evolutionarily design filters that are placed among the top methods quality-wise.
Analysis of Computational Effort of Self-Correcting Codes
Bártů, Tomáš ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
The work deals with error-correcting codes, specifically encoding and decoding Reed-Solomon codes. An introduction to error-correcting codes is provided, followed by a description of the encoding and decoding principle of Reed-Solomon codes using the Petterson-Gorenstein-Zierler, Berlekamp-Massey, and Euclidean algorithms. Implementation is then described, which realizes some of the mentioned algorithms. This is followed by experiments with applications that compare the time and iteration complexity of the encoding and decoding processes.
Fault tolerant Field Programmable Neural Networks
Krčma, Martin ; Kordík, Pavel (referee) ; Stopjaková, Viera (referee) ; Drábek, Vladimír (advisor)
Tato práce se zaměřuje na koncept Field Programmable Neural Networks jehož cílem je učinit implementaci umělých neuronových sítí v hradlových polích méně náročnou jejich prostředky. Za tímto účelem práce koncept rozvíjí a představuje několik jeho různých typů jež se vyznačují různými poměry mezi spotřebou zdrojů hradlových polí a přesností s jakou aproximují původní neuronovou síť jíž implementují. Teze díle rozšiřuje koncept o metody zabezpečení proti poruchám s využitím redundance a také bez ní.
Fault tolerant Field Programmable Neural Networks
Krčma, Martin ; Kordík, Pavel (referee) ; Stopjaková, Viera (referee) ; Drábek, Vladimír (advisor)
Tato práce se zaměřuje na koncept Field Programmable Neural Networks jehož cílem je učinit implementaci umělých neuronových sítí v hradlových polích méně náročnou jejich prostředky. Za tímto účelem práce koncept rozvíjí a představuje několik jeho různých typů jež se vyznačují různými poměry mezi spotřebou zdrojů hradlových polí a přesností s jakou aproximují původní neuronovou síť jíž implementují. Teze díle rozšiřuje koncept o metody zabezpečení proti poruchám s využitím redundance a také bez ní.
New Cellular Automata Design Techniques
Baláž, Martin ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
The aim of this master thesis is to introduce a new technique for the design of cellular automata which will provide a better possibilities for the implementation and solving given problems in an environment of non-uniform automata. In this work, the theoretical foundations of cellular automata have been summarized and the possibilities of their design were examined using two evolutionary principles that have commonly been used - genetic algorithm and cellular programming. Two principally different issues were selected on which the possibilities and capabilities of these techniques were proven: the synchronization problem and the system of implementation of logic gates in an environment of cellular automata. Based on a review of the implementation properties and the initial results of usage of these methods a new design method for cellular automata was created - cellular evolution. The cellular evolution with its method of "prediction of the future state of surrounding cells" provides new possibilities in the design of cellular automata since it operates with structured genes which allow the gene to be active for a variety of cellular surroundings. In the conclusion of this work, all three methods were compared on two selected problems and their abilities were summarized in a detailed overview.
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.

National Repository of Grey Literature : 29 records found   1 - 10nextend  jump to record:
See also: similar author names
1 Drábek, Vojtěch
Interested in being notified about new results for this query?
Subscribe to the RSS feed.