National Repository of Grey Literature 110 records found  beginprevious100 - 109next  jump to record: Search took 0.00 seconds. 
Genetic programming - Java implementation
Tomaštík, Marek ; Kuba,, Martin (referee) ; Matoušek, Radomil (advisor)
This Master´s thesis implements computer program in Java, useful for automatic model generating, specially in symbolic regression problem. Thesis includes short description of genetic programming (GP) and own implementation with advanced GP operands (non-destructive operations, elitism, exptression reduction). Mathematical model is generating by symbolic regression, exacly for choosen data set. For functioning check are used test tasks. Optimal settings is found for choosen GP parameters.
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.
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
Implementation of an evolutionary expert system
Bukáček, Jan ; Müller, Jakub (referee) ; Karásek, Jan (advisor)
This thesis is focused on working up evolutionals and genetics algorithms issues Especially for multiobjective algorithms VEGA, SPEA and NSGA – II. Thereinafter one of FrameWork working with genetics algorithms namely WWW NIMBUS. From this mentioned algorithms was selected VEGA algorithm for implementation in JAVA to preselected problem. Thereby problem is choice thick columns of profile according to predetermined criteria. Selected algorithm works on division of population into several groups and each group evaluates the resulting fitness function. Here is a sample implementation of this algorithm. Furthermore there is a example of working with FrameWork. In the next section are compared the results of generated progam with results that were obtained by FrameWork WWW NIMBUS. As for VEGA, and the Nimbus there are shown different results. The VEGA is presented also the development of individual fitness functions. Also, there are shown graphs, that can be obtained from NIMBUS. At the end of work is introduced the comparation of the results ane propose possible improvements.
Analysis of TP53 gene transcriptional varians in human leucemic cells
Vlahová, Veronika ; Mgr.Diana Grochová, Ph.D. (referee) ; Malčíková,, Jitka (advisor)
The theoretical part of the thesis summarizes general information about the human TP53 gene and p53 protein, which is encoded by this gene. There is also dealt with the transcriptional variants - p53 isoforms. The experimental part is focused on the detection of isoform p53 and its shorter, yet undescribed form. The starting material is peripheral blood of patients from University Hospital Brno, from which RNA was isolated. Subsequently, RNA was transcribed by reverse transcription into cDNA which was amplified by polymerase chain reaction (PCR). Experimental measurements demonstrate that p53 occurs in all the B-lymphocytes of patients with chronic lymphocytic leukemia. It also demonstrats the existence of a shorter form of p53.
Analysis of yeast DNA using pulsed field gel electrophoresis
Kubáčková, Martina ; Drábková, Michaela (referee) ; Márová, Ivana (advisor)
Technique of pulsed field gel electrophoresis (PFGE) has found widespread use in the analysis of the genome of all life organisms. It is applied to the separation of the large DNA molecules above thousands base pairs up to millions of base pairs in size, where using conventional gel electrophoresis techniques are not possible (for instance large bacterial, yeast, fungal or mammalian chromosome). Presented work was realized as a comparative analysis of genome of several carotenogenic yeasts. The conditions of isolation and analysis of chromosomal yeast DNA were optimized. A lysis of yeast cells and deproteination of DNA within agarose chops was shown as the most appropriate method for DNA isolation. Cultivation to late exponential phase (50 hours) is the most suitable to obtaining intact DNA in sufficient amount and quality. Carotenogenic yeasts undergo the random mutagenesis using alkylation reagent ethyl methanesulfonate (EMS). Genome of pigment overproducing mutants was analyzed by pulsed field gel electrophoresis and amount of carotenoids by high pressure liquid chromatography (HPLC). However, overproduction of beta-carotene was analyzed in mutant strains Rhodotorula glutinis (10.6 g/l of biomass enriched 0,34 mg/g of beta-carotene) and Cystofilobasidium capitatum (8.5 g/l of biomass enriched 0,23 mg/g of beta-carotene). Selection of mutant strains overproducing carotenoid pigments was in presented experiment series successful in almost all analyzed strains except in the case of the strain Rhodotorula aurantiaca.
Fixation and Mutation
Maloušková, Drahomíra ; Nikitová, Alice (referee) ; Artamonov, Vasil (advisor)
My ending Bachelor work related with all my work in school across my stadies here in FFA of BUT in Brno. Obssesive collectibles of different things and materials are my starting point. My father have this behavioral disorder, and it is really inspirated for me. In fact, I will present cca 13 oil paintings about some objects from his collection and relationships between these in space and time.
Epilepsy of dogs and their genetic aspect
ŠVARCOVÁ, Monika
The subject of this thesis was to prepare an overview of the information about dog epilepsy and genes related to its development. It has been discovered that only several candidate genes are associated with this disease. The most important are mutations in LGI2 gene in lagotto romagnolo and EPM2B gene in miniature wirehaired dachshund, which is also described as Lafora disease in humans. Other mutations have been identified in 8 NCL genes: CLN8 in english setter, CLN5 in border collie, CTSD in american bulldog, TPP1 and PPT1 genes in dachshunds, ARSG in american staffordshire terrier, CLN6 in australian shepherd and ATP13A2 in tibetan terrier.

National Repository of Grey Literature : 110 records found   beginprevious100 - 109next  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.