Evolution of lace knitting stitch patterns by genetic programming

In this paper we study the generation of lace knitting stitch patterns by using genetic programming. We devise a genetic representation of knitting charts that accurately reflects their usage for hand knitting the pattern. We apply a basic evolutionary algorithm for generating the patterns, where the key of success is evaluation. We propose automatic evaluation of the patterns, without interaction with the user. We present some patterns generated by the method and then discuss further possibilities for bringing automatic evaluation closer to human evaluation. Copyright 2007 ACM.

Enhancing Information Retrieval by Using Evolution Strategies

Similar to Genetic algorithm, Evolution strategy is a process of continuous reproduction, trial and selection. Each new generation is an improvement on the one that went before. This paper presents two different proposals based on the vector space model (VSM) as a traditional model in information Retrieval (TIR). The first uses evolution strategy (ES). The second uses the document centroid (DC) in query expansion technique. Then the results are compared; it was noticed that ES technique is more efficient than the other methods.

Delimited Massively Parallel Algorithm Based on Rules Elimination for Application of Active Rules in Transition P Systems

In the field of Transition P systems implementation, it has been determined that it is very important to determine in advance how long takes evolution rules application in membranes. Moreover, to have time estimations of rules application in membranes makes possible to take important decisions related to hardware / software architectures design. The work presented here introduces an algorithm for applying active evolution rules in Transition P systems, which is based on active rules elimination. The algorithm complies the requisites of being nondeterministic, massively parallel, and what is more important, it is time delimited because it is only dependant on the number of membrane evolution rules.

Solving Differential Equations by Parallel Laplace Method with Assured Accuracy

The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006

The evolution of learning systems:to Bayes or not to be

Bayesian algorithms pose a limit to the performance learning algorithms can achieve. Natural selection should guide the evolution of information processing systems towards those limits. What can we learn from this evolution and what properties do the intermediate stages have? While this question is too general to permit any answer, progress can be made by restricting the class of information processing systems under study. We present analytical and numerical results for the evolution of on-line algorithms for learning from examples for neural network classifiers, which might include or not a hidden layer. The analytical results are obtained by solving a variational problem to determine the learning algorithm that leads to maximum generalization ability. Simulations using evolutionary programming, for programs that implement learning algorithms, confirm and expand the results. The principal result is not just that the evolution is towards a Bayesian limit. Indeed it is essentially reached. In addition we find that evolution is driven by the discovery of useful structures or combinations of variables and operators. In different runs the temporal order of the discovery of such combinations is unique. The main result is that combinations that signal the surprise brought by an example arise always before combinations that serve to gauge the performance of the learning algorithm. This latter structures can be used to implement annealing schedules. The temporal ordering can be understood analytically as well by doing the functional optimization in restricted functional spaces. We also show that there is data suggesting that the appearance of these traits also follows the same temporal ordering in biological systems. © 2006 American Institute of Physics.

Decision Trees for Applicability of Evolution Rules in Transition P Systems

Transition P Systems are a parallel and distributed computational model based on the notion of the cellular membrane structure. Each membrane determines a region that encloses a multiset of objects and evolution rules. Transition P Systems evolve through transitions between two consecutive configurations that are determined by the membrane structure and multisets present inside membranes. Moreover, transitions between two consecutive configurations are provided by an exhaustive non-deterministic and parallel application of active evolution rules subset inside each membrane of the P system. But, to establish the active evolution rules subset, it is required the previous calculation of useful and applicable rules. Hence, computation of applicable evolution rules subset is critical for the whole evolution process efficiency, because it is performed in parallel inside each membrane in every evolution step. The work presented here shows advantages of incorporating decision trees in the evolution rules applicability algorithm. In order to it, necessary formalizations will be presented to consider this as a classification problem, the method to obtain the necessary decision tree automatically generated and the new algorithm for applicability based on it.

HW Implementation of a Optimized Algorithm for the Application of Active Rules in a Transition P-system

P systems or Membrane Computing are a type of a distributed, massively parallel and non deterministic system based on biological membranes. They are inspired in the way cells process chemical compounds, energy and information. These systems perform a computation through transition between two consecutive configurations. As it is well known in membrane computing, a configuration consists in a m-tuple of multisets present at any moment in the existing m regions of the system at that moment time. Transitions between two configurations are performed by using evolution rules which are in each region of the system in a non-deterministic maximally parallel manner. This work is part of an exhaustive investigation line. The final objective is to implement a HW system that evolves as it makes a transition P-system. To achieve this objective, it has been carried out a division of this generic system in several stages, each of them with concrete matters. In this paper the stage is developed by obtaining the part of the system that is in charge of the application of the active rules. To count the number of times that the active rules is applied exist different algorithms. Here, it is presents an algorithm with improved aspects: the number of necessary iterations to reach the final values is smaller than the case of applying step to step each rule. Hence, the whole process requires a minor number of steps and, therefore, the end of the process will be reached in a shorter length of time.

Differential Balanced Trees and (0,1) Matrices

* The research was supported by INTAS 00-397 and 00-626 Projects.

Fast Linear Algorithm for Active Rules Application in Transition P Systems

Transition P systems are computational models based on basic features of biological membranes and the observation of biochemical processes. In these models, membrane contains objects multisets, which evolve according to given evolution rules. In the field of Transition P systems implementation, it has been detected the necessity to determine whichever time are going to take active evolution rules application in membranes. In addition, to have time estimations of rules application makes possible to take important decisions related to the hardware / software architectures design. In this paper we propose a new evolution rules application algorithm oriented towards the implementation of Transition P systems. The developed algorithm is sequential and, it has a linear order complexity in the number of evolution rules. Moreover, it obtains the smaller execution times, compared with the preceding algorithms. Therefore the algorithm is very appropriate for the implementation of Transition P systems in sequential devices.

Nonlinear Time-Fractional Differential Equations in Combustion Science

MSC 2010: 34A08 (main), 34G20, 80A25

Symbolic Solving of Partial Differential Equation Systems and Compatibility Conditions

An algorithm is produced for the symbolic solving of systems of partial differential equations by means of multivariate Laplace–Carson transform. A system of K equations with M as the greatest order of partial derivatives and right-hand parts of a special type is considered. Initial conditions are input. As a result of a Laplace–Carson transform of the system according to initial condition we obtain an algebraic system of equations. A method to obtain compatibility conditions is discussed.

An impulsive differential equation model for Marek's disease

Many dynamical processes are subject to abrupt changes in state. Often these perturbations can be periodic and of short duration relative to the evolving process. These types of phenomena are described well by what are referred to as impulsive differential equations, systems of differential equations coupled with discrete mappings in state space. In this thesis we employ impulsive differential equations to model disease transmission within an industrial livestock barn. In particular we focus on the poultry industry and a viral disease of poultry called Marek's disease. This system lends itself well to impulsive differential equations. Entire cohorts of poultry are introduced and removed from a barn concurrently. Additionally, Marek's disease is transmitted indirectly and the viral particles can survive outside the host for weeks. Therefore, depopulating, cleaning, and restocking of the barn are integral factors in modelling disease transmission and can be completely captured by the impulsive component of the model. Our model allows us to investigate how modern broiler farm practices can make disease elimination difficult or impossible to achieve. It also enables us to investigate factors that may contribute to virulence evolution. Our model suggests that by decrease the cohort duration or by decreasing the flock density, Marek's disease can be eliminated from a barn with no increase in cleaning effort. Unfortunately our model also suggests that these practices will lead to disease evolution towards greater virulence. Additionally, our model suggests that if intensive cleaning between cohorts does not rid the barn of disease, it may drive evolution and cause the disease to become more virulent.

Parallel Cyclostationarity-Exploiting Algorithm for Energy-Efficient Spectrum Sensing

The evolution of wireless communication systems leads to Dynamic Spectrum Allocation for Cognitive Radio, which requires reliable spectrum sensing techniques. Among the spectrum sensing methods proposed in the literature, those that exploit cyclostationary characteristics of radio signals are particularly suitable for communication environments with low signal-to-noise ratios, or with non-stationary noise. However, such methods have high computational complexity that directly raises the power consumption of devices which often have very stringent low-power requirements. We propose a strategy for cyclostationary spectrum sensing with reduced energy consumption. This strategy is based on the principle that p processors working at slower frequencies consume less power than a single processor for the same execution time. We devise a strict relation between the energy savings and common parallel system metrics. The results of simulations show that our strategy promises very significant savings in actual devices.

The ecology and evolution of invasive Potamopyrgus antipodarum in Australia

The spread of invasive organisms is one of the greatest threats to ecosystems and biodiversity worldwide. Understanding the evolutionary and ecological factors responsible for the transport, introduction, establishment and spread of invasive species will assist the development of control strategies. The New Zealand mudsnail, Potamopyrgus antipodarum (Gray 1843) (Gastropoda: Hydrobiidae), is a global freshwater invader, with populations established in Europe, Asia, the Americas and Australia. While sexual and asexual P. antipodarum coexist in the native range, invasive populations reproduce by parthenogenesis, producing dense populations that compete for resources with native species. Potamopyrgus antipodarum is a natural model system for the study of evolutionary and ecological processes underlying invasion. This thesis assesses the invasion history, genetic diversity and ecology of P. antipodarum in Australia, with particular focus on: a) potential source populations, b) distribution and structure of populations, and c) species traits related to the establishment, persistence and spread of invasive P. antipodarum. Genetic analyses were carried out on specimens collected for this study from New Zealand and Australia, along with existing museum samples. In combination with published data, the analyses revealed low genetic diversity among and within invasive populations in south-eastern Australia, relative to New Zealand populations. Phylogenetic relationships inferred from mitochondrial sequences indicated that the Australian populations belong to clades dominated by parthenogenetic haplotypes that are known to be present in Europe and the US. These ‘invasive clades’ are likely to originate from the North Island of New Zealand, and suggest a role for selection in determining genetic composition of invasive populations. The genotypic diversity of Australian P. antipodarum was low, with few, closely related clones distributed across south-eastern Australia. The pattern of clone distribution was not consistent with any assessed geographical or abiotic factors; instead a few, widely-distributed clones were present in high frequencies at most sites. Differences in clone frequencies were found, which may indicate differential success of clonal lineages. A range of traits have been proposed as facilitators of invasion success, and within-species variation in these traits can promote differential success of genotypes. Using laboratory-based experiments, the performance of the three most common Australian clones was tested across a suite of invasion-relevant traits. Ecologically-relevant variation in traits was found among the clones. These differences may have determined the spatial distribution of clones, and may continue to do so into the future. This thesis found that the P. antipodarum invasion of Australia is the result of few introductions of a small number of globally-invasive genotypes that vary in ecologically-relevant traits. From a source of considerable genetic diversity in the native range, very few genotypes have become invasive. Those that are invasive appear to be very successful at continental scales. These findings highlight a capacity in asexual invaders to successfully invade, and potentially adapt to, a broad range of ecosystems. The P. antipodarum invasion system is amenable to research using combinations of field-based studies, molecular and laboratory approaches, and is likely to yield significant, broadly-applicable insights into invasion.

Ferramenta computacional para medição de deslocamentos em ensaios de carga através de técnicas de processamento de imagem

Dissertação de Mestrado para a obtenção de grau de Mestre em Engenharia Eletrotécnica Ramo de Automação e Eletrónica Industrial