Dissertations / Theses: 'Cellullar automata'

1

Herr, Christiane Margerita. "From form generators to automated diagrams using cellular automata to support architectural design /." Thesis, Click to view the E-thesis via HKUTO, 2008. http://sunzi.lib.hku.hk/hkuto/record/B39848954.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Luža, Jindřich. "Návrh výpočetních struktur v celulárních automatech." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2014. http://www.nusl.cz/ntk/nusl-236089.

Full text

Abstract:

The goal of this master thesis is to examine possibilities of realizing comptutational structures in cellular automata. The work describes the fundamental principles of cellular automata and summarizes some ways of how to achive the specified goal. An overview of Turing-complete and other specialized computational tasks is proposed considering both 1D and 2D cellular automata. It is shown that different computational scenarios in cellular automata can be considered with various setups of the input and output arrangements. With regard to showed inputs and outputs arrangement, sets of tests is designed to find solutions of choosen computational structures on cellular automata with use of choosen evolutionary algorithm. Found solutions are compared by computational resources consumption and difficulty of discovery later.

APA, Harvard, Vancouver, ISO, and other styles

3

Collins, Sean. "Interactive cellular automata." Thesis, Lancaster University, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.435877.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Olkerud, Marcus, and Martin Virke. "Processuell generering av oändliga spelvärldar : Praktiska problem och optimering." Thesis, Södertörns högskola, Institutionen för naturvetenskap, miljö och teknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:sh:diva-22949.

Full text

Abstract:

Enligt oss så är det största problemet med att processuellt generera en pseudo-oändlig spelvärld i realtid är att få genereringen att ske så sömlöst som möjligt samtidigt som världen upplevs som konsekvent. För att finna lösningar på detta problem så analyserar vi andra studier och spel som utnyttjar processuell generering. Vi använder sedan de metoder och tekniker vi funnit för skapandet av en egen applikation för att få en djupare förståelse för hur dessa fungerar i praktiken och hur mycket varje metod påverkar prestandan. I vår slutsats beskriver vi de problem vi fann, deras orsak och ger förslag på lösningar. På grund av studiens tekniska karaktär så riktar den sig främst till programmerare. Vi hoppas att med denna studie kunna komplettera andra studier inom detta, enligt oss, relativt outforskade område.
According to us, the biggest problem with procedurally generating a pseudo-infinite game world in real-time is to have it generate as seamlessly as possible and keeping the world consistent at the same time. In order to come up with solutions to this problem we analyzed other studies and games which utilize procedural generation. We then used the methods we found in order to create our own application to further understand how they work in practice and how much each method affexts the performance of said application. In our conclusion we describe the problems that arose as well as explain what caused them, as well as present possible solutions to them. Due to the technical nature of this study it is mainly aimed at programmers. We hope that this study can complement other studies within what we think is a relatively unexplored subject.

APA, Harvard, Vancouver, ISO, and other styles

5

NETO, OMAR PARANAIBA VILELA. "SIMULATION AND AUTOMATIC SYNTHESES OF QUANTUM DOTS CELLULAR AUTOMATA CIRCUITS THOUGHT INTELLIGENT TECHNIQUES." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2006. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=8729@1.

Full text

Abstract:

CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO
Esta dissertação investiga e propõe um novo simulador de circuitos de Autômatos Celulares com Pontos Quânticos (QCA) e uma nova metodologia para a criação e otimização de circuitos lógicos, utilizando técnicas da inteligência computacional. Autômatos Celulares com Pontos Quânticos é uma nova tecnologia, na escala nanométrica, que tem chamado a atenção dos pesquisadores por ser uma alternativa à tecnologia CMOS, cujo limite físico de miniaturização será atingido nos próximos anos. QCA tem um grande potencial no desenvolvimento de circuitos com maior densidade espacial, maior velocidade, baixa dissipação e baixo consumo de energia. Ao contrário das tecnologias tradicionais, QCA não codifica a informação pelo fluxo de corrente elétrica, mas pela configuração das cargas elétricas no interior das células. A interação coulombiana entre as células garante o fluxo da informação. Apesar de simples, essas características fazem com que a arquitetura de circuitos de QCA se torne não trivial. Portanto, a criação de um simulador e de uma metodologia de elaboração e síntese automática de circuitos possibilitam aos cientistas uma melhor visualização de como esses dispositivos funcionam, acelerando o desenvolvimento desses sistemas na escala nanométrica. Para atingir o objetivo proposto, técnicas de inteligência computacional, tais como redes neurais do tipo Hopfield, para o desenvolvimento do simulador, e algoritmos genéticos, para a metodologia de criação e otimização dos circuitos, foram empregadas. Os resultados encontrados foram significativos, comprovando que as técnicas da inteligência computacional podem ser uma ferramenta estratégica para o rápido desenvolvimento da nanoeletrônica e da nanotecnologia em geral.
This dissertation investigates and considers a new simulator of Quantum Dots Cellular Automata (QCA) Circuits and a new methodology for the synthesis and optimization of logical circuits, by means of Computational Intelligence. Quantum-dot Cellular Automata (QCA) is a new technology in the nanometric scale which has called attention from researchers as one alternative for the CMOS technology, which is reaching its physical limitation. QCA have a large potential in the development of circuits with high space density and low heat dissipation, and can allow the development of faster computers with lower power consumption. Differently from the conventional technologies, QCA do not codify information by means of electric current flow, but rather by the configuration of electrical charges in the interior of the cells. The Coulomb interaction between cells is responsible by the flow of information. Despite simple, these features become the design of logical devices into a non-trivial task. Therefore, the development of a simulator and a methodology of automatic synthesis of QCA circuits make possible to the scientist a better evaluation of how these circuits work, accelerating the development of these new systems in the nanometer scale. To reach the proposed target, Computational Intelligence techniques were used. The first results show that these techniques are capable of simulating efficiently and fast, synthesizing optimized circuits with a reduced number of cells. Such optimization reduces the possibility of failures and guarantees higher speed.

