Einloggen

Thematische Bibliographien / Cellulära automater / Zeitschriftenartikel

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Cellulära automater.

Zeitschriftenartikel zum Thema „Cellulära automater“

Autor: Grafiati

Veröffentlicht am 4. Juni 2021

Zuletzt aktualisiert am 18. Februar 2022

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "Cellulära automater" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Jung, Goeun, and Youngho Kim. "Modeling of Spatio-temporal changes of Urban Sprawl in Jeju-island: Using CA (Cellular Automata) and ARD (Automatic Rule Detection)." Journal of the Association of Korean Geographers 10, no. 1 (2021): 139–52. http://dx.doi.org/10.25202/jakg.10.1.9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

TORBEY, SAMI. "TOWARDS A FRAMEWORK FOR INTUITIVE PROGRAMMING OF CELLULAR AUTOMATA." Parallel Processing Letters 19, no. 01 (2009): 73–83. http://dx.doi.org/10.1142/s0129626409000079.

Der volle Inhalt der Quelle

Annotation:

The ability to obtain complex global behaviour from simple local rules makes cellular automata an interesting platform for massively parallel computation. However, manually designing a cellular automaton to perform a given computation can be extremely difficult, and automated design techniques such as genetic programming have their limitations because of the absence of human intuition. In this paper, we propose elements of a framework whose goal is to make the manual synthesis of cellular automata rules exhibiting desired global characteristics more programmer-friendly, while maintaining the s

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Rowland, Eric, and Reem Yassawi. "Automaticity and Invariant Measures of Linear Cellular Automata." Canadian Journal of Mathematics 72, no. 6 (2019): 1691–726. http://dx.doi.org/10.4153/s0008414x19000488.

Der volle Inhalt der Quelle

Annotation:

AbstractWe show that spacetime diagrams of linear cellular automata $\unicode[STIX]{x1D6F7}:\,\mathbb{F}_{p}^{\mathbb{Z}}\rightarrow \mathbb{F}_{p}^{\mathbb{Z}}$ with $(-p)$-automatic initial conditions are automatic. This extends existing results on initial conditions that are eventually constant. Each automatic spacetime diagram defines a $(\unicode[STIX]{x1D70E},\unicode[STIX]{x1D6F7})$-invariant subset of $\mathbb{F}_{p}^{\mathbb{Z}}$, where $\unicode[STIX]{x1D70E}$ is the left shift map, and if the initial condition is not eventually periodic, then this invariant set is nontrivial. For th

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Barragan-Vite, Irving, Juan C. Seck-Tuoh-Mora, Norberto Hernandez-Romero, Joselito Medina-Marin, and Eva S. Hernandez-Gress. "Distributed Control of a Manufacturing System with One-Dimensional Cellular Automata." Complexity 2018 (October 4, 2018): 1–15. http://dx.doi.org/10.1155/2018/7235105.

Der volle Inhalt der Quelle

Annotation:

We present a distributed control modeling approach for an automated manufacturing system based on the dynamics of one-dimensional cellular automata. This is inspired by the fact that both cellular automata and manufacturing systems are discrete dynamical systems where local interactions given among their elements (resources) can lead to complex dynamics, despite the simple rules governing such interactions. The cellular automaton model developed in this study focuses on two states of the resources of a manufacturing system, namely, busy or idle. However, the interaction among the resources suc

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Mardiris, Vassilios A., Georgios Ch Sirakoulis, and Ioannis G. Karafyllidis. "Automated Design Architecture for 1-D Cellular Automata Using Quantum Cellular Automata." IEEE Transactions on Computers 64, no. 9 (2015): 2476–89. http://dx.doi.org/10.1109/tc.2014.2366745.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Mardiris, V. A., and I. G. Karafyllidis. "Universal cellular automaton cell using quantum cellular automata." Electronics Letters 45, no. 12 (2009): 607. http://dx.doi.org/10.1049/el.2009.3693.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

