Search results for "AUTOMATA"
showing 10 items of 453 documents
Design and simulation of efficient combinational circuits based on a new XOR structure in QCA technology
2021
AbstractQuantum-dot cellular automata (QCA), due to its unique characteristics like low power consumption, nanoscale design, and high computing speed is considered as an emerging technology, and it can be used as an alternative for CMOS technology in circuit design for quantum computers in the near future. XOR gate has many applications in the design of digital circuits in QCA. In this paper, an efficient novel structure of XOR gate is proposed in QCA. Also, a novel 1-bit comparator circuit, 1-bit full adder, binary to gray and gray to binary convertor code based on the proposed XOR is designed and simulated using QCADesigner 2.0.3. The simulation results demonstrated that the proposed stru…
Modelling the shrub encroachment in a grassland with a Cellular Automata Model
2018
Abstract. Arid and semi-arid grasslands of southwestern North America have changed dramatically over the last 150 years as a result of shrub encroachment, i.e. the increase in density, cover and biomass of indigenous shrubby plants in grasslands. Numerous studies have documented the expansion of shrublands in the southwestern American grasslands; in particular shrub encroachment has occurred strongly in part of the northern Chihuahuan desert since 1860. This encroachment has been simulated using an ecohydrological Cellular Automata model, CATGraSS. It is a spatially distributed model driven by spatially explicit irradiance and runs on a fine-resolution gridded domain. Plant competition is m…
Design and simulation of QCA-based 3-bit binary to gray and vice versa code converter in reversible and non-reversible mode
2022
The current Very Large-Scale Integration (VLSI) technology has reached its peak due to the fundamental physical limits of Complementary Metal-Oxide-Semiconductor (CMOS). Quantum-dot Cellular Automata (QCA) is considered a proper alternative to CMOS technology in digital circuit design. QCA has features like low power, small area, and high speed in nanoscale digital circuit design. A code converter is a circuit that converts a determined code to another one. Code converters such as Binary to Gray, Gray to Binary, and Binary to BCD converters have a crucial role in fast signal processing in digital systems. Also, code converters are used as a base unit for data transmission into the Arithmeti…
An Integrated Framework for Web Services Orchestration
2009
International audience; Currently, Web services give place to active research and this is due both to industrial and theoretical factors. On one hand, Web services are essential as the design model of applications dedicated to the electronic business. On the other hand, this model aims to become one of the major formalisms for the design of distributed and cooperative applications in an open environment (the Internet). In this article, the authors will focus on two features of Web services. The first one concerns the interaction problem: given the interaction protocol of a Web service described in BPEL, how to generate the appropriate client? Their approach is based on a formal semantics fo…
Neuro-radiosurgery treatments: MRI brain tumor seeded image segmentation based on a cellular automata model
2016
Gross Tumor Volume (GTV) segmentation on medical images is an open issue in neuro-radiosurgery. Magnetic Resonance Imaging (MRI) is the most promi-nent modality in radiation therapy for soft-tissue anatomical districts. Gamma Knife stereotactic neuro-radiosurgery is a mini-invasive technique used to deal with inaccessible or insufficiently treated tumors. During the planning phase, the GTV is usually contoured by radiation oncologists using a manual segmentation procedure on MR images. This methodology is certainly time-consuming and op-erator-dependent. Delineation result repeatability, in terms of both intra- and inter-operator reliability, is only obtained by using computer-assisted appr…
ON-LINE CONSTRUCTION OF A SMALL AUTOMATON FOR A FINITE SET OF WORDS
2012
In this paper we describe a "light" algorithm for the on-line construction of a small automaton recognising a finite set of words. The algorithm runs in linear time. We carried out good experimental results on real dictionaries, on biological sequences and on the sets of suffixes (resp. factors) of a set of words that shows how our automaton is near to the minimal one. For the suffixes of a text, we propose a modified construction that leads to an even smaller automaton. We moreover construct linear algorithms for the insertion and deletion of a word in a finite set, directly from the constructed automaton.
Modélisation et simulation multi-agents de la dynamique urbaine : application à la mobilité résidentielle
2007
From a conceptual and methodological reflection about an effective association of system based cellular automata and multi-agents models, the simulation model VisualSimores was conceived in order to give even partially, a response concerning the impact of residential mobility in urban areas. According to the goal to develop a support system for urban planning, the major interest of this approach is to focus on the relationship between two separately observable phenomena: the residential mobility of household on one hand and the urban dynamics on the other hand. Then it becomes particularly important to identify the reasoning that helps to establish a correspondence between the demands of di…
Some Contributions to the Algebraic Theory of Automata
2015
En el present treball estudiarem els autòmats des d'una perspectiva tant algebraica com coalgebraica. Volem aprofitar la natura dual d'aquests objectes per a presentar un marc unificador que explique i estenga alguns resultats recents de la teoria d'autòmats. Per tant, la secció 2 conté nocions i definicions preliminars per a mantenir el treball tan contingut com siga possible. Així, presentarem les nocions d'àlgebra i coàlgebra per a un endofunctor. També introduirem alguns conceptes sobre monoides i llenguatges. En aquest capítol també exposarem les nocions d'autòmats deterministes i no deterministes, homomorfismes i bisimulacions d'autòmats i productes i coproductes d'aquestes estructure…
On Prefix Normal Words
2011
We present a new class of binary words: the prefix normal words. They are defined by the property that for any given length $k$, no factor of length $k$ has more $a$'s than the prefix of the same length. These words arise in the context of indexing for jumbled pattern matching (a.k.a. permutation matching or Parikh vector matching), where the aim is to decide whether a string has a factor with a given multiplicity of characters, i.e., with a given Parikh vector. Using prefix normal words, we give the first non-trivial characterization of binary words having the same set of Parikh vectors of factors. We prove that the language of prefix normal words is not context-free and is strictly contai…
Vortex dynamics in rotating counterflow and plane Couette and Poiseuille turbulence in superfluid Helium
2008
An equation previously proposed to describe the evolution of vortex line density in rotating counterflow turbulent tangles in superfluid helium is generalized to incorporate nonvanishing barycentric velocity and velocity gradients. Our generalization is compared with an analogous approach proposed by Lipniacki, and with experimental results by Swanson et al. in rotating counterflow, and it is used to evaluate the vortex density in plane Couette and Poiseuille flows of superfluid helium.