Searcharxiv⌕ Search

SEARCH · Searcharxiv

Results for “nlin.CG”

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 127 records · Page 7Linked to original sources

Self-organizing traffic lights at multiple-street intersections

Summary: Traffic light coordination is a complex problem. In this paper, we extend previous work on an abstract model of city traffic to allow for multiple street intersections. We test a self-organizing method in our model, showing that it is close to theoretical optima and superior to a traditional method of traffic light coordination. Abstract: The elementary cellular automaton following rule 184 can mimic particles flowing in one direction at a constant speed. This automaton can therefore model highway traffic. 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 employing 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 paper we propose a benchmark, independent of methods and models, to measure the performance of a traffic light controller comparing it against a theoretical optimum.

nlin.AO↗

The generalized periodic ultradiscrete KdV equation and its background solutions

We investigate the ultradiscrete KdV equation with periodic boundary conditions where the two parameters (capacity of the boxes and that of the carrier) are arbitrary integers. We give a criterion to allow a periodic boundary condition when initial states take arbitrary integer values. Conserved quantities are constructed for the periodic systems. Construction of background solutions of the periodic ultradiscrete KdV equation from the Jacobi theta function is also presented.

nlin.SI↗

The mechanics of rocking stones: equilibria on separated scales

Rocking stones, balanced in counter-intuitive positions have always intrigued geologists. In our paper we explain this phenomenon based on high-precision scans of pebbles which exhibit similar behavior. We construct their convex hull and the heteroclinic graph carrying their equilibrium points. By systematic simplification of the arising Morse-Smale complex in a one-parameter process we show that equilibria occur typically in highly localized groups (flocks), the number of the latter can be reliably observed and determined by hand experiments. Both local and global (micro and macro) equilibria can be either stable or unstable. Most commonly, rocks and pebbles are balanced on stable local equilibria belonging to stable flocks. However, it is possible to balance a convex body on a stable local equilibrium belonging to an unstable flock and this is the intriguing mechanical scenario corresponding to rocking stones. Since outside observers can only reliably perceive flocks, the last described situation will appear counter-intuitive. Comparison of computer experiments to hand experiments reveals that the latter are consistent, i.e. the flocks can be reliably counted and the pebble classification system proposed in our previous work (Domokos et al 2010) is robustly applicable. We also find an interesting logarithmic relationship between the Zingg parameters and the average number of global equilibrium points, indicating a close relationship between the two systems.

physics.geo-ph↗

Computational Aspects of Asynchronous CA

This work studies some aspects of the computational power of fully asynchronous cellular automata (ACA). We deal with some notions of simulation between ACA and Turing Machines. In particular, we characterize the updating sequences specifying which are "universal", i.e., allowing a (specific family of) ACA to simulate any TM on any input. We also consider the computational cost of such simulations.

cs.FL↗

Detecting emergent processes in cellular automata with excess information

Many natural processes occur over characteristic spatial and temporal scales. This paper presents tools for (i) flexibly and scalably coarse-graining cellular automata and (ii) identifying which coarse-grainings express an automaton's dynamics well, and which express its dynamics badly. We apply the tools to investigate a range of examples in Conway's Game of Life and Hopfield networks and demonstrate that they capture some basic intuitions about emergent processes. Finally, we formalize the notion that a process is emergent if it is better expressed at a coarser granularity.

cs.IT↗

Computer Modeling of Radiationally and Thermally Stimulated Processes in a Crystal

The processes of radiation defects formation and evolution have been simulated in cubic dielectric crystals by the computational method of cellular automata. If suppose that the defects concentration as a parameter, which characterizes a system state, reaches some critical value at the irradiation process, in this case there would be collective effects in the system that lead to self-organization phenomena and demonstrate a formation of one-type defect clusters. The fractal theory is used to detect synergistic effects and described the spatial and temporal transformation of defect structure in a crystal.

nlin.CG↗

Prandtl number effects in MRT Lattice Boltzmann models for shocked and unshocked compressible fluids