APA, Harvard, Vancouver, ISO, and other styles

6

Betel, Heather. "Properties and Behaviours of Fuzzy Cellular Automata." Thèse, Université d'Ottawa / University of Ottawa, 2012. http://hdl.handle.net/10393/22858.

Full text

Abstract:

Cellular automata are systems of interconnected cells which are discrete in space, time and state. Cell states are updated synchronously according to a local rule which is dependent upon the current state of the given cell and those of its neighbours in a pre-defined neighbourhood. The local rule is common to all cells. Fuzzy cellular automata extend this notion to systems which are discrete in space and time but not state. In this thesis, we explore fuzzy cellular automata which are created from the extension of Boolean rules in disjunctive normal form to continuous functions. Motivated by recent results on the classification of these rules from empirical evidence, we set out first to show that fuzzy cellular automata can shed some light on classical cellular automata and then to prove that the observed results are mathematically correct. The main results of this thesis can be divided into two categories. We first investigate the links between fuzzy cellular automata and their Boolean counter-parts. We prove that number conservation is preserved by this transformation. We further show that Boolean additive cellular automata have a definable property in their fuzzy form which we call self-oscillation. We then give a probabilistic interpretation of fuzzy cellular automata and show that homogeneous asymptotic states are equivalent to mean field approximations of Boolean cellular automata. We then turn our attention the asymptotic behaviour of fuzzy cellular automata. In the second half of the thesis we investigate the observed behaviours of the fuzzy cellular automata derived from balanced Boolean rules. We show that the empirical results of asymptotic behaviour are correct. In fuzzy form, the balanced rules can be categorized as one of three types: weighted average rules, self-averaging rules, and local majority rules. Each type is analyzed in a variety of ways using a range of tools to explain their behaviours.

APA, Harvard, Vancouver, ISO, and other styles

7

Forrester, David M. "Fuzzy Cellular Automata in Conjunctive Normal Form." Thèse, Université d'Ottawa / University of Ottawa, 2011. http://hdl.handle.net/10393/19987.

Full text

Abstract:

Cellular automata (CA) are discrete dynamical systems comprised of a lattice of finite-state cells. At each time step, each cell updates its state as a function of the previous state of itself and its neighbours. Fuzzy cellular automata (FCA) are a real-valued extension of Boolean cellular automata which "fuzzifies" Boolean logic in the transition function using real values between zero and one (inclusive). To date, FCA have only been studied in disjunctive normal form (DNF). In this thesis, we study FCA in conjunctive normal form (CNF). We classify FCA in CNF both analytically and empirically. We compare these classes to their DNF counterparts. We prove that certain FCA exhibit chaos in CNF, in contrast to the periodic behaviours of DNF FCA. We also briefly explore five different forms of fuzzy logic, and suggest further study. In support of this research, we introduce novel methods of simulating and visualizing FCA.

APA, Harvard, Vancouver, ISO, and other styles

8

Skorkovský, Petr. "Tvorba operačního systému založeného na evolučních a genetických algoritmech." Doctoral thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2013. http://www.nusl.cz/ntk/nusl-233610.

Full text

Abstract:

The main goal of the work is to introduce new ideas how traditional approaches for designing an operation system and associated software can be improved to be a part of automatic software evolution. It is generally supposed that algorithms found by the genetic programming processes cannot be used for exact calculations but only for approximate solutions. Several examples of software evolution are introduced, to show that quite precise solutions can be achieved. To reach this goal, characteristics of tree-like structures with approaches based on cellular automata features are combined in a new promising technique of algorithm representation, joining benefits of both concepts. An application has been developed based on these new genetic programming concepts and it is supposed it can be a part of a future automatic software evolution process.

