Search results for "Automaton"
showing 10 items of 257 documents
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…
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…
The dual equivalence of equations and coequations for automata
2015
The transition structure α : X ? X A of a deterministic automaton with state set X and with inputs from an alphabet A can be viewed both as an algebra and as a coalgebra. We use this algebra-coalgebra duality as a common perspective for the study of equations and coequations. For every automaton ( X , α ) , we define two new automata: free ( X , α ) and cofree ( X , α ) representing, respectively, the greatest set of equations and the smallest set of coequations satisfied by ( X , α ) . Both constructions are shown to be functorial. Our main result is that the restrictions of free and cofree to, respectively, preformations of languages and to quotients A * / C of A * with respect to a congr…
Artificial organisms as tools for the development of psychological theory: Tolman's lesson
2007
In the 1930s and 1940s, Edward Tolman developed a psychological theory of spatial orientation in rats and humans. He expressed his theory as an automaton (the ‘‘schematic sowbug’’) or what today we would call an ‘‘artificial organism.’’ With the technology of the day, he could not implement his model. Nonetheless, he used it to develop empirical predictions which tested with animals in the laboratory. This way of proceeding was in line with scientific practice dating back to Galileo. The way psychologists use artificial organisms in their work today breaks with this tradition. Modern ‘‘artificial organisms’’ are constructed a posteriori, working from experimental or ethological observations…
Channel selection in Cognitive Radio Networks: A Switchable Bayesian Learning Automata approach
2013
We consider the problem of a user operating within a Cognitive Radio Network (CRN) which involves N channels each associated with a Primary User (PU). The problem consists of allocating a channel which, at any given time instant is not being used by a PU, to a Secondary User (SU). Within our study, we assume that a SU is allowed to perform “channel switching”, i.e., to choose an alternate channel S times (where S +1 ≤ N) if the previous choice does not lead to a channel which is vacant. The paper first presents a formal probabilistic model for the problem itself, referred to as the Formal Secondary Channel Selection (FSCS) problem, and the characteristics of the FSCS are then analyzed. Ther…
Hamming, Permutations and Automata
2007
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 superexponentially more concise than deterministic finite automata. It was not known whether the super-exponential advantage of quantum automata is really achievable. We prove that there is an infinite sequence of distinct int…
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…