Spelling suggestions: "subject:"[een] CELLULAR AUTOMATA"" "subject:"[enn] CELLULAR AUTOMATA""
141 |
Automates cellulaires, fonctions booléennes et dessins combinatoires / Cellular automata, boolean functions and combinatorial designsMariot, Luca 09 March 2018 (has links)
Le but de cette thèse est l'étude des Automates Cellulaires (AC) dans la perspective des fonctions booléennes et des dessins combinatoires. Au-delà de son intérêt théorique, cette recherche est motivée par ses applications à la cryptographie, puisque les fonctions booléennes et les dessins combinatoires sont utilisés pour construire des générateurs de nombres pseudo aléatoires (Pseudorandom Number Generators, PRNG) et des schémas de partage de secret (Secret Sharing Schemes, SSS). Les résultats présentés dans la thèse ont été développés sur trois lignes de recherche, organisées comme suit. La première ligne porte sur l'utilisation des algorithmes d'optimisation heuristique pour chercher des fonctions booléennes ayant des bonnes propriétés cryptographiques, à utiliser comme des règles locales dans des PRNG basés sur les AC. La motivation principale est l'amélioration du générateur de Wolfram basé sur la règle 30, qui a été montré être vulnérable vis à vis de deux attaques cryptanalytiques. La deuxième ligne s'occupe des fonctions booléennes vectorielles engendrées par les règles globales des AC. La première contribution considère la période des pré-images des configurations spatialement périodiques dans les AC surjectifs, et l'analyse des propriétés cryptographiques des règles globales des AC. La troisième ligne se concentre sur les dessins combinatoires engendrés par les AC, en considérant les Carrés Latins Orthogonaux (Orthogonal Latin Squares, OLS), qui sont équivalents aux SSS. En particulier, on donne une caractérisation algébrique des OLS engendrés par les AC linéaires, et on utilise des algorithmes heuristiques pour construire des OLS basés sur des AC non linéaires. / The goal of this thesis is the investigation of Cellular Automata (CA) from the perspective of Boolean functions and combinatorial designs. Beside its theoretical interest, this research finds its motivation in cryptography, since Boolean functions and combinatorial designs are used to construct Pseudorandom Number Generators (PRNG) and Secret Sharing Schemes (SSS). The results presented in the thesis are developed along three research lines, organized as follows. The first line considers the use of heuristic optimization algorithms to search for Boolean functions with good cryptographic properties, to be used as local rules in CA-based PRNG. The main motivation is to improve Wolfram's generator based on rule 30, which has been shown to be vulnerable against two cryptanalytic attacks. The second line deals with vectorial Boolean functions induced by CA global rules. The first contribution considers the period of preimages of spatially periodic configurations in surjective CA, and analyze the cryptographic properties of CA global rules. The third line focuses on the combinatorial designs generated by CA, specifically considering Orthogonal Latin Squares (OLS), which are equivalent to SSS. In particular, an algebraic characterization of OLS generated by linear CA is given, and heuristic algorithms are used to build OLS based on nonlinear CA.
|
142 |
Zellulare Automaten und ihre Anwendung bei der Modellierung von WellenerscheinungenSosna, Dieter, Zschöttge, Steffen 11 July 2019 (has links)
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 Hinweise zur Berechnung einer speziellen zweidimensionalen Wellenform
mit Mathematica gegeben. / We concider cellular automata to describe the surface of waterwaves. This description will
be used in computer graphics.
Simple cellular automata decribe the surface in the case of onedimensional waves. Introducing
a memory effect we also obtain results about the interaction of two solitone waves
and about the reflection of a solitone wave at the boundary.
The Apendix contains hints about the computation of a special twodimensional wave
using Mathematica.
|
143 |
Self-Healing Cellular Automata to Correct Soft Errors in Defective Embedded Program MemoriesVoddi, Varun 01 December 2009 (has links)
Static Random Access Memory (SRAM) cells in ultra-low power Integrated Circuits (ICs) based on nanoscale Complementary Metal Oxide Semiconductor (CMOS) devices are likely to be the most vulnerable to large-scale soft errors. Conventional error correction circuits may not be able to handle the distributed nature of such errors and are susceptible to soft errors themselves. In this thesis, a distributed error correction circuit called Self-Healing Cellular Automata (SHCA) that can repair itself is presented. A possible way to deploy a SHCA in a system of SRAM-based embedded program memories (ePM) for one type of chip multi-processors is also discussed. The SHCA is compared with conventional error correction approaches and its strengths and limitations are analyzed.
|
144 |
A low level analysis of Cellular Automata and Random Boolean Networks as a computational architectureDamera, Prateen Reddy 01 January 2011 (has links)
With the transition from single-core to multi-core computing and CMOS technology reaching its physical limits, new computing architectures which are scalable, robust, and low-power are required. A promising alternative to conventional computing architectures are Cellular Automata (CA) networks and Random Boolean Networks (RBN), where simple computational nodes combine to form a network that is capable of performing a larger computational task. It has previously been shown that RBNs can offer superior characteristics over mesh networks in terms of robustness, information processing capabilities, and manufacturing costs while the locally connected computing elements of a CA network provide better scalability and low average interconnect length. This study presents a low level hardware analysis of these architectures using a framework which generates the HDL code and netlist of these networks for various network parameters. The HDL code and netlists are then used to simulate these new computing architectures to estimate the latency, area and power consumed when implemented on silicon and performing a pre-determined computation. We show that for RBNs, information processing is faster compared to a CA network, but CA networks are found to a have lower and better distribution of power dissipation than RBNs because of their regular structure. A well-established task to determine the latency of operation for these architectures is presented for a good understanding of the effect of non-local connections in a network. Programming the nodes for this purpose is done externally using a novel self-configuration algorithm requiring minimal hardware. Configuration for RBNs is done by sending in configuration packets through a randomly chosen node. Logic for identifying the topology for the network is implemented for the nodes in the RBN network to enable compilers to analyze and generate the configuration bit stream for that network. On the other hand, the configuration of the CA network is done by passing in configuration data through the inputs on one of the sides of the cell array and shifting it into the network. A study of the overhead of the network configuration and topology identification mechanisms are presented. An analysis of small-world networks in terms of interconnect power and information propagation capability has been presented. It has been shown that small-world networks, whose randomness lies between that of completely regular and completely irregular networks, are realistic while providing good information propagation capability. This study provides valuable information to help designers make decisions for various performance parameters for both RBN and CA networks, and thus to find the best design for the application under consideration.
|
145 |
A Web-Based Decision Support System For Wildfire ManagementOuyang, Weichen 13 October 2014 (has links)
No description available.
|
146 |
A NEW ALGORITHM FOR THE TIME EVOLUTION OF QUANTUM TRAJECTORY SIMULATIONS AND PHYSICALLY MOTIVATED ERROR MODELS IN 1D QUANTUM CELLULAR AUTOMATAMcNally, Douglas M., II 11 August 2014 (has links)
No description available.
|
147 |
A Comparative Study on Methods for Stochastic Number GenerationShenoi, Sangeetha Chandra January 2017 (has links)
No description available.
|
148 |
Design, Implementation, and Test of Next Generation FPGAs Using Quantum-Dot Cellular Automata TechnologyRaviraj, Tejas 22 May 2011 (has links)
No description available.
|
149 |
Modeling and Simulation of Altera Logic Array Block using Quantum-Dot Cellular AutomataKapkar, Rohan Viren January 2011 (has links)
No description available.
|
150 |
Design, Implementation, and Test of Novel Quantum-dot Cellular Automata FPGAs for the beyond CMOS EraBalijepalli, Heman 09 July 2012 (has links)
No description available.
|
Page generated in 0.0499 seconds