|
|
Karyotype analysis of selected representatives of two pedipalpid orders, Amblypygi and Uropygi
Sember, Alexandr ; Král, Jiří (advisor) ; Ráb, Petr (referee)
Karyotype analysis of selected species from arachnid orders Amblypygi and Uropygi Whip spiders (Amblypygi) and whip scorpions (Uropygi) represent relict arachnid orders which has been found already at Upper Carboniferous strata. Although cytogenetic data from amblypygids and uropygids might be important to reconstruct karyotype evolution of arachnids, cytogenetics of these orders is almost unknown. Presented study is aimed in analysis of karyotype and meiosis in 16 species of Amblypygi and 4 species of Uropygi. Both groups are characterized by considerable range of diploid chromosome numbers (2n = 24 - 86 in Amblypygi and 36 - 66 in Uropygi). Analysed species does not exhibit morfologically differentiated sex chromosomes. Differentiation of sex chromosomes on molecular level was revealed in amblypygid Paraphrynus mexicanus by comparative genome hybridization. Obtained data indicate XY/XX sex chromosome system in this species. Comparison of karyotype data indicates reduction of chromosome numbers during evolution of both orders. In Amblypygi, this reduction was accompanied by increase of number of biarmed chromosomes. This trend is not apparent in Uropygi. Karyotypes of most analysed amblypygids and uropygids are also characterized by low amount of heterochromatin. Most studied species exhibit two pairs...
|
|
| |
|
|
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.
|
|
|
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.
|
|
|
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.
|
|
|
Coevolution of Cartesian Genetic Algorithms and Neural Networks
Kolář, Adam ; Král, Jiří (referee) ; Zbořil, František (advisor)
The aim of the thesis is to verify synergy of genetic programming and neural networks. Solution is provided by set of experiments with implemented library built upon benchmark tasks. I've done experiments with directly and also indirectly encoded neural netwrok. I focused on finding robust solutions and the best calculation of configurations, overfitting detection and advanced stimulations of solution with fitness function. Generally better solutions were found using lower values of parameters n_c and n_r. These solutions tended less to be overfitted. I was able to evolve neurocontroller eliminating oscilations in pole balancing problem. In cancer detection problem, precision of provided solution was over 98%, which overcame compared techniques. I succeeded also in designing of maze model, where agent was able to perform multistep tasks.
|
|
|
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.
|
|
|
Evolutionary algorithms
Bortel, Martin ; Karásek, Jan (referee) ; Burget, Radim (advisor)
Thesis describes main attributes and principles of Evolutionary and Genetic algorithms. Crossover, mutation and selection are described as well as termination options. There are examples of practical use of evolutionary and genetic algorithms. Optimization of distribution routes using PHP&MySQL and Google Maps API technologies.
|
|
|
Genetic Algorithm Design for Distribution Network Outfits Optimalization
Ondruš, Tomáš ; Skala, Petr (referee) ; Paar, Martin (advisor)
The work deals with genetic algorithms and their potential use in application software to optimize high voltage switching elements of distribution network. Theoretical part explains the basic concepts of genetic algorithms such as a gene, population and chromosome and basic principles of the development of genetic algorithms.. The main task of the thesis is to design the algorithm that will simulate the distribution of the sectionalizers by telecontrolled section switches or reclosers and analyze how to set the the parameters affecting the convergence speed of genetic algorithm. The basic parameters affecting the convergence of breeding, mutation probability, population size or using of elitism. The second goal is finding a suitable set of input parameters for the selected population sizes without and with using elitism. The results of the work determine the most appropriate settings for each generation and determining the approximate number of generations needed to find the best solution. The genetic algorithm applocation was tested on a less extensive distribution network with six switching elements
|
|
|
The occurrence of chromosomal aberrations in the Czech Republic
LANDOVÁ, Ivana
The objektive of this bachelor's thesis was to describe the occurrence of chromosomal aberrations in the Czech Republic and to verify whether the literary data agree with the current occurrence rates. This thesis consist of 2 parts: The theoretical part of the thesis describe phenotypic symptoms and signs of chromosomal aberrations, their origin, causes and occurence rates in the population as reported in the literature. In the practical part, I tried to verify these occurrence rates of the aberrations based on results of investigations (both prenatal and postnatal) provided by the following laboratories: Genetika Plzeň s.r.o., Institute of Reproductive Medicine and Genetics, Karlovy Vary, and Institute of Medical Genetics, University Hospital, Pzeň. I have also used data obtained from the Czech Institute of Medical Information and Statistics (ÚZIS) as well as data found in various Internet sites. The purpose of this research was to provide graphics demonstrating the results, unify various types of results and try to find possible interrelations. It is obvious from the results that there has been a shift in the age group of maximum fertility from ages 20 ? 24 in 1995 to 30 ? 34 years in 2008. The mean age of mothers whose foetuses were diagnosed with Down syndrome in individual years ranged in the interval from 27 to 37.5 years. There were no differences in the representation of Down syndrome in individual years, and also the representations found in individual workplaces did not show any significant differences, ranging from 0.19 to 1.52%. The mean occurrence rate of Down syndrome as calculated from the results published by ÚZIS from the period 1994 ? 2007 was 1 for 1,700 live births. I succeeded in realizing all the targets of my work. Both prenatal and postnatal occurrence rates of aberrations in the workplaces of interest varied for individual years or showed only minor signs of increasing or decreasing rates. Monitoring of larger number of workplaces appears warranted to confirm my hypothesis.
|
guest ::
