|
|
A Simple Digital Circuit Simulator
Kolman, Aleš ; Žaloudek, Luděk (referee) ; Sekanina, Lukáš (advisor)
Tituln. list esf This work is oriented on the simulation of digital circuits, especially small combinational and sequential circuits. This project is focused particularly on achieving the highest possible speed of simulation, for this reason was chosen programming language C. As Input format for this project was selected EDIF format of digital circuits. Output has not been specified.
|
|
|
Symbolic Regression and Coevolution
Drahošová, Michaela ; Žaloudek, Luděk (referee) ; Sekanina, Lukáš (advisor)
Symbolic regression is the problem of identifying the mathematic description of a hidden system from experimental data. Symbolic regression is closely related to general machine learning. This work deals with symbolic regression and its solution based on the principle of genetic programming and coevolution. Genetic programming is the evolution based machine learning method, which automaticaly generates whole programs in the given programming language. Coevolution of fitness predictors is the optimalization method of the fitness modelling that reduces the fitness evaluation cost and frequency, while maintainig evolutionary progress. This work deals with concept and implementation of the solution of symbolic regression using coevolution of fitness predictors, and its comparison to a solution without coevolution. Experiments were performed using cartesian genetic programming.
|
|
|
GUI for Handling Genetic Programming Chromozome
Staurovská, Jana ; Žaloudek, Luděk (referee) ; Jaroš, Jiří (advisor)
The main goal of this thesis is to create a program for manipulation with genetic programming chromosomes, which should allow export to a vector graphics format, moving of gates, their colouring and other graphical operations, and will work on different operating systems (mainly Microsoft Windows and Linux). For better understanding, the basic principles of cartesian genetic programming are described in theoretical part.
|
|
|
Large-Scale Travelling Salesman Problem
Kukula, Lukáš ; Žaloudek, Luděk (referee) ; Bartoš, Pavel (advisor)
Thesis deals with solving large-scale traveling salesman problem. The aim is to find the best possible solution within a short time. Most widely used heuristics was compared and most efficient proved to be Lin-Kernighan. This heuristic combined with the stochastic algorithm brings even better results than the Lin-Kernighan heuristic itself.
|
|
|
Evolutionary Circuit Design at the Transistor Level
Žaloudek, Luděk ; Vašíček, Zdeněk (referee) ; Sekanina, Lukáš (advisor)
This project deals with evolutionary design of electronic circuits with an emphasis on digital circuits. It describes the theoretical basics for the evolutionary design of circuits on computer systems, including the explanation of Genetic Programming and Evolutionary Strategies, possible design levels of electronic circuits, CMOS technology overview, also the overview of the most important evolutionary circuits design methods like development and Cartesian Genetic Programming. Next introduced is a new method of digital circuits design on the transistor level, which is based on CGP. Also a design system using this new method is introduced. Finally, the experiments performed with this system are described and evaluated.
|
|
|
The Efficient Implementation of the Genetic Algorithm Using Multicore Processors
Kouřil, Miroslav ; Žaloudek, Luděk (referee) ; Jaroš, Jiří (advisor)
This diploma thesis deals with acceleration of advanced genetic algorithm. For implementation, discrete and continuos versions of UMDA genetic algorithm were chosen. The main part of the acceleration is the utilization of SSE instruction set. Using this set, the functions for calculating fitness and new population sampling were accelerated in particular. Then the pseudorandom number generator that also uses SSE instruction set was implemented. The discrete algorithm reached the speed of up to 4,6 after this implementation. Finally, the algorithms were modified so that the system OpenMP could be used, which enables the running of blocks of code in more threads. The continuous version of algorithm is not convenient for parallelization, because computational complexity of that algorithm is low. In comparison, the discrete versions of algorithm are really appropriate for parallelization. Both the implemented versions reached the total acceleration of up to 4,9 and 7,2.
|
|
|
Instruction-Controlled Cellular Automata
Bendl, Jaroslav ; Žaloudek, Luděk (referee) ; Bidlo, Michal (advisor)
The thesis focuses on a new concept of cellular automata control based on instructions. The instruction can be understood as a rule that checks the states of cells in pre-defined areas in the cellular neighbourhood. If a given condition is satisfied, the state of the central cell is changed according to the definition of the instruction. Because it's possible to perform more instructions in one computational step, their sequence can be understood as a form of a short program. This concept can be extended with simple operations applied to the instruction's prescription during interpretation of the instructions - an example of such operation can be row shift or column shift. An advantage of the instruction-based approach lies in the search space reduction. In comparison with the table-based approach, it isn't necessary to search all the possible configurations of the cellular neighbouhood, but only several areas determined by the instructions. While the groups of the inspected cells in the cellular neighbourhood are designed manually on the basis of the analysis of the solved task, their sequence in the chromosome is optimized by genetic algorithm. The capability of the proposed method of cellular automata control is studied on these benchmark tasks - majority, synchronization, self-organization and the design of combinational circuits.
|
|
|
Temperature Measuring in Wellness
Gábriš, Michal ; Žaloudek, Luděk (referee) ; Bartoš, Pavel (advisor)
This Bachelor thesis deals with creation of operation program for digitally calibrated thermometer measuring two temperatures, which can be used in wellness centers. The thermometer operates in two modes, the mode of measuring and displaying of water temperature, and the mode of linear digital calibration, in which the temperature sensors are set. The Bachelor thesis contains both the description of used hardware components, and software solution implemented in assembly language. This device is already in commercial use.
|
|
|
Self-Replication in Cellular Automata
Mikeš, Martin ; Bidlo, Michal (referee) ; Žaloudek, Luděk (advisor)
This thesis introduces cellular automata as an environment suitable for simulating complex and massively parallel systems, built from a large number of simple cooperating units. The thesis explores self-replication and self-replicating loops - structures operating within the cellular space, particularly those capable of carrying out useful tasks. The thesis provides a description of implementation of three such loops, executing following tasks: coloring of the space within a loop, construction of letters "MM" and binary addition. A practical usability is discussed at the end.
|
|
|
Multi-Objective Partical Swarm Optimization
Benčok, Tomáš ; Žaloudek, Luděk (referee) ; Sekanina, Lukáš (advisor)
This bachelor work deals with the difficulties of multi-objective optimization of certain hard mathematical functions and non-traditional approaches for discovering their extremes. Main attention is given to the PSO (Particle Swarm Optimization) algorithm, implementation of which is also part of the bachelor work. The algorithm is modified in a such way, that it automatically builds Pareto-Optimal Set of the solutions. It's performance is compared with NSGA-II genetic algorithm on several test tasks.
|
guest ::
RSS feed.