Search results for "Cellular Automata"

showing 10 items of 113 documents

Is land-use change a cause of loss of pedodiversity? The case of the Mazzarrone study area, Sicily

2011

Anthropogenic soils created ex novo by land-us e change in large scale farming are, from a pedogenetic point of view, catastrophic events that bring the soils to time zero and change the natural pattern of the soilscape, remarkably, in some cases. The qu antitative aspects of pedodiversity of a soilsc ape in South-East Sicily, where some types of soils, in recent decades, have suffered a consistent reduction due to the transformations by large scale farming, are considered. The evolution of pedodiversity over a 53-year period (1955 to 2008 ) is examined using a dedicated statistical method and a space – time model based on Markov analysis and cellular autom ata in order to predict the evolu…

HydrologyDiversity indexLand useSettore AGR/14 - PedologiaPedodiversity Anthropogenic soils Soil space –time modeling Markov analysis Cellular automataSpecies diversityLand use land-use change and forestrySpecies richnessScale (map)PedodiversityGeologyEarth-Surface ProcessesUSDA soil taxonomyGeomorphology
researchProduct

Simplified Probabilistic-Topologic Model for Reproducing Hillslope Rill Network Surface Runoff

2015

AbstractThis work presents a simplified probabilistic-topologic model for reproducing rill network surface runoff on a square-plane hillslope. The model requires only two parameters: the first is related to the production capacity of overland flow of the hillslope, at the initial conditions of the process, and the second depends on the sinuosity of the rill network. From a hydrological point of view, the following parameters account for the effects that essentially delineate the hydrologic response of a natural hillslope: rainfall intensity, hillslope roughness, and slope. Obviously, the reliability of the model is pending experimental validation that has only just begun. However, a prelimi…

Hydrologygeographygeography.geographical_feature_categoryProbabilistic logicSurface finishSinuosityExperimental validationAgricultural and Biological Sciences (miscellaneous)RillHydrology (agriculture)Settore AGR/08 - Idraulica Agraria E Sistemazioni Idraulico-ForestaliSurface runoffsurface runoff cellular automata hillslopeGeologyIntensity (heat transfer)Water Science and TechnologyCivil and Structural EngineeringJournal of Irrigation and Drainage Engineering
researchProduct

Salvador Beltran, F., Herrando, S., Estreder, V., Ferreres, D., Adell, M. A., i Ruiz-Soler, M. (2011). A language shift simulation based on cellular …

2016

IGI Global Artículo [Salvador Beltran F. Herrando S. Estreder V. Ferreres D. Adell M. A. i Ruiz-Soler M. (2011). A language shift simulation based on cellular automata. En E. G. Blanchard i D. Allard (Eds.) Handbook of research on culturally-aware information technology. Perspectives and models (pp. 136-150). Hershey NY]:PSICOLOGÍA [UNESCO]Salvador Beltran F. Herrando S. Estreder V. Ferreres D. Adell M. A. i Ruiz-Soler M. (2011). A language shift simulation based on cellular automata. En E. G. Blanchard i D. Allard (Eds.) Handbook of research on culturally-aware information technology. Perspectives and models (pp. 136-150). Hershey NY: IGI Global ArtículoUNESCO::PSICOLOGÍA
researchProduct

Representation of Autonomous Automata

2001

An autonomous automaton is a finite automaton with output in which the input alphabet has cardinality one when special reduced. We define the transition from automata to semigroups via a representation successful if given two incomparable automata (neither simulate the other), the semigroups representing the automata are distinct. We show that representation by the transition semigroup is not successful. We then consider a representation of automata by semigroups of partial transformations. We show that in general transition from automata to semigroups by this representation is not successful either. In fact, the only successful transition presented is the transiton to this semigroup of par…

Krohn–Rhodes theoryDiscrete mathematicsNested wordFinite-state machineMathematics::Operator AlgebrasComputer scienceSemigroupTimed automatonω-automatonNonlinear Sciences::Cellular Automata and Lattice GasesMobile automatonAutomatonNondeterministic finite automaton with ε-movesStochastic cellular automatonDeterministic finite automatonDFA minimizationDeterministic automatonContinuous spatial automatonSpecial classes of semigroupsQuantum finite automataAutomata theoryTwo-way deterministic finite automatonNondeterministic finite automatonComputer Science::Formal Languages and Automata Theory
researchProduct

A description based on languages of the final non-deterministic automaton

2014

The study of the behaviour of non-deterministic automata has traditionally focused on the languages which can be associated to the different states. Under this interpretation, the different branches that can be taken at every step are ignored. However, we can also take into account the different decisions which can be made at every state, that is, the branches that can be taken, and these decisions might change the possible future behaviour. In this case, the behaviour of the automata can be described with the help of the concept of bisimilarity. This is the kind of description that is usually obtained when the automata are regarded as labelled transition systems or coalgebras. Contrarily t…

