Related papers: Frequency-Histogram Coarse Graining in Elementary …
We explore the emergence of intelligent behavior in artificial systems by investigating how the complexity of rule-based systems influences the capabilities of models trained to predict these rules. Our study focuses on elementary cellular…
We discuss a cellular automata model to study the competition between an emergent better fitted species against an existing majority species. The model implement local fights among small group of individual and a synchronous random walk on…
Building self-adaptive and self-organizing (SASO) systems is a challenging problem, in part because SASO principles are not yet well understood and few platforms exist for exploring them. Cellular automata (CA) are a well-studied approach…
We propose a data-driven, coarse-graining formulation in the context of equilibrium statistical mechanics. In contrast to existing techniques which are based on a fine-to-coarse map, we adopt the opposite strategy by prescribing a…
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 perform the renormalization-group-like numerical analysis of geographically embedded complex networks on the two-dimensional square lattice. At each step of coarsegraining procedure, the four vertices on each $2 \times 2$ square box are…
A series of coarse-grained models have been developed for the study of the molecular dynamics of RNA nanostructures. The models in the series have one to three beads per nucleotide and include different amounts of detailed structural…
The critical behavior at the frozen/active transition in the Domany-Kinzel stochastic cellular automaton (DKCA) is studied {\it via} a surface growth process in (1+1) dimensions. At criticality, this process presents a kinetic roughening…
This work proposes a hierarchical clustering algorithm for high-dimensional datasets using the cyclic space of reversible finite cellular automata. In cellular automaton (CA) based clustering, if two objects belong to the same cycle, they…
Cellular automata are one-dimensional arrays of interconnected interacting finite automata. We investigate one of the weakest classes, the real-time one-way cellular automata, and impose an additional restriction on their inter-cell…
The computer-assisted modeling of re-entrant production lines, and, in particular, simulation scalability, is attracting a lot of attention due to the importance of such lines in semiconductor manufacturing. Re-entrant flows lead to…
We propose and illustrate an approach to coarse-graining the dynamics of evolving networks (networks whose connectivity changes dynamically). The approach is based on the equation-free framework: short bursts of detailed network evolution…
Rapid advancements in deep learning over the past decade have fueled an insatiable demand for efficient and scalable hardware. Photonics offers a promising solution by leveraging the unique properties of light. However, conventional neural…
Coarse-grained (CG) models facilitate an efficient exploration of complex systems by reducing the unnecessary degrees of freedom of the fine-grained (FG) system while recapitulating major structural correlations. Unlike structural…
Neural cellular automata (Neural CA) are a recent framework used to model biological phenomena emerging from multicellular organisms. In these systems, artificial neural networks are used as update rules for cellular automata. Neural CA are…
In recent years, simulation methods based on the scaling of atomic potential functions, such as quasi-coarse-grained dynamics and coarse-grained dynamics, have shown promising results for modeling crystalline systems at multiple scales.…
In this paper, we propose a new approach for building cellular automata to solve real-world segmentation problems. We design and train a cellular automaton that can successfully segment high-resolution images. We consider a colony that…
Cellular automata are capable of developing complex behaviors based on simple local interactions between their elements. Some of these characteristics have been used to propose and improve meta-heuristics for global optimization; however,…
We define and explore in simulation several rules for the local evolution of generative rules for 1D and 2D cellular automata. Our implementation uses strategies from conceptual blending. We discuss potential applications to modelling…
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both…