Featured Researches

Cellular Automata And Lattice Gases

Application of Complex Daubechies' Wavelets to Numerical Simulation of a Nonlinear Signal Propagation Model

We report the first application of complex symmetric wavelets to the numerical simulation of a nonlinear signal propagation model. This model is the so-called nonlinear Schrodinger equation that describes, for instance, the evolution of the electric field amplitude in nonlinear optical fibers. We propose and study a new way to implement a global space-time adaptive grid, based on interpolation properties of higher-order scaling functions.

Read more
Cellular Automata And Lattice Gases

CAM-8: A Computer Architecture Based on Cellular Automata

Conventional computers are ill suited to run CA models, and so discourage their development. By creating a hardware platform that makes a broad range of new CA algorithms practical for real applications, we hope to whet the appetite of researchers for the astronomical computing power that can be harnessed in microphysics in a CA format.

Read more
Cellular Automata And Lattice Gases

Cellular Automaton Model for Immunology of Tumor Growth

The stochastic discrete space-time model of an immune response on tumor spreading in a two-dimensional square lattice has been developed. The immunity-tumor interactions are described at the cellular level and then transferred into the setting of cellular automata (CA). The multistate CA model for system, in which all statesoflattice sites, composing of both immune and tumor cells populations, are the functions of the states of the 12 nearest neighbors. The CA model incorporates the essential featuresof the immunity-tumor system. Three regimes of neoplastic evolution including metastatic tumor growth and screen effect by inactive immune cells surrounding a tumor have been predicted.

Read more
Cellular Automata And Lattice Gases

Cellular Automaton Rule184++C. A Simple Model for the Complex Dynamics of Various Particles Flow

A cellular automaton named Rule 184++C is proposed as a meta-model to investigate the flow of various complex particles. In this model, unlike the granular pipe flow and the traffic flow, not only the free-jam phase transition but also the free-intermediate, the intermediate-jam, and the dilute-dense phase transitions appear. Moreover, the freezing phenomena appear if the system contains two types of different particles.

Read more
Cellular Automata And Lattice Gases

Cellular Automaton for Realistic Modelling of Landslides

A numerical model is developed for the simulation of debris flow in landslides over a complex three dimensional topography. The model is based on a lattice, in which debris can be transferred among nearest neighbors according to established empirical relationships for granular flows. The model is then validated by comparing a simulation with reported field data. Our model is in fact a realistic elaboration of simpler ``sandpile automata'', which have in recent years been studied as supposedly paradigmatic of ``self-organized criticality''. Statistics and scaling properties of the simulation are examined, and show that the model has an intermittent behavior.

Read more
Cellular Automata And Lattice Gases

Cellular automaton model of precipitation/dissolution coupled with solute transport

Precipitation/dissolution reactions coupled with solute transport are modelled as a cellular automaton in which solute molecules perform a random walk on a regular lattice and react according to a local probabilistic rule. Stationary solid particles dissolve with a certain probability and, provided solid is already present or the solution is saturated, solute particles have a probability to precipitate. In our simulation of the dissolution of a solid block inside uniformly flowing water we obtain solid precipitation downstream from the original solid edge, in contrast to the standard reaction-transport equations. The observed effect is the result of fluctuations in solute density and diminishes when we average over a larger ensemble. The additional precipitation of solid is accompanied by a substantial reduction in the relatively small solute concentration. The model is appropriate for the study of the rôle of intrinsic fluctuations in the presence of reaction thresholds and can be employed to investigate porosity changes associated with the carbonation of cement.

Read more
Cellular Automata And Lattice Gases

Cellular automaton model of reaction-transport processes

The transport and chemical reactions of solutes are modelled as a cellular automaton in which molecules of different species perform a random walk on a regular lattice and react according to a local probabilistic rule. The model describes advection and diffusion in a simple way, and as no restriction is placed on the number of particles at a lattice site, it is also able to describe a wide variety of chemical reactions. Assuming molecular chaos and a smooth density function, we obtain the standard reaction-transport equations in the continuum limit. Simulations on one- and two-dimensional lattices show that the discrete model can be used to approximate the solutions of the continuum equations. We discuss discrepancies which arise from correlations between molecules and how these disappear as the continuum limit is approached. Of particular interest are simulations displaying long-time behaviour which depends on long-wavelength statistical fluctuations not accounted for by the standard equations. The model is applied to the reactions a+b⇌c and a+b→c with homogeneous and inhomogeneous initial conditions as well as to systems subject to autocatalytic reactions and displaying spontaneous formation of spatial concentration patterns.

Read more
Cellular Automata And Lattice Gases

Coarse-grained entropy rates for characterization of complex time series

A method for classification of complex time series using coarse-grained entropy rates (CER's) is presented. The CER's, which are computed from information-theoretic functionals -- redundancies, are relative measures of regularity and predictability, and for data generated by dynamical systems they are related to Kolmogorov-Sinai entropy. A deterministic dynamical origin of the data under study, however, is not a necessary condition for the use of the CER's, since the entropy rates can be defined for stochastic processes as well. Sensitivity of the CER's to changes in data dynamics and their robustness with respect to noise are tested by using numerically generated time series resulted from both deterministic -- chaotic and stochastic processes. Potential application of the CER's in analysis of physiological signals or other complex time series is demonstrated by using examples from pharmaco-EEG and tremor classification.

Read more
Cellular Automata And Lattice Gases

Comparison of Spectral Method and Lattice Boltzmann Simulations of Two-Dimensional Hydrodynamics

We present numerical solutions of the two-dimensional Navier-Stokes equations by two methods; spectral and the novel Lattice Boltzmann Equation (LBE) scheme. Very good agreement is found for global quantities as well as energy spectra. The LBE scheme is, indeed, providing reasonably accurate solutions of the Navier-Stokes equations with an isothermal equation of state, in the nearly incompressible limit. Relaxation to a previously reported ``sinh-Poisson'' state is also observed for both runs.

Read more
Cellular Automata And Lattice Gases

Computations on Nondeterministic Cellular Automata

The work is concerned with the trade-offs between the dimension and the time and space complexity of computations on nondeterministic cellular automata. It is proved, that 1). Every NCA $\Cal A$ of dimension r , computing a predicate P with time complexity T(n) and space complexity S(n) can be simulated by r -dimensional NCA with time and space complexity O( T 1 r+1 S r r+1 ) and by r+1 -dimensional NCA with time and space complexity O( T 1/2 +S) . 2) For any predicate P and integer r>1 if $\Cal A$ is a fastest r -dimensional NCA computing P with time complexity T(n) and space complexity S(n), then T=O(S) . 3). If T r,P is time complexity of a fastest r -dimensional NCA computing predicate P then $T_{r+1,P} &=O((T_{r,P})^{1-r/(r+1)^2})$, $T_{r-1,P} &=O((T_{r,P})^{1+2/r})$. Similar problems for deterministic CA are discussed.

Read more

Ready to get started?

Join us today