Search results for "Cellular Automaton"
showing 10 items of 77 documents
Constraint Cellular Automata for Urban Development Simulation: An Application to the Strasbourg-Kehl Cross-Border Area
2017
AcknowledgementsThe research presented in this chapter is part of the Smart. Boundary project supported by the Fonds National de la Recherche in Luxembourg and CNRS in France (ref. INTER/CNRS/12/02). The authors would like also to thank the Grasp Program of LISER for allowing cross-collaboration between the two teams based in Luxembourg and France.; International audience; Urban sprawl and space consumption have become key issues in sustainable territorial development. Traditional planning approaches are often insufficient to anticipate their complex spatial consequences, especially in cross-border areas. Such complexity requires the use of dynamic spatial simulations and the development of…
(H, ρ)-induced dynamics and the quantum game of life
2017
Abstract We propose an extended version of quantum dynamics for a certain system S , whose evolution is ruled by a Hamiltonian H, its initial conditions, and a suitable set ρ of rules, acting repeatedly on S . The resulting dynamics is not necessarily periodic or quasi-periodic, as one could imagine for conservative systems with a finite number of degrees of freedom. In fact, it may have quite different behaviors depending on the explicit forms of H, ρ as well as on the initial conditions. After a general discussion on this (H, ρ)-induced dynamics, we apply our general ideas to extend the classical game of life, and we analyze several aspects of this extension.
Social Simulation Based on Cellular Automata: Modeling Language Shifts
2011
Nowadays, language shifts (i.e., a community of speakers stops using their traditional language and speaks a new one in all communication settings) may produce a massive extinction of languages throughout the world. In this context, an important task for social sciences research should therefore be to achieve a deep comprehension of language shifts. However, modeling the social and behavioral variables that guide the social behavior of individuals and groups has traditionally been tricky in all the social sciences. In this situation, social simulation provides a tool for testing hypotheses and building models of social phenomena (see, for example, Gilbert, 1996; Gilbert & Toitzsch, 2005; an…
A generic model of reinforcement learning combined with macroscopic cellular automata to simulate land use change
2019
Better understanding the evolution of land cover is a priority concern in the field of land use change study. This evolution can be the result of interactions between major factors. The study of land use change is included in territorial planning to inform planners and policy makers of possible developments they will face. Land use models are useful for reasonable land use management to optimize future land management decisions. In this paper we present an original theoretical model of reinforcement learning combined with macroscopic cellular automata to simulate land use change.
Speeding up of microstructure reconstruction: II. Application to patterns of poly-dispersed islands
2015
We report a fast, efficient and credible statistical reconstruction of any two-phase patterns of islands of miscellaneous shapes and poly-dispersed in sizes. In the proposed multi-scale approach called a weighted doubly-hybrid, two different pairs of hybrid descriptors are used. As the first pair, we employ entropic quantifiers, while correlation functions are the second pair. Their competition allows considering a wider spectrum of morphological features. Instead of a standard random initial configuration, a synthetic one with the same number of islands as that of the target is created by a cellular automaton. This is the key point for speeding-up of microstructure reconstruction, making u…
Speeding up of microstructure reconstruction: I. Application to labyrinth patterns
2011
Recently, entropic descriptors based the Monte Carlo hybrid reconstruction of the microstructure of a binary/greyscale pattern has been proposed (Piasecki 2011 Proc. R. Soc. A 467 806). We try to speed up this method applied in this instance to the reconstruction of a binary labyrinth target. Instead of a random configuration, we propose to start with a suitable synthetic pattern created by cellular automaton. The occurrence of the characteristic attributes of the target is the key factor for reducing the computational cost that can be measured by the total number of MC steps required. For the same set of basic parameters, we investigated the following simulation scenarios: the biased/rando…
A GPU-Based Multi-agent System for Real-Time Simulations
2010
The huge number of cores existing in current Graphics Processor Units (GPUs) provides these devices with computing capabilities that can be exploited by distributed applications. In particular, these capabilites have been used in crowd simulations for enhancing the crowd rendering, and even for simulating continuum crowds. However, GPUs have not been used for simulating large crowds of complex agents, since these simulations require distributed architectures that can support huge amounts of agents. In this paper, we propose a GPU-based multi-agent system for crowd simulation. Concretely, we propose the use of an on-board GPU to implement one of the main tasks that a distributed server for c…
Interactive Terrain Simulation and Force Distribution Models in Sand Piles
2006
This paper presents an application of Cellular Automata in the field of dry Granular Systems modelling While the study of granular systems is not a recent field, no efficient models exist, from a computational point of view, in classical methodologies Some previous works showed that the use of Cellular Automata is suitable for the development of models that can be used in real time applications This paper extends the existing Cellular Automata models in order to make them interactive A model for the reaction to external forces and a pressure distribution model are presented and analyzed, with numerical examples and simulations.
Superiority Of One-Way And Realtime Quantum Machines
2012
In automata theory, quantum computation has been widely examined for finite state machines, known as quantum finite automata (QFAs), and less attention has been given to QFAs augmented with counters or stacks. In this paper, we focus on such generalizations of QFAs where the input head operates in one-way or realtime mode, and present some new results regarding their superiority over their classical counterparts. Our first result is about the nondeterministic acceptance mode: Each quantum model architecturally intermediate between realtime finite state automaton and one-way pushdown automaton (one-way finite automaton, realtime and one-way finite automata with one-counter, and realtime push…
Language Recognition Power and Succinctness of Affine Automata
2016
In this work we study a non-linear generalization based on affine transformations of probabilistic and quantum automata proposed recently by Diaz-Caro and Yakaryilmaz [6] referred as affine automata. First, we present efficient simulations of probabilistic and quantum automata by means of affine automata which allows us to characterize the class of exclusive stochastic languages. Then, we initiate a study on the succintness of affine automata. In particular, we show that an infinite family of unary regular languages can be recognized by 2-state affine automata, whereas the number of states of any quantum and probabilistic automata cannot be bounded. Finally, we present the characterization …