|
|
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.
|
|
|
ALPS Technique in Cartesian Genetic Programming
Stanovský, Peter ; Slaný, Karel (referee) ; Sekanina, Lukáš (advisor)
This work introduces a brief summary of softcomputing and the solutions to NP-hard problems. It especially deals with evolution algorithms and their basic types. The next part involves the study of cartesian genetic programming, which belongs to the field of evolution algorithms, used mainly in the evolution of digital circuits, symbolic regression, etc. A special chapter is devoted to the studies of new technique Age layered population structure, which deals with the problems of premature convergence, which suggests the way of how the population could be divided into subpopulations split up according to the age criteria. Thanks to the maintaining of sufficient diversity, it achieves substantially better solutions in comparison to the classical evolution algorithms. This papier includes the suggestion of two ways of incorporation of the ALPS technique into CGP. In the next part of work there were carried out tests on the classic problems, that would be solved with evolution algorithms. These tests were made with and without using ALPS technique. In the part of work "Experimental results" there was discussed a contribution of using ALPS technique in CGP against the classic CGP.
|
|
|
Self-Replication in Cellular Systems
Komenda, Tomáš ; Bidlo, Michal (referee) ; Sekanina, Lukáš (advisor)
This thesis deals with cellular systems and their applications to self - replication data structures. The sector cellular automats is a very interesting and inspiring area which seems now as a very suitable environment for the simulation of various phenomen. One of these phenomen may be, for example, artificial life or self- replication the structure, which transmits some useful information or carry out the necessary calculations. In this thesis is detailed subscribe cellular automats and their division. It focuses on Langtons loop, Codds automata, Byls loop, Chou-Reggia loop, Tempesti loop, Perrier loop, SDSR loop, Evoloop and Sexyloop. Part of the work is to accelerate replication Byls loops through change to the rules of cellular automat and the addition of functionality to the ability to release space to the completion of replication loops. At thesis, I also dealt with the evolutionary design of the rules of cellular automata.
|
|
|
Spam Filter Implementation on the Basis of Artificial Immune Systems
Neuwirth, David ; Schwarz, Josef (referee) ; Sekanina, Lukáš (advisor)
Unsolicited e-mails generally present a major problem within the e-mail communication nowadays. There exist several methods that can detect spam and distinguish it from the requested messages. The theoretical part of the masters thesis introduces the ways of detecting unsolicited messages by using artificial immune systems. It presents and subsequently analyses several methods of the artificial immune systems that can assist in the fight against spam. The practical part of the masters thesis deals with the implementation of a spam filter on the basis of the artificial immune systems. The project ends with comparison of effectiveness of the newly designed spam filter and the one which uses common methods for spam detection.
|
|
|
A Nanocomputer Simulator Using Cellular Automaton
Kmeť, Dušan ; Bidlo, Michal (referee) ; Sekanina, Lukáš (advisor)
This master thesis deals with the realization of a simulator based on asynchronous cellular automata simulating delay insensitive circuits. In connection with nanotechnology, cellular automata have several interesting properties, such as self-replication, regular structure and high parallelism that make them very useful as models for some types of nanocomputers. This text describes the relationship between cellular automata and nanotechnology. Emphasis is given to the possibility of using asynchronous timing mode. Asynchronous cellular arrays based on asynchronous cellular automata could prove to be a suitable architecture for future nanocomputer, which was the reason for implementation of this simulator. The simulator's functionality was verified by experiments.
|
|
|
Evolutionary Design of 3D Structures
Kovařík, Roman ; Sekanina, Lukáš (referee) ; Jaroš, Jiří (advisor)
This work deals with evolutionary design of 3D structures. The work brings the summary of the previous works in this area and brings autor's suggested solution of evolutionary design of 3D structures. This paper seeks to the ability of easy fitness function definition in the systems for evolutionary design of structures. The author tries to make one of the first steps to the future systems for evolution design of any universal structures in contrast with the evolution systems for design of a concrete type of structure. The result of this work is the basic system for evolutionary design of 3D structures with the ability of external fitness function definition via the XML file. This paper offers also the simple advices and observations for the potential future work in this area.
|
|
|
A Tool for Visual Analysis of Circuit Evolution
Staurovská, Jana ; Minařík, Miloš (referee) ; Sekanina, Lukáš (advisor)
The main goal of the master's thesis is to compose a study on cartesian genetic programming with focus on evolution of circuits and to design a concept for visualisation of this evolution. Another goal is to create a program to visualise the circuit evolution in cartesian genetic programming, its generations and chromosomes. The program is capable of visualising the changes between generations and chromosomes and comparing more chromosomes at once. Several user cases had been prepared for the resulting program.
|
|
|
Polymorphic Image Filters
Salajka, Vojtěch ; Vašíček, Zdeněk (referee) ; Sekanina, Lukáš (advisor)
This thesis deals with the polymorphic image filter design. The study includes polymorphic circuits, their theoretical base and practical applications. It further focuses on the cartesian genetic programming that can be used for an evolutionary design of some types of image filters. The thesis continues with the specification of the evolutionary algorithm to be used for the design of the polymorphic image filters. The implementation of the algorithm is described in two versions -- a standard one running only on a CPU and an accelerated one that partially uses the GPU. Several polymorphic image filters are designed by means of the algorithm.
|
|
|
Evolutionary Algorithms in the Task of Boolean Satisfiability
Serédi, Silvester ; Vašíček, Zdeněk (referee) ; Sekanina, Lukáš (advisor)
The goal of this Master's Thesis is finding a SAT solving heuristic by the application of an evolutionary algorithm. This thesis surveys various approaches used in SAT solving and some variants of evolutionary algorithms that are relevant to this topic. Afterwards the implementation of a linear genetic programming system that searches for a suitable heuristic for SAT problem instances is described, together with the implementation of a custom SAT solver which expoloits the output of the genetic program. Finally, the achieved results are summarized.
|
|
|
Evolutionary Combinational Circuit Resynthesis
Pták, Ondřej ; Schwarz, Josef (referee) ; Sekanina, Lukáš (advisor)
This project deals with combinational digital circuits and their optimization. First there are presented main levels of abstraction utilized in the design of combinational digital circuits. Afterwards different methods are surveyed for optimization of combinational digital circuits. The next part of this project is mainly devoted to evolutionary algorithms, their common characteristics and branches: genetic algorithms, evolutionary strategies, evolutionary programming and genetic programming. The variant of genetic programming called Cartesian Genetic Programming (CGP) and the use of CGP in various areas, particularly in the synthesis and optimization of combinational logic circuits are described in detail. The project also discusses some modifications of CGP and the scalability problem of evolutionary circuit design. Consequential part of this thesis describes the method for evolution resynthesis of combinational digital circuits. There is description of design, especially the method of splitting circuits into subcircuits, and implementation details. Finally experiments with these method and their results are described.
|
guest ::