BOCCARA, NINO. "RANDOMIZED CELLULAR AUTOMATA." International Journal of Modern Physics C 18, no. 08 (2007): 1303–12. http://dx.doi.org/10.1142/s0129183107011339.

Der volle Inhalt der Quelle

Annotation:

We define and study a few properties of a class of random automata networks. While regular finite one-dimensional cellular automata are defined on periodic lattices, these automata networks, called randomized cellular automata, are defined on random directed graphs with constant out-degrees and evolve according to cellular automaton rules. For some families of rules, a few typical a priori unexpected results are presented.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Allouche, J. P., F. V. Haeseler, E. Lange, A. Petersen, and G. Skordev. "Linear cellular automata and automatic sequences." Parallel Computing 23, no. 11 (1997): 1577–92. http://dx.doi.org/10.1016/s0167-8191(97)00074-4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

DUBACQ, JEAN-CHRISTOPHE. "HOW TO SIMULATE TURING MACHINES BY INVERTIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA." International Journal of Foundations of Computer Science 06, no. 04 (1995): 395–402. http://dx.doi.org/10.1142/s0129054195000202.

Der volle Inhalt der Quelle

Annotation:

The issue of testing invertibility of cellular automata has been often discussed. Constructing invertible automata is very useful for simulating invertible dynamical systems, based on local rules. The computation universality of cellular automata has long been positively resolved, and by showing that any cellular automaton could be simulated by an invertible one having a superior dimension, Toffoli proved that invertible cellular automaton of dimension d≥2 were computation-universal. Morita proved that any invertible Turing Machine could be simulated by a one-dimensional invertible cellular au

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Wang, Jiawen, Shaobo Li, Yining Lu, and Lubang Wang. "A Division Method of Determining the Early-Warning Zone on an Expressway for Automated Vehicles." Discrete Dynamics in Nature and Society 2020 (April 21, 2020): 1–10. http://dx.doi.org/10.1155/2020/9523819.

Der volle Inhalt der Quelle

Annotation:

Using a cellular automaton model, this paper studied the evolution mechanism of traffic incidents affecting the capacity of urban expressway under the mixed traffic environment of manual driving and automatic driving. It showed that the length of the automated-driving early-warning zone could affect the capacity of expressway. Specifically, the early-warning zone is divided into an accelerate lane-changing area, a decelerate lane-changing area, and a forced lane-changing area. The areas vary according to the distance between the vehicle and the location of incident. Based on the study, this pa

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Zhukov, Alexey E. "The reversibility of one-dimensional cellular automata." RUDN Journal of Engineering Researches 22, no. 1 (2021): 7–15. http://dx.doi.org/10.22363/2312-8143-2021-22-1-7-15.

Der volle Inhalt der Quelle

Annotation:

Recently the reversible cellular automata are increasingly used to build high-performance cryptographic algorithms. The paper establishes a connection between the reversibility of homogeneous one-dimensional binary cellular automata of a finite size and the properties of a structure called binary filter with input memory and such finite automata properties as the prohibitions in automata output and loss of information. We show that finding the preimage for an arbitrary configuration of a one-dimensional cellular automaton of length L with a local transition function f is associated with revers

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Alexander P, Buslaev, Tatashev Alexander G, and Yashina Marina V. "On cellular automata, traffic and dynamical systems in graphs." International Journal of Engineering & Technology 7, no. 2.28 (2018): 351. http://dx.doi.org/10.14419/ijet.v7i2.28.13210.

Der volle Inhalt der Quelle

Annotation:

Qualitative studies of discrete dynamical systems behavior on networks are relevant in many fields such as system biology, transportation, information traffic, material sciences and so on. We consider cellular automata on one-dimensional and two-dimensional toroidal supporters. At every discrete time moment, each cell of a cellular automaton is in one of two states 0 and 1. We introduce concept of the cellular automaton mass at fixed time. The cellular automaton mass is the quantity of cells such that these cells are in the state 1. The mass conservation law takes place if the mass of cellular

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Adamatzky, Andrew. "Automatic programming of cellular automata: identification approach." Kybernetes 26, no. 2 (1997): 126–35. http://dx.doi.org/10.1108/03684929710163074.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

DOLZHENKO, EGOR, and NATAŠA JONOSKA. "TWO-DIMENSIONAL LANGUAGES AND CELLULAR AUTOMATA." International Journal of Foundations of Computer Science 23, no. 01 (2012): 185–206. http://dx.doi.org/10.1142/s0129054112500037.

Der volle Inhalt der Quelle

Annotation:

Space-time diagrams of a one-dimensional cellular automaton can be visualized as half-plane arrays of symbols. The set of rectangular blocks extracted from such arrays forms a two-dimensional (picture) language. We initiate a study of cellular automata through the associated two dimensional languages by investigating cellular automata whose two-dimensional languages are factorial-local. We show that these cellular automata have the same characterization as one-sided cellular automata with SFT traces.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Kari, Jarkko, Ville Salo, and Thomas Worsch. "Sequentializing cellular automata." Natural Computing 19, no. 4 (2019): 759–72. http://dx.doi.org/10.1007/s11047-019-09745-7.

Der volle Inhalt der Quelle

Annotation:

Abstract We study the problem of sequentializing a cellular automaton without introducing any intermediate states, and only performing reversible permutations on the tape. We give a decidable characterization of cellular automata which can be written as a single sweep of a bijective rule from left to right over an infinite tape. Such cellular automata are necessarily left-closing, and they move at least as much information to the left as they move information to the right.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

HSIUNG, MING. "Elementary cellular automata and self-referential paradoxes." Journal of Logic and Computation 30, no. 3 (2020): 745–63. http://dx.doi.org/10.1093/logcom/exaa022.

Der volle Inhalt der Quelle

Annotation:

Abstract We associate an elementary cellular automaton with a set of self-referential sentences, whose revision process is exactly the evolution process of that automaton. A simple but useful result of this connection is that a set of self-referential sentences is paradoxical, iff (the evolution process for) the cellular automaton in question has no fixed points. We sort out several distinct kinds of paradoxes by the existence and features of the fixed points of their corresponding automata. They are finite homogeneous paradoxes and infinite homogeneous paradoxes. In some weaker sense, we will

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Lee, Chung-Hwan, Dong-jin Hong Lee, Eui-young Cha, and Sung-Hyo Yun. "Implementation of Lava Flow Simulation Program Using Cellular Automata." Journal of the Petrological Society of Korea 26, no. 1 (2017): 93–98. http://dx.doi.org/10.7854/jpsk.2017.26.1.93.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Das, Sukanta, and Mihir K. Chakraborty. "Formal Logic of Cellular Automata." Complex Systems 30, no. 2 (2021): 187–203. http://dx.doi.org/10.25088/complexsystems.30.2.187.

Der volle Inhalt der Quelle

Annotation:

This paper develops a formal logic, named L CA , targeting modeling of one-dimensional binary cellular automata. We first develop the syntax of L CA , then give semantics to L CA in the domain of all binary strings. Then the elementary cellular automata and four-neighborhood binary cellular automata are shown as models of the logic. These instances point out that there are other models of L CA . Finally it is proved that any one-dimensional binary cellular automaton is a model of the proposed logic.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

BEIGY, HAMID, and M. R. MEYBODI. "OPEN SYNCHRONOUS CELLULAR LEARNING AUTOMATA." Advances in Complex Systems 10, no. 04 (2007): 527–56. http://dx.doi.org/10.1142/s0219525907001264.

Der volle Inhalt der Quelle

Annotation:

Cellular learning automata is a combination of learning automata and cellular automata. This model is superior to cellular learning automata because of its ability to learn and also is superior to single learning automaton because it is a collection of learning automata which can interact together. In some applications such as image processing, a type of cellular learning automata in which the action of each cell in the next stage of its evolution not only depends on the local environment (actions of its neighbors) but it also depends on the external environments. We call such a cellular learn

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Turney, Peter D. "Measuring Behavioral Similarity of Cellular Automata." Artificial Life 27, no. 1 (2021): 62–71. http://dx.doi.org/10.1162/artl_a_00337.

