scholarly journals Self-Organizing Construction Method of Offshore Structures by Cellular Automata Model

2015 ◽  
Vol 2015 ◽  
pp. 1-7
Author(s):  
Takeshi Ishida
Keyword(s):  
Cellular Automata ◽  
Living Organism ◽  
Offshore Structures ◽  
Structural Units ◽  
Cellular Automata Model ◽  
One Dimensional ◽  
Transition Rules ◽  
Complex Patterns ◽  
The One ◽  
Self Organizing

We propose a new algorithm to build self-organizing and self-repairing marine structures on the ocean floor, where humans and remotely operated robots cannot operate. The proposed algorithm is based on the one-dimensional cellular automata model and uses simple transition rules to produce various complex patterns. This cellular automata model can produce various complex patterns like sea shells with simple transition rules. The model can simulate the marine structure construction process with distributed cooperation control instead of central control. Like living organism is constructed with module called cell, we assume that the self-organized structure consists of unified modules (structural units). The units pile up at the bottom of the sea and a structure with the appropriate shape eventually emerges. Using the attribute of emerging patterns in the one-dimensional cellular automata model, we construct specific structures based on the local interaction of transition rules without using complex algorithms. Furthermore, the model requires smaller communication data among the units because it only relies on communication between adjacent structural units. With the proposed algorithm, in the future, it will be possible to use self-assembling structural modules without complex built-in computers.

ON THE STRUCTURE OF REAL-VALUED ONE-DIMENSIONAL CELLULAR AUTOMATA

2011 ◽  
Vol 21 (05) ◽  
pp. 1265-1279 ◽  
Author(s):  
XU XU ◽  
STEPHEN P. BANKS ◽  
MAHDI MAHFOUF
Keyword(s):  
Cellular Automata ◽  
Cellular Automaton ◽  
Fixed Points ◽  
Periodic Solutions ◽  
Cellular Systems ◽  
One Dimensional ◽  
Dynamical Behaviors ◽  
New Type ◽  
Complex Patterns

It is well-known that binary-valued cellular automata, which are defined by simple local rules, have the amazing feature of generating very complex patterns and having complicated dynamical behaviors. In this paper, we present a new type of cellular automaton based on real-valued states which produce an even greater amount of interesting structures such as fractal, chaotic and hypercyclic. We also give proofs to real-valued cellular systems which have fixed points and periodic solutions.

Validation of Cellular Automata Model of Dynamic Recrystallization

2015 ◽  
Vol 651-653 ◽  
pp. 581-586 ◽  
Author(s):  
Mateusz Sitko ◽  
Łukasz Madej ◽  
Maciej Pietrzyk
Keyword(s):  
Cellular Automata ◽  
Dynamic Recrystallization ◽  
Internal Variables ◽  
Cellular Automata Model ◽  
Proposed Model ◽  
Digital Material ◽  
Ca Model ◽  
Transition Rules ◽  
Development And Validation ◽  
Neighborhood Type

Development and validation of the micro scale cellular automata (CA) model of dynamic recrystallization (DRX) were the main goals of the present paper. Major assumptions of the developed CA DRX model, which is based on the Digital Material Representation (DMR) concept, are described. Parameters like neighborhood type, state and internal variables of the proposed model and their influence on final results are presented and discussed. Particular attention was put on description of the developed transition rules used to replicate mechanisms leading to dynamic recrystallization. Finally, obtained results in the form of flow stress curves are compared with the experimental predictions.

scholarly journals Large semigroups of cellular automata

2011 ◽  
Vol 32 (6) ◽  
pp. 1991-2010 ◽  
Author(s):  
YAIR HARTMAN
Keyword(s):  
Cellular Automata ◽  
Field Structure ◽  
The Other ◽  
Entire Space ◽  
Dimensional Torus ◽  
Semigroup Action ◽  
Closed Set ◽  
One Dimensional ◽  
Shift Space ◽  
The One

AbstractIn this article, we consider semigroups of transformations of cellular automata which act on a fixed shift space. In particular, we are interested in two properties of these semigroups which relate to ‘largeness’: first, a semigroup has the ID (infinite is dense) property if the only infinite invariant closed set (with respect to the semigroup action) is the entire space; the second property is maximal commutativity (MC). We shall consider two examples of semigroups: one is spanned by cellular automata transformations that represent multiplications by integers on the one-dimensional torus, and the other one consists of all the cellular automata transformations which are linear (when the symbols set is the ring ℤ/sℤ). It will be shown that these two properties of these semigroups depend on the number of symbols s. The multiplication semigroup is ID and MC if and only if s is not a power of a prime. The linear semigroup over the mentioned ring is always MC but is ID if and only if s is prime. When the symbol set is endowed with a finite field structure (when possible), the linear semigroup is both ID and MC. In addition, we associate with each semigroup which acts on a one-sided shift space a semigroup acting on a two-sided shift space, and vice versa, in a way that preserves the ID and the MC properties.

scholarly journals Winner-Relaxing Self-Organizing Maps

2005 ◽  
Vol 17 (5) ◽  
pp. 996-1009 ◽  
Author(s):  
Jens Christian Claussen
Keyword(s):  
Information Theory ◽  
Dimensional Case ◽  
Self Organizing Maps ◽  
One Dimensional ◽  
New Family ◽  
Wide Range ◽  
The One ◽  
Self Organizing

A new family of self-organizing maps, the winner-relaxing Kohonen algorithm, is introduced as a generalization of a variant given by Kohonen in 1991. The magnification behavior is calculated analytically. For the original variant, a magnification exponent of 4/7 is derived; the generalized version allows steering the magnification in the wide range from exponent 1/2 to 1 in the one-dimensional case, thus providing optimal mapping in the sense of information theory. The winner-relaxing algorithm requires minimal extra computations per learning step and is conveniently easy to implement.

Transformations of the one-dimensional cellular automata rule space

1997 ◽  
Vol 23 (11) ◽  
pp. 1593-1611 ◽  
Author(s):  
G. Cattaneo ◽  
E. Formenti ◽  
L. Margara ◽  
G. Mauri
Keyword(s):  
Cellular Automata ◽  
One Dimensional ◽  
Rule Space ◽  
The One

Complex Order from Disorder and from Simple Order in Coarse-Graining Invariant Orbits of Certain Two-Dimensional Linear Cellular Automata

1997 ◽  
Vol 07 (07) ◽  
pp. 1451-1496 ◽  
Author(s):  
André Barbé
Keyword(s):  
Cellular Automata ◽  
Three Dimensional ◽  
Coarse Graining ◽  
Dimensional Case ◽  
Two Dimensional ◽  
One Dimensional ◽  
Complex Order ◽  
Simple Order ◽  
Problems And Solutions ◽  
The One

This paper considers three-dimensional coarse-graining invariant orbits for two-dimensional linear cellular automata over a finite field, as a nontrivial extension of the two-dimensional coarse-graining invariant orbits for one-dimensional CA that were studied in an earlier paper. These orbits can be found by solving a particular kind of recursive equations (renormalizing equations with rescaling term). The solution starts from some seed that has to be determined first. In contrast with the one-dimensional case, the seed has infinite support in most cases. The way for solving these equations is discussed by means of some examples. Three categories of problems (and solutions) can be distinguished (as opposed to only one in the one-dimensional case). Finally, the morphology of a few coarse-graining invariant orbits is discussed: Complex order (of quasiperiodic type) seems to emerge from random seeds as well as from seeds of simple order (for example, constant or periodic seeds).

scholarly journals Remarks on the Structure of Clifford Quantum Cellular Automata

2009 ◽  
Vol 16 (02n03) ◽  
pp. 269-279
Author(s):  
Dirk-Michael Schlingemann
Keyword(s):  
Phase Space ◽  
Cellular Automata ◽  
Symplectic Group ◽  
Tensor Products ◽  
Projective Representation ◽  
Dimensional Case ◽  
Additional Restriction ◽  
Quantum Cellular Automata ◽  
One Dimensional ◽  
The One

We report here on the structure of reversible quantum cellular automata with the additional restriction that these are also Clifford operations. This means that tensor products of Weyl operators (projective representation of a finite abelian symplectic group) are mapped to multiples of tensor products of Weyl operators. Therefore Clifford quantum cellular automata are induced by symplectic cellular automata in phase space. We characterize these symplectic cellular automata and find that all possible local rules must be, up to some global shift, reflection-invariant with respect to the origin. In the one-dimensional case we also find that all 1D Clifford quantum cellular automata are generated by a few elementary operations.

scholarly journals Strictly local one-dimensional topological quantum error correction with symmetry-constrained cellular automata

2018 ◽  
Vol 4 (1) ◽  
Author(s):  
Nicolai Lang ◽  
Hans Peter Büchler
Keyword(s):  
Cellular Automata ◽  
Cellular Automaton ◽  
Error Correction ◽  
Quantum Error Correction ◽  
One Dimensional ◽  
Decoding Algorithms ◽  
Topological Quantum ◽  
The One ◽  
Quantum Error

Active quantum error correction on topological codes is one of the most promising routes to long-term qubit storage. In view of future applications, the scalability of the used decoding algorithms in physical implementations is crucial. In this work, we focus on the one-dimensional Majorana chain and construct a strictly local decoder based on a self-dual cellular automaton. We study numerically and analytically its performance and exploit these results to contrive a scalable decoder with exponentially growing decoherence times in the presence of noise. Our results pave the way for scalable and modular designs of actively corrected one-dimensional topological quantum memories.

Sign in / Sign up

Export Citation Format

Share Document