共查询到20条相似文献，搜索用时 0 毫秒
1.
Cellular automata systems often produce complex behavior from simple rule sets. The behaviors and results of two complex combinations of cellular automata rules are analyzed. Both two‐dimensional rule sets add complexities to typical cellular automata systems by attaching attributes and rules to each cell. One of the rule sets produces gliders that reproduce upon collision, whereas the other grows into an intricate shape. Projection and entropy analysis classify the rule sets as complex for the intricate shape, but measurements indicate that the self‐reproducing gliders fall between ordered and complex classification, despite their complex appearance. © 2005 Wiley Periodicals, Inc. Complexity 10: 45–55, 2005 相似文献
2.
In order to understand the interplay among information, genetic instructions, and phenotypic variations, self‐reproducers discovered in two‐dimensional cellular automata are considered as proto‐organisms, which undergo to mutations as they were in a real environmental situation. We realized a computational model through which we have been able to discover the genetic map of the self‐reproducers and the networks they use. Identifying in these maps sets of different functional genes, we found that mutations in the genetic sequences could affect both external shapes and behavior of the self‐reproducers, thus realizing different life‐like strategies in the evolution process. The results highlight that some strategies evolution uses in selecting organisms that are fitting with changing environmental situations maintain the self‐reproducing function, whereas other variations create new self‐reproducers. These self‐reproducers in turn realize different genetic networks, which can be very different from the basic ancestors pools. The mutations that are disruptive bring self‐reproducers to disappear, while other proto‐organisms are generated. © 2004 Wiley Periodicals, Inc. Complexity 9: 38–55, 2004 相似文献
3.
It is widely believed that evolutionary dynamics of artificial self‐replicators realized in cellular automata (CA) are limited in diversity and adaptation. Contrary to this view, we show that complex genetic evolution may occur within simple CA. The evolving self‐replicating loops (“evoloops”) we investigate exhibit significant diversity in macro‐scale morphologies and mutational biases, undergoing nontrivial genetic adaptation by maximizing colony density and enhancing sustainability against other species. Nonmutable subsequences enable genetic operations that alter fitness differentials and promote long‐term evolutionary exploration. These results demonstrate a unique example of genetic evolution hierarchically emerging from local interactions between elements much smaller than individual replicators. © 2004 Wiley Periodicals, Inc. Complexity 10: 33–39, 2004 相似文献
4.
We present a theoretical study of thermal effect in quantum‐dot cellular automata (QCA). An extended Hubbard‐type model for the Hamiltonian of the QCA arrays, and canonical distribution were used to obtain thermal average of polarization for the QCA cells. A full‐basis quantum method has been used for the calculation of response function for a two‐ and a three‐cell array system. Each cell is composed of four dots located at the corners of the cells. Results show that the nonlinear behavior of the response function functions decay with the temperature as well as with the number of cells in the array. © 2005 Wiley Periodicals, Inc. Complexity 10: 73–78, 2005 相似文献
5.
Tom Bohman 《Transactions of the American Mathematical Society》1999,351(3):947-983
In the discrete threshold model for crystal growth in the plane we begin with some set of seed crystals and observe crystal growth over time by generating a sequence of subsets of by a deterministic rule. This rule is as follows: a site crystallizes when a threshold number of crystallized points appear in the site's prescribed neighborhood. The growth dynamics generated by this model are said to be omnivorous if finite and imply . In this paper we prove that the dynamics are omnivorous when the neighborhood is a box (i.e. when, for some fixed , the neighborhood of is . This result has important implications in the study of the first passage time when is chosen randomly with a sparse Bernoulli density and in the study of the limiting shape to which converges.
6.
Brooks and Orr [R.R. Brooks and N. Orr, A model for mobile code using interacting automata. IEEE Trans Mobile Computing 2002, 1(4)] present a model for analysis and simulation of mobile code systems based on cellular automata (CA) abstractions. One flaw with that article was a lack of experimental support showing that CA can model IP networks. This article presents CA models, consistent with those in the work of Brooks and Orr, that model the transport layer of IP networks. We show how these models may be generalized for more complicated network topologies. We provide quantitative results comparing the quality of our CA implementation versus the standard network modeling tool ns‐2. The results from the CA model are qualitatively similar to ns‐2, but the CA simulation runs significantly faster and scales better. © 2004 Wiley Periodicals, Inc. Complexity 9:32–40, 2004 相似文献
7.
As paradigmatic complex systems, various studies have been done in the context of one‐dimensional cellular automata (CA) on the definition of parameters directly obtained from their transition rule, aiming at the help they might provide to forecasting CA dynamic behavior. Out of the analysis of the most important parameters available for this end, as well as others evaluated by us, a set of guidelines is proposed that should be followed when defining a parameter of that kind. Based upon the guidelines, a critique of those parameters is made, which leads to a set of five that jointly provide a good forecasting set; two of them were drawn from the literature and three are new ones defined according to the guidelines. By using them as a heuristic in the evolutionary search for CA of a predefined computational behavior, good results have been obtained, exemplified herein by the evolutionary search for CA that perform the Synchronization Task. © 2001 John Wiley & Sons, Inc. 相似文献
8.
The elementary cellular automaton following rule 184 can mimic particles flowing in one direction at a constant speed. Therefore, this automaton can model highway traffic qualitatively. In a recent paper, we have incorporated intersections regulated by traffic lights to this model using exclusively elementary cellular automata. In such a paper, however, we only explored a rectangular grid. We now extend our model to more complex scenarios using an hexagonal grid. This extension shows first that our model can readily incorporate multiple‐way intersections and hence simulate complex scenarios. In addition, the current extension allows us to study and evaluate the behavior of two different kinds of traffic‐light controller for a grid of six‐way streets allowing for either two‐ or three‐street intersections: a traffic light that tries to adapt to the amount of traffic (which results in self‐organizing traffic lights) and a system of synchronized traffic lights with coordinated rigid periods (sometimes called the “green‐wave” method). We observe a tradeoff between system capacity and topological complexity. The green‐wave method is unable to cope with the complexity of a higher‐capacity scenario, while the self‐organizing method is scalable, adapting to the complexity of a scenario and exploiting its maximum capacity. Additionally, in this article, we propose a benchmark, independent of methods and models, to measure the performance of a traffic‐light controller comparing it against a theoretical optimum. © 2011 Wiley Periodicals, Inc. Complexity, 2012 相似文献
9.
在人口密集场所(馆)观众席位区及疏散通道分布模拟图的基础上,应用数据库技术结合元胞自动机模拟了场馆中人员的疏散情况,并针对场馆发生突发事件后,在疏散过程中某个出口堵塞的情形进行了模拟,模拟结果可以记录人员疏散的轨迹,为突发事件发生后人员疏散应急方案提供参考. 相似文献
10.
Ramón Alonso‐Sanz 《Complexity》2014,20(1):49-56
The effect of delay type memory of past states on reversible elementary cellular automata (CA) is examined in this study. It is assessed in simple scenarios, such as elementary CA, but the feasibility of enriching the dynamics with memory in a general reversible CA context is also outlined. © 2014 Wiley Periodicals, Inc. Complexity 20: 49–56, 2014 相似文献
11.
Eduardo Mizraji 《Complexity》2004,9(6):33-42
This work concerns the interaction between two classical problems: the forecasting of the dynamical behaviors of elementary cellular automata (ECA) from its intrinsic mathematical laws and the conditions that determine the emergence of complex dynamics. To approach these problems, and inspired by the theory of reversible logical gates, we decompose the ECA laws in a “spectrum” of dyadic Boolean gates. Emergent properties due to interactions are captured generating another spectrum of logical gates. The combined analysis of both spectra shows the existence of characteristic bias in the distribution of Boolean gates for ECA belonging to different dynamical classes. These results suggest the existence of signatures capable to indicate the propensity to develop complex dynamics. Logical gates “exclusive‐or” and “equivalence” are among these signatures of complexity. An important conclusion is that within ECA space, interactions are not capable to generate signatures of complexity in the case these signatures are absent in the intrinsic law of the automaton. © 2004 Wiley Periodicals, Inc. Complexity 9: 33–42, 2004 相似文献
12.
We propose an algebro-geometric method for constructing solutions of the discrete KP equation over a finite field. We also perform the corresponding reduction to the finite-field version of the discrete KdV equation. We write formulas that allow constructing multisoliton solutions of the equations starting from vacuum wave functions on an arbitrary nonsingular curve. 相似文献
13.
Establishment of effective traffic models to reveal fundamental traffic characteristics is an essential requirement in the design, planning and operation of transportation systems. In 1992 Nagel and Schreckenberg presented a cellular automaton model describing traffic flow of N cars on a single lane and applied it in the famous project TRANSIMS on transportation simulation. In this paper, the author proposes a new model for the same problem and gives a comparison of simulation results with the former ones. The comparison shows that the new model works better under the condition of high traffic density. 相似文献
14.
提出了企业员工的正行为、零行为和负行为概念,分析了员工中不同行为间的相互影响.对传统元胞自动机方法进行了改进,建立了基于员工传播性和保持性的元胞自动机模型,并对员工不同的初始比例、不同的行为传播性和保持性以及企业不同奖励和惩罚性政策下的员工行为演化进行了模拟,得到了一些合理和有益的结论,并对不同情形下的人员管理提供了针对性建议. 相似文献
15.
三维自助式类渗流细胞自动机的临界值 总被引：1，自引：0，他引：1
本文研究三维自助式类渗流细胞自动机的临界值．得出临界值pc＝0的一些充分条件和必要条件．当pc＞0时，利用定向点渗流的临界值，给出了pc上、下界的显式估计． 相似文献
16.
Todd Rowland 《Complexity》2006,12(2):13-29
We present a network experiment that investigates the computational power of cellular automata on the simplest irregular lattice. One cellular automaton whose apparent complexity increased is Rule 60, the left neighbor Xor operator. It went from being nested to complex. That makes Xor a candidate for universal computational power. We present the evidence in terms of the size of cycle lengths, transients, and size of boolean expressions. © 2006 Wiley Periodicals, Inc. Complexity 12: 13–29, 2006 相似文献
17.
Probabilistic cellular automata form a very large and general class of stochastic processes. These automata exhibit a wide range of complex behavior and are of interest in a number of fields of study, including mathematical physics, percolation theory, computer science, and neurobiology. Very little has been proved about these models, even in simple cases, so it is common to compare the models to mean field models. It is normally assumed that mean field models are essentially trivial. However, we show here that even the mean field models can exhibit surprising behavior. We prove some rigorous results on mean field models, including the existence of a surrogate for the “energy” in certain non‐reversible models. We also briefly discuss some differences that occur between the mean field and lattice models. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2006 相似文献
18.
An effective procedure for deciding permutativeness of one-directional cellular automata on the one-sided full shift is presented. It is then implemented in C++, and used to test permutativeness of elementary cellular automata (those of radius 3). 相似文献
19.
Stefano Cavagnetto 《Mathematical Logic Quarterly》2009,55(6):605-616
In this paper we give a new proof of Richardson's theorem [31]: a global function G?? of a cellular automaton ?? is injective if and only if the inverse of G?? is a global function of a cellular automaton. Moreover, we show a way how to construct the inverse cellular automaton using the method of feasible interpolation from [20]. We also solve two problems regarding complexity of cellular automata formulated by Durand [12] (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
20.
Evolutionary complexity is measured here by the number of trials/evaluations needed for evolving a logical gate in a nonlinear medium. Behavioral complexity of the gates evolved is characterized in terms of cellular automata behavior. We speculate that hierarchies of behavioral and evolutionary complexities are isomorphic up to some degree, subject to substrate specificity of evolution, and the spectrum of evolution parameters. © 2009 Wiley Periodicals, Inc. Complexity, 2009 相似文献