Cellular Automata

Name: Cellular Automata | 15th International Conference on Cellular Automata for Research and Industry, ACRI 2022, Geneva, Switzerland, September 12-15, 2022, Proceedings
Brand: Springer
Price: 85.59 EUR
Availability: OnlineOnly

15th International Conference on Cellular Automata for Research and Industry, ACRI 2022, Geneva, Switzerland, September 12-15, 2022, Proceedings

Bastien Chopard Stefania Bandini Alberto Dennunzio Mira Arabi Haddad(Herausgeber*in)

Springer (Verlag)

Erschienen am 12. August 2022

XII, 370 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-031-14926-9 (ISBN)

85,59 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

Intro
Preface
Organization
Contents
Cellular Automata Tutoring
Cellular Automata Application on Chemical Computing Logic Circuits
1 Introduction
2 Methods for Simulation of Chemical Gates
3 Results
4 Conclusions
References
Theory
Exploring Lightweight S-boxes Using Cellular Automata and Reinforcement Learning
1 Introduction
2 Cellular Automata
3 Substitution Boxes (S-boxes)
3.1 Nonlinearity
3.2 Differential Uniformity
4 Semi-bent Boolean Functions
5 Reinforcement Learning
6 Our Design
6.1 Boolean Functions
6.2 Substitution Box
6.3 Reinforcement Learning
7 Results
8 Conclusion and Future Work
A Appendix
References
Identification of Periodic Boundary SACA Rules Exploring NSRT Diagram
1 Introduction
2 Preliminaries of Cellular Automata
3 NSRTD
4 SACA Rules
5 Conclusion
References
A Cellular Automata Based Fault Resistant MICKEY-Like Stream Cipher
1 Introduction
2 Preliminaries
2.1 MICKEY-Mutual Irregular Clocking KEYstream Generator
2.2 Cellular Automata - An Overview
3 Proposed Cipher - CA Based MICKEY
4 Design Rationale
4.1 Selection of Hybrid CA Rules
5 Security Analysis and Resistance of CA Based MICKEY to DFA
5.1 Differential Fault Attack on MICKEY
6 Software Implementation and Results
7 Conclusion and Future Work
References
On the Linear Components Space of S-boxes Generated by Orthogonal Cellular Automata
1 Introduction
2 Basic Definitions
2.1 Cryptographic Boolean Functions and S-boxes
2.2 Orthogonal CA
3 S-boxes Based on OCA
4 Polynomial Codes from Linear Components Spaces
5 Conclusions
References
The Structure of Configurations in One-Dimensional Majority Cellular Automata: From Cell Stability to Configuration Periodicity
1 Introduction
1.1 Organization
2 Preliminaries
2.1 The Majority Rule with Radius r
2.2 Temporal and Spatial Periodicity
3 Our Main Result and the Notion of Cell Stability
3.1 Illustrating Theorem 1 for r = 1, 2, 3
4 The Alignment Mapping (High-Level Idea)
5 Related Work
References
Synchronisation of Elementary Cellular Automata with a Small Initial Error. Application to Rule 18
1 Introduction
2 Influence of Initial Error on Synchronization
3 Modeling of the Error Spreading Dynamics
4 Optimization of Algorithm for a Single Erroneous Cell
5 Conclusion and Perspectives
References
Millions of 5-State n3-Real Time Sequence Generators via Local Simulations
1 Introduction
1.1 Local Mappings to Explore the Cellular Solution Space
1.2 Real-Time Sequence Generation Problems
1.3 Organization of the Content
2 Preliminaries
2.1 Cellular Automata, Local Mappings, and Local Simulations
2.2 Real-Time Sequence Generators
3 Exploring RTSG Solutions via Local Mappings
3.1 Compliant Local Mappings
3.2 A Hand-Crafted Local Simulation
3.3 Optimizing Through Millions of Solutions
3.4 Beyond RTSG and FSSP Optimizations
4 Conclusion
References
System Reduction: An Approach Based on Probabilistic Cellular Automata
1 Introduction
2 Problem Formulation
3 Coarse Graining Procedure
4 Example
5 Reduced Voter Model
5.1 Description of the Model
5.2 Transition Probabilities for a 1D Circular Graph Voter Model
5.3 The Transition Function
5.4 Simulation of a Controlled Situation
6 Conclusions
References
Lyapunov Profiles of Three-State Totalistic Cellular Automata
1 Introduction
2 Lyapunov Profiles of Cellular Automata
2.1 Preliminaries
2.2 Two-State CA
2.3 Three-State CAs
3 Results and Discussion
3.1 Experimental Setup
3.2 Class I
3.3 Class II
3.4 Class III
3.5 Class IV
4 Conclusions
References
Modelling and Simulation of Physical Systems and Phenomena
Evolving Quantum Circuits to Implement Stochastic and Deterministic Cellular Automata Rules
1 Scope and Motivation
2 The Genetic Algorithm to Evolve Quantum Circuits
3 Three Different ``Flavours'' of Quantum Cellular Automata
3.1 The Quantum Cousin of a Stochastic Critical Cellular Automata
3.2 The Two Other Flavours: Deterministic CA and Stochastic CA but Non-critical
4 Discussion and Conclusions
References
Double Population Lattice Boltzmann Model for Magneto-Hydrodynamic Blood Flow in Stenotic Artery
1 Introduction
2 Mathematical Model
2.1 Problem Description
2.2 Equations
3 Numerical Model
3.1 Lattice Boltzmann Method with Single Relaxation Time (LBM-SRT)
3.2 Boundary Conditions
3.3 Bounce Back
4 Model Validation
5 Results and Discussion
6 Conclusion
References
Four State Deterministic Cellular Automaton Rule Emulating Random Diffusion
1 Introduction
2 Construction of the Rule
3 Experiments
4 Two-Dimensional Rule
5 Conclusions
References
The Evolution of Vermicular Structures and Sintering Behavior of Alumina
1 Introduction
2 The Cellular Automaton Model
2.1 The Interface Energy
2.2 Transition Probabilities
3 Results
3.1 The Total Interface Energy
3.2 Vermicular Structures
3.3 A Measure of the Porosity
4 Conclusions
References
A Cellular Automaton Model of a Laser with Saturable Absorber Reproducing Laser Passive Q-switching
1 Introduction
2 Laser Rate Equations
3 A Cellular Automata Model for a Laser with a Saturable Absorber
4 Results
4.1 Dependence with the Pumping Probability R1
4.2 Dependence with R2
4.3 The Effect of the Density of the Absorber
5 Conclusions
References
Modeling Phase Change Materials Using Cellular Automata
1 Introduction
2 Model Description
2.1 Phenomenon Description
2.2 Cellular Automata for Phase Change Phenomenon
3 Simulation
3.1 Model Evaluation
3.2 Simulation Results
4 Conclusion and Perspectives
References
Performance Analysis of Regular Clocking Based Quantum-Dot Cellular Automata Logic Circuit: Fault Tolerant Approach
1 Introduction
2 Background and Related Work
2.1 QCA Basic
2.2 Regular Clocking
2.3 QCA Defects
3 Analysis of Fault Tolerant Capability of Underlying Clocking Schemes
3.1 Analysis Using HDLQ
3.2 Analysis Using QCADesigner
4 Discussion
5 Conclusion
References
Idea of Cellular Automata Application in Two-Slit Experiments
1 Introduction
2 Description of a Two Dimensional Computer Experiment with Cellular Automata
2.1 Geometry of the Binary Cellular Automata
2.2 Dynamic Rules for Cell States
2.3 Frequency Principle of Experimental Processing
3 Results of Computational Experiments
4 Anticipation Based Cellular Automata for Two-Slit Experiments
4.1 Definition of Anticipation
4.2 Anticipating in an Cellular Automata Model
4.3 Computational Experiments with Cellular Automata with Anticipating
5 Conclusions
References
Towards Self-optimizing Sensor Networks: Game-Theoretic Second-Order CA-Based Approach
1 Introduction
2 Sensor Networks: Coverage and Lifetime Problems
3 Multi-agent System for WSN Coverage and Lifetime Optimization
4 Collective Behavior of Second-Order CA-Based Players in Spatial Prisoner's Dilemma Game
5 Coverage and Lifetime Optimization: Spatial PD Game with the Use of a Second-Order CA
6 Conclusions
References
Cellular Automata and Spreading Dynamics
Spreadability and Vulnerability via Attributes for Systems Described by Cellular Automata: Application to Wildfire
1 Introduction
2 CA, Spreadability and Vulnerability
2.1 Attributes-Based CA
2.2 Original Spreadability and Vulnerability
2.3 Spreadability via Attributes
2.4 Vulnerability via Attributes
2.5 Vulnerability Indexes via Attributes
3 Case Study: Forest Fire Modelling
3.1 Model Description
3.2 Wildfire Spreadability
3.3 Wildfire Vulnerability
4 Conclusion and Perspectives
References
Automatic Evolutionary Adjustment of Cellular Automata Model for Forest Fire Propagation
1 Introduction
2 Related Work
3 Proposed Model for Forest Fire Simulation
4 Evolutionary Approach to Adjust the Model Parameters
5 Experiments
6 Final Considerations
References
Wildfire Simulation Model Based on Cellular Automata and Stochastic Rules
1 Introduction
2 Related Works
3 Model Description
4 Simulations and Analyses
5 Conclusion and Future Work
References
Crowds, Pedestrian, and Traffic Dynamics
Integrating the Implications of Distance-Based Affective States in Cellular Automata Pedestrian Simulation
1 Introduction
2 Affective State Design: Data from Experiments
3 1D CA Model
3.1 Implementation and Results
4 2D CA Model
4.1 Implementation
4.2 Preliminary Results
5 Conclusion
References
Density Estimates in Cellular Automata Models of Pedestrian Dynamics
1 Introduction
1.1 Quantities
1.2 Data-Driven Study
2 Concept and Definitions
2.1 Type of Kernels
2.2 Smoothing Techniques
3 Illustrations and Analysis
3.1 Similarity to Point Approximation
3.2 Alternatives of Voronoi Diagram
4 Conclusions
References
Maximum Traffic Flow Patterns in Interacting Autonomous Vehicles
1 Introduction
2 The Speed Regulator
3 Analysis of the Flow
4 Fundamental Diagrams
5 Conclusions
References
Stimulus-Induced Swarming in Soldier Crabs
1 Introduction
2 Experiment and Outcomes
3 Numerical Simulation
3.1 Universal Behavior
3.2 Behavior in the Presence of External Stimulus (Moving Light)
3.3 Results
4 Conclusions
References
Analysis of Congestion Caused by a Bottleneck in a Crowded Aquarium with a Fixed One-Way Route
1 Introduction
2 Model Description
2.1 Original TASEP
2.2 Modified TASEP
3 Definition of New Indexes to Estimate Congestion
3.1 Traditional Indicators to Estimate Congestion
3.2 Mean Experienced Density for Particle
4 Theoretical Analysis and Simulation Results of Steady State
4.1 Theoretical Analysis
4.2 Simulation Results
5 Simulation Results of Unsteady State with Control
6 Conclusion
References
Pedestrian Movement: An Analysis of Transition Regime the Real-Life Experiment, a Comparison with a Simulation Data at an Example of the ``SigmaEva'' Software
1 Introduction
2 The Analysis of the Real-Life Experiment
3 Description of the Model
4 Simulation
5 Conclusion
References
Cluster Motion of Multiple Elevators and Indices Related to the Transportation Efficiency Studied in a Discrete Model Simulation
1 Introduction
2 Problem Formulation
3 Results
4 Discussion and Conclusion
References
Other Studies on Cellular Automata
A Simple Model of Knowledge Percolation
1 Introduction
2 The Model
2.1 Knowledge Corpus Dynamics
2.2 Cluster Dynamics
3 Conclusions
References
Cellular Automata Enhanced Machine Learning Model for Toxic Text Classification
1 Introduction
2 Basics of Cellular Automata
3 Proposed CA Based LSTM Model Design
4 Results and Performance Analysis
5 Conclusion
References
Irregular Learning Cellular Automata for the Resolution of Complex Logic Puzzles
1 Introduction
2 Basics of the Employed Computational Models
2.1 Learning Automata
2.2 Learning Cellular Automata
3 Complex Logic Puzzles: The Sudoku Paradigm
4 Solving Sudoku Puzzles
4.1 Solving Process Using Irregular Learning Cellular Automata
4.2 Irregular Learning Cellular Automata Algorithm
5 Results and Discussion
6 Conclusions
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken