THE ROLE OF DARK MATTER INTERACTION IN GALAXY CLUSTERS

We consider a toy del to analyze the consequences of dark matter interaction with a dark energy background on the overall rotation of galaxy clusters and the misalignment between their dark matter and baryon distributions when compared to ACDM predictions. The interaction parameters are found via a genetic algorithm search. The results obtained suggest that interaction is a basic phenomenon whose effects are detectable even in simple models of galactic dynamics.

Emergence of sensory selection mechanisms in Artificial Life simulations

Background The evolutionary advantages of selective attention are unclear. Since the study of selective attention began, it has been suggested that the nervous system only processes the most relevant stimuli because of its limited capacity [1]. An alternative proposal is that action planning requires the inhibition of irrelevant stimuli, which forces the nervous system to limit its processing [2]. An evolutionary approach might provide additional clues to clarify the role of selective attention. Methods We developed Artificial Life simulations wherein animals were repeatedly presented two objects, "left" and "right", each of which could be "food" or "non-food." The animals' neural networks (multilayer perceptrons) had two input nodes, one for each object, and two output nodes to determine if the animal ate each of the objects. The neural networks also had a variable number of hidden nodes, which determined whether or not it had enough capacity to process both stimuli (Table 1). The evolutionary relevance of the left and the right food objects could also vary depending on how much the animal's fitness was increased when ingesting them (Table 1). We compared sensory processing in animals with or without limited capacity, which evolved in simulations in which the objects had the same or different relevances. Table 1. Nine sets of simulations were performed, varying the values of food objects and the number of hidden nodes in the neural networks. The values of left and right food were swapped during the second half of the simulations. Non-food objects were always worth -3. The evolution of neural networks was simulated by a simple genetic algorithm. Fitness was a function of the number of food and non-food objects each animal ate and the chromosomes determined the node biases and synaptic weights. During each simulation, 10 populations of 20 individuals each evolved in parallel for 20,000 generations, then the relevance of food objects was swapped and the simulation was run again for another 20,000 generations. The neural networks were evaluated by their ability to identify the two objects correctly. The detectability (d') for the left and the right objects was calculated using Signal Detection Theory [3]. Results and conclusion When both stimuli were equally relevant, networks with two hidden nodes only processed one stimulus and ignored the other. With four or eight hidden nodes, they could correctly identify both stimuli. When the stimuli had different relevances, the d' for the most relevant stimulus was higher than the d' for the least relevant stimulus, even when the networks had four or eight hidden nodes. We conclude that selection mechanisms arose in our simulations depending not only on the size of the neuron networks but also on the stimuli's relevance for action.

Alocação eficiente de indicadores de faltas em um sistema de distribuição real usando computação evolutiva

Este trabalho propõe uma abordagem computacional evolutiva para a resolução do problema de alocação de dispositivos indicadores de faltas (IFs) em alimentadores primários de distribuição de energia elétrica. De forma mais específica, o problema de se obter o melhor local de instalação é solucionado por meio da técnica de Algoritmos Genéticos (AGs) que busca obter uma configuração eficiente de instalação de IFs no tronco principal de um alimentador de distribuição. Assim, faz-se a modelagem do mesmo na forma de um problema de otimização orientado à melhoria dos indicadores de qualidade do serviço e ao encontro de uma solução economicamente atraente. Os resultados com dados reais comprovam a eficiência da metodologia proposta.

Evolving decision trees with beam search-based initialization and lexicographic multi-objective evaluation

Decision tree induction algorithms represent one of the most popular techniques for dealing with classification problems. However, traditional decision-tree induction algorithms implement a greedy approach for node splitting that is inherently susceptible to local optima convergence. Evolutionary algorithms can avoid the problems associated with a greedy search and have been successfully employed to the induction of decision trees. Previously, we proposed a lexicographic multi-objective genetic algorithm for decision-tree induction, named LEGAL-Tree. In this work, we propose extending this approach substantially, particularly w.r.t. two important evolutionary aspects: the initialization of the population and the fitness function. We carry out a comprehensive set of experiments to validate our extended algorithm. The experimental results suggest that it is able to outperform both traditional algorithms for decision-tree induction and another evolutionary algorithm in a variety of application domains.