Search results for "Cellular Automata"
showing 10 items of 113 documents
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…
Cellular automata and urban development simulation : a transition rules creation process based on statistical analysis
2015
National audience; Nowadays land use evolution study has become a major stake in urban planning. The main focus is to understand the way in which land use evolves across time and to understand processes that take place. This understanding would allow to plan urban developments based on a knowledge as complete as possible covering as many fields as possible (i.e. urban planning, politics, sociology, etc.). Simulation tools can be used to merge and display different points of view and stakes from different stakeholders (Parrott & Meyer, 2012).
Generating Multi State Cellular Automata by using Chua’s ”Universal Neuron”
2007
Modeling the role of climate change on small-scale vegetation patterns in a Mediterranean basin using a Cellular Automata model
2013
Predicting vegetation response in regions of ecotone transition under a changing climate is a among grand challenges in ecohydrology. In a small basin (1.3 sq km) in Sicily, Italy, where north-facing slopes are characterized by Quercus (tree), and south-facing slopes by Opuntia ficus-indaca (evergreen perennial species drought tolerant) and grasses we use an ecohydrological Cellular-Automaton model (CATGraSS) of vegetation coexistence driven by rainfall and solar radiation with downscaled future climate to examine the role of climate change on vegetation patterns. In the model, each cell can hold a single plant type or can be bare soil. Plant competition is modeled explicitly by keeping tra…
Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States
2008
Quantum finite automata with mixed states are proved to be super-exponentially more concise rather than quantum finite automata with pure states. It was proved earlier by A.Ambainis and R.Freivalds that quantum finite automata with pure states can have exponentially smaller number of states than deterministic finite automata recognizing the same language. There was a never published "folk theorem" proving that quantum finite automata with mixed states are no more than super-exponentially more concise than deterministic finite automata. It was not known whether the super-exponential advantage of quantum automata is really achievable. We use a novel proof technique based on Kolmogorov complex…
Reduction of the number of spectral bands in Landsat images: a comparison of linear and nonlinear methods
2006
We describe some applications of linear and nonlinear pro- jection methods in order to reduce the number of spectral bands in Land- sat multispectral images. The nonlinear method is curvilinear component analysis CCA, and we propose an adapted optimization of it for image processing, based on the use of principal-component analysis PCA, a linear method. The principle of CCA consists in reproducing the topol- ogy of the original space projection points in a reduced subspace, keep- ing the maximum of information. Our conclusions are: CCA is an im- provement for dimension reduction of multispectral images; CCA is really a nonlinear extension of PCA; CCA optimization through PCA called CCAinitP…
An efficient swap algorithm for the lattice Boltzmann method
2007
During the last decade, the lattice-Boltzmann method (LBM) as a valuable tool in computational fluid dynamics has been increasingly acknowledged. The widespread application of LBM is partly due to the simplicity of its coding. The most well-known algorithms for the implementation of the standard lattice-Boltzmann equation (LBE) are the two-lattice and two-step algorithms. However, implementations of the two-lattice or the two-step algorithm suffer from high memory consumption or poor computational performance, respectively. Ultimately, the computing resources available decide which of the two disadvantages is more critical. Here we introduce a new algorithm, called the swap algorithm, for t…
Parallelization of Cellular Automata for Surface Reactions
2002
We present a parallel implementation of cellular automata to simulate chemical reactions on surfaces. The scaling of the computer time with the number of processors for this parallel implementation is quite close to the ideal T/P, where T is the computer time used for one single processor and P the number of processors. Two examples are presented to test the algorithm, the simple A+B->0 model and a realistic model for CO oxidation on Pt(110). By using large parallel simulations, it is possible to derive scaling laws which allow us to extrapolate to even larger system sizes and faster diffusion coefficients allowing us to make direct comparisons with experiments.
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.
Capabilities of Ultrametric Automata with One, Two, and Three States
2016
Ultrametric automata use p-adic numbers to describe the random branching of the process of computation. Previous research has shown that ultrametric automata can have a significant decrease in computing complexity. In this paper we consider the languages that can be recognized by one-way ultrametric automata with one, two, and three states. We also show an example of a promise problem that can be solved by ultrametric integral automaton with three states.