Der volle Inhalt der Quelle

Annotation:

Abstract Conway's Game of Life is the best-known cellular automaton. It is a classic model of emergence and self-organization, it is Turing-complete, and it can simulate a universal constructor. The Game of Life belongs to the set of semi-totalistic cellular automata, a family with 262,144 members. Many of these automata may deserve as much attention as the Game of Life, if not more. The challenge we address here is to provide a structure for organizing this large family, to make it easier to find interesting automata, and to understand the relations between automata. Packard and Wolfram (1985

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

KŮRKA, PETR. "Languages, equicontinuity and attractors in cellular automata." Ergodic Theory and Dynamical Systems 17, no. 2 (1997): 417–33. http://dx.doi.org/10.1017/s014338579706985x.

Der volle Inhalt der Quelle

Annotation:

We consider three related classifications of cellular automata: the first is based on the complexity of languages generated by clopen partitions of the state space, i.e. on the complexity of the factor subshifts; the second is based on the concept of equicontinuity and it is a modification of the classification introduced by Gilman [9]. The third one is based on the concept of attractors and it refines the classification introduced by Hurley [16]. We show relations between these classifications and give examples of cellular automata in the intersection classes. In particular, we show that ever

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Ravichandran, Ramprasad, Sung Kyu Lim, and Mike Niemier. "Automatic cell placement for quantum-dot cellular automata." Integration 38, no. 3 (2005): 541–48. http://dx.doi.org/10.1016/j.vlsi.2004.07.002.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

DEL REY, A. MARTÍN, and G. RODRÍGUEZ SÁNCHEZ. "ON THE REVERSIBILITY OF 150 WOLFRAM CELLULAR AUTOMATA." International Journal of Modern Physics C 17, no. 07 (2006): 975–83. http://dx.doi.org/10.1142/s0129183106009680.

Der volle Inhalt der Quelle

Annotation:

In this paper, the reversibility problem for 150 Wolfram cellular automata is tackled for null boundary conditions. It is explicitly shown that the reversibility depends on the number of cells of the cellular automaton. The inverse cellular automaton for each case is also computed.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

MORA, JUAN CARLOS SECK TUOH, MANUEL GONZÁLEZ HERNÁANDEZ, GENARO JUÁREZ MARTÍNEZ, and SERGIO V. CHAPA VERGARA. "EXTENSIONS IN REVERSIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA ARE EQUIVALENT WITH THE FULL SHIFT." International Journal of Modern Physics C 14, no. 08 (2003): 1143–60. http://dx.doi.org/10.1142/s012918310300525x.

Der volle Inhalt der Quelle

Annotation:

Cellular automata are discrete dynamical systems based on simple local interactions among its components, but sometimes they are able to yield quite a complex global behavior. A special kind of cellular automaton is the one where the global behavior is invertible, this type of cellular automaton is called reversible. In this paper we expose the graph representation provided by de Bruijn diagrams of reversible one-dimensional cellular automata and we define the distinct types of paths between self-loops in such diagrams. With this, we establish the way in which a reversible one-dimensional cell

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

BEIGY, HAMID, and M. R. MEYBODI. "A MATHEMATICAL FRAMEWORK FOR CELLULAR LEARNING AUTOMATA." Advances in Complex Systems 07, no. 03n04 (2004): 295–319. http://dx.doi.org/10.1142/s0219525904000202.

Der volle Inhalt der Quelle

Annotation:

The cellular learning automata, which is a combination of cellular automata, and learning automata, is a new recently introduced model. This model is superior to cellular automata because of its ability to learn and is also superior to a single learning automaton because it is a collection of learning automata which can interact with each other. The basic idea of cellular learning automata, which is a subclass of stochastic cellular learning automata, is to use the learning automata to adjust the state transition probability of stochastic cellular automata. In this paper, we first provide a ma

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

