|
|
Travelling Salesman Problem
Kolář, Adam ; Rozman, Jaroslav (referee) ; Zbořil, František (advisor)
The aim of this bachelor's thesis is to design a testing environment for the traveling salesman problem and compare the effectiveness of different approaches to the solution. The first part discussed the possibility of genetic algorithms, depending on the setting of a crossover, mutations and population size. In the second part, there is the same problem using two types of neural networks. The representative of the self-learning net was chosen Kohonen neural network. Hopfield neural network represents a method of minimizing the energy function with fixed coefficients. At both neural networks, there were described possible advantages and disadvantages. In the end, all the findings were interpreted in a global context.
|
|
|
Discovery of Wireless Sensor Network Topology Using Genetic Algorithms
Dalecký, Štěpán ; Samek, Jan (referee) ; Zbořil, František (advisor)
The thesis deals with a design of the genetic algorithm that is able to discover the wireless sensor network topology using signal strength among particular sensors. At first, the thesis describes the theory of genetic algorithm and wireless sensor network. Subsequently, on the basis of this theory, the genetic algorithm serving for the wireless sensor network topology discovery has been designed. The thesis also describes important features of the algorithm implementation. In conclusion, the outcomes have been reviewed.
|
|
|
Evolutionary Solving of Rubik's Cube
Kollner, Aleš ; Bidlo, Michal (referee) ; Jaroš, Jiří (advisor)
This thesis deals with solving of the Rubik's cube. It describes the Rubik's cube and the famous methods for its composition. The main goal of this work is to propose an evelutionary method that for any configuration of blocks will lead to its composition. The theis describes the problem encoding, the proposed evelutionary algorithm and its proper configuration and deployment. The achieved results are commented on and compared with other known mehtods in conclusions.
|
|
|
Cryptanalysis of Symmetric Encryption Algorithms Using Genetic Programming
Smetka, Tomáš ; Janoušek, Vladimír (referee) ; Homoliak, Ivan (advisor)
This diploma thesis deals with the cryptanalysis of symmetric encryption algorithms. The aim of this thesis is to show different point of view on this issues. The dissimilar way, compared to the recent methods, lies in the use of the power of evolutionary principles which are in the cryptanalytic system applied with help of genetic programming. In the theoretical part the cryptography, cryptanalysis of symmetric encryption algorithms and genetic programming are described. On the ground of the obtained information a project of cryptanalytic system which uses evolutionary principles is represented. Practical part deals with implementation of symmetric encrypting algorithm, linear cryptanalysis and simulation instrument of genetic programming. The end of the thesis represents experiments together with projected cryptanalytic system which uses genetic programming and evaluates reached results.
|
|
|
Optimization of cogeneration system
Stacha, Radek ; Turek, Vojtěch (referee) ; Jegla, Zdeněk (advisor)
Master thesis is focused on optimization of cogeneration system for purpose of rating optimization methods and evaluating properties of these methods. For each method there is description together with block schemes. First part of thesis is devoted to description of methods and their comparison. Second part consists of development of hybrid algorithm, which is used to optimize cogeneration systém model. Each algorithm compared is together with hybrid algorithms included in annexes.
|
|
|
Evolutionary algorithms
Haupt, Daniel ; Polách, Petr (referee) ; Honzík, Petr (advisor)
The first part of this work deals with the optimization and evolutionary algorithms which are used as a tool to solve complex optimization problems. The discussed algorithms are Differential Evolution, Genetic Algorithm, Simulated Annealing and deterministic non-evolutionary algorithm Taboo Search.. Consequently the discussion is held on the issue of testing the optimization algorithms through the use of the test function gallery and comparison solution all algorithms on Travelling salesman problem. In the second part of this work all above mentioned optimization algorithms are tested on 11 test functions and on three models of placement cities in Travelling salesman problem. Firstly, the experiments are carried out with unlimited number of accesses to the fitness function and secondly with limited number of accesses to the fitness function. All the data are processed statistically and graphically.
|
|
|
Genetic Algorithms - Multi-core CPU Implementation
Studnička, Vladimír ; Kuba, Martin (referee) ; Matoušek, Radomil (advisor)
his diploma thesis deals with creating the most universal library of genetic algorithms in C++, as much as possible, implemented with the certain number of universal operators, and then with testing created library on some examples. Library must support multi-core processors, implementation will be done over OpenMP. The library will be tested on three examples in all. The first two examples are mathematical functions, that are used just for genetic algorithms testing. Last problem for test is N-Queens problem. Finally we will use genetic algorithms to try find solution for Eternity II puzzle, there is declared a 2 million bounty for full solution.
|
|
|
Suppresion of distortion in iris images
Jalůvková, Lenka ; Štohanzlová, Petra (referee) ; Kolář, Radim (advisor)
This master`s thesis is focused on a suppression of a distorsion in iris images. The aim of this work is to study and describe existing degradation methods (1D motion blur, uniform 2D motion blur, Gaussian blur, atmospheric turbulence blur, and out of focus blur). Furthermore, these methods are implemented and tested on a set of images. Then, we designed methods for suppression of these distorsions - inverse filtration, Wiener filtration and iterative deconvolution. All of these methods were tested and evaluated. Based on the experimental results, we can conclude that the Wiener-filter restoration is the most accurate approach from our test set. It achieves the best results in both normal and iterative mode.
|
|
|
Optimization of EMI filter Circuitry
Surovec, Vojtěch ; Soldán, Josef (referee) ; Dřínovský, Jiří (advisor)
In introduction of work, I presented the state of the art of measuring insertion loss of the EMI filter and the description of individual methods of measuring is also included. After that I dealt with global optimization methods and some of them I theoretically described. Mainly PSO method was studied carefully, and the principle of optimization in details are presented in the thesis, because this method was used for optimization of the filters parameters in the thesis. Next part of work deals with theoretical and mathematical expression of insertion loss of the EMI filters. Due to the mathematical expression of the insertion loss, the values of parasitic elements of given filter have been optimized in different measuring systems. This optimization was applied on synthetic data. By this step the functionality of optimization was proved and also the fitness function has been tuned and optimised. The last part of thesis works with optimization on measured data of given filters. I found out inaccuracy in mathematical expression of given model of EMI filter, therefore it was necessary to come up with the new filter model. The accuracy increases by using the new filter model. In next step the new model was enlarged by new spurious components.
|
|
| |
guest ::
