Search results for "Cellular Automaton"
showing 7 items of 77 documents
Complex Adaptive Systems and Agent-Based Modelling
2015
In a labour–education market system, there are many individuals and firms with adaptive behaviour. As we have seen in the previous chapter, networks are prevalent in LEMS and play an important role in many decisions of its actors. Thus, LEMS can be analysed as a complex adaptive system (CAS). Agent-based modelling (ABM) is typically used for such purposes, and the next chapter will dig into details of various ways of applying ABM in modelling LEMS. To be ready for it, we first have to understand the motivation behind and the details of this method. This is what will be discussed here.
Improved constructions of quantum automata
2008
We present a simple construction of quantum automata which achieve an exponential advantage over classical finite automata. Our automata use \frac{4}{\epsilon} \log 2p + O(1) states to recognize a language that requires p states classically. The construction is both substantially simpler and achieves a better constant in the front of \log p than the previously known construction of Ambainis and Freivalds (quant-ph/9802062). Similarly to Ambainis and Freivalds, our construction is by a probabilistic argument. We consider the possibility to derandomize it and present some results in this direction.
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…
Morphological similarities between DBM and an economic geography model of city growth
2009
International audience; An urban microeconomic model of households evolving in a 2Dcellular automata allows to simulate the growth of a metropolitan area whereland is devoted to housing, road network and agricultural/green areas. Thissystem is self-organised: based on individualistic decisions of economic agentswho compete on the land market, the model generates a metropolitan area withhouses, roads, and agriculture. Several simulation are performed. The resultsshow strong similarities with physical Dieletric breackdown models (DBM). Inparticular, phase transitions in the urban morphology occur when a controlparameter reaches critical values. Population density in our model and theelectric …
GTVcut for neuro-radiosurgery treatment planning: an MRI brain cancer seeded image segmentation method based on a cellular automata model
2018
Despite of the development of advanced segmentation techniques, achieving accurate and reproducible gross tumor volume (GTV) segmentation results is still an important challenge in neuro-radiosurgery. Nowadays, magnetic resonance imaging (MRI) is the most prominent modality in radiation therapy for soft-tissue anatomical districts. Gamma Knife stereotactic neuro-radiosurgery is a minimally invasive technology for dealing with inaccessible or insufficiently treated tumors with traditional surgery or radiotherapy. During a treatment planning phase, the GTV is generally contoured by experienced neurosurgeons and radiation oncologists using fully manual segmentation procedures on MR images. Unf…
Modeling Local Social Migrations: A Cellular Automata Approach
2015
In local social migrations, agents move from their initial location looking for a better local social environment. Social migrations processes do not change the number of social agents of a given type (i.e., the empirical distribution of the population) but their spatial location. Although cellular automata seems to appear as a natural approach to model of social migrations, the evolution of the configuration through a cellular automata might induce a new configuration wherein the number of agents of each type might be actually modified. This article provides a characterization of these cellular automata rules such that for any initial empirical distribution, the evolution of the configurat…
Quantum versus Probabilistic One-Way Finite Automata with Counter
2001
The paper adds the one-counter one-way finite automaton [6] to the list of classical computing devices having quantum counterparts more powerful in some cases. Specifically, two languages are considered, the first is not recognizable by deterministic one-counter one-way finite automata, the second is not recognizable with bounded error by probabilistic one-counter one-way finite automata, but each recognizable with bounded error by a quantum one-counter one-way finite automaton. This result contrasts the case of one-way finite automata without counter, where it is known [5] that the quantum device is actually less powerful than its classical counterpart.