|
Cyclic Cellular Automaton
A cyclic cellular automaton is a kind of cellular automaton rule developed by David Griffeath and studied by several other cellular automaton researchers. In this system, each cell remains unchanged until some neighboring cell has a modular value exactly one unit larger than that of the cell itself, at which point it copies its neighbor's value. One-dimensional cyclic cellular automata can be interpreted as systems of interacting particles, while cyclic cellular automata in higher dimensions exhibit complex spiraling behavior. Rules As with any cellular automaton, the cyclic cellular automaton consists of a regular grid of cells in one or more dimensions. The cells can take on any of n states, ranging from 0 to n-1. The first generation starts out with random states in each of the cells. In each subsequent generation, if a cell has a neighboring cell whose value is the successor of the cell's value, the cell is "consumed" and takes on the succeeding value. (Note that 0 is the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Von Neumann Neighborhood
In cellular automata, the von Neumann neighborhood (or 4-neighborhood) is classically defined on a two-dimensional square lattice and is composed of a central cell and its four adjacent cells. The neighborhood is named after John von Neumann, who used it to define the von Neumann cellular automaton and the von Neumann universal constructor within it. It is one of the two most commonly used neighborhood types for two-dimensional cellular automata, the other one being the Moore neighborhood. This neighbourhood can be used to define the notion of 4-connected pixels in computer graphics.. The von Neumann neighbourhood of a cell is the cell itself and the cells at a Manhattan distance of 1. The concept can be extended to higher dimensions, for example forming a 6-cell octahedral neighborhood for a cubic cellular automaton in three dimensions. Von Neumann neighborhood of range ''r'' An extension of the simple von Neumann neighborhood described above is to take the set of poin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Excitable Medium
An excitable medium is a nonlinear dynamical system which has the capacity to propagate a wave of some description, and which cannot support the passing of another wave until a certain amount of time has passed (known as the refractory time). A forest is an example of an excitable medium: if a wildfire burns through the forest, no fire can return to a burnt spot until the vegetation has gone through its refractory period and regrown. In chemistry, oscillating reactions are excitable media, for example the Belousov–Zhabotinsky reaction and the Briggs–Rauscher reaction. Cell excitability is the change in membrane potential that is necessary for cellular responses in various tissues. The resting potential forms the basis of cell excitability and these processes are fundamental for the generation of graded and action potentials. Normal and pathological activities in the heart and brain can be modelled as excitable media. A group of spectators at a sporting event are an excitable ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Autowave
Autowaves are self-supporting non-linear waves in active media (i.e. those that provide distributed energy sources). The term is generally used in processes where the waves carry relatively low energy, which is necessary for synchronization or switching the active medium. Introduction Relevance and significance In 1980, the Soviet scientists G.R. Ivanitsky, V.I. Krinsky, A.N. Zaikin, A.M. Zhabotinsky, B.P. Belousov became winners of the highest state award of the USSR, Lenin Prize "''for the discovery of a new class of autowave processes and the study of them in disturbance of stability of the distributed excitable systems''." A brief history of autowave researches The first who studied actively the self-oscillations was Academician AA Andronov, and the term "''auto-oscillations''" in Russian terminology was introduced by AA Andronov in 1928. His followers from Lobachevsky University further contributed greatly to the development of ''autowave theory''. The s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Belousov–Zhabotinsky Reaction
A Belousov–Zhabotinsky reaction, or BZ reaction, is one of a class of reactions that serve as a classical example of non-equilibrium thermodynamics, resulting in the establishment of a nonlinear chemical oscillator. The only common element in these oscillators is the inclusion of bromine and an acid. The reactions are important to theoretical chemistry in that they show that chemical reactions do not have to be dominated by equilibrium thermodynamic behavior. These reactions are far from equilibrium and remain so for a significant length of time and evolve chaotically. In this sense, they provide an interesting chemical model of nonequilibrium biological phenomena; as such, mathematical models and simulations of the BZ reactions themselves are of theoretical interest, showing phenomenon as noise-induced order. An essential aspect of the BZ reaction is its so called "excitability"; under the influence of stimuli, patterns develop in what would otherwise be a perfectly quies ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Almost Surely
In probability theory, an event is said to happen almost surely (sometimes abbreviated as a.s.) if it happens with probability 1 (or Lebesgue measure 1). In other words, the set of possible exceptions may be non-empty, but it has probability 0. The concept is analogous to the concept of "almost everywhere" in measure theory. In probability experiments on a finite sample space, there is no difference between ''almost surely'' and ''surely'' (since having a probability of 1 often entails including all the sample points). However, this distinction becomes important when the sample space is an infinite set, because an infinite set can have non-empty subsets of probability 0. Some examples of the use of this concept include the strong and uniform versions of the law of large numbers, and the continuity of the paths of Brownian motion. The terms almost certainly (a.c.) and almost always (a.a.) are also used. Almost never describes the opposite of ''almost surely'': an event that h ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Spiral
In mathematics, a spiral is a curve which emanates from a point, moving farther away as it revolves around the point. Helices Two major definitions of "spiral" in the American Heritage Dictionary are:Spiral ''American Heritage Dictionary of the English Language'', Houghton Mifflin Company, Fourth Edition, 2009. # a curve on a plane that winds around a fixed center point at a continuously increasing or decreasing distance from the point. # a three-dimensional curve that turns around an axis at a constant or continuously varying distance while moving parallel to the axis; a . The first definition describes a |
Moore Neighborhood
In cellular automata, the Moore neighborhood is defined on a two-dimensional square lattice and is composed of a central cell and the eight cells that surround it. Name The neighborhood is named after Edward F. Moore, a pioneer of cellular automata theory. Importance It is one of the two most commonly used neighborhood types, the other one being the von Neumann neighborhood, which excludes the corner cells. The well known Conway's Game of Life, for example, uses the Moore neighborhood. It is similar to the notion of 8-connected pixels in computer graphics. The Moore neighbourhood of a cell is the cell itself and the cells at a Chebyshev distance of 1. The concept can be extended to higher dimensions, for example forming a 26-cell cubic neighborhood for a cellular automaton in three dimensions, as used by 3D Life. In dimension ''d,'' where 0 \le d, d \in \mathbb, the size of the neighborhood is 3''d'' − 1. In two dimensions, the number of cells in an ''ex ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cellular Automaton
A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model of computation studied in automata theory. Cellular automata are also called cellular spaces, tessellation automata, homogeneous structures, cellular structures, tessellation structures, and iterative arrays. Cellular automata have found application in various areas, including physics, theoretical biology and microstructure modeling. A cellular automaton consists of a regular grid of ''cells'', each in one of a finite number of '' states'', such as ''on'' and ''off'' (in contrast to a coupled map lattice). The grid can be in any finite number of dimensions. For each cell, a set of cells called its ''neighborhood'' is defined relative to the specified cell. An initial state (time ''t'' = 0) is selected by assigning a state for each cell. A new ''generation'' is created (advancing ''t'' by 1), according to some fixed ''rule'' (generally, a mathematical function) that determines the new state of e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Traffic Flow
In mathematics and transportation engineering, traffic flow is the study of interactions between travellers (including pedestrians, cyclists, drivers, and their vehicles) and infrastructure (including highways, signage, and traffic control devices), with the aim of understanding and developing an optimal transport network with efficient movement of traffic and minimal traffic congestion problems. History Attempts to produce a mathematical theory of traffic flow date back to the 1920s, when Frank Knight first produced an analysis of traffic equilibrium, which was refined into John Glen Wardrop, Wardrop's first and second principles of equilibrium in 1952. Nonetheless, even with the advent of significant computer processing power, to date there has been no satisfactory general theory that can be consistently applied to real flow conditions. Current traffic models use a mixture of empirical and Deductive reasoning, theoretical techniques. These models are then developed into Trans ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rule 184
Rule 184 is a one-dimensional binary cellular automaton rule, notable for solving the majority problem as well as for its ability to simultaneously describe several, seemingly quite different, particle systems: * Rule 184 can be used as a simple model for traffic flow in a single lane of a highway, and forms the basis for many cellular automaton models of traffic flow with greater sophistication. In this model, particles (representing vehicles) move in a single direction, stopping and starting depending on the cars in front of them. The number of particles remains unchanged throughout the simulation. Because of this application, Rule 184 is sometimes called the "traffic rule". * Rule 184 also models a form of deposition of particles onto an irregular surface, in which each local minimum of the surface is filled with a particle in each step. At each step of the simulation, the number of particles increases. Once placed, a particle never moves. * Rule 184 can be understood in ter ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
