منابع مشابه
Dynamic Neighbourhood Cellular Automata
We propose a defi nition of Cellular Automaton in which links between cells can change during the computation. This is done locally by each cell, which can reach the neighbours of its neighbours in a single computational step. We suggest that Dynamic Neighbourhood Cellular Automata can serve as a theoretical model for studying Algorithmic and Computational Complexity issues in the are of Ubiqui...
متن کاملDynamic Structure Cellular Automata
Study of complex propagation phenomena is performed through cellular simulation models. Usually cellular models are specific cellular automata developed by non-computer specialists. We attempt to present here a mathematical specification of a new kind of CA. The latter allows to soundly specify cellular models using a discrete time base, avoiding basic CA limitations (infinite lattice, neighbor...
متن کاملStructurally Dynamic Cellular Automata
A new kind of cellular automato n (CA) model is intr odu ced in which binary value-configurations and the (conventionally qui escent) unde rlying topological struct ure are dynamically coupled. Topology alterati ons are defined by local transition rules anal ogous to the value functions studied in conventiona l CA models defined on fixed lattices. Preliminary investigation reveals a rich spec t...
متن کاملFour Neighbourhood Cellular Automata as Better Cryptographic Primitives
Three-neighbourhood Cellular Automata (CA) are widely studied and accepted as suitable cryptographic primitive. Rule 30, a 3-neighbourhood CA rule, was proposed as an ideal candidate for cryptographic primitive by Wolfram. However, rule 30 was shown to be weak against Meier-Staffelbach attack [7]. The cryptographic properties like diffusion and randomness increase with increase in neighbourhood...
متن کاملDynamic load balancing of parallel cellular automata
We are interested in running in parallel cellular automata. We present an algorithm which explores the dynamic remapping of cells in order to balance the load between the processing nodes. The parallel application runs on a cluster of PCs connected by Fast-Ethernet. A general cellular automaton can be described as a set of cells where each cell is a state machine. To compute the next cell state...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 2009
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/bxp019