APA, Harvard, Vancouver, ISO, and other styles

9

Epperlein, Jeremias. "Topological Conjugacies Between Cellular Automata." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-231823.

Full text

Abstract:

We study cellular automata as discrete dynamical systems and in particular investigate under which conditions two cellular automata are topologically conjugate. Based on work of McKinsey, Tarski, Pierce and Head we introduce derivative algebras to study the topological structure of sofic shifts in dimension one. This allows us to classify periodic cellular automata on sofic shifts up to topological conjugacy based on the structure of their periodic points. We also get new conjugacy invariants in the general case. Based on a construction by Hanf and Halmos, we construct a pair of non-homeomorphic subshifts whose disjoint sums with themselves are homeomorphic. From this we can construct two cellular automata on homeomorphic state spaces for which all points have minimal period two, which are, however, not topologically conjugate. We apply our methods to classify the 256 elementary cellular automata with radius one over the binary alphabet up to topological conjugacy. By means of linear algebra over the field with two elements and identities between Fibonacci-polynomials we show that every conjugacy between rule 90 and rule 150 cannot have only a finite number of local rules. Finally, we look at the sequences of finite dynamical systems obtained by restricting cellular automata to spatially periodic points. If these sequences are termwise conjugate, we call the cellular automata conjugate on all tori. We then study the invariants under this notion of isomorphism. By means of an appropriately defined entropy, we can show that surjectivity is such an invariant.

APA, Harvard, Vancouver, ISO, and other styles

10

Rakotomalala, Livaniaina Hary. "Network Decontamination Using Cellular Automata." Thesis, Université d'Ottawa / University of Ottawa, 2016. http://hdl.handle.net/10393/34095.

Full text

Abstract:

We consider the problem of decontaminating a network where all nodes are infected by a virus. The decontamination strategy is performed using a Cellular Automata (CA) model in which each node of the network is represented by the automata cell and thus, the network host status is also mapped to the CA state (contaminated, decontaminating, decontaminated). All hosts are assumed to be initially contaminated and the status of each cell is synchronously updated according to a set of local rules, based on the state of its neighbourhood. Our goal is to find the set of local rules that will accomplish the decontamination in an optimal way. The metrics used to define optimality is the minimization of three metrics: the maximum number of decontaminating cells at each step, the required value of the immunity time of each cell and the number of steps to complete the sanitization algorithm. In our research, we explore the designing of these local decontamination rules by refining the concept of the neighbourhood radius of CA with the addition of two new dimensions: Visibility Hop and Contamination Distance. Additionally, a research tool that help us manage our study have been developed.

APA, Harvard, Vancouver, ISO, and other styles

11

Weimar, Jorg Richard. "Cellular automata for reactive systems." Doctoral thesis, Universite Libre de Bruxelles, 1995. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/212557.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Deng, Mingyuan. "Programmable cellular automata for cryptosystems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ39137.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Serquera, Jaime. "Sound synthesis with cellular automata." Thesis, University of Plymouth, 2012. http://hdl.handle.net/10026.1/1189.

Full text

Abstract:

This thesis reports on new music technology research which investigates the use of cellular automata (CA) for the digital synthesis of dynamic sounds. The research addresses the problem of the sound design limitations of synthesis techniques based on CA. These limitations fundamentally stem from the unpredictable and autonomous nature of these computational models. Therefore, the aim of this thesis is to develop a sound synthesis technique based on CA capable of allowing a sound design process. A critical analysis of previous research in this area will be presented in order to justify that this problem has not been previously solved. Also, it will be discussed why this problem is worthwhile to solve. In order to achieve such aim, a novel approach is proposed which considers the output of CA as digital signals and uses DSP procedures to analyse them. This approach opens a large variety of possibilities for better understanding the self-organization process of CA with a view to identifying not only mapping possibilities for making the synthesis of sounds possible, but also control possibilities which enable a sound design process. As a result of this approach, this thesis presents a technique called Histogram Mapping Synthesis (HMS), which is based on the statistical analysis of CA evolutions by histogram measurements. HMS will be studied with four different automatons, and a considerable number of control mechanisms will be presented. These will show that HMS enables a reasonable sound design process. With these control mechanisms it is possible to design and produce in a predictable and controllable manner a variety of timbres. Some of these timbres are imitations of sounds produced by acoustic means and others are novel. All the sounds obtained present dynamic features and many of them, including some of those that are novel, retain important characteristics of sounds produced by acoustic means.

APA, Harvard, Vancouver, ISO, and other styles

14

