Emergent Computation: A Festschrift for Selim G. Akl (Emergence, Complexity and Computation (24))

This book is dedicated to Professor Selim G. Akl to honour his groundbreaking research achievements in computer science over four decades. The book is an intellectually stimulating excursion into emergent computing paradigms, architectures and implementations. World top experts in computer science, engineering and mathematics overview exciting and intriguing topics of musical rhythms generation algorithms, analyse the computational power of random walks, dispelling a myth of computational universality, computability and complexity at the microscopic level of synchronous computation, descriptional complexity of error detection, quantum cryptography, context-free parallel communicating grammar systems, fault tolerance of hypercubes, finite automata theory of bulk-synchronous parallel computing, dealing with silent data corruptions in high-performance computing, parallel sorting on graphics processing units, mining for functional dependencies in relational databases, cellular automata optimisation of wireless sensors networks, connectivity preserving network transformers, constrained resource networks, vague computing, parallel evolutionary optimisation, emergent behaviour in multi-agent systems, vehicular clouds, epigenetic drug discovery, dimensionality reduction for intrusion detection systems, physical maze solvers, computer chess, parallel algorithms to string alignment, detection of community structure. The book is a unique combination of vibrant essays which inspires scientists and engineers to exploit natural phenomena in designs of computing architectures of the future. Front Matter....Pages i-xiii Simple Deterministic Algorithms for Generating “Good” Musical Rhythms....Pages 1-18 Is Universal Computation a Myth?....Pages 19-37 On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism....Pages 39-56 On the Microscopic View of Time and Messages....Pages 57-69 Descriptional Complexity of Error Detection....Pages 71-99 A Less Known Side of Quantum Cryptography....Pages 101-119 Emergence in Context-Free Parallel Communicating Grammar Systems: What Does and Does not Make a Grammar System More Expressive Than Its Parts....Pages 121-169 Enumerated BSP Automata....Pages 171-213 Coping with Silent Errors in HPC Applications....Pages 215-232 Parallel Sorting for GPUs....Pages 233-267 Mining for Functional Dependencies Using Shared Radix Trees in Many-Core Multi-Threaded Systems....Pages 269-292 Cellular Automata and Wireless Sensor Networks....Pages 293-302 Connectivity Preserving Network Transformers....Pages 303-319 Operating Secure Mobile Healthcare Services over Constrained Resource Networks....Pages 321-335 On Vague Computers....Pages 337-359 Parallel Evolutionary Optimization of Natural Convection Problem....Pages 361-391 Theory and Practice of Discrete Interacting Agents Models....Pages 393-402 Vehicular Clouds: Ubiquitous Computing on Wheels....Pages 403-418 Computational Approaches to Epigenetic Drug Discovery....Pages 419-433 Dimensionality Reduction for Intrusion Detection Systems in Multi-data Streams—A Review and Proposal of Unsupervised Feature Selection Scheme....Pages 435-452 Physical Maze Solvers. All Twelve Prototypes Implement 1961 Lee Algorithm....Pages 453-465 Computer Chess Endgame Play With Pawns: Then and Now....Pages 467-487 Parallel Algorithms to Align Multiple Strings in the Context of Web Data Extraction....Pages 489-504 Community Detection Using Synthetic Coordinates and Flow Propagation....Pages 505-523 Back Matter....Pages 525-578 ....Pages 579-636