240 research outputs found

    Studying Parallel Evolutionary Algorithms: The cellular Programming Case

    Get PDF
    Parallel evolutionary algorithms, studied to some extent over the past few years, have proven empirically worthwhile—though there seems to be lacking a better understanding of their workings. In this paper we concentrate on cellular (fine-grained) models, presenting a number of statistical measures, both at the genotypic and phenotypic levels. We demonstrate the application and utility of these measures on a specific example, that of the cellular programming evolutionary algorithm, when used to evolve solutions to a hard problem in the cellular-automata domain, known as synchronization

    Parity Problem With A Cellular Automaton Solution

    Get PDF
    The parity of a bit string of length NN is a global quantity that can be efficiently compute using a global counter in O(N){O} (N) time. But is it possible to find the parity using cellular automata with a set of local rule tables without using any global counter? Here, we report a way to solve this problem using a number of r=1r=1 binary, uniform, parallel and deterministic cellular automata applied in succession for a total of O(N2){O} (N^2) time.Comment: Revtex, 4 pages, final version accepted by Phys.Rev.

    A Simple Cellular Automation that Solves the Density and Ordering Problems

    Get PDF
    Cellular automata (CA) are discrete, dynamical systems that perform computations in a distributed fashion on a spatially extended grid. The dynamical behavior of a CA may give rise to emergent computation, referring to the appearance of global information processing capabilities that are not explicitly represented in the system's elementary components nor in their local interconnections.1 As such, CAs o?er an austere yet versatile model for studying natural phenomena, as well as a powerful paradigm for attaining ?ne-grained, massively parallel computation. An example of such emergent computation is to use a CA to determine the global density of bits in an initial state con?guration. This problem, known as density classi?cation, has been studied quite intensively over the past few years. In this short communication we describe two previous versions of the problem along with their CA solutions, and then go on to show that there exists yet a third version | which admits a simple solution

    Non-deterministic density classification with diffusive probabilistic cellular automata

    Full text link
    We present a probabilistic cellular automaton (CA) with two absorbing states which performs classification of binary strings in a non-deterministic sense. In a system evolving under this CA rule, empty sites become occupied with a probability proportional to the number of occupied sites in the neighborhood, while occupied sites become empty with a probability proportional to the number of empty sites in the neighborhood. The probability that all sites become eventually occupied is equal to the density of occupied sites in the initial string.Comment: 4 pages, 4 figure

    Ontogenetic Development and Fault Tolerance in the POEtic Tissue

    Full text link

    Emergence of Macro Spatial Structures in Dissipative Cellular Automata

    Full text link
    This paper describes the peculiar behavior observed in a class of cellular automata that we have defined as dissipative, i.e., cellular automata that are open and makes it possible for the environment to influence their evolution. Peculiar in the dynamic evolution of this class of cellular automata is that stable macro-level spatial structures emerge from local interactions among cells, a behavior that does not emerge when the cellular automaton is closed, i.e., when the state of a cell is not influenced by the external world. Moreover, we observed that Dissipative Cellular Automata (DCA) exhibit a behavior very similar to that of dissipative structures, as macro-level spatial structures emerge as soon as the external perturbation exceeds a threshold value and it stays below the "turbulence" limit. Finally, we discuss possible relations of the performed experiments with the area of open distributed computing, and in particular of agent-based distributed computing

    Interaction of quasilocal harmonic modes and boson peak in glasses

    Full text link
    The direct proportionality relation between the boson peak maximum in glasses, ωb\omega_b, and the Ioffe-Regel crossover frequency for phonons, ωd\omega_d, is established. For several investigated materials ωb=(1.5±0.1)ωd\omega_b = (1.5\pm 0.1)\omega_d. At the frequency ωd\omega_d the mean free path of the phonons ll becomes equal to their wavelength because of strong resonant scattering on quasilocal harmonic oscillators. Above this frequency phonons cease to exist. We prove that the established correlation between ωb\omega_b and ωd\omega_d holds in the general case and is a direct consequence of bilinear coupling of quasilocal oscillators with the strain field.Comment: RevTex, 4 pages, 1 figur

    Cellular Self-Organising Maps - CSOM

    Get PDF
    International audienceThis paper presents CSOM, a Cellular Self-Organising Map which performs weight update in a cellular manner. Instead of updating weights towards new input vectors, it uses a signal propagation originated from the best matching unit to every other neuron in the network. Interactions between neurons are thus local and distributed. In this paper we present performance results showing than CSOM can obtain faster and better quantisation than classical SOM when used on high-dimensional vectors. We also present an application on video compression based on vector quantisation, in which CSOM outperforms SOM

    Discrete and fuzzy dynamical genetic programming in the XCSF learning classifier system

    Full text link
    A number of representation schemes have been presented for use within learning classifier systems, ranging from binary encodings to neural networks. This paper presents results from an investigation into using discrete and fuzzy dynamical system representations within the XCSF learning classifier system. In particular, asynchronous random Boolean networks are used to represent the traditional condition-action production system rules in the discrete case and asynchronous fuzzy logic networks in the continuous-valued case. It is shown possible to use self-adaptive, open-ended evolution to design an ensemble of such dynamical systems within XCSF to solve a number of well-known test problems

    Fitness landscape of the cellular automata majority problem: View from the Olympus

    Get PDF
    In this paper we study cellular automata (CAs) that perform the computational Majority task. This task is a good example of what the phenomenon of emergence in complex systems is. We take an interest in the reasons that make this particular fitness landscape a difficult one. The first goal is to study the landscape as such, and thus it is ideally independent from the actual heuristics used to search the space. However, a second goal is to understand the features a good search technique for this particular problem space should possess. We statistically quantify in various ways the degree of difficulty of searching this landscape. Due to neutrality, investigations based on sampling techniques on the whole landscape are difficult to conduct. So, we go exploring the landscape from the top. Although it has been proved that no CA can perform the task perfectly, several efficient CAs for this task have been found. Exploiting similarities between these CAs and symmetries in the landscape, we define the Olympus landscape which is regarded as the ''heavenly home'' of the best local optima known (blok). Then we measure several properties of this subspace. Although it is easier to find relevant CAs in this subspace than in the overall landscape, there are structural reasons that prevent a searcher from finding overfitted CAs in the Olympus. Finally, we study dynamics and performance of genetic algorithms on the Olympus in order to confirm our analysis and to find efficient CAs for the Majority problem with low computational cost
    corecore