Powley, Edward Jack. "Global properties of cellular automata." Thesis, University of York, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.516655.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Clewlow, Les. "Cellular automata and dynamical systems." Thesis, University of Warwick, 1989. http://wrap.warwick.ac.uk/4233/.

Full text

Abstract:

In this thesis we investigate the theoretical nature of the mathematical structures termed cellular automata. Chapter 1: Reviews the origin and history of cellular automata in order to place the current work into context. Chapter 2: Develops a cellular automata framework which contains the main aspects of cellular automata structure which have appeared in the literature. We present a scheme for specifying the cellular automata rules for this general model and present six examples of cellular automata within the model. Chapter 3: Here we develop a statistical mechanical model of cellular automata behaviour. We consider the relationship between variations within the model and their relationship to dynamical systems. We obtain results on the variance of the state changes, scaling of the cellular automata lattice, the equivalence of noise, spatial mixing of the lattice states and entropy, synchronous and asynchronous cellular automata and the equivalence of the rule probability and the time step of a discrete approximation to a dynamical system. Chapter 4: This contains an empirical comparison of cellular automata within our general framework and the statistical mechanical model. We obtain results on the transition from limit cycle to limit point behaviour as the rule probabilities are decreased. We also discuss failures of the statistical mechanical model due to failure of the assumptions behind it. Chapter 5: Here a practical application of the preceding work to population genetics is presented. We study this in the context of some established population models and show it may be most useful in the field of epidemiology. Further generalisations of the statistical mechanical and cellular automata models allow the modelling of more complex population models and mobile populations of organisms. Chapter 6: Reviews the results obtained in the context of the open questions introduced in Chapter 1. We also consider further questions this work raises and make some general comments on how these may apply to related fields.

APA, Harvard, Vancouver, ISO, and other styles

16

Slotta, Douglas J. "Structural Design Using Cellular Automata." Thesis, Virginia Tech, 2001. http://hdl.handle.net/10919/33368.

Full text

Abstract:

Traditional parallel methods for structural design do not scale well. This thesis discusses the application of massively scalable cellular automata (CA) techniques to structural design. There are two sets of CA rules, one used to propagate stresses and strains, and one to perform design analysis. These rules can be applied serially, periodically, or concurrently, and Jacobi or Gauss-Seidel style updating can be done. These options are compared with respect to convergence, speed, and stability.
Master of Science

APA, Harvard, Vancouver, ISO, and other styles

17

Louis, Pierre-Yves. "Increasing coupling for probabilistic cellular automata." Universität Potsdam, 2005. http://opus.kobv.de/ubp/volltexte/2006/659/.

Full text

Abstract:

We give a necessary and sufficient condition for the existence of an increasing coupling of N (N >= 2) synchronous dynamics on S-Zd (PCA). Increasing means the coupling preserves stochastic ordering. We first present our main construction theorem in the case where S is totally ordered; applications to attractive PCAs are given. When S is only partially ordered, we show on two examples that a coupling of more than two synchronous dynamics may not exist. We also prove an extension of our main result for a particular class of partially ordered spaces.

APA, Harvard, Vancouver, ISO, and other styles

18

Urminský, Andrej. "Akcelerace mikroskopické simulace dopravy za použití OpenCL." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2011. http://www.nusl.cz/ntk/nusl-237011.

Full text

Abstract:

As the number of vehicles on our roads increases, the problems related to this phenomenon emerge more dramatically. These problems include car accidents, congestions and CO2 emissions production, increasing CO2 concentrations in the atmosphere. In order to minimize these impacts and to use the road infrastructure eff ectively, the use of traffic simulators can come in handy. Thanks to these tools, it is possible to evaluate the evolution of a traffic flow with various initial states of the simulation and thus know what to do and how to react in different states of the real-world traffic situations. This thesis deals with acceleration of microscopic urban traffic simulation using OpenCL. Supposing it is necessary to simulate a large network traffic, the need to accelerate the simulation is necessary. For this purpose, it is possible, for example, to use the graphics processing units (GPUs) and the technique of GPGPU for general purpose computations, which is used in this work. The results show that the performance gains of GPUs are significant compared to a parallel implementation on CPU.

APA, Harvard, Vancouver, ISO, and other styles

19

Louis, Pierre-Yves. "Increasing Coupling of Probabilistic Cellular Automata." Universität Potsdam, 2004. http://opus.kobv.de/ubp/volltexte/2011/5157/.

Full text

Abstract:

We give a necessary and sufficient condition for the existence of an increasing coupling of N (N >= 2) synchronous dynamics on S-Zd (PCA). Increasing means the coupling preserves stochastic ordering. We first present our main construction theorem in the case where S is totally ordered; applications to attractive PCAs are given. When S is only partially ordered, we show on two examples that a coupling of more than two synchronous dynamics may not exist. We also prove an extension of our main result for a particular class of partially ordered spaces.