MARTÍNEZ, GENARO J., ANDREW ADAMATZKY, CHRISTOPHER R. STEPHENS, and ALEJANDRO F. HOEFLICH. "CELLULAR AUTOMATON SUPERCOLLIDERS." International Journal of Modern Physics C 22, no. 04 (2011): 419–39. http://dx.doi.org/10.1142/s0129183111016348.

Der volle Inhalt der Quelle

Annotation:

Gliders in one-dimensional cellular automata are compact groups of non-quiescent and non-ether patterns (ether represents a periodic background) translating along automaton lattice. They are cellular automaton analogous of localizations or quasi-local collective excitations traveling in a spatially extended nonlinear medium. They can be considered as binary strings or symbols traveling along a one-dimensional ring, interacting with each other and changing their states, or symbolic values, as a result of interactions. We analyze what types of interaction occur between gliders traveling on a cel

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

MORA, JUAN CARLOS SECK TUOH, SERGIO V. CHAPA VERGARA, GENARO JUÁREZ MARTÍNEZ, and HAROLD V. McINTOSH. "SPECTRAL PROPERTIES OF REVERSIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA." International Journal of Modern Physics C 14, no. 03 (2003): 379–95. http://dx.doi.org/10.1142/s0129183103004541.

Der volle Inhalt der Quelle

Annotation:

Reversible cellular automata are invertible dynamical systems characterized by discreteness, determinism and local interaction. This article studies the local behavior of reversible one-dimensional cellular automata by means of the spectral properties of their connectivity matrices. We use the transformation of every one-dimensional cellular automaton to another of neighborhood size 2 to generalize the results exposed in this paper. In particular we prove that the connectivity matrices have a single positive eigenvalue equal to 1; based on this result we also prove the idempotent behavior of t

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Bilan, S. M. "EVOLUTION OF TWO-DIMENSIONAL CELLULAR AUTOMATA. NEW FORMS OF PRESENTATION." Ukrainian Journal of Information Technology 3, no. 1 (2021): 85–90. http://dx.doi.org/10.23939/ujit2021.03.085.

Der volle Inhalt der Quelle

Annotation:

The paper considers cellular automata and forms of reflection of their evolution. Forms of evolution of elementary cellular automata are known and widely used, which allowed specialists to model different dynamic processes and behavior of systems in different directions. In the context of the easy construction of the form of evolution of elementary cellular automata, difficulties arise in representing the form of evolution of two-dimensional cellular automata, both synchronous and asynchronous. The evolution of two-dimensional cellular automata is represented by a set of states of two-dimensio

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Lo, Shih-Ching, and Chia-Hung Hsu. "Cellular automata simulation for mixed manual and automated control traffic." Mathematical and Computer Modelling 51, no. 7-8 (2010): 1000–1007. http://dx.doi.org/10.1016/j.mcm.2009.08.042.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Bhasin, Harsh. "Artificial life and cellular automata based automated test case generator." ACM SIGSOFT Software Engineering Notes 39, no. 1 (2014): 1–5. http://dx.doi.org/10.1145/2557833.2557843.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Straatman, Bas, Roger White, and Guy Engelen. "Towards an automatic calibration procedure for constrained cellular automata." Computers, Environment and Urban Systems 28, no. 1-2 (2004): 149–70. http://dx.doi.org/10.1016/s0198-9715(02)00068-6.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Lohn, J. D., and J. A. Reggia. "Automatic discovery of self-replicating structures in cellular automata." IEEE Transactions on Evolutionary Computation 1, no. 3 (1997): 165–78. http://dx.doi.org/10.1109/4235.661547.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

STÄMPFLE, M. "CELLULAR AUTOMATA AND OPTIMAL PATH PLANNING." International Journal of Bifurcation and Chaos 06, no. 03 (1996): 603–10. http://dx.doi.org/10.1142/s0218127496000291.

Der volle Inhalt der Quelle

Annotation:

Cellular automata are deterministic dynamical systems in which time, space, and state values are discrete. Although they consist of uniform elements, which interact only locally, cellular automata are capable of showing complex behavior. This property is exploited for solving path planning problems in workspaces with obstacles. A new automaton rule is presented which calculates simultaneously all shortest paths between a starting position and a target cell. Based on wave propagation, the algorithm ensures that the dynamics settles down in an equilibrium state which represents an optimal soluti

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

SUTNER, KLAUS. "REDUCED POWER AUTOMATA AND SOFIC SYSTEMS." International Journal of Foundations of Computer Science 14, no. 06 (2003): 1117–28. http://dx.doi.org/10.1142/s0129054103002217.

Der volle Inhalt der Quelle

Annotation:

The state complexity of the cover language of sofic shifts arising from cellular automata is studied. It is shown that in the case where the underlying automaton is nearly a permutation automaton the deterministic automaton obtained by the classical Rabin-Scott construction is already reduced.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

SABLIK, MATHIEU. "Measure rigidity for algebraic bipermutative cellular automata." Ergodic Theory and Dynamical Systems 27, no. 6 (2007): 1965–90. http://dx.doi.org/10.1017/s0143385707000247.

Der volle Inhalt der Quelle

Annotation:

AbstractLet $({\mathcal {A}^{\mathbb {Z}}} ,F)$ be a bipermutative algebraic cellular automaton. We present conditions that force a probability measure, which is invariant for the $ {\mathbb {N}} \times {\mathbb {Z}} $-action of F and the shift map σ, to be the Haar measure on Σ, a closed shift-invariant subgroup of the abelian compact group $ {\mathcal {A}^{\mathbb {Z}}} $. This generalizes simultaneously results of Host et al (B. Host, A. Maass and S. Martínez. Uniform Bernoulli measure in dynamics of permutative cellular automata with algebraic local rules. Discrete Contin. Dyn. Syst. 9(6)

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

MORA, JUAN CARLOS SECK TUOH, GENARO JUÁREZ MARTÍNEZ, and HAROLD V. MCINTOSH. "CALCULATING ANCESTORS IN ONE-DIMENSIONAL CELLULAR AUTOMATA." International Journal of Modern Physics C 15, no. 08 (2004): 1151–69. http://dx.doi.org/10.1142/s0129183104006625.

Der volle Inhalt der Quelle

Annotation:

One-dimensional cellular automata are dynamical systems characterized by discreteness (in space and time), determinism and local interaction. We present a procedure to calculate the ancestors for a given sequence of states, which is based on a special kind of graph called subset diagram. We use this diagram to specify subset tables for calculating ancestors which are not Garden-of-Eden sequences, hence the process is able to yield ancestors in several generations. Some examples are illustrated using the cellular automaton Rule 110 which is the most interesting automaton of two states and three

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

D’Autilia, Roberto, and Janet Hetman. "Complex Buildings and Cellular Automata—A Cellular Automaton Model for the Centquatre-Paris." Urban Science 2, no. 2 (2018): 50. http://dx.doi.org/10.3390/urbansci2020050.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Chouksey, Jayshree, and Er Deepak Pancholi. "Review Paper on Quantum Dot Cellular Automata Using Nanoelectronics." International Journal of Trend in Scientific Research and Development Volume-2, Issue-5 (2018): 2205–7. http://dx.doi.org/10.31142/ijtsrd18214.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Pino, Neisser, and Gabriel Wainer. "Un Modelo Computacional de la Transmisión del Dengue por Autómatas Celulares." Selecciones Matemáticas 6, no. 2 (2019): 217–24. http://dx.doi.org/10.17268/sel.mat.2019.02.08.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Sargolzaei, A., K. K. Yen, K. Zeng, S. M. A. Motahari, and S. Noei. "Impulse Image Noise Reduction Using Fuzzy-Cellular Automata Method." International Journal of Computer and Electrical Engineering 6, no. 2 (2014): 191–95. http://dx.doi.org/10.7763/ijcee.2014.v6.820.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Hempel, Gerd, Stefan Miltenyi, and Volker Huppert. "Next Level of Automated Cell Processing System for Flexible Manufacturing of Cellular Products." Blood 116, no. 21 (2010): 1186. http://dx.doi.org/10.1182/blood.v116.21.1186.1186.

Der volle Inhalt der Quelle

Annotation:

Abstract Abstract 1186 Introduction: Currently, manufacturing of cellular products for cellular therapies is done manually or semi-automated. To make cellular therapies applicable for routine use, a standardized production of cellular therapeutic agents is necessary. Therefore closed and highly automated manufacturing procedures are required. Solution: A new integrated cell processing device has been developed to automate and standardize the manufacturing process of cellular therapeutic agents and to handle several cell handling procedures in a fully automated and unified way. These procedures

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

He, Jun Lian, and Ming Tian Li. "Cellular Automata to Simulate Crack Propagation of Quasi-Brittle Materials." Applied Mechanics and Materials 90-93 (September 2011): 748–51. http://dx.doi.org/10.4028/www.scientific.net/amm.90-93.748.

Der volle Inhalt der Quelle

Annotation:

Crack propagation in quasi-brittle material such as rock and concrete is studied by a new numerical method, lattice cellular automata. Cellular automaton method is an efficient method that simulates the process of self-organization of the complex system by constructing some simple local rules. It is of the advantage of localization and parallelization. Lattice model can transform a complex triaxial problem into a simpler uniaxial problem as well as consider the heterogeneity of the materials. Lattice cellular automata integrate advantages of both cellular automata and lattice model. In this pa

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Domasevich, M. A., A. V. Pavlova, and S. E. Rubtsov. "TO MODELING OF SPATIAL PROCESSES ON TRIANGULATION GRIDS." Ecology. Economy. Informatics.System analysis and mathematical modeling of ecological and economic systems 1, no. 5 (2020): 50–55. http://dx.doi.org/10.23885/2500-395x-2020-1-5-50-55.

Der volle Inhalt der Quelle

Annotation:

Using of triangulation grids as a discrete space for constructing cellular automaton models is very promising. Approximation of the landscape surface and applying of cellular automata on the resulting triangulation grid simulating various physical processes, such as floods, floods, fires, landslides, etc., will allow for more accurate modeling in connection with the ability to use landscape features. The authors demonstrated an approach to the construction of triangulation gratings approximating for real fragments of the terrain. They developed mesh generation algorithms based on height maps.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

ADAMATZKY, ANDREW, and LEON CHUA. "MEMRISTIVE EXCITABLE CELLULAR AUTOMATA." International Journal of Bifurcation and Chaos 21, no. 11 (2011): 3083–102. http://dx.doi.org/10.1142/s0218127411030611.

Der volle Inhalt der Quelle

Annotation:

The memristor is a device whose resistance changes depending on the polarity and magnitude of a voltage applied to the device's terminals. We design a minimalistic model of a regular network of memristors using structurally-dynamic cellular automata. Each cell gets info about states of its closest neighbors via incoming links. A link can be "conductive" or "nonconductive". States of every link are updated depending on the states of cells the link connects. Every cell of a memristive automaton assumes three states: resting, excited (analog of positive polarity) and refractory (analog of negativ

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Yang, Da, Xiaoping Qiu, Lina Ma, Danhong Wu, Liling Zhu, and Hongbin Liang. "Cellular Automata–Based Modeling and Simulation of a Mixed Traffic Flow of Manual and Automated Vehicles." Transportation Research Record: Journal of the Transportation Research Board 2622, no. 1 (2017): 105–16. http://dx.doi.org/10.3141/2622-10.

Der volle Inhalt der Quelle

Annotation:

In recent years, automated vehicles have been developing rapidly, and some automated vehicles have begun to drive on highways. The market share of automated vehicles is expected to increase and will greatly affect traffic flow characteristics. This paper focuses on the mixed traffic flow of manual and automated vehicles. The study improves the existing cellular automaton model to capture the differences between manual vehicles and automated vehicles. Computer simulations are employed to analyze the characteristic variations in the mixed traffic flow under different automated vehicle proportion

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Adamatzky, Andrew, Eric Goles, Genaro J. Martínez, Michail-Antisthenis Tsompanas, Martin Tegelaar, and Han A. B. Wosten. "Fungal Automata." Complex Systems 29, no. 4 (2020): 759–78. http://dx.doi.org/10.25088/complexsystems.29.4.759.

Der volle Inhalt der Quelle

Annotation:

We study a cellular automaton (CA) model of information dynamics on a single hypha of a fungal mycelium. Such a filament is divided in compartments (here also called cells) by septa. These septa are invaginations of the cell wall and their pores allow for the flow of cytoplasm between compartments and hyphae. The septal pores of the fungal phylum of the Ascomycota can be closed by organelles called Woronin bodies. Septal closure is increased when the septa become older and when exposed to stress conditions. Thus, Woronin bodies act as informational flow valves. The one-dimensional fungal autom

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Xu, Hong Xue, and Dong Mei Zhang. "The Application of Cellular Automata in Traffic Flow Management and the Present Situation." Applied Mechanics and Materials 513-517 (February 2014): 2702–5. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.2702.

Der volle Inhalt der Quelle

Annotation:

Review the research process and results of cellular automaton used for traffic flow, and against the theory based on cellular automata model established lane, two-lane model, multi-lane traffic network model and discuss the model. Then introduced the research status and development trends of various models. Finally, prospect the future of the cellular automata used to traffic flow managements development trend and research direction, and provide a reference for building traffic management mode suit to the characteristics of the transportation.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Bortnyik, Kornél, and Péter Barkóczy. "Identification of Eutectic Microstructure by HPP Cellular Automata in Aluminum Alloys." Materials Science Forum 885 (February 2017): 228–33. http://dx.doi.org/10.4028/www.scientific.net/msf.885.228.

Der volle Inhalt der Quelle

Annotation:

The eutectic structure of aluminum alloys has different morphology. To describe these a different image processing and analysis workflow needs to be built. To assign the different image processing steps to the different structure automatically a computational method had to be developed. In the image processing methods several cellular automata operate. For this expediently a cellular automaton was developed to classify the different eutectic structures. In materials engineering applications a HPP automata is used extensively therefore this type of automata were chosen to solve the mentioned pr

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Gyöngyösi, Szilvia, and Peter Barkoczy. "Simulation of Grain Coarsening Using One-Dimensional Cellular Automaton." Materials Science Forum 752 (March 2013): 217–22. http://dx.doi.org/10.4028/www.scientific.net/msf.752.217.

Der volle Inhalt der Quelle

Annotation:

Numerous literature [1,4,5] has reported on the effective use of cellular automaton method for the simulation of short-range diffusion. Using this model for the simulation of short-range diffusional phase transformations therefore is a resolved issue. It is proven that two- or three-dimensional automata can reflect the course of the abovementioned processes realistically. What our study demonstrates more than in the past [1] is that two-dimensional stochastic cellular automaton simulation already presented before has been simplified. This time our automaton operates in one dimension [2], which

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Allison, Karen. "The First Automated High Content Screening System." JALA: Journal of the Association for Laboratory Automation 8, no. 3 (2003): 27–29. http://dx.doi.org/10.1016/s1535-5535-04-00266-7.

Der volle Inhalt der Quelle

Annotation:

With biological discovery and technology advancing in parallel, AstraZeneca (AZ) announced that it would soon take delivery of what is thought to be the first fully automated high-throughput high-content screening system. This custom designed assay platform from RTS Life Science International (RTS) automates the IN Cell Analyzer 3000 sub cellular analysis system from Amersham Biosciences. RTS has integrated its advanced scheduling system with the imaging tool to enable AZ to evaluate the effect of drug compounds on cellular processes.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!