Nested wordTheoretical computer scienceGeneral Computer ScienceTimed automatonLlenguatges de programacióω-automatonTheoretical Computer ScienceDeterministic pushdown automatonCoalgebraFinal automatonDeterministic automatonQuantum finite automataAutomatitzacióComputer Science::DatabasesMathematicsDiscrete mathematicsNonlinear Sciences::Cellular Automata and Lattice GasesNon-deterministic automatonMobile automatonBisimilarityComputer Science::Programming LanguagesAutomata theoryFormal languageÀlgebraMATEMATICA APLICADAComputer Science::Formal Languages and Automata Theory
researchProduct

Real-Time Vector Automata

2013

We study the computational power of real-time finite automata that have been augmented with a vector of dimension k, and programmed to multiply this vector at each step by an appropriately selected k×k matrix. Only one entry of the vector can be tested for equality to 1 at any time. Classes of languages recognized by deterministic, nondeterministic, and "blind" versions of these machines are studied and compared with each other, and the associated classes for multicounter automata, automata with multiplication, and generalized finite automata.

Nondeterministic algorithmDiscrete mathematicsMatrix (mathematics)TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESFinite-state machineDimension (vector space)Computer scienceMultiplicationNonlinear Sciences::Cellular Automata and Lattice GasesComputer Science::Formal Languages and Automata TheoryAutomatonPower (physics)
researchProduct

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.

Nonlinear Sciences::Cellular Automata and Lattice GasesRobotsAutomatització
researchProduct

Semipredictable dynamical systems

2015

A new class of deterministic dynamical systems, termed semipredictable dynamical systems, is presented. The spatiotemporal evolution of these systems have both predictable and unpredictable traits, as found in natural complex systems. We prove a general result: The dynamics of any deterministic nonlinear cellular automaton (CA) with $p$ possible dynamical states can be decomposed at each instant of time in a superposition of $N$ layers involving $p_{0}$, $p_{1}$,... $p_{N-1}$ dynamical states each, where the $p_{k\in \mathbb{N}}$, $k \in [0, N-1]$ are divisors of $p$. If the divisors coincide with the prime factors of $p$ this decomposition is unique. Conversely, we also prove that $N$ CA w…

Numerical AnalysisDynamical systems theoryCellular Automata and Lattice Gases (nlin.CG)Applied MathematicsComplex systemFOS: Physical sciencesMathematical Physics (math-ph)Nonlinear Sciences - Chaotic Dynamics01 natural sciencesCellular automaton010305 fluids & plasmasCombinatoricsNonlinear systemSuperposition principleModeling and Simulation0103 physical sciencesPrime factorChaotic Dynamics (nlin.CD)Moufang loop010306 general physicsNonlinear Sciences - Cellular Automata and Lattice GasesMathematical PhysicsMathematicsCommunications in Nonlinear Science and Numerical Simulation
researchProduct

Classifier Optimized for Resource-constrained Pervasive Systems and Energy-efficiency

2017

Computational intelligence is often used in smart environment applications in order to determine a user’scontext. Many computational intelligence algorithms are complex and resource-consuming which can beproblematic for implementation devices such as FPGA:s, ASIC:s and low-level microcontrollers. Thesetypes of devices are, however, highly useful in pervasive and mobile computing due to their small size,energy-efficiency and ability to provide fast real-time responses. In this paper, we propose a classi-fier, CORPSE, specifically targeted for implementation in FPGA:s, ASIC:s or low-level microcontrollers.CORPSE has a small memory footprint, is computationally inexpensive, and is suitable for…

Parallel computingMicrocontrollerEnergy-efficientGeneral Computer ScienceComputer scienceDistributed computingComputational intelligenceCellular AutomataClassifierlcsh:QA75.5-76.95EmbeddedAnnan elektroteknik och elektronikEnergy-savingFPGAOther Electrical Engineering Electronic Engineering Information Engineeringbusiness.industryComputer SciencesComputational MathematicsDatavetenskap (datalogi)Embedded systemPervasive systemsSmart environmentlcsh:Electronic computers. Computer sciencebusinessClassifier (UML)Efficient energy use
researchProduct

Can the Double Exchange Cause Antiferromagnetic Spin Alignment?

2020

The effect of the double exchange in a square-planar mixed-valence dn+1&minus

PhysicsCondensed matter physicsSpinsdouble exchangeElectrontetrameric mixed valence clusterselectron transferAntiparallel (biochemistry)Polarization (waves)Electronic Optical and Magnetic Materialslcsh:ChemistryCondensed Matter::Materials ScienceDelocalized electronlcsh:QD1-999FerromagnetismChemistry (miscellaneous)Materials Chemistrymixed-valenceAntiferromagnetismCondensed Matter::Strongly Correlated Electronsquantum cellular automatamagnetic exchangeSpin-½Magnetochemistry
researchProduct