APA, Harvard, Vancouver, ISO, and other styles

20

Bolduc, Jean-Sebastien. "Cellular-automata based nonlinear adaptive controllers." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape10/PQDD_0002/MQ44128.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Weimar, Jörg Richard. "Cellular automata models for excitable media /." This resource online, 1991. http://scholar.lib.vt.edu/theses/available/etd-03032009-040651/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Bolduc, Jean-Sébastien. "Cellular-automata based nonlinear adaptive controllers." Thesis, McGill University, 1998. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=20804.

Full text

Abstract:

An analytical approach is obviously practical only when we want to study nonlinear systems of low complexity. An alternative for more complex processes that has raised a lot of interest in recent years relies on Artificial Neural Networks (ANNs).
In this work we will explore an alternative avenue to the problems of control and identification, where Cellular Automata (CAs) will be considered in place of ANNs. CAs not only share ANNs' most valuable characteristics but they also have interesting characteristics of their own, for a structurally simpler architecture. CAs applications so far have been mainly restrained to simulating natural phenomena occuring in a finite homogeneous space.
Concepts relevant to the problems of control and identification will be introduced in the first part of our work. CAs will then be introduced, with a discussion of the issues raised by their application in the context, A working prototype of a CA-based controller is introduced in the last part of the work, that confirms the interest of using CAs to address the problem of nonlinear adaptive control. (Abstract shortened by UMI.)

APA, Harvard, Vancouver, ISO, and other styles

23

Smith, Mark Andrew. "Cellular automata methods in mathematical physics." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/33501.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Weimar, JÃ¶rg Richard. "Cellular automata models for excitable media." Thesis, Virginia Tech, 1991. http://hdl.handle.net/10919/41365.

Full text

Abstract:

A cellular automaton is developed for simulating excitable media. First, general "masks" as discrete approximations to the diffusion equation are examined, showing how to calculate the diffusion coefficient from the elements of the mask. The mask is then combined with a thresholding operation to simulate the propagation of waves (shock fronts) in excitable media, showing that (for well-chosen masks) the waves obey a linear "speedcurvature" relation with slope given by the predicted diffusion coefficient. The utility of different masks in terms of computational efficiency and adherence to a linear speed-curvature relation is assessed. Then, a cellular automaton model for wave propagation in reaction diffusion systems is constructed based on these "masks" for the diffusion component and on singular perturbation analysis for the reaction component. The cellular automaton is used to model spiral waves in the Belousov-Zhabotinskii reaction. The behavior of the spiral waves and the movement of the spiral tip are analyzed. By comparing these results to solutions of the Oregonator PDE model, the automaton is shown to be a useful and efficient replacement for the standard numerical solution of the PDE's.

Master of Science

APA, Harvard, Vancouver, ISO, and other styles

25

Hopman, Ryan. "Aribitrary geometry cellular automata for elastodynamics." Thesis, Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29742.

Full text

Abstract:

Thesis (M. S.)--Mechanical Engineering, Georgia Institute of Technology, 2010.
Committee Chair: Dr. Michael Leamy; Committee Member: Dr. Karim Sabra; Committee Member: Dr. Aldo Ferri. Part of the SMARTech Electronic Thesis and Dissertation Collection.

APA, Harvard, Vancouver, ISO, and other styles

26

Besson, Tom. "Discrétisation automatique de machines à signaux en automates cellulaires." Thesis, Orléans, 2018. http://www.theses.fr/2018ORLE2009/document.

Full text

Abstract:

Dans le contexte du calcul géométrique abstrait, les machines à signaux ont été développées comme le pendant continu des automates cellulaires capturant les notions de particules, de signaux et de collisions. Une question importante est la génération automatique d’un automate cellulaire reproduisant la dynamique d’une machine à signaux donnée. D’une part, il existe des conversions ad hoc. D’autre part, ce n’est pas toujours possible car certaines machines à signaux présentent des comportements « continus ». Par conséquent, la discrétisation automatique de telles structures est souvent complexe et pas toujours possible. Cette thèse propose trois manières différentes de discrétiser automatiquement les machines à signaux en automates cellulaires, avec ou sans approximation possible. La première s’intéresse à une sous-catégorie de machines à signaux, qui présente des propriétés permettant d’assurer une discrétisation automatique exacte pour toute machine de ce type. La deuxième est utilisable sur toutes les machines mais ne peut assurer ni l’exactitude ni la correction du résultat. La troisième s’appuie sur une nouvelle expression de la dynamique d’une machine à signaux pour proposer une discrétisation. Cette expression porte le nom de modularité et est décrite avant d’être utilisée pour discrétiser
In the context of abstract geometrical computation, signal machines have been developed as a continuous counter part of cellular automata capturing the notions of particles, signals and collisions. An important issue is the automatic generation of a cellular automaton mimicking the dynamics of a given signal machine. On the one hand, ad hoc conversions exist.On the other hand, it is not always possible since some signal machines exhibit “purely continuous” behaviors. Therefore, automatically discretizing such structures is often complicated and not always possible. This thesis proposes different ways to automatically discretize signal machines into cellular automata, both with and without handling the possiblity of approximation.The first is concerned with a subcategory of signal machines, which has properties ensuring an exact automatic discretization for any machine of this type. The second is usable on all machines but cannot guarantee the exactness and correction of the result. The third is based on a new expression of the dynamics of a signal machine to propose a discretization.This dynamical expression takes the name of modularity and is described before being used to discretize

