|
|
Evolutionary Design of Boolean Functions for Cryptography
Dvořák, Jan ; Vašíček, Zdeněk (referee) ; Husa, Jakub (advisor)
The goal of this bachelor's thesis is to compare various selection methods used in cartesian genetic programming applied to a problem of various types of cryptographically significant boolean functions. I focused on these selection methods: evolutionary strategies (1+lambda) and (1,lambda), tournament selection and roulette selection. The chosen problem was solved by an implementation of CGP with the above-mentioned selection methods and by a statistical evaluation of data acquired from conducted experiments. Evaluation of mentioned data has shown that the best results in case of bent functions were achieved while using (1+lambda) evolutionary strategy. The roulette selection performed the best in case of balanced functions with high nonlinearity.
|
|
|
Evolutionary Optimization of Freight Transportation
Beránek, Michal ; Drahošová, Michaela (referee) ; Bidlo, Michal (advisor)
The following thesis deals with optimization of freight transport planning. The goal is to minimize expenses connected to transportation, which emerge from travelled distance. The expenses can be heavily reduced, if the routes are correctly planned, especially when there is a large number of customers to be served. This thesis focuses on solving the problem by using the evolutional algorithms, that are optimization methods based on principles of evolution. Thesis concentrates on Heterogeneous Fixed Fleet Vehicle Routing Problem. Thesis introduces multiple evolutional algorithms and their results are compared. The best algorithm, evolutional strategy with local neighbourhood search, achieves similar, for certain tasks even better results, than other existing evolutional algorithms, created to solve given problem.
|
|
|
Prediction of Protein Stability upon Amino Acid Mutations Using Evolution Strategy
Kadlec, Miroslav ; Burgetová, Ivana (referee) ; Bendl, Jaroslav (advisor)
This thesis is focused on predicting the impact of amino acid substitution on protein stability. The main goal is to create a consensual predictor that uses the outputs of chosen existing tools in order to improve accuracy of prediction. The optimal consensus of theese tools was designed using evolution strategies in three variants: 1/5 success rule, self-adaptation variant and the CMA-ES method. Then, the quality of calculated weight vectors was tested on the independent dataset. Although the highest prediction performance was attained by self-adaptation method, the differences between all three variants were not significant. Compared to the individual tools, the predictions provided by consensual methods were generally more accurate - the self-adaptation variant imporved the Pearson's corelation coeficient of the predictions by 0,057 on the training dataset. On the testing dataset, the improvement of designed method was smaller (0,040). Relatively low improvement of prediction performance (both on the training and the testing dataset) were caused by the fact, that for some records of testing dataset, some individual tools vere not able to provide their results. When omitting these records, consensual method improved the Pearson's corelations coeficient by 0,118.
|
|
|
Neuroevolution Principles and Applications
Herec, Jan ; Strnadel, Josef (referee) ; Bidlo, Michal (advisor)
The theoretical part of this work deals with evolutionary algorithms (EA), neural networks (NN) and their synthesis in the form of neuroevolution. From a practical point of view, the aim of the work is to show the application of neuroevolution on two different tasks. The first task is the evolutionary design of the convolutional neural network (CNN) architecture that would be able to classify handwritten digits (from the MNIST dataset) with a high accurancy. The second task is the evolutionary optimization of neurocontroller for a simulated Falcon 9 rocket landing. Both tasks are computationally demanding and therefore have been solved on a supercomputer. As a part of the first task, it was possible to design such architectures which, when properly trained, achieve an accuracy of 99.49%. It turned out that it is possible to automate the design of high-quality architectures with the use of neuroevolution. Within the second task, the neuro-controller weights have been optimized so that, for defined initial conditions, the model of the Falcon booster can successfully land. Neuroevolution succeeded in both tasks.
|
|
|
Functional Annotation of Nucleotide Polymorphism Using Evolution Strategy
Šalanda, Ondřej ; Martínek, Tomáš (referee) ; Bendl, Jaroslav (advisor)
This thesis brings a new approach to the prediction of the the effect of amino acid substitution. The main goal is to create a new meta-tool, which combines evaluations of eight already implemented prediction tools. The use of weighted consensus over those tools should lead to better accuracy and versatility of prediction. The novelty of developed tool lies in involving evolution strategy with experimentally defined parameters as a way to determine the best weight distribution. At the end, a complex comparison and evaluation of results is given.
|
|
|
Quantum-Inspired Optimisation Algorithms
Kosík, Dominik ; Sekanina, Lukáš (referee) ; Bidlo, Michal (advisor)
The focus of this work is an implementation of the chosen quantum-inspired optimisation algorithm and its modifications, which will be compared at the end of the work. As the optimisation algorithm was chosen simulated quantum annealing algorithm. The first part of the work will lay the theoretical groundwork of standard optimisation algorithms used in this work, physics from which the inspiration for the simulated quantum annealing originates, and a description of the chosen algorithm. The second part will focus on the implementation of the algorithms on the selected problems. The selected problems are travelling salesman problem, searching rules for cellular automaton and MAX-SAT problem. The last part will contain the proposed modifications of the simulated quantum annealing, a comparison of the basic variant and standard optimisations algorithms, and an evaluation of the results.
|
|
|
Optimization of PID controller using evolutionary computing techniques
Kočí, Jakub ; Matoušek, Radomil (referee) ; Lang, Stanislav (advisor)
This bachelor thesis deals with using evolutionary computation for tuning up PID controller. In research part there are summarised information about regulation and another background information about quality of regulation and ITAE criterion. Practical part consist of implementing three evolutionary computation algorithms - differential evolution, evolution strategy and genetic algorithm. These and MATLAB's function ga() are compared on two systems mutually and to Ziegler-Nichols rule. Basic comparsion is followed by statistical evaluation on second system.
|
|
|
Evolutionary Optimisation of Analogue Circuits
Mihulka, Tomáš ; Zachariášová, Marcela (referee) ; Bidlo, Michal (advisor)
The aim of this work was to create a system for optimisaton of specific analog circuits by evolution using multiple fitness functions . A set of experiments was run, and the results analyzed to evaluate the feasibility of evolutionary optimisation of analog circuits . A requirement for this goal is the study and choice of certain types of analog circuits and evolutionary algorithms . For the scope of this work , amplifiers and oscillators were chosen as target circuits , and genetic algorithms and evolutionary strategies as evolutionary algorithms . The motivation for this work is the ongoing effort to automate the design and optimisation of analog circuits , where evolutionary optimisation is one of the options .
|
|
|
The Impact of Candidate Solution Mappings on Evolutionary Algorithm Efficiency
Hrbáček, Jiří ; Korček, Pavol (referee) ; Křivánek, Jan (advisor)
The Concern of the present study is summarizing knowledges in the theory of mapping candidate solutions , analysis and application of evolutionary algorithms. The study provides summary of the evolutionary algorithms, classification and application. The target of the study is links gained knowledge from sectionS of ; evolutionary algorithms, mapping candidate solutions and creations of a system that will demonstrate and influence mapping the efficiency of the evolutionary algorithms succesfully.
|
|
|
Evolutionary Prediction of Time Series
Křivánek, Jan ; Bidlo, Michal (referee) ; Sekanina, Lukáš (advisor)
This thesis summarizes knowledge in the field of time series theory, method for time series analysis and applications in financial modeling. It also resumes the area of evolutionary algorithms, their classification and applications. The core of this work combines these knowledges in order to build a system utilizing evolutionary algorithms for financial time series forecasting models optimization. Various software engineering techniques were used during the implementation phase (ACI - autonomous continual integration, autonomous quality control etc.) to ensure easy maintainability and extendibility of project by more developers.
|
guest ::
