Log in

Relevant bibliographies by topics / Cellulära automater / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Cellulära automater.

Dissertations / Theses on the topic 'Cellulära automater'

Author: Grafiati

Published: 4 June 2021

Last updated: 18 February 2022

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

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Cellulära automater.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Wahlman, Kim. "Procedurellt genererade grottnivåer : En jämförelse mellan cellulära automater och diffusionsbegränsad aggregation." Thesis, Högskolan i Skövde, Institutionen för informationsteknologi, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-12393.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

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

3

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

APA, Harvard, Vancouver, ISO, and other styles

4

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

APA, Harvard, Vancouver, ISO, and other styles

5

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 d

APA, Harvard, Vancouver, ISO, and other styles

6

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<br>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 desenvolvime

APA, Harvard, Vancouver, ISO, and other styles

7

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

APA, Harvard, Vancouver, ISO, and other styles

8

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

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-homeomorp

APA, Harvard, Vancouver, ISO, and other styles

10

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

11

Grandjean, Anaël. "Reconnaissance de langage en temps réel sur automates cellulaires 2D." Thesis, Montpellier, 2016. http://www.theses.fr/2016MONTT331/document.

Full text

Abstract:

Les automates cellulaires sont un modèle de calcul massivement parallèle introduit dans les années 50. De nombreuses variantes peuvent être considérées par exemple en faisant varier la dimension de l’espace de calcul, ou les possibilités de communication entre les différentes cellules. En effet, chaque cellule ne peut communiquer qu’avec un nombre fini d’autres cellules que l’on appelle son voisinage. Mes travaux s’intéressent principalement à l’impact du choix du voisinage sur les capacités algorithmiques de ce modèle. Cet impact étant bien compris en une dimension, mes travaux portent majori

APA, Harvard, Vancouver, ISO, and other styles

12

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 b

APA, Harvard, Vancouver, ISO, and other styles

13

Bergman, Jimmy. "Cellulär automat simulerar utbredning av Taraxacum." Thesis, Högskolan i Skövde, Institutionen för vård och natur, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-6354.

Full text

Abstract:

I detta arbete undersöks vilken grad av inomartskonkurrens som ger upphov till ett observerat utbredningsmönster av maskrosor (Taraxacum sect. Ruderalia). Maskrosor har både fröspridning och vegetativ förökning. Studien hypotiserar att utbredningen kan beskrivas utifrån enkla regler för spridning och konkurrens. Dessa används i simuleringar med en binär cellulär automat där utveckling sker i deterministiska tidssteg. Modellen består av ett rutnät där en tom cell antingen kan förbli tom eller koloniseras, medan en upptagen cell antingen kan överleva eller dö ut. Reglerna efterliknar situationer

APA, Harvard, Vancouver, ISO, and other styles

14

Pérez, Brokate Cristian Felipe. "Etude de la compétition entre corrosion uniforme et localisée par automates cellulaires." Thesis, Paris 6, 2016. http://www.theses.fr/2016PA066650/document.

Full text

Abstract:

Les modèles numériques sont un outil complémentaire pour la prédiction de la corrosion. L'objectif de cette thèse est de développer un modèle de corrosion reposant sur la méthode des automates cellulaires pour l'étude de l'évolution morphologique des surfaces, ainsi que de la cinétique de corrosion. Le modèle développé couple les demi-réactions électrochimiques d'oxydation et de réduction. Au niveau cinétique, la simulation par automates cellulaires peut alors reproduire les courbes intensité-potentiel d'une réaction redox sur électrode inerte. L'échelle spatio-temporelle choisie décrit des ph

APA, Harvard, Vancouver, ISO, and other styles

15

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 empirica

APA, Harvard, Vancouver, ISO, and other styles

16

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

17

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 thi

APA, Harvard, Vancouver, ISO, and other styles

18

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

19

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 automa

APA, Harvard, Vancouver, ISO, and other styles

20

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.<br>Master of Science

APA, Harvard, Vancouver, ISO, and other styles

21

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 accomplis

APA, Harvard, Vancouver, ISO, and other styles

22

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

23

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 situat

APA, Harvard, Vancouver, ISO, and other styles

24

Dridi, Sara. "Recent advances in regional controllability of cellular automata." Thesis, Perpignan, 2019. http://www.theses.fr/2019PERP0021/document.

Full text

Abstract:

Le sujet abordé dans cette thèse concerne la contrôlabilité d’une classe de systèmes spatio-temporels, entièrement discrets de type automates cellulaires (AC). Le but de cette étude est de mettre en lumière de nouvelles pistes pour prouver la contrôlabilité des systèmes complexes. Plus spécifiquement, cette thèse se focalise sur la contrôlabilité régionale qui consiste à se restreindre à une région du domaine où le système devra atteindre un objectif donné à travers des actions ciblées. Le cas d’AC Booléens a été particulièrement examiné tout au long de cette thèse. La première partie est cons

APA, Harvard, Vancouver, ISO, and other styles

25