APA, Harvard, Vancouver, ISO, and other styles

27

陳德志 and Tak-chi Chan. "Using cellular automaton models to study dissipative and diffusive systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1996. http://hub.hku.hk/bib/B31212839.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Siu, Lai-wa, and 蕭麗華. "Application of cellular automata to one-dimensional density classification." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1999. http://hub.hku.hk/bib/B31223369.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

甄冠僑 and Koon-kiu Yan. "Phase transition of certain iterative cellular automation models." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1999. http://hub.hku.hk/bib/B42575382.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Yan, Koon-kiu. "Phase transition of certain iterative cellular automation models." Click to view the E-thesis via HKUTO, 1999. http://sunzi.lib.hku.hk/hkuto/record/B42575382.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Chan, Tak-chi. "Using cellular automaton models to study dissipative and diffusive systems /." Hong Kong : University of Hong Kong, 1996. http://sunzi.lib.hku.hk/hkuto/record.jsp?B19671386.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Alvandipour, Mehrdad. "Cellular Automata, Game of Life and Chance." Thesis, Southern Illinois University at Edwardsville, 2017. http://pqdtopen.proquest.com/#viewpdf?dispub=10615332.

Full text

Abstract:

Cellular automata (CA) is shortly reviewed and different approaches to CAs are introduced, while the major focus is put on the Game of Life (GoL). While the GoL has deterministic rules, we suggest a method to make the game stochastic. An analysis of the new stochastic game is studied which focuses on a macroscopic characteristic of the field, the population density. The stochastic game is simulated with various different rules to compare the exact results with the analysis. The applicability of Markov chains and Markov random fields to such games is also studied briefly, while the final chapter of our work consists of a stochastic game inside a finite grid which is modeled by Markov chains. The structure of the states, the transition probabilities and other aspects of the model is both analyzed and simulated. And finally relevant directions to expand this study is suggested.

APA, Harvard, Vancouver, ISO, and other styles

33

Ratitch, Bohdana. "Continuous function identification with fuzzy cellular automata." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape10/PQDD_0006/MQ44255.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Testa, Joseph S. "Investigations of cellular automata-based stream ciphers /." Online version of thesis, 2008. http://hdl.handle.net/1850/7897.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Waage, Aleksander Lunøe. "Discrete Tranformation of Output in Cellular Automata." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for datateknikk og informasjonsvitenskap, 2012. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-22963.

Full text

Abstract:

Cellular automata (CA) is an example of cellular computing: large numbers of simple components, no central control, and limited communication among components. A CA consists of an array of cells, each in one of a finite number of possible states. The cells are updated synchronously in discrete time steps, according to a local, identical interaction rule. CA have been studied for years due to their architectural simplicity and the wide spectrum of behaviors. It can be difficult to design CA to exhibit a specific behavior, and there is no programming paradigm for implementing parallel computations in CA. This makes CA a prime candidate for adaptive programming methods such as evolutionary algorithms (EA). EA have been successfully used to evolve CA to perform computations, such as the majority problem. In problem solving like this, CA are treated as input-output systems and evolved to visit certain states given certain initial states. The n-th state of a CA is commonly treated as its output, such that one input gives one output.In this report a way to transform the output of CA such that multiple outputs emerge is investigated. The evolution of transformed CA is also investigated. Useful applications of this include controlling multi-variable systems such as a pole balancing system.The transformation process was tested in the elementary and 3-state rule spaces. Evolution of transformed CA was successful in the elementary rule space. This suggests there is a correlation between rules of CA and their transformed output. The evolution of transformed CA was unsuccessful in the 3-state rule space. This suggests the chosen evolutionary algorithm doesn't scale with the size of the rule space.

APA, Harvard, Vancouver, ISO, and other styles

36

Jones, David Huw. "Design and application of convergent cellular automata." Thesis, Durham University, 2009. http://etheses.dur.ac.uk/84/.

