Details

Subject(s)

• Cellular automata—Congresses [Browse]
• Cellular automata—Software [Browse]

Author

• Martinez, Genaro J. [Browse]

Series

• Advances in Intelligent Systems and Computing [More in this series]
• Advances in Intelligent Systems and Computing ; v.1425 [More in this series]

Source of description

Description based on print version record.

Contents

• Intro
• Committees
• Foreword
• Preface
• Contents
• About the Editors
• Invited Papers
• Computing in a Simple Reversible and Conservative Cellular Automaton
• 1 Introduction
• 2 A New Model of Reversible and Conservative Cellular Automaton P0
• 3 Useful Patterns and Phenomena in P0
• 3.1 Useful Patterns in P0
• 3.2 Three Useful Phenomena in P0
• 4 Making Reversible Turing Machines in P0
• 4.1 Reversible Logic Element with Memory (RLEM)
• 4.2 Reversible Turing Machines Implemented in P0
• 5 Concluding Remarks
• References
• Algorithms for Group Cellular Automata
• 2 Preliminaries
• 2.1 Subshifts and Cellular Automata
• 2.2 Group Shifts and Group Cellular Automata
• 3 Algorithms
• 3.1 Injectivity and Surjectivity
• 3.2 Density of Periodic Points
• 3.3 Nilpotency and Periodicity
• 3.4 Sensitivity and Equicontinuity
• 3.5 Mixing Properties
• Revisiting Logic Obfuscation Using Cellular Automata
• 2 Background
• 2.1 The Cellular Automata (CA)
• 2.2 A Non-group Additive CA: D1*CA
• 2.3 Properties of D1*CA
• 2.4 FSM Synthesis using D1*CA
• 3 FSM Obfuscation using Cellular Automata
• 3.1 The Obfuscation Technique
• 3.2 The ORACALL Attack Methodology
• 4 Incorporating Non-linearity to Thwart ORACALL
• 5 Experimental Results
• 6 Conclusion
• Accepted Papers
• Grade Estimation of Mineral Resources: An Application of Cellular Automata
• 2.1 Cellular Automata
• 2.2 Variogram Model and Krigging
• 3 Estimation of Grade Values Using Cellular Automata
• 4 Conclusion
• Shape Generation Using Cellular Automata with Clustering
• 2.2 Cellular Automata with Clustering
• 2.3 Ant Sorting Using the Lumer and Faieta Model.
• 2.4 Ant Sorting Using Clustered Cellular Automata
• 3 Shape Generation
• 3.1 Fitness-Based Strategies
• 3.2 FIFO Queue-Based Strategies
• 3.3 Priority Queue-Based Strategies
• Evolution Patterns of Some One-Dimensional Non-uniform Cellular Automata
• 2 Basic Concepts
• 3 Relation Between Local and Global Transition Function of a Non-uniform CA
• 4 Patterns of Evolution of a Non-uniform CA Under Some Transitions
• 5 Conclusion
• Relationship of Two Discrete Dynamical Models: One-Dimensional Cellular Automata and Integral Value Transformations
• 2 Mathematical Preliminaries
• 3 Wolfram Code of CA and IVT
• 3.1 Some Particular Wolfram Codes and Particular IVTs
• 4 Transition Function of a CA and IVT
• 5 Some Algebraic Results on CA and IVT
• Emulating Mersenne Twister with Cellular Automata
• 2.1 Mersenne Twister
• 2.2 Cellular Automata
• 3 Phase I: Making Our Own PRNG
• 3.1 Choosing the Size of CA(150')
• 3.2 Need of Temper Function
• 3.3 Finding The Best Seed
• 3.4 Results and Comparison with MT
• 4 Phase II: Improving our PRNG by Non-linearity
• 4.1 Using Twist
• 4.2 XOR + MULTIPLY
• 5 Conclusion and Next Steps
• Defining Reachability Tree Under Adiabatic and Reflexive Boundary Conditions
• 2 Basics of Cellular Automata
• 2.1 Rule Min Term (RMT)
• 2.2 State Transition Diagram
• 2.3 Boundary of a Finite CA
• 3 Reachability Tree
• 3.1 Construction of Reachability tree
• 3.2 Reachability Tree for ABC
• 3.3 Reachability Tree for RBC
• 4.1 Future scope
• First Degree Cellular Automata as Pseudo-Random Number Generators
• 2.1 Definitions.
• 2.2 Desirable Properties of Cellular Automata
• 3 The Selection and Rejection Criteria
• 3.1 Selection Criterion: Maximum Information Flow on One Side
• 3.2 Rejection Criterion: Theoretical Filtering
• 4 Finding Rules for PRNG
• 4.1 Rule of First Degree
• 4.2 Development of PRNG
• Asynchronous Cellular Automata as Randomness Enhancer
• 2.2 Asynchronous Cellular Automata &
• Reversibility
• 3 ACAs with Large Cycles
• 3.1 Recurrent ACAs
• 3.2 ACAs with Multi-length Attractor
• 4 ACAs with Large Cycles and Sense of Democracy
• 5 Empirical Verification of the Proposed ACAs-based Randomness Enhancer
• Cellular-Automata Based Simulation of Dynamic Recrystallization and Statistical Analysis of Resulting Grain Growth
• 2 Model Description
• 2.1 Static Recrystallization Model
• 2.2 Dynamic Recrystallization Model
• 2.3 Summary of Rules
• 2.4 Domain Setup
• 3 Result and Discussion
• 3.1 Realising Grain Growth in Dynamic Recrystallization
• 3.2 Examining Grain Growth Kinetics
• A New Notion of Universality in Respect of Logic Gates Generation Capability of ECAs
• 2 Elementary Cellular Automata
• 2.1 Basics
• 2.2 ECA as n-Input n-Output Block
• 3 Exploring Gate Design Capability of ECAs
• 3.1 Realization of Basic Gates
• 3.2 Comparison of Gate Design Capability of ECAs
• Impact of Genetic Algorithm on Low Power QCA Logic Circuit with Regular Clocking
• 2 Background and Related Work
• 2.1 QCA Basic
• 2.2 Regular Clocking
• 2.3 Genetic Algorithm
• 3 Proposed Method
• 3.1 Case Study
• 4 Power Analysis
• 4.1 Discussion
• References.
• Cellular Automata Based Model for Finding Minimum Spanning Tree in Wireless Sensor Networks
• 2.1 Wireless Sensor Networks
• 2.3 Survey of Existing Work
• 2.4 Contribution of This Work
• 3 Proposed Work
• 3.1 Computation Using Cellular Automaton
• 3.2 Set of States
• 3.3 State Transition
• 3.4 Example
• 3.5 Implementation of CA Based Model in WSN
• 4 Simulation Results
• A Novel Hash Function Based on Hybrid Cellular Automata and Sponge Functions
• 2.1 Basics of CA
• 2.2 Sponge Functions
• 2.3 Cryptographic Hash Functions
• 2.4 Omega-Flip Permutations
• 3 Related Work
• 3.1 Hash Functions Based on Cellular Automata
• 3.2 Hash Functions Based on Sponge Functions
• 3.3 Hash Functions Based on CA and Sponge Functions
• 4 Proposed Hash Function
• 4.1 Description of the Hash Function
• 4.2 Single Round of the Internal Function
• 5 Design Rationale
• 6 Security and Performance Analysis
• 6.1 Security Analysis
• 6.2 Performance Analysis
• 7 Conclusion and Future Work
• Synthesis of Single Length Cycle Two Attractor CA Using NSRT Diagram
• 2 CA Preliminaries
• 3 Next State RMT Transition Diagram
• 3.1 Identification of NSRs
• 3.2 Construction of NSRTD
• 4 Proposed Methodology
• Author Index.

Show 162 more Contents items

ISBN

981-19-0542-8

Statement on language in description

Princeton University Library aims to describe library materials in a manner that is respectful to the individuals and communities who create, use, and are represented in the collections we manage. Read more...