For compressible fluids under shock wave reaction, we have proposed two Multiple-Relaxation-Time (MRT) Lattice Boltzmann (LB) models [F. Chen, et al, EPL \textbf{90} (2010) 54003; Phys. Lett. A \textbf{375} (2011) 2129.]. In this paper, we construct a new MRT Lattice Boltzmann model which is not only for the shocked compressible fluids, but also for the unshocked compressible fluids. To make the model work for unshocked compressible fluids, a key step is to modify the collision operators of energy flux so that the viscous coefficient in momentum equation is consistent with that in energy equation even in the unshocked system. The unnecessity of the modification for systems under strong shock is analyzed. The model is validated by some well-known benchmark tests, including (i) thermal Couette flow, (ii) Riemann problem, (iii) Richtmyer-Meshkov instability. The first system is unshocked and the latter two are shocked. In all the three systems, the Prandtl numbers effects are checked. Satisfying agreements are obtained between new model results and analytical ones or other numerical results.

cond-mat.soft↗

Computation with competing patterns in Life-like automaton

We study a Life-like cellular automaton rule $B2/S2345$ where a cell in state `0' takes state `1' if it has exactly two neighbors in state `1' and the cell remains in the state `1' if it has between two and five neighbors in state `1.' This automaton is a discrete analog spatially extended chemical media, combining both properties of sub-excitable and precipitating chemical media. When started from random initial configuration B2/S2345 automaton exhibits chaotic behavior. Configurations with low density of state `1' show emergence of localized propagating patterns and stationary localizations. We construct basic logical gates and elementary arithmetical circuits by simulating logical signals with mobile localizations reaction propagating geometrically restricted by stationary non-destructible localizations. Values of Boolean variables are encoded into two types of patterns --- symmetric (False) and asymmetric (True) patterns --- which compete for the `empty' space when propagate in the channels. Implementations of logical gates and binary adders are illustrated explicitly.

nlin.PS↗

Random Sequential Generation of Intervals for the Cascade Model of Food Webs

The cascade model generates a food web at random. In it the species are labeled from 0 to $m$, and arcs are given at random between pairs of the species. For an arc with endpoints $i$ and $j$ ($i<j$), the species $i$ is eaten by the species labeled $j$. The chain length (height), generated at random, models the length of food chain in ecological data. The aim of this note is to introduce the random sequential generation of intervals as a Poisson model which gives naturally an analogous behavior to the cascade model.

nlin.CG↗

Non-Uniform Cellular Automata: classes, dynamics, and decidability

The dynamical behavior of non-uniform cellular automata is compared with the one of classical cellular automata. Several differences and similarities are pointed out by a series of examples. Decidability of basic properties like surjectivity and injectivity is also established. The final part studies a strong form of equicontinuity property specially suited for non-uniform cellular automata.

cs.FL↗

Non-uniform cellular automata and distributions of rules

In this paper we study $ν$-CA on one-dimensional lattice defined over a finite set of local rules. The main goal is to determine how the local rules can be mixed to ensure the produced $ν$-CA has some properties. In a first part, we give some background for the study of $ν$-CA. Then surjectivity and injectivity are studied using a variant of DeBruijn graphs. The next part is dedicated to the number-conserving property.

cs.FL↗

Response Curves and Preimage Sequences of Two-Dimensional Cellular Automata

We consider the problem of finding response curves for a class of binary two-dimensional cellular automata with $L$-shaped neighbourhood. We show that the dependence of the density of ones after an arbitrary number of iterations, on the initial density of ones, can be calculated for a fairly large number of rules by considering preimage sets. We provide several examples and a summary of all known results. We consider a special case of initial density equal to 0.5 for other rules and compute explicitly the density of ones after $n$ iterations of the rule. This analysis includes surjective rules, which in the case of $L$-shaped neighbourhood are all found to be permutive. We conclude with the observation that all rules for which preimage curves can be computed explicitly are either finite or asymptotic emulators of identity or shift.

nlin.CG↗

Quantum Algorithms of Solving the Backtracking of One-dimensional Cellular Automata

In [Wolfram 1982; Wolfram 1983; Wolfram 2002], the backtracking of one-dimensional cellular automata is to find out which of the 2n possible initial configurations of width n evolve to a specific configuration. In this paper, in one-dimensional cellular automata for a specific configuration of width n, its unique initial configuration can be found by mean of the proposed quantum algorithm with polynomial quantum gates, polynomial quantum bits and the successful probability that is the same as that of Shor's quantum order-finding algorithm in [Shor 1994].

cs.DS↗

Quantum emulation of classical dynamics

In statistical mechanics, it is well known that finite-state classical lattice models can be recast as quantum models, with distinct classical configurations identified with orthogonal basis states. This mapping makes classical statistical mechanics on a lattice a special case of quantum statistical mechanics, and classical combinatorial entropy a special case of quantum entropy. In a similar manner, finite-state classical dynamics can be recast as finite-energy quantum dynamics. This mapping translates continuous quantities, concepts and machinery of quantum mechanics into a simplified finite-state context in which they have a purely classical and combinatorial interpretation. For example, in this mapping quantum average energy becomes the classical update rate. Interpolation theory and communication theory help explain the truce achieved here between perfect classical determinism and quantum uncertainty, and between discrete and continuous dynamics.

quant-ph↗

Integral Value Transformations: A Class of Affine Discrete Dynamical Systems and an Application

In this paper, the notion of Integral Value Transformations (IVTs), a class of Discrete Dynamical Maps has been introduced. Then notion of Affine Discrete Dynamical System (ADDS) in the light of IVTs is defined and some rudimentary mathematical properties of the system are depicted. Collatz Conjecture is one of the most enigmatic problems in 20th Century. The Conjecture was posed by German Mathematician L. Collatz in 1937. There are much advancement in generalizing and defining analogous conjectures, but even to the date, there is no fruitful result for the advancement for the settlement of the conjecture. We have made an effort to make a Collatz type problem in the domain of IVTs and we have been able to solve the problem in 2011 [1]. Here mainly, we have focused and inquired on Collatz-like ADDS. Finally, we have designed the Optimal Distributed and Parallel Environment (ODPE) in the light of ADDS.

cs.DM↗

Cooperative game in a two-lane traffic flow

We use cellular automata model to study the cooperation between cyclists. In the two-lane model, cyclists can change lanes. Even there is someone on the back they will take a cooperative attitude. It means that they will be in a same lattice. Simulation carried out under the open borders. Simulation results show that the density in a certain area appeared surge. When the (or) is constant and (or) changes in isometric, the distance between the curves are getting closer. If and close to the limit 1 or 0, a dramatic change has been observed in density profile.

nlin.CG↗

Eco-Evolutionary Feedback in Host--Pathogen Spatial Dynamics

Spatial extent is a complicating factor in mathematical biology. The possibility that an action at point A cannot immediately affect what happens at point B creates the opportunity for spatial nonuniformity. This nonuniformity must change our understanding of evolutionary dynamics, as the same organism in different places can have different expected evolutionary outcomes. Since organism origins and fates are both determined locally, we must consider heterogeneity explicitly to determine its effects. We use simulations of spatially extended host--pathogen and predator--prey ecosystems to reveal the limitations of standard mathematical treatments of spatial heterogeneity. Our model ecosystem generates heterogeneity dynamically; an adaptive network of hosts on which pathogens are transmitted arises as an emergent phenomenon. The structure and dynamics of this network differ in significant ways from those of related models studied in the adaptive-network field. We use a new technique, organism swapping, to test the efficacy of both simple approximations and more elaborate moment-closure methods, and a new measure to reveal the timescale dependence of invasive-strain behavior. Our results demonstrate the failure not only of the most straightforward ("mean field") approximation, which smooths over heterogeneity entirely, but also of the standard correction ("pair approximation") to the mean field treatment. In spatial contexts, invasive pathogen varieties can prosper initially but perish in the medium term, implying that the concepts of reproductive fitness and the Evolutionary Stable Strategy have to be modified for such systems.

nlin.CG↗