Full text

Abstract:

Systems made of many interacting elements may display unanticipated emergent properties. A system for which the desired properties are the same as those which emerge will be inherently robust. Currently available techniques for designing emergent properties are prohibitively costly for all but the simplest systems. The self-assembly of biological cells into tissues and ultimately organisms is an example of a natural dynamic distributed system of which the primary emergent behaviour is a fully operational being. The distributed process that co-ordinates this self-assembly is morphogenesis. By analysing morphogenesis with a cellular automata model we deduce a means by which this self-organisation might be achieved. This mechanism is then adapted to the design of self-organising patterns, reliable electronic systems and self-assembling systems. The limitations of the design algorithm are analysed, as is a means to overcome them. The cost of this algorithm is discussed and finally demonstrated with the design of a reliable arithmetic logic unit and a self-assembling, self-repairing and metamorphosising robot made of 12,000 cells.

APA, Harvard, Vancouver, ISO, and other styles

37

McIlhatton, David. "Spatial planning : cellular automata urban growth modelling." Thesis, University of Ulster, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.523107.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Xu, Hao, and 許浩. "On the computational ability of cellular automata." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B31226942.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

di, Lena Pietro <1977&gt. "Decidable and computational properties of cellular automata." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2007. http://amsdottorato.unibo.it/371/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Kim, Bokhwan. "Modelling new city growth using cellular automata." Thesis, University of Leeds, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.423002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Dow, R. A. "Algebraic methods for finite linear cellular automata." Thesis, Queen Mary, University of London, 1996. http://qmro.qmul.ac.uk/xmlui/handle/123456789/1647.

Full text

Abstract:

Cellular automata are a simple class of extended dynamical systems which have been much studied in recent years. Linear cellular automata are the class of cellular automata most amenable to algebraic analytic treatments, algebraic techniques are used to study finite linear cellular automata and also finite linear cellular automata with external inputs. General results are developed for state alphabet a finite commutative ring and a notion of qualitative dynamical similarity is introduced for those systems consisting of a fixed linear cellular automata rule but with distinct time independent inputs. Sufficient conditions for qualitative dynamical similarity are obtained in the general case. Exact results are obtained for the case of state alphabet a finite field, including new results for finite linear cellular automata without inputs and a complete description of the behaviour of the corresponding system with time independent inputs. Necessary and sufficient conditions for qualitative dynamical similarity in this case are given. Results for the hitherto untreated case of state alphabet the integers modulo pk, p prime and k>1, are obtained from those for the finite field case by the technique of idempotent lifting. These two cases suffice for the treatment of the general case of st, ),t e alphabet the integers modulo any positive integer m>1, in particular a necessary and sufficient condition for qualitatively similar dynamics in the presence of time independent inputs is given for this case. The extension of the results for time independent inputs to the case of periodic and eventually periodic inputs is treated and the generalisation of the techniques developed to higher dimensional linear cellular automata is discussed.

APA, Harvard, Vancouver, ISO, and other styles

42

Agin, Ruben. "Logic simulation on a cellular automata machine." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/43474.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Demontis, Pierfranco, Federico G. Pazzona, and Giuseppe B. Suffritti. "Cellular automata modeling of diffusion under confinement." Universitätsbibliothek Leipzig, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-193309.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Adams, Roxane. "Implementation of cell clustering in cellular automata." Thesis, Stellenbosch : University of Stellenbosch, 2011. http://hdl.handle.net/10019.1/6674.

Full text

Abstract:

