Results 211 to 220 of about 5,964 (241)

CHARACTERIZING THE ABILITY OF PARALLEL ARRAY GENERATORS ON REVERSIBLE PARTITIONED CELLULAR AUTOMATA

International Journal of Pattern Recognition and Artificial Intelligence, 1999
A PCAAG introduced by Morita and Ueno is a parallel array generator on a partitioned cellular automaton (PCA) that generates an array language (i.e. a set of symbol arrays). A "reversible" PCAAG (RPCAAG) is a backward deterministic PCAAG, and thus parsing of two-dimensional patterns can be performed without backtracking by an "inverse" system of the ...
KENICHI MORITA, SATOSHI UENO, KATSUNOBU IMAI   +2 more
openaire   +1 more source

A stream cipher algorithm based on 2D coupled map lattice and partitioned cellular automata

Nonlinear Dynamics, 2020
The two-dimensional coupled map lattice (2D CML) is a spatiotemporal chaotic model with complex dynamic behavior and has high potential for designing stream cipher. We propose an offset 2D CML model by adding different offsets for each lattice. The offset 2D CML model has better chaotic properties, such as larger Lyapunov exponent (LE) and more uniform
Zhuo Liu, Yong Wang, Yi Zhao, Leo Yu Zhang   +3 more
openaire   +2 more sources

Using Cellular Automata with Evolutionary Learned Rules to Solve the Online Partitioning Problem

2005 IEEE Congress on Evolutionary Computation, 2005
In recent computer science research highly robust and scalable sets that are composed of autonomous individuals have become more and more important. The online partitioning problem (OPP) deals with the distribution of huge sets of agents onto different targets in consideration of several objectives.
A. Goebels, A. Weimer, S. Priesterjahn
openaire   +1 more source

Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage

2018
This chapter presents the use of Partitioned Cellular Automata—introduced by Morita and colleagues— as the tool to tackle simulation and intrinsic universality in the context of Reversible Cellular Automata. Cellular automata (CA) are mappings over infinite lattices such that all cells are updated synchronously according to the states around each one ...
openaire   +2 more sources

Supplemental Material - Modeling land-use change using partitioned vector cellular automata while considering urban spatial structure

2023
Supplemental Material for Modeling land-use change using partitioned vector cellular automata while considering urban spatial structure by Jing Yang, Xinyu Zhu, Wei Chen, Yizhong Sun and Jie Zhu in Environment and Planning B: Urban Analytics and City ...
Yang, Jing, Zhu, Xinyu, Chen, Wei, Sun, Yizhong, Zhu, Jie   +4 more
openaire   +1 more source

Parallel Execution of Cellular Automata through Space Partitioning: The Landslide Simulation Sciddicas3-Hex Case Study

2017 25th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP), 2017
The performance and scalability of cellular automata, when executed on parallel/distributed machines, are limited by the necessity of synchronizing all the nodes at each time step, i.e., a node can execute its code only after all the other nodes have executed the previous step.
Giordano A, De Rango A, Spataro D, D'AMBROSIO, Donato, Mastroianni C, Folino G, SPATARO, William   +6 more
openaire   +3 more sources

From thermodynamic cell models to partitioning cellular automata for diffusion in zeolites. I. Structure of the algorithm

The Journal of Chemical Physics, 2009
In the study of adsorption of simple adsorbates in microporous materials like zeolites, thermodynamic models of small grand-canonical cells with very local interactions [e.g., see K. G. Ayappa, J. Chem. Phys. 111, 4736 (1999)] have been proven to be able to produce thermodynamic properties in very good agreement with the results of experiments and ...
PAZZONA F. G, DEMONTIS, Pierfranco, SUFFRITTI, Giuseppe Baldovino   +2 more
openaire   +4 more sources

Multi-objective optimization using hybrid genetic algorithm and cellular learning automata applying to graph partitioning problem

2011 11th International Conference on Hybrid Intelligent Systems (HIS), 2011
Graph partitioning is a NP-hard problem with multiple conflicting objectives. The graph partitioning should minimize the inter-partition relationship while maximizing the intra-partition relationship. Furthermore, the partition load should be evenly distributed over the respective partitions.
Mehdi Farshbaf, Mohammad-Reza Feizi-Derakhshi, Arash Roshanpoor   +2 more
openaire   +1 more source

Non Uniform Cellular Automata Description of Signed Partition Versions of Ice and Sand Pile Models

2014
This paper reviews the well-known formalisations for ice and sand piles, based on a finite sequence of non-negative integers and its recent extension to signed partitions, i.e. sequences of a non-negative and a non-positive part of integers, both non increasing.The ice pile model can be interpreted as a discrete time dynamical system under the action ...
Cattaneo Gianpiero, Chiaselotti Giampiero., Dennunzio Alberto, Formenti Enrico, Manzoni Luca   +4 more
openaire   +4 more sources

The integration of vector-based cellular automata and partitioned rules for simulation of land use change

2019
Cellular Automata (CA) have formed an important part of the geocomputational and spatial analysis toolbox for three decades. Some of the most important components of CA are the transition rules to determine the changes in cell states across iterations. These are applied at the micro-sale, but lead to emergent patterns at the macro-scale.
Lu, Yi, Laffan, Shawn
openaire   +2 more sources