Vosylius, Audrius. "Voronoi diagramų braižymas ląsteliniu automatu." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2005. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2005~D_20050606_192058-10796.

Full text

Abstract:

In this work Voronoi diagrams which are drawn by the cellular automaton are discussed. The square and hexagon cellular automata were created and used for drawing Voronoi diagrams. As a result of using the created programs Voronoi diagrams, which are obtained in case of two and more dots, are observed. The following results of the research were achieved: § Voronoi diagram can be obtained by the cellular automaton. § Voronoi diagrams, which were obtained, are not precise due to different speed of movement in different directions. § In square - cell case the obtained diagrams depend on the chosen

APA, Harvard, Vancouver, ISO, and other styles

26

Marques, Murilo Ferriolli. "Análise estatística da dinâmica de roubos e furtos residenciais /." Rio Claro, 2019. http://hdl.handle.net/11449/183498.

Full text

Abstract:

Orientador: Edson Denis Leonel<br>Resumo: Nesse trabalho, utilizaremos um autômato celular para investigar o problema de roubos e furtos residenciais. A partir de regras e critérios pré-estabelecidos, definimos o comportamento da difusão da criminalidade em uma cidade como função do tempo e dos seus parâmetros de controle. Utilizando um tratamento estatístico da criminalidade, nossos resultados indicam uma possível transição entre fase endêmica, onde o crime existe porém em baixa ocorrência, e uma fase epidêmica, onde o crime é desenfreado.<br>Abstract: In this work, we will use a cellular aut

APA, Harvard, Vancouver, ISO, and other styles

27

Hellouin, de Menibus Benjamin. "Asymptotic behaviour of cellular automata : computation and randomness." Thesis, Aix-Marseille, 2014. http://www.theses.fr/2014AIXM4729/document.

Full text

Abstract:

L'objet de cette thèse est l'étude de l'auto-organisation dans les automates cellulaires unidimensionnels.Les automates cellulaires sont un système dynamique discret ainsi qu'un modèle de calcul massivement parallèle, ces deux aspects s'influençant mutuellement. L'auto-organisation est un phénomène où un comportement organisé est observé asymptotiquement, indépendamment de la configuration initiale. Typiquement, nous considérons que le point initial est tiré aléatoirement: étant donnée une mesure de probabilité décrivant une distribution de configurations initiales, nous étudions son évolution

APA, Harvard, Vancouver, ISO, and other styles

28

Borello, Alex. "Reconnaissance de langages en temps réel par des automates cellulaires avec contraintes." Thesis, Aix-Marseille 1, 2011. http://www.theses.fr/2011AIX10127.

Full text

Abstract:

Dans cette thèse, on s'intéresse aux automates cellulaires en tant que modèle de calcul permettant de reconnaître des langages. Dans un tel domaine, il est toujours difficile d'établir des résultats négatifs, typiquement de prouver qu'un langage donné n'est pas reconnu en une certaine fonction de temps par une certaine classe d'automates. On se focalisera en particulier sur les classes de faible complexité comme le temps réel, au sujet desquelles de nombreuses questions restent ouvertes.Dans une première partie, on propose plusieurs manières d'affaiblir encore les classes de langages étudiées,

APA, Harvard, Vancouver, ISO, and other styles

29

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

30

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).<br>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

APA, Harvard, Vancouver, ISO, and other styles

31

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

32

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

33

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.<br>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

34

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

35

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

Full text

Abstract:

<p>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

APA, Harvard, Vancouver, ISO, and other styles

36

Sosna, Dieter, and Steffen Zschöttge. "Zellulare Automaten und ihre Anwendung bei der Modellierung von Wellenerscheinungen." Universität Leipzig, 1995. https://ul.qucosa.de/id/qucosa%3A34491.

Full text

Abstract:

Ziel dieser Arbeit ist es, das physikalische Problem der Bestimmung der Gestalt der Flüssigkeitsoberflächer bei der Ausbreitung von Wasserwellen durch zellularen Automaten zu modellieren und anschließend die Ergebnisse durch Computerprogramme graphisch darzustellen. Für eindimensionale Wellen wird die Oberfläche durch einen einfachen zellularen Automaten modelliert. Durch Erweiterung des Automaten um eine Gedächtnisfunktion kann die Interaktion zwischen zwei Wellen einfacher Gestalt (Solitonen) bzw. zwischen einer solchen Welle und einem reflektierenden Rand modelliert werden. In Anhang werden

APA, Harvard, Vancouver, ISO, and other styles

37

Bailey, A. H. "A cellular automaton model of ventricular fibrillation." Thesis, University of Ulster, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.233445.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Demirkaya, Omer. "Automated quantitative cellular analysis of immunohistochemically stained tissue sections /." The Ohio State University, 1997. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487942739807921.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

陳德志 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

40

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

41

甄冠僑 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

42

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

43

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

44

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 computatio

APA, Harvard, Vancouver, ISO, and other styles

45

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

46

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

47

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 a

APA, Harvard, Vancouver, ISO, and other styles

48

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

49

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

50

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

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!