Thesis (MSc (Mathematical Sciences)) University of Stellenbosch, 2011.
ENGLISH ABSTRACT: Cellular Automata (CA) have become a popular vehicle to study complex dynamical behaviour of systems. CA can be used to model a wide variety of physical, biological, chemical and other systems. Such systems typically consist of subparts that change their state independently, based on the state of their immediate surroundings and some generally shared laws of change. When the CA approach was used to solve the LEGO construction problem, the best solution was found when using a variant of CA allowing for the clustering of cells. The LEGO construction problem concerns the optimal layout of a set of LEGO bricks. The advantages found for using the CA method with clustering in this case are the ease of implementation, the significantly smaller memory usage to previously implemented methods, and its trivial extension to construct multicoloured LEGO sculptures which were previously too complex to construct. In our research we propose to explore the definitions of clustering in CA and investigate the implementation and application of this method. We look at the ant sorting method described by Lumer and Faieta, and compare the implementation of this algorithm using regular CA as well as the clustering variation. The ant sorting model is a simple model, in which ants move randomly in space and pick up and deposit objects on the basis of local information.
AFRIKAANSE OPSOMMING: Sellulêre Outomate (SO) het ’n populêre metode geword om die komplekse dinamiese gedrag van sisteme bestudeer. SO kan gebruik word om ’n groot verskeidenheid fisiese, biologiese, chemiese en ander tipe sisteme te modelleer. Sulke sisteme bestaan tipies uit subafdelings wat, gebaseer op die status van hulle omgewing en ’n paar algemene gedeelde reëls van verandering, hulle status onafhanklik verander. Met die gebruik van die SO benadering om the LEGO konstruksieprobleem op te los, is die beste oplossing bereik deur gebruik te maak van ’n variant van SO, waar selle saamgroepeer kan word. Die LEGO konstruksieprobleem behels die optimale uitleg van ’n stel LEGO blokkies. In hierdie geval is die voordele van die SO met sel groepering die maklike implementasie, ’n beduidende kleiner geheuegebruik teenoor voorheen geïmplementeerde metodes, en die triviale uitbreiding daarvan om gekleurde LEGO beelde wat voorheen te kompleks was, te kan bou. In ons ondersoek verken ons die definisies van selgroepering in SO en ondersoek die implementasie en toepassing van die metode. Ons kyk na die miersorteringsmetode beskryf deur Lumer en Faieta, en vergelyk die implementasie van hierdie algoritme deur gewone SO asook die groeperingsvariasie te gebruik. Die miersorteringsmodel is ’n eenvoudige model waarin miere lukraak in ’n omgewing beweeg en voorwerpe optel of neersit volgens plaaslike inligting.

APA, Harvard, Vancouver, ISO, and other styles

45

Demontis, Pierfranco, Federico G. Pazzona, and Giuseppe B. Suffritti. "Cellular automata modeling of diffusion under confinement." Diffusion fundamentals 6 (2007) 13, S. 1-2, 2007. https://ul.qucosa.de/id/qucosa%3A14187.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Srivastava, Saket. "Probabilistic modeling of quantum-dot cellular automata." [Tampa, Fla.] : University of South Florida, 2007. http://purl.fcla.edu/usf/dc/et/SFE0002399.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Castro, Antonio Paulo. "Dynamic water quality modeling using cellular automata." Diss., This resource online, 1996. http://scholar.lib.vt.edu/theses/available/etd-06062008-151210/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Xu, Hao. "On the computational ability of cellular automata /." Hong Kong : University of Hong Kong, 2002. http://sunzi.lib.hku.hk/hkuto/record.jsp?B25155088.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Weeks, Andrew. "Neutral emergence and coarse graining cellular automata." Thesis, University of York, 2010. http://etheses.whiterose.ac.uk/2256/.

Full text

Abstract:

Emergent systems are often thought of as special, and are often linked to desirable properties like robustness, fault tolerance and adaptability. But, though not well understood, emergence is not a magical, unfathomable property. We introduce neutral emergence as a new way to explore emergent phenomena, showing that being good enough, enough of the time may actually yield more robust solutions more quickly. We then use cellular automata as a substrate to investigate emergence, and find they are capable of exhibiting emergent phenomena through coarse graining. Coarse graining shows us that emergence is a relative concept - while some models may be more useful, there is no correct emergent model - and that emergence is lossy, mapping the high level model to a subset of the low level behaviour. We develop a method of quantifying the 'goodness' of a coarse graining (and the quality of the emergent model) and use this to find emergent models - and, later, the emergent models we want - automatically.

APA, Harvard, Vancouver, ISO, and other styles

50

Cenek, Martin. "Information Processing in Two-Dimensional Cellular Automata." PDXScholar, 2011. https://pdxscholar.library.pdx.edu/open_access_etds/275.

Full text

Abstract:

Cellular automata (CA) have been widely used as idealized models of spatially-extended dynamical systems and as models of massively parallel distributed computation devices. Despite their wide range of applications and the fact that CA are capable of universal computation (under particular constraints), the full potential of these models is unrealized to-date. This is for two reasons: (1) the absence of a programming paradigm to control these models to solve a given problem and (2) the lack of understanding of how these models compute a given task. This work addresses the notion of computation in two-dimensional cellular automata. Solutions using a decentralized parallel model of computation require information processing on a global level. CA have been used to solve the so-called density (or majority) classification task that requires a system-wide coordination of cells. To better understand and challenge the ability of CA to solve problems, I define, solve, and analyze novel tasks that require solutions with global information processing mechanisms. The ability of CA to perform parallel, collective computation is attributed to the complex pattern-forming system behavior. I further develop the computational mechanics framework to study the mechanism of collective computation in two-dimensional cellular automata. I define several approaches to automatically identify the spatiotemporal structures with information content. Finally, I demonstrate why an accurate model of information processing in two-dimensional cellular automata cannot be constructed from the space-time behavior of these structures.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Cellullar automata'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles