Related papers: Locally adaptive cellular automata for goal-orient…
Cellular automata have long been celebrated for their ability to generate complex behaviors from simple, local rules, with well-known discrete models like Conway's Game of Life proven capable of universal computation. Recent advancements…
Wolfram has provided a qualitative classification of cellular automata(CA) rules according to which, there exits a class of CA rules (called Class 4) which exhibit complex pattern formation and long-lived dynamical activity (long…
This work deals with the portability of greenhouse models, as we believe that this is a challenge to their practical usage in control strategies under production conditions. We address this task by means of adaptive neural networks, which…
Many computer models such as cellular automata and artificial neural networks have been developed and successfully applied. However, in some cases, these models might be restrictive on the possible solutions or their solutions might be…
We present a parallel implementation of cellular automata to simulate chemical reactions on surfaces. The scaling of the computer time with the number of processors for this parallel implementation is quite close to the ideal T/P, where T…
We study a cellular automaton model, which allows diffusion of energy (or equivalently any other physical quantities such as mass of a particular compound) at every lattice site after each timestep. Unit amount of energy is randomly added…
The cellular automaton is a widely known model of both reversible and irreversible computations. The family of reversible second-order cellular automata considered in this work is appropriate both for construction of logic gates and…
A two-temperature Ising-Schelling model is introduced and studied for describing human segregation. The self-organized Ising model with Glauber kinetics simulated by M\"uller et al. exhibits a phase transition between segregated and mixed…
This paper introduces a simple formalism for dealing with deterministic, non- deterministic and stochastic cellular automata in an unified and composable manner. This formalism allows for local probabilistic correlations, a feature which is…
This paper presents a new parameter estimation algorithm for the adaptive control of a class of time-varying plants. The main feature of this algorithm is a matrix of time-varying learning rates, which enables parameter estimation error…
We construct a cellular automaton (CA) model that describes the movement of a particle in a disordered system. The mathematical properties of the CA model were examined by varying the configuration of grid and determining the number of…
We propose the use of latent space generative world models to address the covariate shift problem in autonomous driving. A world model is a neural network capable of predicting an agent's next state given past states and actions. By…
An exact characterization of the different dynamical behavior that exhibit the space phase of a reversible and conservative cellular automaton, the so called Q2R model, is shown in this paper. Q2R is a cellular automaton which is a…
The cellular automaton (CA) pulsing model (arXiv:1806.06416) described the surprising phenomenon of spontaneous, sustained and robust rhythmic oscillations, pulsing dynamics, when random wiring is applied to a 2D `glider' rule running in a…
The work introduces a 3D cellular automaton model for the spatial and crystallographic prediction of spherulite growth phenomena in polymers at the mesoscopic scale. The automaton is discrete in time, real space, and orientation space. The…
In this paper, we study the problem of finding the global minima of a given function. Specifically, we consider complicated functions with numerous local minima, as is often the case for real-world data mining losses. We do so by applying a…
The topic we address in this paper concerns the minimization of a Hamiltonian function for an Ising model through the application of simulated annealing algorithms based on (single-site) Glauber dynamics and stochastic cellular automata…
The notions of universality and completeness are central in the theories of computation and computational complexity. However, proving lower bounds and necessary conditions remains hard in most of the cases. In this article, we introduce…
We investigate the dynamics of an epidemiological susceptible-infected-susceptible (SIS) model on an adaptive network. This model combines epidemic spreading (dynamics on the network) with rewiring of network connections (topological…
Most current methods for identifying coherent structures in spatially-extended systems rely on prior information about the form which those structures take. Here we present two new approaches to automatically filter the changing…