Topological evolution is a new dynamical systems model of biological evolution occurring within a genomic state space. It can be modeled equivalently as a stochastic dynamical system, a stochastic differential equation, or a partial differential equation drift-diffusion model. An application of this approach is a model of disease evolution tracing diseases in ways similar to standard functional traits (e.g., organ evolution). Genetically embedded diseases become evolving functional components of species-level genomes. The competition between species-level evolution (which tends to maintain diseases) and individual evolution (which acts to eliminate them), yields a novel structural topology for the stochastic dynamics involved. In particular, an unlimited set of dynamical time scales emerges as a means of timing different levels of evolution: from individual to group to species and larger units. These scales exhibit a dynamical tension between individual and group evolutions, which are modeled on very different (fast and slow, respectively) time scales. This is analyzed in the context of a potentially major constraint on evolution: the species-level enforcement of lifespan via (topological) barriers to genomic longevity. This species-enforced behavior is analogous to certain types of evolutionary altruism, but it is denoted here as extreme altruism based on its potential shaping through mass extinctions. We give examples of biological mechanisms implementing some of the topological barriers discussed and provide mathematical models for them. This picture also introduces an explicit basis for lifespan-limiting evolutionary pressures. This involves a species-level need to maintain flux in its genome via a paced turnover of its biomass. This is necessitated by the need for phenomic characteristics to keep pace with genomic changes through evolution. Put briefly, the phenome must keep up with the genome, which occurs with an optimized limited lifespan. An important consequence of this model is a new role for diseases in evolution. Rather than their commonly recognized role as accidental side-effects, they play a central functional role in the shaping of an optimal lifespan for a species implemented through the topology of their embedding into the genome state space. This includes cancers, which are known to be embedded into the genome in complex and sometimes hair-triggered ways arising from DNA damage. Such cancers are known also to act in engineered and teleological ways that have been difficult to explain using currently very popular theories of intra-organismic cancer evolution. This alternative inter-organismic picture presents cancer evolution as occurring over much longer (evolutionary) time scales rather than very shortened organic evolutions that occur in individual cancers. This in turn may explain some evolved, intricate, and seemingly engineered properties of cancer. This dynamical evolutionary model is framed in a multiscaled picture in which different time scales are almost independently active in the evolutionary process acting on semi-independent parts of the genome. We additionally move from natural evolution to artificial implementations of evolutionary algorithms. We study genetic programming for the structured construction of machine learning features in a new structural risk minimization environment. While genetic programming in feature engineering is not new, we propose a Lagrangian optimization criterion for defining new feature sets inspired by structural risk minimization in statistical learning. We bifurcate the optimization of this Lagrangian into two exhaustive categories involving local and global search. The former is accomplished through local descent with given basins of attraction while the latter is done through a combinatorial search for new basins via an evolution algorithm.

The aim of this diploma thesis is refer to the supplier evaluation and selection process in business sphere. On the business sphere is putted emphasis because securing of company sources are more and more important parts of strategic decision making. In this paper is analyzed supplier selection problem and are analyzed most common methods to determine the best supplier. The goal of this paper is proposal of own program solution of evaluation and supplier selection build on evolution methods, specifically evolution algorithms. The part of this thesis is map of theoretical possibilities of evolution algorithms and implementation of program for solving supplier selection problem.

Celular automata are one of many alternative models of computation. Massive parallelism and the posibillity to describe their local behaviour in a simple way are of particular interest. This thesis describes a different way of representing the local transfer function of cellular automata, which is particulary suitable for use in genetic algorithm. This representation is based on simple model, mirroring the way instruction based register machines operate. The aim of this publication is to analyze and assess applicability of proposed method.

The aim of this thesis is implementation of wavelet transform algorithm for noise reduction. The noise reduction itself is focused on improving informative capabilities of sonographic (ultrasound) images in medicine. For this purpose, thresholding of detailed coefficients on individual levels of multiresolution analysis was used. Common procedures were not used for searching for the most suitable thresholds of those levels. The alternative concept's design is based on fundamental empirical approach, where the individual thresholds are optimised by evolution algorithms. However, with this algorithmic procedure, more problems manifest regarding the objective evaluation of the success of noise reduction. Because of this, the program uses commonly used parameters such as mean square error of the whole image, linear slope edge approximation, relative contrast of two differently bright and distinct points and the standard deviation of compact surface. Described theoretical knowledge is used in developed application DTWT. It executes multilevel decomposition and reversed reconstruction by discrete time wavelet transform, thresholding of detailed coefficients and final evaluation of performed noise reduction. The developed tool can be used separately to reduce noise. For our purposes, it has been modified in way, that it executed through the component for evolutionary optimization of parameters (Optimize Parameters) in created scenario in RapidMiner program. In the optimization process, this component used evaluation received from DTWT program as fitness function. Optimal thresholds were sought separately for three wavelet families - Daubeschies, Symmlets and Coiflets. The evolution algorithm chose soft threshold for all three wavelet families. In comparison to hard threshold, it is more suitable for noise reduction, but it has tendencies to blur the edges more. The devised method had in most cases greater evaluated success of noise reduction with wavelet transform with threshold search done by evolution algorithms, than commonly used filters. In visual comparison however the wavelet transform introduced some minor depreciating artefacts into the image. It is always about compromise between noise reduction and maximal preservation of image information. Objectively evaluating this dilemma is not easy and is always dependant on subjective viewpoint which in case of sonographic images is that of the attending physician.

Steel has become widespread and now it can be accepted as the candidate of being main material for the structural systems with its excellent properties. Its high quality, durability, stability, low maintenance costs and opportunity of fast construction are the advantages of steel. The correct use of the material is important for steel&rsquo / s bright prospects. The need for weight optimization becomes important at this point. Available sources are used economically through optimization. Optimization brings material savings and at last economy. Optimization can be achieved with different ways. This thesis investigates the effect of the appropriate choice of column orientation on minimum weight design of steel frames. Evolution strategies (ESs) method, which is one of the three mainstreams of evolutionary algorithms, is used as the optimizer in this study to deal with the current problem of interest. A new evolution strategy (ES) algorithm is proposed, where design variables are considered simultaneously as cross-sectional dimensions (size variables) and orientation of column members (orientation variables). The resulting algorithm is computerized in a design optimization software called OFES. This software has many capabilities addressing to issues encountered in practical applications, such as producing designs according to TS-648 and ASD-AISC design provisions. The effect of column orientations is numerically studied using six examples with practical design considerations. In these examples, first steel structures are sized for minimum weight considering the size variables only, where orientations of the column members are initially assigned and kept constant during optimization process. Next, the weight optimum design of structures are implemented using both size and orientation design variables. It is shown that the inclusion of column orientations produces designs which are generally 4 to 8 % lesser in weight than the cases where only size variables are employed.

This Master's Thesis is focused on the principles of neural networks, primarily convolutional neural networks (CNN). It introduces the evolutionary optimization in the context of neural networks. One of existing libraries devoted to the CNN design was chosen (Keras), analysed and used in image classification tasks. An optimization technique based on cartesian genetic programming that should reduce the complexity of CNN's computation was proposed and implemented. The impact of the proposed technique on CNN behaviour was evaluated in a case study.

This thesis deals with methods for optimization in image processing. There is described some of optimization techniques and some applications in image processing. There is also described detailed procedure and realization of bee algorithm, genetic algorithm, PSO algorithm and their realization in image registration, matched filtering, image segmentation and image reconstruction. Algorithms and their efficiencies are compared in the particular application for image processing.

Cette thèse porte sur la caractérisation de structures mécaniques, au travers de leurs paramètres structuraux, à partir d'observations perturbées par des bruits de mesure, supposés additifs blancs gaussiens et centrés. Pour cela, nous proposons d'utiliser des modèles à temps discret à parties linéaire et non-linéaire séparables. La première permet de retrouver les paramètres recherchés tandis que la seconde renseigne sur la non-linéarité présente. Dans le cadre d'une modélisation non-récursive par des séries de Volterra, nous présentons une approche à erreurs-dans-les-variables lorsque les variances des bruits ne sont pas connues ainsi qu'un algorithme adaptatif du type LMS nécessitant la connaissance de la variance du bruit d'entrée. Dans le cadre d'une modélisation par un modèle récursif polynomial, nous proposons deux méthodes à partir d'algorithmes évolutionnaires. La première inclut un protocole d'arrêt tenant compte de la variance du bruit de sortie. Dans la seconde, les fonctions fitness sont fondées sur des fonctions de corrélation dans lesquelles l'influence du bruit est supprimée ou compensée. / This PhD deals with the caracterisation of mechanical structures, by its structural parameters, when only noisy observations disturbed by additive measurement noises, assumed to be zero-mean white and Gaussian, are available. For this purpose, we suggest using discrete-time models with distinct linear and nonlinear parts. The first one allows the structural parameters to be retrieved whereas the second one gives information on the nonlinearity. When dealing with non-recursive Volterra series, we propose an errors-in-variables (EIV) method to jointly estimate the noise variances and the Volterra kernels. We also suggest a modified unbiased LMS algorithm to estimate the model parameters provided that the input-noise variance is known. When dealing with recursive polynomial model, we propose two methods using evolutionary algorithms. The first includes a stop protocol that takes into account the output-noise variance. In the second one, the fitness functions are based on correlation criteria in which the noise influence is removed or compensated.

In my thesis, I focus on the task of recognizing human iris from an image.In the beginning, the work deals with a question of biometrics, its importance and basic concepts, which are necessary for use in following text. Subsequently process of human Iris detection is described together with theory of evolution algorithms. In the implementation part, is described the design of implemented solution, which uses evolution algorithms, where is emphasis on correct pupil and iris boundary detection.

Many companies consider essential to obtain forecast of time series of uncertain variables that influence their decisions and actions. Marketing includes a number of decisions that depend on a reliable forecast. Forecasts are based directly or indirectly on the information derived from historical data. This data may include different patterns - such as trend, horizontal pattern, and cyclical or seasonal pattern. Most methods are based on the recognition of these patterns, their projection into the future and thus create a forecast. Other approaches such as neural networks are black boxes, which uses learning.