You are previewing Natural Computing for Simulation and Knowledge Discovery.
O'Reilly logo
Natural Computing for Simulation and Knowledge Discovery

Book Description

Nature has long provided the inspiration for a variety of scientific discoveries in engineering, biomedicine, and computing, though only recently have these elements of nature been used directly in computational systems. Natural Computing for Simulation and Knowledge Discovery investigates the latest developments in nature-influenced technologies. Within its pages, readers will find an in-depth analysis of such advances as cryptographic solutions based on cell division, the creation and manipulation of biological computers, and particle swarm optimization techniques. Scientists, practitioners, and students in fields such as computing, mathematics, and molecular science will make use of this essential reference to explore current trends in natural computation and advance nature-inspired technologies to the next generation.

Table of Contents

  1. Cover
  2. Title Page
  3. Copyright Page
  4. Editorial Advisory Board and List of Reviewers
    1. Associate Editors
    2. International Editorial Review Board
  5. Preface
  6. Chapter 1: PSO-CGO
    1. ABSTRACT
    2. 1. INTRODUCTION
    3. 2. MORSE CLUSTERS
    4. 3. PARTICLE SWARM OPTIMIZATION
    5. 4. PSO-CGO: A PSO FOR CLUSTER GEOMETRY OPTIMIZATION
    6. 5. EXPERIMENTS
    7. 6. CONCLUSION AND FUTURE WORK
  7. Chapter 2: Phylogenetic Differential Evolution
    1. ABSTRACT
    2. 1. INTRODUCTION
    3. 2. BUILDING BLOCKS AND DECEPTIVE FUNCTIONS
    4. 3. HOW TO FIND BUILDING BLOCKS
    5. 4. METHODS OF PHYLOGENETIC RECONSTRUCTION
    6. 5. PHYLOGENETIC ALGORITHMS
    7. 6. PHYLOGENETIC DIFFERENTIAL EVOLUTION
    8. 7. EXPERIMENTS
    9. 8. CONCLUSION
  8. Chapter 3: Head Motion Stabilization During Quadruped Robot Locomotion
    1. ABSTRACT
    2. 1. INTRODUCTION
    3. 2. STATE-OF-THE-ART
    4. 3. SYSTEM ARCHITECTURE
    5. 4. OPTIMIZATION PROCESS
    6. 5. EXPERIMENTAL RESULTS
    7. 6. CONCLUSION AND FUTURE WORKS
  9. Chapter 4: Incorporation of Preferences in an Evolutionary Algorithm Using an Outranking Relation
    1. ABSTRACT
    2. 1. INTRODUCTION
    3. 2. INCORPORATION OF PREFERENCE INFORMATION IN EAs
    4. 3. THE ELECTRE TRI METHOD
    5. 4. THE EvABOR-III APPROACH
    6. 5. ILLUSTRATIVE RESULTS FROM A REACTIVE POWER COMPENSATION PROBLEM
    7. 6. CONCLUSION
  10. Chapter 5: Asynchronous P Systems
    1. ABSTRACT
    2. 1. INTRODUCTION
    3. 2. PRELIMINARIES
    4. 3. ASYNCHRONOUS P SYSTEMS
    5. 4. DISTRIBUTED DEPTH-FIRST SEARCH (DFS)
    6. 5. DISTRIBUTED BREADTH-FIRST SEARCH (BFS)
    7. 6. COMPLEXITY
    8. 7. CONCLUSION
  11. Chapter 6: Simulating Spiking Neural P Systems Without Delays Using GPUs
    1. ABSTRACT
    2. 1. INTRODUCTION
    3. 2. SPIKING NEURAL P SYSTEMS
    4. 3. THE NVIDIA CUDA ARCHITECTURE
    5. 4. SIMULATOR DESIGN AND IMPLEMENTATION
    6. 5. SIMULATION RESULTS, OBSERVATIONS, AND ANALYSES
    7. 6. CONCLUSION AND FUTURE WORK
  12. Chapter 7: P Colonies of Capacity One and Modularity
    1. ABSTRACT
    2. 1. INTRODUCTION
    3. 2. DEFINITIONS
    4. 3. P COLONIES WITH ONE OBJECT INSIDE THE AGENT
    5. 4. MODULARITY IN THE TERMS OF P COLONIES
    6. 5. CONCLUSION
    7. APPENDIX
  13. Chapter 8: Local Search with P Systems
    1. ABSTRACT
    2. 1. INTRODUCTION
    3. 2. LOCAL SEARCH
    4. 3. THE N-QUEENS PROBLEM
    5. 4. A P SYSTEM FAMILY FOR LOCAL SEARCH
    6. 5. EXPERIMENTAL RESULTS
    7. 6. CONCLUSION
  14. Chapter 9: Forward and Backward Chaining with P Systems
    1. ABSTRACT
    2. 1. INTRODUCTION
    3. 2. DEFINITIONS
    4. 3. FORWARD CHAINING
    5. 4. A DIFFERENT APPROACH TO FORWARD CHAINING
    6. 5. BACKWARD CHAINING
    7. 6. CONCLUSION
  15. Chapter 10: Towards Automated Verification of P Systems Using Spin
    1. ABSTRACT
    2. 1. INTRODUCTION
    3. 2. P SYSTEM SPECIFICATION IN PROMELA
    4. 3. TOOL DESCRIPTION
    5. 4. CASE STUDIES
    6. 5. CONCLUSION AND FUTURE WORK
  16. Chapter 11: MP Modelling of Glucose-Insulin Interactions in the Intravenous Glucose Tolerance Test
    1. ABSTRACT
    2. 1. INTRODUCTION
    3. 2. MATHEMATICAL MODELS OF THE INTRAVENOUS GLUCOSE TOLERANCE TEST
    4. 3. MP MODELLING
    5. 4. CONCLUSION AND ONGOING WORK
  17. Chapter 12: Implementation on CUDA of the Smoothing Problem with Tissue-Like P Systems
    1. ABSTRACT
    2. 1. INTRODUCTION
    3. 2. PRELIMINARIES
    4. 3. PARALLEL IMPLEMENTATION
    5. 4. CONCLUSION AND FUTURE WORK
  18. Chapter 13: Elementary Active Membranes Have the Power of Counting
    1. ABSTRACT
    2. 1. INTRODUCTION
    3. 2. PRELIMINARIES
    4. 3. SOLVING THRESHOLD-3SAT
    5. 4. SOLVING THE OTHER PP PROBLEMS
    6. 5. CONCLUSION
  19. Chapter 14: Linear Time Solution to Prime Factorization by Tissue P Systems with Cell Division
    1. ABSTRACT
    2. 1. INTRODUCTION
    3. 2. PRELIMINARIES
    4. 3. TISSUE P SYSTEMS WITH CELL DIVISION
    5. 4. A LINEAR TIME SOLUTION TO THE FACTORIZATION PROBLEM
    6. 5. CONCLUSION AND COMMENTS
  20. Chapter 15: Unorganized Machines
    1. 1. INTRODUCTION
    2. 2. TURING’S NEURAL NETWORKS
    3. 3. RESERVOIR COMPUTING
    4. 4. EXTREME LEARNING MACHINES
    5. 5. REFLECTIONS ON THE POINTS OF CONTACT BETWEEN TURING’S NETWORKS AND MODERN UNORGANIZED MACHINES
    6. 6. CONCLUSION
  21. Chapter 16: The Grand Challenges in Natural Computing Research
    1. ABSTRACT
    2. 1. COMPUTING: YESTERDAY, TODAY, AND TOMORROW
    3. 2. NATURAL COMPUTING REVISITED
    4. 3. THE GRAND CHALLENGES IN NATURAL COMPUTING RESEARCH
    5. 4. DISCUSSION
  22. Chapter 17: Trans-Canada Slimeways
    1. ABSTRACT
    2. 1. INTRODUCTION
    3. 2. METHODS
    4. 3. FORAGING ON URBAN AREAS
    5. 4. PHYSARUM NETWORK VS. HIGHWAY NETWORK
    6. 5. PROXIMITY GRAPHS
    7. 6. RESPONSE TO CONTAMINATION
    8. 7. DISCUSSION
  23. Chapter 18: Ecosystems Computing
    1. ABSTRACT
    2. 1. INTRODUCTION: THE NATURAL COMPUTING OF BIOGEOGRAPHY
    3. 2. FUNDAMENTALS OF BIOGEOGRAPHY
    4. 3. ARTIFICIAL ECOSYSTEMS: WHY TO STUDY?
    5. 4. BIOGEOGRAPHIC COMPUTATION METAMODEL
    6. 5. BIOGEOGRAPHIC PATTERNS: CARRYING CAPACITY AND POPULATION EQUILIBRIUM ON ADAPTIVE SURFACES
    7. 6. DISCUSSION
  24. Compilation of References
  25. About the Contributors