Algorithms and data structures Books

Book SynopsisThis book deals with several aspects of what is now called "explicit number theory." The local aspect, global aspect, and the third aspect is the theory of zeta and L-functions.Trade ReviewFrom the reviews:"Cohen (Université Bordeaux I, France), an instant classic, uniquely bridges the gap between old-fashioned, naive treatments and the many modern books available that develop the tools just mentioned … . Summing Up: Recommended. … Upper-division undergraduates through faculty." (D. V. Feldman, CHOICE, Vol. 45 (5), January, 2008)"The book deals with aspects of ‘explicit number theory’. … The central theme … is the solution of Diophantine equations. … It combines an interesting ‘philosophy’ of the subject with an encyclopedic grasp of detail. The extension of the author’s reach via the contributed chapters is a good idea. Perhaps it is the start of a trend, as the subject grows more and more. … It will undoubtedly be mined by instructors for their graduate courses, particularly for the purpose of including some recently-proved content." (R. C. Baker, Mathematical Reviews, Issue 2008 e)“This is the second volume of a highly impressive two-volume textbook on Diophantine analysis. … readers are presented with an almost overwhelming amount of material. This … text book is bound to become an important reference for students and researchers alike.” (C. Baxa, Monatshefte für Mathematik, Vol. 157 (2), June, 2009)Table of ContentsAnalytic Tools.- Bernoulli Polynomials and the Gamma Function.- Dirichlet Series and L-Functions.- p-adic Gamma and L-Functions.- Modern Tools.- Applications of Linear Forms in Logarithms.- Rational Points on Higher-Genus Curves.- The Super-Fermat Equation.- The Modular Approach to Diophantine Equations.- Catalan’s Equation.

Read more less

Book SynopsisPresents an account of graph theory. Written with students of mathematics and computer science in mind, this book reflects the state of the subject and emphasizes connections with other branches of pure mathematics. It presents a survey of fresh topics and includes more than 600 exercises.Trade Review"...This book is likely to become a classic, and it deserves to be on the shelf of everyone working in graph theory or even remotely related areas, from graduate student to active researcher."--MATHEMATICAL REVIEWSTable of Contents1: Fundamentals. 2: Electrical Networks. 3: Flows, Connectivity and Matching. 4: Extremal Problems. 5: Colouring. 6: Ramsey Theory. 7: Random Graphs. 8: Graphs, Groups and Matrices. 9: Random Walks on Graphs. 10: The Tutte Polynomial.

Read more less

Book Synopsis

Read more less

Book SynopsisFollowing a recent mathematical, algorithmic, and computational turn in the field of social sciences, and particularly design aspects of contemporary organisations, Organisation and Governance Using Algorithms explores the problem of governance in organisations from a mathematical perspective. Avramopoulos offers a ground-breaking theory and application on organisational systems design, including discussions on organisational systems design requirements, such as productivity, emotion, and reward, the problems of unaccountability, including hierarchical delegation, and the benefits of accountable design. The suggested theoretical approach views organizational actors as computer processors that communicate through a shared infrastructure – both physical and digital – and suggests scientific principles and mechanisms by which to correct inequality and advance democratic governance in organisations.Table of ContentsChapter 1. Introduction Chapter 2. On the cognitive foundation of organization Chapter 3. Organizational systems design requirements Chapter 4. The stigmata of unaccountable presence Chapter 5. Organization based on accountably anonymous delegation Chapter 6. Concluding remarks and future work

Read more less

Book SynopsisThe primary aim of this book is to present a coherent introduction to graph theory, suitable as a textbook for advanced undergraduate and beginning graduate students in mathematics and computer science. It provides a systematic treatment of the theory of graphs without sacrificing its intuitive and aesthetic appeal. Commonly used proof techniques are described and illustrated. The book also serves as an introduction to research in graph theory.Trade Reviewdeveloped by Paul Seymour and Neil Robertson and followers), which certainly now deserves a monographic treatment of its own. Summing up: Recommended. Lower-division undergraduate through professional collections. CHOICE This book is a follow-on to the authors' 1976 text, Graphs with Applications. What began as a revision has evolved into a modern, first-class, graduate-level textbook reflecting changes in the discipline over the past thirty years... This text hits the mark by appearing in Springer’s Graduate Texts in Mathematics series, as it is a very rigorous treatment, compactly presented, with an assumption of a very complete undergraduate preparation in all of the standard topics. While the book could ably serve as a reference for many of the most important topics in graph theory, it fulfills the promise of being an effective textbook. The plentiful exercises in each subsection are divided into two groups, with the second group deemed "more challenging". Any exercises necessary for a complete understanding of the text have also been marked as such. There is plenty here to keep a graduate student busy, and any student would learn much in tackling a selection of the exercises... Not only is the content of this book exceptional, so too is its production. The high quality of its manufacture, the crisp and detailed illustrations, and the uncluttered design complement the attention to the typography and layout. Even in simple black and white with line art, it is a beautiful book. SIAM Book Reviews "A text which is designed to be usable both for a basic graph theory course … but also to be usable as an introduction to research in graph theory, by including more advanced topics in each chapter. There are a large number of exercises in the book … . The text contains drawings of many standard interesting graphs, which are listed at the end." (David B. Penman, Zentralblatt MATH, Vol. 1134 (12), 2008) MathSciNet Reviews "The present volume is intended to serve as a text for "advanced undergraduate and beginning graduate students in mathematics and computer science" (p. viii). It is well suited for this purpose. The writing is fully accessible to the stated groups of students, and indeed is not merely readable but is engaging… Even a complete listing of the chapters does not fully convey the breadth of this book… For researchers in graph theory, this book offers features which parallel the first Bondy and Murty book: it provides well-chosen terminology and notation, a multitude of especially interesting graphs, and a substantial unsolved problems section…One-hundred unsolved problems are listed in Appendix A, a treasure trove of problems worthy of study… (In short) this rewrite of a classic in graph theory stands a good chance of becoming a classic itself." "The present volume is intended to serve as a text for ‘advanced undergraduate and beginning graduate students in mathematics and computer science’ … . The writing is fully accessible to the stated groups of students, and indeed is not merely readable but is engaging. The book has many exercise sets, each containing problems … ." (Arthur M. Hobbs, Mathematical Reviews, Issue 2009 C) "A couple of fantastic features: Proof techniques: I love these nutshelled essences highlighted in bordered frames. They look like pictures on the wall and grab the view of the reader. Exercises: Their style, depth and logic remind me of Lovász’ classical exercise book. Also the fact that the name of the author is bracketed after the exercise…Figures: Extremely precise and high-tech…The book contains very recent results and ideas. It is clearly an up-to-date collection of fundamental results of graph theory…All-in-all, it is a marvelous book." (János Barát, Acta Scientiarum Mathematicarum, Vol. 75, 2009)Table of ContentsGraphs.- Subgraphs.- Connected Graphs.- Trees.- Nonseparable Graphs.- Tree-Search Algorithms.- Flows in Networks.- Complexity of Algorithms.- Connectivity.- Planar Graphs.- The Four-Colour Problem.- Stable Sets and Cliques.- The Probabilistic Method.- Vertex Colourings.- Colourings of Maps.- Matchings.- Edge Colourings.- Hamilton Cycles.- Coverings and Packings in Directed Graphs.- Electrical Networks.- Integer Flows and Coverings.

Read more less

Book SynopsisThis book combines the research activities of the authors, both of whom are researchers at Ecole Nationale de l’Aviation Civile (French National School of Civil Aviation), and presents their findings from the last 15 years. Their work uses air transport as its focal point, within the realm of mathematical optimization, looking at real life problems and theoretical models in tandem, and the challenges that accompany studying both approaches. The authors’ research is linked with the attempt to reduce air space congestion in Western Europe, USA and, increasingly, Asia. They do this through studying stochastic optimization (particularly artificial evolution), the sectorization of airspace, route distribution and takeoff slots, and by modeling airspace congestion. Finally, the authors discuss their short, medium and long term research goals. They hope that their work, although related to air transport, will be applied to other fields, such is the transferable nature of mathematical optimization. At the same time, they intend to use other areas of research, such as approximation and statistics to complement their continued inquiry in their own field. Contents 1. Introduction. Part 1. Optimization and Artificial Evolution 2. Optimization: State of the Art. 3. Genetic Algorithms and Improvements. 4. A new concept for Genetic Algorithms based on Order Statistics. Part 2. Applications to Air Traffic Control 5. Air Traffic Control. 6. Contributions to Airspace Sectorization. 7. Contribution to Traffic Assignment. 8. Airspace Congestion Metrics. 9. Conclusion and Future Perspectives. About the Authors Daniel Delahaye works for Ecole Nationale de l’Aviation Civile (French National School of Civil Aviation) in France. Stéphane Puechmorel works for Ecole Nationale de l’Aviation Civile (French National School of Civil Aviation) in France.Table of ContentsIntroduction xi PART 1. OPTIMIZATION AND ARTIFICIAL EVOLUTION 1 Chapter 1. Optimization: State of the Art 3 1.1. Methodological principles in optimization 3 1.1.1. Introduction 3 1.1.2. Modeling 4 1.1.3. Complexity 12 1.1.4. Computation time 13 1.1.5. Conclusion 13 1.2. Optimization algorithms 14 1.2.1. Introduction 14 1.2.2. Linear programming 15 1.2.3. Nonlinear programming (NLP) 16 1.2.4. Local methods subject to constraints 19 1.2.5. Deterministic global methods 21 1.2.6. Stochastic global methods 25 1.2.7. Genetic algorithms 33 1.2.8. Conclusion 34 Chapter 2. Genetic Algorithms and Improvements 37 2.1. General points 37 2.1.1. Introduction 37 2.1.2. Principle of genetic algorithms 39 2.1.3. Coding principles 42 2.1.4. Random generation of the initial population 42 2.1.5. Crossover operators 43 2.1.6. Mutation operators 45 2.1.7. Selection principles 47 2.2. Classic improvements 48 2.2.1. Scaling 49 2.2.2. Sharing 50 2.2.3. Crowding 52 2.2.4. Memetic algorithms 53 2.2.5. Multi-objective genetic algorithms 53 2.3. Our contributions 57 2.3.1. Adaptive clustered sharing 58 2.3.2. Association of genetic algorithms with simulated annealing 60 2.3.3. Parallel genetic algorithms 64 2.4. Conclusion 66 Chapter 3. A New Concept for Genetic Algorithms Based on Order Statistics 67 3.1. Introduction 67 3.2. Order statistics 68 3.3. Estimating the probability that the global optimum belongs to a given domain 71 3.4. Genetic algorithms and order statistics 71 3.4.1. Introduction 71 3.4.2. Coding 72 3.4.3. Recombination operators 73 3.4.4. Evaluation of fitness 75 3.5. Application to test functions 75 3.5.1. Results for the Griewank function 77 3.5.2. Results for the Rosenbrook function 78 3.5.3. Results for the Lennard-Jones function 79 3.6. Conclusion 81 PART 2. APPLICATIONS TO AIR TRAFFIC CONTROL 83 Chapter 4. Air Traffic Control 85 Chapter 5. Contributions to Airspace Sectorization 91 5.1. Introduction 91 5.2. Modeling in 2D 93 5.2.1. Model based on a transportation network 93 5.2.2. Associated complexity 98 5.3. Continuous modeling 99 5.3.1. Principle 99 5.3.2. Chromosome coding 101 5.3.3. Initial population generation principle 101 5.3.4. Crossover operator 101 5.3.5. Mutation operator 103 5.3.6. Calculation and normalization of the fitness function 104 5.3.7. Results 106 5.3.8. Conclusion 110 5.4. Discrete modeling 111 5.4.1. Principle 111 5.4.2. Coding 113 5.4.3. Recombination operators 115 5.4.4. Results 117 5.4.5. Conclusion 119 5.5. Extension 3D 119 5.5.1. Introduction 119 5.5.2. Mathematical modeling 122 5.5.3. Application of artificial evolution to the problem 127 5.5.4. Results 132 5.5.5. Conclusion 135 5.6. Accounting for the dynamic aspect 136 5.6.1. Formalization of objectives and associated mathematical model 136 5.6.2. Optimization using a genetic algorithm: continuous approach 140 5.6.3. Optimization using a genetic algorithm: discrete approach 144 Chapter 6. Contribution to Traffic Assignment 151 6.1. Summary of traffic assignment methods based on transportation network theory 152 6.1.1. Transportation networks 153 6.1.2. Static assignment 155 6.1.3. Dynamic assignment 163 6.2. Other approaches to traffic assignment 167 6.2.1. Temporal extension of the network 167 6.2.2. Optimal control 168 6.2.3. Dynamic programming approaches (ground holding problem) 169 6.2.4. Conclusion 171 6.3. Using artificial evolution in all-or-nothing traffic assignment 173 6.3.1. Mathematical formalization of objectives 173 6.3.2. Coding and operators of the genetic algorithm 176 6.3.3. Introduction of an inter-chromosome distance for sharing 179 6.3.4. Example of results 182 6.3.5. Conclusion 185 6.4. Allocation of routes and slots using artificial evolution 186 6.4.1. System architecture 187 6.4.2. The fitness function 192 6.4.3. Simple genetic algorithm 194 6.5. Modification of the algorithm – adaptive modifications 198 6.5.1. Establishing congestion levels in the chromosome 198 6.5.2. Establishment of trends 200 6.5.3. New coding and biased initial population 203 6.5.4. New crossover operator 203 6.5.5. New mutation operator 204 6.5.6. New results 205 6.5.7. Dynamic bi-allocation 207 6.5.8. Multi-objective approach 210 6.5.9. Conclusion 211 6.6. Sequencing flights for landing 211 6.6.1. Introduction 212 6.6.2. Single runway formulation 213 6.6.3. Modeling using GA 214 6.6.4. Results 217 6.7. Trajectory planning 220 6.7.1. Introduction 220 6.7.2. The light propagation algorithm 222 6.7.3. Approach using genetic algorithms on B-splines 234 6.8. Conclusion 241 Chapter 7. Airspace Congestion Metrics 243 7.1. Introduction 243 7.2. Flow-based approach 248 7.2.1. Mathematical modeling of the control workload 253 7.3. Geometrical approaches 253 7.3.1. Proximity metric 254 7.3.2. Convergence 258 7.3.3. Clusters 263 7.3.4. Grassmannian indicator 265 7.4. Approach based on dynamic systems 268 7.4.1. Linear dynamic systems 268 7.4.2. Spatial extension using nonlinear dynamic systems 273 7.4.3. Spatiotemporal extension using nonlinear dynamic systems 281 7.4.4. Local linear models 285 7.4.5. Stochastic extension 288 Conclusion and Future Perspectives 291 Bibliography 299 Index 327

Read more less

Book Synopsis

Read more less

Book Synopsis

Read more less

Book SynopsisThis text examines the goals of data analysis with respect to enhancing knowledge, and identifies data summarization and correlation analysis as the core issues. Data summarization, both quantitative and categorical, is treated within the encoder-decoder paradigm bringing forward a number of mathematically supported insights into the methods and relations between them. Two Chapters describe methods for categorical summarization: partitioning, divisive clustering and separate cluster finding and another explain the methods for quantitative summarization, Principal Component Analysis and PageRank. Features:· An in-depth presentation of K-means partitioning including a corresponding Pythagorean decomposition of the data scatter. · Advice regarding such issues as clustering of categorical and mixed scale data, similarity and network data, interpretation aids, anomalous clusters, the number of clusters, etc.· Thorough attention to data-driven modelling including a number of mathematically stated relations between statistical and geometrical concepts including those between goodness-of-fit criteria for decision trees and data standardization, similarity and consensus clustering, modularity clustering and uniform partitioning.New edition highlights: · Inclusion of ranking issues such as Google PageRank, linear stratification and tied rankings median, consensus clustering, semi-average clustering, one-cluster clustering· Restructured to make the logics more straightforward and sections self-containedCore Data Analysis: Summarization, Correlation and Visualization is aimed at those who are eager to participate in developing the field as well as appealing to novices and practitioners. Trade Review“This book provides a clear overview of the data analysis process, the different types of statistical techniques employed for data analysis, and their role and purpose. … There is good use of a variety of examples to demonstrate how the different techniques are applied in practice. The book’s main purpose would be as a textbook for undergraduate students, or a reference book for data analysts.” (Mark Taylor, Computing Reviews, May 5, 2022)Table of Contents

Read more less

Book SynopsisThis must-read textbook presents an essential introduction to Kolmogorov complexity (KC), a central theory and powerful tool in information science that deals with the quantity of information in individual objects. The text covers both the fundamental concepts and the most important practical applications, supported by a wealth of didactic features.This thoroughly revised and enhanced fourth edition includes new and updated material on, amongst other topics, the Miller-Yu theorem, the Gács-Kučera theorem, the Day-Gács theorem, increasing randomness, short lists computable from an input string containing the incomputable Kolmogorov complexity of the input, the Lovász local lemma, sorting, the algorithmic full Slepian-Wolf theorem for individual strings, multiset normalized information distance and normalized web distance, and conditional universal distribution.Topics and features: describes the mathematical theory of KC, including the theories of algorithmic complexity and algorithmic probability; presents a general theory of inductive reasoning and its applications, and reviews the utility of the incompressibility method; covers the practical application of KC in great detail, including the normalized information distance (the similarity metric) and information diameter of multisets in phylogeny, language trees, music, heterogeneous files, and clustering; discusses the many applications of resource-bounded KC, and examines different physical theories from a KC point of view; includes numerous examples that elaborate the theory, and a range of exercises of varying difficulty (with solutions); offers explanatory asides on technical issues, and extensive historical sections; suggests structures for several one-semester courses in the preface.As the definitive textbook on Kolmogorov complexity, this comprehensive and self-contained work is an invaluable resource for advanced undergraduate students, graduate students, and researchers in all fields of science.Table of ContentsPreliminaries Algorithmic Complexity Algorithmic Prefix Complexity Algorithmic Probability Inductive Reasoning The Incompressibility Method Resource-Bounded Complexity Physics, Information, and Computation

Read more less

Book SynopsisThis practically-focused textbook presents a concise tutorial on data structures and algorithms using the object-functional language Scala. The material builds upon the foundation established in the title Programming with Scala: Language Exploration by the same author, which can be treated as a companion text for those less familiar with Scala.Topics and features: discusses data structures and algorithms in the form of design patterns; covers key topics on arrays, lists, stacks, queues, hash tables, binary trees, sorting, searching, and graphs; describes examples of complete and running applications for each topic; presents a functional approach to implementations for data structures and algorithms (excepting arrays); provides numerous challenge exercises (with solutions), encouraging the reader to take existing solutions and improve upon them; offers insights from the author’s extensive industrial experience; includes a glossary, and an appendix supplying an overview of discrete mathematics.Highlighting the techniques and skills necessary to quickly derive solutions to applied problems, this accessible text will prove invaluable to time-pressured students and professional software engineers.Table of ContentsFoundational Components Fundamental Algorithms Arrays Lists Stacks Queues Hash Tables Binary Trees Sorting Searching Graphs Appendix A: Solutions for Selected Exercises Appendix B: Review of Discrete Mathematical Topics

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the First International Workshop on Quantum Technology and Optimization Problems, QTOP 2019, held in Munich, Germany, in March 2019.The 18 full papers presented together with 1 keynote paper in this volume were carefully reviewed and selected from 21 submissions. The papers are grouped in the following topical sections: analysis of optimization problems; quantum gate algorithms; applications of quantum annealing; and foundations and quantum technologies.Table of ContentsAnalysis of Optimization Problems.- Quantum Gate Algorithms.- Applications of Quantum Annealing.- Foundations and Quantum Technologies.

Read more less

Book SynopsisThis book constitutes the refereed post-conference proceedings of the 14th EAI International Conference on Quality, Reliability, Security and Robustness in Heterogeneous Networks, QShine 2018, held in Ho Chi Minh City, Vietnam, in December 2018. The 13 revised full papers were carefully reviewed and selected from 28 submissions. The papers are organized thematically in tracks, starting with security and privacy, telecommunication systems and networks, networks and applications.Table of ContentsImproving Privacy for GeoIP DNS Traffic.- Deep Reinforcement Learning based QoS-aware Routing in Knowledge-defined networking.- 3 Throughput optimization for multirate multicasting through association control in IEEE 802.11 WLAN.- An NS-3 MPTCP Implementation.- A Novel Security Framework for Industrial IoT based on ISA 100.11a.- Social-aware Caching and Resource Sharing Optimization for Video Delivering in 5G Networks.- Energy Efficiency in QoS Constrained 60 GHz Millimeter-Wave Ultra-dense Networks.- Priority-based Device Discovery in Public Safety D2D Networks with Full Duplexing.- Modified Direct Method for Point-to-Point Blocking.- Probability in Multi-service Switching Networks with Resource Allocation Control.- Inconsistencies among Spectral Robustness Metrics.- QoS criteria for energy-aware switching networks.- Modelling Overflow Systems with Queuing in Primary.- Exploring YouTube’s CDN Heterogeneity.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 8th International Conference on Evolutionary Computation in Combinatorial Optimization, EvoMUSART 2019, held in Leipzig, Germany, in April 2019, co-located with the Evo*2019 events EuroGP, EvoCOP and EvoApplications. The 16 revised full papers presented were carefully reviewed and selected from 24 submissions. The papers cover a wide range of topics and application areas, including: visual art and music generation, analysis, and interpretation; sound synthesis; architecture; video; poetry; design; and other creative tasks.Table of ContentsDeep Learning Concepts for Evolutionary Art.- Adversarial Evolution and Deep Learning – How Does An Artist Play with Our Visual System.- Autonomy, Authenticity, Authorship and Intention in Computer Generated Art.- Camera Obscurer: Generative Art for Design Inspiration.- Swarm-Based Identification of Animation Key Points from 2D-medialness Maps.- Paintings, Polygons and Plant Propagation.- Evolutionary Games for Audiovisual Works: Exploring the Demographic Prisoner's Dilemma.- Emojinating: Evolving Emoji Blends.- Automatically Generating Engaging Presentation Slide Decks.- Tired of choosing? Just Add Structure and Virtual Reality.- EvoChef: Show Me What to Cook! Artificial Evolution of Culinary Arts.- Comparing Models for Harmony Prediction in An Interactive Audio Looper.- Stochastic Synthesizer Patch Exploration in Edisyn.- Evolutionary Multi-Objective Training Set Selection of Data Instances and Augmentations for Vocal Detection.- Automatic Jazz Melody Composition Through a Learning-Based Genetic Algorithm.- Exploring Transfer Functions in Evolved CTRNNs for Music Generation.

Read more less

Book SynopsisThis English version of Ruslan L. Stratonovich’s Theory of Information (1975) builds on theory and provides methods, techniques, and concepts toward utilizing critical applications. Unifying theories of information, optimization, and statistical physics, the value of information theory has gained recognition in data science, machine learning, and artificial intelligence. With the emergence of a data-driven economy, progress in machine learning, artificial intelligence algorithms, and increased computational resources, the need for comprehending information is essential. This book is even more relevant today than when it was first published in 1975. It extends the classic work of R.L. Stratonovich, one of the original developers of the symmetrized version of stochastic calculus and filtering theory, to name just two topics.Each chapter begins with basic, fundamental ideas, supported by clear examples; the material then advances to great detail and depth. The reader is not required to be familiar with the more difficult and specific material. Rather, the treasure trove of examples of stochastic processes and problems makes this book accessible to a wide readership of researchers, postgraduates, and undergraduate students in mathematics, engineering, physics and computer science who are specializing in information theory, data analysis, or machine learning.Trade Review“The book could be useful in advanced graduate courses with students, who are not afraid of integrals and probabilities.” (Jaak Henno, zbMATH 1454.94002, 2021)Table of Contents

Read more less

Book SynopsisThis textbook is a concise introduction to the basic toolbox of structures that allow efficient organization and retrieval of data, key algorithms for problems on graphs, and generic techniques for modeling, understanding, and solving algorithmic problems. The authors aim for a balance between simplicity and efficiency, between theory and practice, and between classical results and the forefront of research. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, priority queues, sorted sequences, graph representation, graph traversal, shortest paths, minimum spanning trees, optimization, collective communication and computation, and load balancing. The authors also discuss important issues such as algorithm engineering, memory hierarchies, algorithm libraries, and certifying algorithms. Moving beyond the sequential algorithms and data structures of the earlier related title, this book takes into account the paradigm shift towards the parallel processing required to solve modern performance-critical applications and how this impacts on the teaching of algorithms. The book is suitable for undergraduate and graduate students and professionals familiar with programming and basic mathematical language. Most chapters have the same basic structure: the authors discuss a problem as it occurs in a real-life situation, they illustrate the most important applications, and then they introduce simple solutions as informally as possible and as formally as necessary so the reader really understands the issues at hand. As they move to more advanced and optional issues, their approach gradually leads to a more mathematical treatment, including theorems and proofs. The book includes many examples, pictures, informal explanations, and exercises, and the implementation notes introduce clean, efficient implementations in languages such as C++ and Java.Trade Review“The style of the book is accessible and is suitable for a wide range of audiences, from mathematicians and computer scientists to researchers from other fields who would like to use parallelised approaches in their research.” (Irina Ioana Mohorianu, zbMATH 1445.68003, 2020)Table of ContentsAppetizer: Integer Arithmetic.- Introduction.- Representing Sequences by Arrays and Linked Lists.- Hash Tables and Associative Arrays.- Sorting and Selection.- Priority Queues.- Sorted Sequences.- Graph Representation.- Graph Traversal.- Shortest Paths.- Minimum Spanning Trees.- Generic Approaches to Optimization.- Collective Communication and Computation.- Load Balancing.- App. A, Mathematical Background.- App. B, Computer Architecture Aspects.- App. C, Support for Parallelism in C++.- App. D, The Message Passing Interface (MPI).- App. E, List of Commercial Products, Trademarks and Licenses.

Read more less

Book SynopsisThis book constitutes the refereed post-conference proceedings of the Special Event on the Analysis of Experimental Algorithms, SEA² 2019, held in Kalamata, Greece, in June 2019.The 35 revised full papers presented were carefully reviewed and selected from 45 submissions. The papers cover a wide range of topics in both computer science and operations research/mathematical programming. They focus on the role of experimentation and engineering techniques in the design and evaluation of algorithms, data structures, and computational optimization methods.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 27th International Symposium on Graph Drawing and Network Visualization, GD 2019, held in Prague, Czech Republic, in September 2019.The 42 papers and 12 posters presented in this volume were carefully reviewed and selected from 113 submissions. They were organized into the following topical sections: Cartograms and Intersection Graphs, Geometric Graph Theory, Clustering, Quality Metrics, Arrangements, A Low Number of Crossings, Best Paper in Track 1, Morphing and Planarity, Parameterized Complexity, Collinearities, Topological Graph Theory, Best Paper in Track 2, Level Planarity, Graph Drawing Contest Report, and Poster Abstracts.Table of ContentsCartograms and Intersection Graphs.- Stick Graphs with Length Constraints.- Representing Graphs and Hypergraphs by Touching Polygons in 3D.- Optimal Morphs of Planar Orthogonal Drawings II.- Computing Stable Demers Cartograms.- Geometric Graph Theory.- Bundled Crossings Revisited.- Crossing Numbers of Beyond-Planar Graphs.- On the 2-Colored Crossing Number.- Minimal Representations of Order Types by Geometric Graphs.- Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators.- Clustering.- A Quality Metric for Visualization of Clusters in Graphs.- Multi-level Graph Drawing using Infomap Clustering.- On Strict (Outer-)Confluent Graphs.- Quality Metrics.- On the Edge-Length Ratio of Planar Graphs.- Node Overlap Removal Algorithms: A Comparative Study.- Graphs with large total angular resolution.- Arrangements.- Computing Height-Optimal Tangles Faster.- On Arrangements of Orthogonal Circles.- Extending Simple Drawings.- Coloring Hasse diagrams and disjointness graphs of curves.- A Low Number of Crossings.- Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity.- The QuaSEFE Problem.- ChordLink: A New Hybrid Visualization Model.- Stress-Plus-X (SPX) Graph Layout.- Best Paper in Track 1.- Exact Crossing Number Parameterized by Vertex Cover.- Morphing and Planarity.- Maximizing Ink in Partial Edge Drawings of k-Plane Graphs.- Graph Drawing with Morphing Partial Edges.- A Note on Universal Point Sets for Planar Graphs.- Parameterized Complexity.- Parameterized Algorithms for Book Embedding Problems.- Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs.- Collinearities.- 4-Connected Triangulations on Few Lines.- Line and Plane Cover Numbers Revisited.- Drawing planar graphs with few segments on a polynomial grid.- Variants of the Segment Number of a Graph.- Topological Graph Theory.- Local and Union Page Numbers.- Mixed Linear Layouts: Complexity, Heuristics, and Experiments.- Homotopy height, grid-major height and graph-drawing height.- On the Edge-Vertex Ratio of Maximal Thrackles.- Best Paper in Track 2.- Symmetry Detection and Classification in Drawings of Graphs.- Level Planarity.- An SPQR-Tree-Like Embedding Representation for Upward Planarity.- A Natural Quadratic Approach to the Generalized Graph Layering Problem.- Graph Stories in Small Area.- Level-Planar Drawings with Few Slopes.- Graph Drawing Contest Report.- Graph Drawing Contest Report.- Poster Abstracts.- A 1-planarity Testing and Embedding Algorithm.- Stretching Two Pseudolines in Planar Straight-Line Drawings.- Adventures in Abstraction: Reachability in Hierarchical Drawings.- On Topological Book Embedding for k-Plane Graphs.- On Compact RAC Drawings.- FPQ-choosable Planarity Testing.- Packing Trees into 1-Planar Graphs.- Geographic Network Visualization Techniques: A Work-In-Progress Taxonomy.- On the Simple Quasi Crossing Number of K 11.- Minimising Crossings in a Tree-Based Network.- Crossing Families and Their Generalizations.- Which Sets of Strings are Pseudospherical?.

Read more less

Book SynopsisThis book constitutes the proceedings of the 21st International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2020. The 21 papers presented in this volume were carefully reviewed from 44 submissions. VMCAI provides a forum for researchers from the communities of verification, model checking, and abstract Interpretation, facilitating interaction, cross-fertilization, and advancement of hybrid methods that combine these and related areas. Table of ContentsWitnessing Secure Compilation.- BackFlow: Backward Context-sensitive Flow Reconstruction of Taint Analysis Results.- Fixing Code That Explodes Under Symbolic Evaluation.- The Correctness of a Code Generator for a Functional Language.- Leveraging Compiler Intermediate Representation for Multi- and Cross-Language Verification.- Putting the Squeeze on Array Programs: Loop Verification via Inductive Rank Reduction.- A Systematic Approach to Abstract Interpretation of Program Transformations.- Sharing ghost variables in a collection of abstract domains.- Harnessing Static Analysis to Help Learn Pseudo-Inverses of String Manipulating Procedures for Automatic Test Generation.- Synthesizing Environment Invariants for Modular Hardware Verification.- Systematic Classi cation of Attackers via Bounded Model Checking.- Cheap CTL Compassion in NuSMV.- A Cooperative Parallelization Approach for Property-Directed k-Induction.- Generalized Property-Directed Reachability for Hybrid Systems.- Language Inclusion for Finite Prime Event Structures.- Promptness and Bounded Fairness in Concurrent and Parameterized Systems.- Solving LIA* Using Approximations.- Formalizing and checking Multilevel Consistency.- Practical Abstractions for Automated Veri cation of Shared-Memory Concurrency.- How to Win First-Order Safety Games.- Improving Parity Game Solvers with Justifications.

Read more less

Book SynopsisThis book contains extended versions of the best papers presented at the First International Workshop on Distributed Computing for Emerging Smart Networks, DiCES-N 2019, held in Hammamet, Tunisia, in October 2019.The 9 revised full papers included in this volume were carefully reviewed and selected from 24 initial submissions. The papers are organized in the following topical sections: ​intelligent transportation systems; distributed computing for networking and communication; articial intelligence applied to cyber physical systems.Table of ContentsIntelligent Transportation Systems.- Distributed Computing for Networking and Communication.- Articial Intelligence Applied to Cyber Physical Systems.

Read more less

Book SynopsisThis Festschrift is in honor of Ker-I Ko, Professor in the Stony Brook University, USA. Ker-I Ko was one of the founding fathers of computational complexity over real numbers and analysis. He and Harvey Friedman devised a theoretical model for real number computations by extending the computation of Turing machines. He contributed significantly to advancing the theory of structural complexity, especially on polynomial-time isomorphism, instance complexity, and relativization of polynomial-time hierarchy. Ker-I also made many contributions to approximation algorithm theory of combinatorial optimization problems. This volume contains 17 contributions in the area of complexity and approximation. Those articles are authored by researchers over the world, including North America, Europe and Asia. Most of them are co-authors, colleagues, friends, and students of Ker-I Ko.Table of ContentsIn Memoriam: Ker-I Ko (1950-2018).- Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity.- The Power of Self-Reducibility Selectivity, Information, and Approximation.- Who Asked Us - How the Theory of Computing Answers, QuestionsAbout Analysis.- Promise Problems on Probability Distributions.- On Nonadaptive Reductions to the Set of Random Strings and its Dense Subsets.- Computability of the Solutions to Navier-Stokes Equations via Recursive Approximation.- Automatic Generation of Structured Overviews over a Very Large Corpus of Documents.- Better Upper Bounds for Searching on a Line with Byzantine Robots.- A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions.- Sequential Location Game on Continuous Directional Star Networks.- Core Decomposition, Maintenance and Applications.- Active and Busy Time Scheduling Problem: a Survey.- A Note on the Position Value for Hypergraph Communication Situations.- An Efficient Approximation Algorithm for the Steiner Tree Problem.- A Review for Submodular Optimization on Machine Scheduling Problems.- Edge Computing Integrated with Blockchain Technologies.

Read more less

Book SynopsisThis Festschrift was published in honor of Hans L. Bodlaender on the occasion of his 60th birthday. The 14 full and 5 short contributions included in this volume show the many transformative discoveries made by H.L. Bodlaender in the areas of graph algorithms, parameterized complexity, kernelization and combinatorial games. The papers are written by his former Ph.D. students and colleagues as well as by his former Ph.D. advisor, Jan van Leeuwen.Chapter “Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds” is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.Table of ContentsSeeing Arboretum for the (partial k) Trees.- Collaborating With Hans: Some Remaining Wonderments.- Hans Bodlaender and the Theory of Kernelization Lower Bounds.- Algorithms, Complexity, and Hans.- Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs.- As Time Goes By: Reflections on Treewidth for Temporal Graphs.- Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs.- Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds.- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths.- Four shorts stories on surprising algorithmic uses of treewidth.- Algorithms for NP-Hard Problems via Rank-related Parameters of Matrices.- A Survey on Spanning Tree Congestion.- Surprising Applications of Treewidth Bounds for Planar Graphs.- Computing tree decompositions.- Experimental analysis of treewidth.- A Retrospective on (Meta) Kernelization.- Games, Puzzles and Treewidth.- Fast Algorithms for Join Operations on Tree Decompositions.

Read more less

Book SynopsisBlockchain and other trustless systems have gone from being relatively obscure technologies, which were only known to a small community of computer scientists and cryptologists, to mainstream phenomena that are now considered powerful game changers for many industries. This book explores and assesses real-world use cases and case studies on blockchain and related technologies. The studies describe the respective applications and address how these technologies have been deployed, the rationale behind their application, and finally, their outcomes. The book shares a wealth of experiences and lessons learned regarding financial markets, energy, SCM, healthcare, law and compliance. Given its scope, it is chiefly intended for academics and practitioners who want to learn more about blockchain applications.Table of ContentsToward More Rigorous Blockchain Research: Recommendations for Writing Blockchain Case Studies.- From a Use Case Categorization Scheme Towards A Maturity Model for Engineering Distributed Ledgers.- What’s In The Box? Combating Counterfeit Medications in Pharmaceutical Supply Chains With Blockchain Vigilant Information Systems.- A Use Case of Blockchain in Healthcare: Allergy Card.- International Exchange Of Financial Information on Distributed Ledgers: Outlook and Design Blueprint.- A Blockchain Supported Solution for Compliant Digital Security Offerings.- A Blockchain-Driven Approach to Fulfill the GDPR Recording Requirements.- Wibson: A Case Study of a Decentralized, Privacy-Preserving Data Marketplace.- : Business Process Transformation in Natural Resources Development Using Blockchain: Indigenous Entrepreneurship, Trustless Technology, and Rebuilding Trust.- Smart City Applications on the Blockchain: Development of a Multi-Layer Taxonomy.- A Case Study of Blockchain-Induced Digital Transformation in the Public Sector.- Analyzing the Potential of DLT-Based Applications in Smart Factories.- Disrupting Platform Organizations with Blockchain Technology and the Internet of Things?.- Using Blockchain for Online Multimedia Management: Characteristics of Existing Platforms.- Supply Chain Visibility Ledger.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 15th International Conference on Persuasive Technology, PERSUASIVE 2020, held in Aalborg, Denmark, in April 2020. The 18 full papers presented in this book were carefully reviewed and selected from 79 submissions. The papers are grouped in the following topical sections: methodological and theoretical perspectives on persuasive design; persuasive in practice, digital insights; persuasive technologies for health and wellbeing; persuasive solutions for a sustainable future; and on security and ethics in persuasive technology.Table of ContentsMethodological and theoretical perspectives on persuasive design.- Persuasive in practice, digital insights.- Persuasive technologies for health and wellbeing.- Persuasive solutions for a sustainable future.- On security and ethics in Persuasive Technology.

Read more less

This book is specially designed to refresh and elevate the level of understanding of the foundational background in probability and distributional theory required to be successful in a graduate-level statistics program. Advanced undergraduate students and introductory graduate students from a variety of quantitative backgrounds will benefit from the transitional bridge that this volume offers, from a more generalized study of undergraduate mathematics and statistics to the career-focused, applied education at the graduate level. In particular, it focuses on growing fields that will be of potential interest to future M.S. and Ph.D. students, as well as advanced undergraduates heading directly into the workplace: data analytics, statistics and biostatistics, and related areas.

Read more less

Book SynopsisThis two-volume set of LNCS 12188 and 12189 constitutes the refereed proceedings of the 14th International Conference on Universal Access in Human-Computer Interaction, UAHCI 2020, held as part of the 22nd International Conference, HCI International 2020, which took place in Copenhagen, Denmark, in July 2020. The conference was held virtually due to the COVID-19 pandemic. The total of 1439 papers and 238 posters have been accepted for publication in the HCII 2020 proceedings from a total of 6326 submissions. UAHCI 2020 includes a total of 80 regular papers which are organized in topical sections named: Design for All Theory, Methods and Practice; User Interfaces and Interaction Techniques for Universal Access; Web Accessibility; Virtual and Augmented Reality for Universal Access; Robots in Universal Access; Technologies for Autism Spectrum Disorders; Technologies for Deaf Users; Universal Access to Learning and Education; Social Media, Digital Services, eInclusion and Innovation; Intelligent Assistive Environments.Table of ContentsUniversal Design of ICT: A Historical Journey from Specialized Adaptations towards Designing for Diversity.- From Accessible Interfaces to Useful and Adapted Interactions.- Integrated Assistive Auxiliary System - Developing Low Cost Assistive Technology to Provide Computational Accessibility for Disabled People.- Co-creating Persona Scenarios with Diverse Users Enriching Inclusive Design.- Construction of an Inexpensive Eye Tracker for Social Inclusion and Education.- Understanding Organizations through Systems Oriented Design: Mapping Critical Intervention Points for Universal Design.- Process Modelling (BPM) in Healthcare – Breast Cancer Screening.- Brain-Computer Interfaces for Communication in Severe Acquired Brain Damage: Challenges and Strategies in Clinical Research and Development.- Evaluating Hands-on and Hands-free Input Methods for a Simple Game.- Affective Communication Enhancement System for Locked-In Syndrome Patients.- Perceived Midpoint of the Forearm.- User Interfaces in Dark Mode During Daytime – Improved Productivity or Just Cool-Looking?.- Usability Evaluation of Short Dwell-time Activated Eye Typing Techniques.- A Comparative Study of Three Sudoku Input Methods for Touch Displays.- QB-Gest: Qwerty Bimanual Gestural Input for Eyes-free Smartphone Text Input.- Exploring WAI-Aria Techniques to Enhance Screen Reader Interaction: The Case of a Portal for Rating Accessibility of Cultural Heritage Sites.- Impact of Sentence length on the Readability of Web for Screen Reader Users.- Towards Universal Accessibility on the Web: Do Grammar Checking Tools Improve Text Readability?.- Investigating the Effect of Adding Visual Content to Textual Search Interfaces on Accessibility of Dyslexic Users.- A Comparative Study of Accessibility and Usability of Norwegian University Websites for Screen Reader Users Based on User Experience and Automated Assessment.- Usability of User-centric Mobile application design from Visually Impaired People's Perspective.- Large Scale Augmented Reality for Collaborative Environments.- Walking Support for Visually Impaired Using AR/MR and Virtual Braille Block.- Effect of Background Element Difference on Regional Cerebral Blood Flow while Viewing Stereoscopic Video Clips.- Dementia: I Am Physically Fading. Can Virtual Reality Help? Physical Training for People with Dementia in Confined Mental Health Units.- A Virtual Rehabilitation System for Occupational Therapy with Hand Motion Capture and Force Feedback -Implementation with Vibration Motor.- iVision: An Assistive System for the Blind based on Augmented Reality and Machine Learning.- Relationship between Eye Movements and Individual Differences in Motion Sickness Susceptibility While Viewing Stereoscopic Movies under Controlled Consciousness.- HoloPrognosis - An AR-based Serious Exercise Game for Early Stage Parkinson’s Disease Patients.- A Feasibility Study on the Application of Virtual Reality Technology for the Rehabilitation of Upper Limbs after Stroke.- Usable and Accessible Robot Programming System for People Who are Visually Impaired.- Lego Robots in Puppet Play for Children with Cerebral Palsy.- Being Aware of One’s Self in the Auto-Generated Chat with a Communication Robot.- Voice User Interfaces for Service Robots: Design Principles and Methodology.- Robotic Cane for the Visually Impaired.

Read more less

Book SynopsisThis book introduces the basic methodologies for successful data analytics. Matrix optimization and approximation are explained in detail and extensively applied to dimensionality reduction by principal component analysis and multidimensional scaling. Diffusion maps and spectral clustering are derived as powerful tools. The methodological overlap between data science and machine learning is emphasized by demonstrating how data science is used for classification as well as supervised and unsupervised learning.Table of Contents1 Introduction.- 2 Prerequisites from Matrix Analysis.- 3 Multivariate Distributions and Moments.- 4 Dimensionality Reduction.- 5 Classification and Clustering.- 6 Support Vector Machines.- 7 Machine Learning.- Index.

Read more less

Book SynopsisIs everything Information? This is a tantalizing question which emerges in modern physics, life sciences, astronomy and in today’s information and technology-driven society. In Powers of Two expert authors undertake a unique expedition - in words and images - throughout the world (and scales) of information. The story resembles, in a way, the classic Powers of Ten journeys through space: from us to the macro and the micro worlds . However, by following Powers of Two through the world of information, a completely different and timely paradigm unfolds. Every power of two, 1, 2, 4, 8…. tells us a different story: starting from the creation of the very first bit at the Big Bang and the evolution of life, through 50 years of computational science, and finally into deep space, describing the information in black holes and even in the entire universe and beyond…. All this to address one question: Is our universe made of information? In this book, we experience the Information Universe in nature and in our society and how information lies at the very foundation of our understanding of the Universe.From the Foreword by Robbert Dijkgraaf: This book is in many ways a vastly extended version of Shannon’s one-page blueprint. It carries us all the way to the total information content of the Universe. And it bears testimony of how widespread the use of data has become in all aspects of life. Information is the connective tissue of the modern sciences. […] Undoubtedly, future generations will look back at this time, so much enthralled by Big Data and quantum computers, as beholden to the information metaphor. But that is exactly the value of this book. With its crisp descriptions and evocative illustrations, it brings the reader into the here and now, at the very frontier of scientific research, including the excitement and promise of all the outstanding questions and future discoveries.Message for the e-reader of the book Powers of Two The book has been designed to be read in two-page spreads in full screen mode. For optimal reader experience in a downloaded .pdf file we strongly recommend you use the following settings in Adobe Acrobat Reader: - Taskbar: View > Page Display > two page view - Taskbar: View > Page Display > Show Cover Page in Two Page View - Taskbar: ^ Preferences > Full Screen > deselect " Fill screen with one page at a time" - Taskbar: View > Full screen mode or ctrl L (cmd L on a Mac) ***** Note: for reading the previews on Spinger link (and on-line reading in a browser), the full screen two-page view only works with these browsers: Firefox - Taskbar: on top of the text, at the uppermost right you will see then >> (which is a drop-down menu) >> even double pages - Fullscreen: F11 or Control+Cmd+F with Mac Edge - Taskbar middle: Two-page view and select show cover page separatelyTrade Review“The book … a very unusual collection of some facts about the relationship between the immaterial world represented by bits and the real physical world described by fundamental physical equations. This book continues the very categorical point of view of J. A. Wheeler … . The book presents short articles on various areas of modern science … in which it is shown that in these areas in some mysterious way there is a connection with the theory of information.” (Vladimir Dzhunushaliev, zbMATH 1479.83004, 2022)Table of ContentsForeword by Robbert DijkgraafChapter 0: IntroductionJoy-riding the Universe – by the authorWorking as an astronomer, data scientist and professor of astro-informatics for nearly fifty years, Edwin Valentijn has witnessed and first-hand engineered the dawn of the era of Big Data in science and society. Throughout his career, he became increasingly aware of the role of information in our world: in computers, in our society, and even in nature and in the Universe itself.The Information UniverseFollowing the increasing powers of two, the story paints a journey through the whole world of information, both in society and in nature. Each step opens a door into a new world: from the first bits with the Big Bang and the dawn of life, going through fifty years of human technology, all the way up to the information content of the whole Universe.What is Information? - Item pageThe basics of information are introduced.Chapter 1: The beginningSpace-time foam – Ti (0 bit: 20 =1)The very first power of two: 20, corresponds to the value one. This identifies the single, eternal, indistinguishable state: the primordial sea from which our Universe emerged – sometimes called the Space-time foam. I call this Ti, the reverse of It. This is one of the miraculous new notions in the story of the Powers of Two.Multiverse: Anthropic principle (Item page)From Ti, the primordial space-time foam, countless universes arise with widely different characteristics: the Multiverse. The Anthropic Principle is a philosophical consideration which states that we, people, will find ourselves in a universe that is suitable for intelligent life to emerge. Therefore, this Principle demonstrates that conditions in our Universe are not “fine-tuned” to the existence of human life and a “creator” doesn’t exist.Big bang (1 bit: 21 =2 states)At the Big Bang the first bit is created. From the indistinguishable unity of the primordial foam Ti, “the zeros were separated from the 1’s”: the first bit corresponds to two possible states. This bit is the first step on our journey to capture the ever-increasing complexity of our expanding Universe in terms of information, through the increasing powers of two.What is a bit? (Item page)The bit is at the core of the concept of information. A bit is any system that can have two states. Humans assign meanings to these states, which are illustrated with the concept of the traffic light: red or green, stop or go. The combination of multiple bits creates an exponentially increasing number of possible states, and hence meanings.Multicellular life (2 bit: 22 =4 states) / (4 bit: 24 =16 states)?Life started with exchanging information between cells. This is fundamental for the evolution of any kind of life. It took at least two billion years for uni-cellular to evolve into multi-cellular organisms around 600 million years ago, and to start the exchange of information between their different cells. By exchanging information, cells collaborate and act as a unified whole: life.The game of life (Item page)The characteristic features of life (or any complex system in the Universe) can be created from information. A simple computer game is all you need to demonstrate this concept. A famous example is Conway's Game of Life, which is full of visuals of living, growing, moving and dying objects. This game was already made on the computers of the early 70's with just a few lines of code.Chapter 2: People's Information UniverseASCII (7 bit: 27 =128 states)There is currently no physical theory how the digital world connects to the human consciousness. In the world of Information Technology (IT) all information exchange is based on agreements between people. For instance, ASCII, a simple list relating each letter of the alphabet to a 7-bit string, connects the digital world to the human consciousness. Machu Picchu (8 bit: 28 =256, 1 byte)The Intiwatana stone, a giant rock carved by the Inca's of ancient Machu Picchu in Peru, can be considered as a first 8-bit hard disk. Why so? As the sunrays lit the different surfaces of this huge rock throughout the year, it triggered the Inca's activities: sowing, harvesting, celebrating and praying.This ancient stone dissolves both the boundaries between heaven and earth, and those between the digital and natural Information Universe. In fact, the stone represents an ultimate picture of the cross-over between the in vivo and the in vitro Information Universe - a main theme of the book. In vitro being the man made technology to handle information and in vivo being the information built in nature, in this case the orbit and the light rays of the sun.First computers (16 bit: 216 =65.536, 2 byte)When computers emerged in the 1970's, astronomers first adopted them to steer their telescopes. Back then, a maximal effort to understand the mathematics of the problem was needed to squeeze the solution into the small computer memory. Nowadays, with large amounts of computing power and machine learning at their disposal, scientists and computer programmers often do the reverse.Star Peace vs. Star Wars (Item page)King Juan Carlos adored the harmony of galaxies as a source of inspiration for people on earth, in those days when Ronald Reagan was promoting his Star-wars programme. With this adoration in mind, in 1985, he gave an inspiring speech at the Royal inauguration of the international astronomical observatory on La Palma, Canary Islands. The inauguration was attended by, for those days, an unprecedented large crowd of European royals and government officials despite the great threat of terrorist attacks by the ETA. (the next and later spreads on facts vs fakes elucidate the relevance of this spread in the story line).Pre-internet Facts and Fakes (Item page)“Edwin Valentijn saved the life of the Dutch Queen Beatrix by catching her just before falling off a cliff at the inauguration on La Palma”, according to the headlines in Dutch newspapers. Fake news-stories are at all times alike and can only be dispelled by tracing links of information to their source, links or associations being a fundamental property of the Information Universe. Later, I discuss the less innocent case of overdrawing attention to terrorist attacks in the past decade.Hard disk (24 bit: 224 =1.6*107, 2 Mb)Only sixty years ago, a 5 MB hard disk weighed over five tons, and had to be loaded onto an aeroplane by using a truck. Now, we carry a thousand times more information in our trouser pocket. This demonstrates the amazing advance of information technology over the past decades. (Picture: first IBM hard disk loaded onto a plane).The telephone (Item page) As a precursor of the Internet, the telephone offered many of the same advantages and dangers, and was heavily discussed at its introduction. Whether telephone or the Internet, it all revolves around communication or copying of information. The telephone, as example of it, is one of the major discoveries of the 20th century. DNA (32 bit: 232 = 4*109, 500 Mb) – Guest author: Charley Lineweaver The information in the DNA creates life. All base pairs of the human DNA can be stored on a 500 Mb drive. How is this information communicated? How does a cell know it has to build part of a liver and not an eye, while they all have the same DNA? Apoptosis and the role of information exchange.Where does biological Information come from? (Item page) – Guest author: Charley Lineweaver Charley Lineweaver, expert on evolutionary biology, exoplanetology and astrobiology, will expand on the role of information in the evolution of life.Lifelines (Item page) – Guest author: Morris SwertzWhat is the role of nature versus that of nurture? A key question in modern health research. In Lifesciences, this question is addressed now using Big Data, like the astronomers who acquire huge data volumes to address the same question on the nature of galaxies. In Lifelines, a cohort of 165.000 people is studied over a period of 30 years using hospital data, blood samples and DNA scans.DVD (33 bit: 233 =9*109, 1 Gb)It’ s amazing how fast the digital image revolution went since 1989.30 years ago, Philips lab approached me since they had made a big discovery: it was possible to store many digital images on a CD. They were chasing me for digital images. While NASA had less than a thousand, I had 32.000 galaxy images obtained by scanning photographic plates from the European Southern Observatory – the first large digital image collection.Human Brain (36 bit: 236 =7*1010, 9 Gb) – Guest author: Katrin Amunts- JulichIn the large EU human brain project, the activities of the human brain are simulated in computers. This is a very difficult mission since the transistors in computers consume 100.000 billion times more energy than the synapsis of neurons. Our brains consist of 1011 neurons, corresponding to 9 Gb of data.Thinking of Karlheinz Meier, coordinator of the Human Brain Project in Heidelberg, Katrin Amunts will author two spreads on the role of information in the human brain.Neuromorphic computing – Guest author: Katrin AmuntsCurrently, it takes a hundred years of a supercomputer’s time to compete with the learning power of only a single day of the human brain. “Neuromorphic computing” researchers design electronic systems inspired by the human brain, in order to make computers many times faster and more energy efficient.CT scan (38 bit: 238 =3*1011, 34 Gb) – Guest author: Anders YnnermanNow it is possible to look inside animal and human bodies on touchscreens. Forensic investigations on, for instance, corpses of victims can be done with touch-screen tables. You can look inside, rotate, scroll and zoom animal and human bodies using tens of gigabytes of CT scan data. Prof. Anders Ynnerman explains how he does it.Terabytes (45 bit: 245 =4.4*1012, 1 Tb) - The largest (astronomical) datasetsDark energy and dark matter: two mysterious constituents of our Universe. How do astronomers get and handle the data from the VLT Survey Telescope on a high mountain top in Chile to shed lights on these ‘still too dark’ topics. This Telescope surveys the sky every hour at night generating Terabytes of astronomical data.Gravity as a lens (Item page) – Guest author: Margot BrouwerWhen light rays are bent by the gravity of a heavy object, this object acts as a lens. This effect can be used to map dark matter, which is invisible but constitutes 80% of the matter in our visible Universe. In 1915, Albert Einstein posed that gravity is equivalent to the curvature of the fabric of space and time itself, leading to the lensing effect.Weak gravitational lensing surveys – Guest author: Margot BrouwerTerabytes of astronomical data are reduced to a few numbers, describing how dark matter behaves and what is its true nature. https://www.youtube.com/watch?v=ZCyYGWqCmFw&t=23sEntering the Petabyte regime (53 bit: 253 =1*1015, 1 Pb)How do we technically acquire and deal with Petabytes of data?Dark Matter maps (Item page)A first dark matter map projected on the night sky. An ultimate encounter between the digital world of modern astronomical observations, and nature: the mysterious dark matter mapped on top of the everyday “night” stellar sky. A visualization that condenses Terabytes of astronomical data to a simple map.Metadata for Peta-data (62 bit: 262 =6*1017, 600 Pb)With pointers, one can connect everything in the Information Universe. Pointers are often inserted in Metadata (data about data) - an ultimate tool for dealing with Big Data. It is possible to create unique pointers to hundreds of Petabytes of data, using a string of less than 64 bits. This is what makes pointers so powerful and indispensable in current and future stages of the big data era; not only for astronomical research, but also for companies like Google, Amazon and Facebook.Downloading the Universe (Item page)The universe can be seen as a spreadsheet, certainly in the way we map it on our computers (in vitro), but also in nature (in vivo). Perceiving the Universe as a spreadsheet links bit to It.Meta data (Item page)A visualisation of the enormous complexity of data models which trace all pointers between data items. (picture: thrilling still from a full dome animation of a data model)Future (astronomical) datasets (item page)While current telescopes collect astronomical datasets of Terabytes, future telescopes such as the LSST and the Euclid satellite, instead, will collect Petabytes. These enormous amounts of data need a whole new approach to data management. For the Euclid satellite my “Universe as a spreadsheet” approach has been adopted.The Euclid satellite (Item page) – Guest author: Margot BrouwerEuclid is ESA’s new space mission to map the Dark Universe. At a distance of 1.5 million kilometres from Earth, this telescope will observe billions of galaxies. Its goal: to shed light on the nature of Dark Matter and Dark Energy, which make up 95% of our Universe. Dr. Margot Brouwer, Dutch scientific communication officer for Euclid, will explain more.The Information Universe (Item page)The resemblance of the overall structure of the real observed Universe (in vivo) with the simulated universe (in vitro), based on the concurrent cosmological model, gave a lot of credit to the latter. When we zoom out the Universe, we see billions of galaxies forming a web-like structure. Amazingly, astronomers can now compute and simulate these structures with very large supercomputers.The lost boy (Item page)Information is timeless, and knows no boundaries. It crosses over the in vivo and the in vitro Information Universe. This concept is well illustrated through daily life stories involving time. At the age of five, a boy loses sight of his older brother on a train in India, and eventually gets lost on the streets of Mumbai. Twenty years later, after being adopted by a family in Australia, he is able to find his natural mother (in vivo) through only searching on Google maps (in vitro).Qbits (50 qbit: 250 =1.1*1015 qbit, 1 Pbit) – Guest author: Lieven VandersypenUsing fundamental particles (quanta, such as electrons) to perform calculations and build computers, is one of the most exciting cross-overs between the in vivo and the in vitro Information Universe. Prof. Lieven Vandersypen, who leads a Quantum Computing group at TU Delft in the Netherlands, will explain how this technology will change the way we compute.Quantum entanglement (Item page) – Guest author: Lieven VandersypenThe states of two particles can be intimately linked (entangled), no matter how far they are separated. What Einstein famously dismissed as “spooky action at a distance”, can now be established on demand at TU Delft in the Netherlands. Prof. Vandersypen will explain how his research group, for the first time ever, both create and apply this entanglement in laboratory.Entanglement (item page) - EVThe Square Kilometre Array (64 bit: 264 =1.3*1018, 1 Eb) – Guest author: TBAThe Square Kilometre Telescope will collect data at the rate of the global internet traffic of 2013, in its endeavour to answer fundamental questions about the origin and evolution of the Universe, and its search for extra-terrestrial life.Cryptography (128 bit: 2128 =3.4*1038) – Guest author Tanja LangeEncrypted messages should not be decoded by adversaries, be they criminals or hostile countries. Cryptography enables secure communications and is one of the few applications which require 128-bit numbers. A guest author will explain more.Chapter 3: Deep spaceThe Desert (128-256 bit) Theoretical physics is not progressing much in the last decennia – some call it a crisis. Likely, an observational breakthrough is out of reach: the highest man-made information density on earth is produced by the high energy accelerators at CERN. But these accelerators have to be 1013 -1015 more powerful to reach the fundamental unit of information, which is probably at the same level of the Planck length. Unfortunately, there is no way to reach this unit of information with these instruments. This enormous gap in reaching all the domains in the Information Universe is illustrated in a figure and in a very sobering, but instructive table in the Appendix.Black holes (128-256 bit?) – Guest author: Manus VisserCan information disappear into a black hole? The Information paradox. Stephen Hawking wondered it and started a field in which space and time are described in terms of information. Dr. Manus Visser, expert on gravity and space-time, will explain more.Observing a Black Hole: Event Horizon Telescope – Guest author: Heino FalckeThe first image of a black hole. Prof. Heino Falcke, chair of the Event Horizon Telescope Science Council, will explain how information from a world-wide network of telescopes was combined using atomic clocks, to create the first ever image of a black hole. (Picture: first image of a black hole)Cogwheels: a deeper level – Guest author: Gerard 't HooftNobel laureate ‘t Hooft explains his views on cogwheels, carrying the fundamental information in the Universe.Gravitational waves – Guest author: Chris van den BroeckLinks: The Universe as a spreadsheetLinks, joins, references, URLs, blockchain, associations and even entanglement in physics are all different words for the same building block, forming the connections in the Information Universe.Cosmic Microwave Background – Guest author: Margot BrouwerParticles of light created in the hot and dense state of the Universe after the Big Bang are still flying through the Universe today. Together, these 1077 photons contain the largest amount of information known in the Universe. This information can still be accessed through telescopes, and brings us invaluable information about the dawn of our Universe.Emergent Gravity – Guest author: Erik VerlindeProf. Erik Verlinde, professor of theoretical physics at the University of Amsterdam, won the Spinoza prize for his new theory explaining gravity. In his theory, all matter, space and time consist of information and are all connected by entanglement. If this theory is correct, the information content of the entire Universe is 2399. This is the highest power described in this book, and actually, in physics.Chapter 4: It from BitOne big information processing machine – Guest author: Gerard 't Hooft (TBC)t Hooftt Hooft: : ““there is something happening at a different level of nature”there is something happening at a different level of nature”..On the origin of physical information. – Guest author: Stefano GottardiThe ear In the ear information is copied a dozen times!The eye – on the visual perception of data- climate change. Links to - facts and fakes- the system of ScienceThe System of ScienceHow does this system work? Discussing Hegel’s system of science, logic, technology, Nature, life, physics, consciousness.Artificial IntelligenceThe machine learning and the data-base oriented communities are still living on different planets. I discuss and revisit Tegmark’s recent book Life 3.0 by comparing 3 crosscuts through the Information Universe: i) the classical computer centric view ii) the data centric view iii) the artificial intelligence view.Information densityThe average information density of the universe can be compared to that of written text.Black Body radiation On the information aspects of the third big physical breakthrough of the 20th century (next to General relativity and quantum mechanics).EntropyDiscussing Shannon’s work and identifying that “Information only exists in relation to its environment”. Examples will be given.Cosmic information, cosmogenesis and dark energy by PadmanabhanCosmic information connects the cosmological constant to cosmogenesisIt from BitIs the Universe one big information processing machine?ConsciousnessVery little is known about the consciousness and I refrain from addressing the consciousness per se. A relevant list of about 5 facts we do know are listed. Any view on the relation between the consciousness and the Information Universe should at least deal with this list.Somnium – Musician Jacco Gardner performing at DOTLiveplanetarium at Eurosonic 2019 show case music festival- Inspired by Kepler’s Somnium – directed by EV The Information UniverseAn overview.Facts and fakesHow is all this related to the current facts and fakes issues on the Internet? How do you make sure that what you are reading is accurate and comes from a reliable source?The link between Open Science, FAIR and reliability of data.

Read more less

Book SynopsisIs everything Information? This is a tantalizing question which emerges in modern physics, life sciences, astronomy and in today’s information and technology-driven society. In Powers of Two expert authors undertake a unique expedition - in words and images - throughout the world (and scales) of information. The story resembles, in a way, the classic Powers of Ten journeys through space: from us to the macro and the micro worlds . However, by following Powers of Two through the world of information, a completely different and timely paradigm unfolds. Every power of two, 1, 2, 4, 8…. tells us a different story: starting from the creation of the very first bit at the Big Bang and the evolution of life, through 50 years of computational science, and finally into deep space, describing the information in black holes and even in the entire universe and beyond…. All this to address one question: Is our universe made of information? In this book, we experience the Information Universe in nature and in our society and how information lies at the very foundation of our understanding of the Universe.From the Foreword by Robbert Dijkgraaf: This book is in many ways a vastly extended version of Shannon’s one-page blueprint. It carries us all the way to the total information content of the Universe. And it bears testimony of how widespread the use of data has become in all aspects of life. Information is the connective tissue of the modern sciences. […] Undoubtedly, future generations will look back at this time, so much enthralled by Big Data and quantum computers, as beholden to the information metaphor. But that is exactly the value of this book. With its crisp descriptions and evocative illustrations, it brings the reader into the here and now, at the very frontier of scientific research, including the excitement and promise of all the outstanding questions and future discoveries.Message for the e-reader of the book Powers of Two The book has been designed to be read in two-page spreads in full screen mode. For optimal reader experience in a downloaded .pdf file we strongly recommend you use the following settings in Adobe Acrobat Reader: - Taskbar: View > Page Display > two page view - Taskbar: View > Page Display > Show Cover Page in Two Page View - Taskbar: ^ Preferences > Full Screen > deselect " Fill screen with one page at a time" - Taskbar: View > Full screen mode or ctrl L (cmd L on a Mac) ***** Note: for reading the previews on Spinger link (and on-line reading in a browser), the full screen two-page view only works with these browsers: Firefox - Taskbar: on top of the text, at the uppermost right you will see then >> (which is a drop-down menu) >> even double pages - Fullscreen: F11 or Control+Cmd+F with Mac Edge - Taskbar middle: Two-page view and select show cover page separatelyTrade Review“The book … a very unusual collection of some facts about the relationship between the immaterial world represented by bits and the real physical world described by fundamental physical equations. This book continues the very categorical point of view of J. A. Wheeler … . The book presents short articles on various areas of modern science … in which it is shown that in these areas in some mysterious way there is a connection with the theory of information.” (Vladimir Dzhunushaliev, zbMATH 1479.83004, 2022)Table of ContentsForeword by Robbert DijkgraafChapter 0: IntroductionJoy-riding the Universe – by the authorWorking as an astronomer, data scientist and professor of astro-informatics for nearly fifty years, Edwin Valentijn has witnessed and first-hand engineered the dawn of the era of Big Data in science and society. Throughout his career, he became increasingly aware of the role of information in our world: in computers, in our society, and even in nature and in the Universe itself.The Information UniverseFollowing the increasing powers of two, the story paints a journey through the whole world of information, both in society and in nature. Each step opens a door into a new world: from the first bits with the Big Bang and the dawn of life, going through fifty years of human technology, all the way up to the information content of the whole Universe.What is Information? - Item pageThe basics of information are introduced.Chapter 1: The beginningSpace-time foam – Ti (0 bit: 20 =1)The very first power of two: 20, corresponds to the value one. This identifies the single, eternal, indistinguishable state: the primordial sea from which our Universe emerged – sometimes called the Space-time foam. I call this Ti, the reverse of It. This is one of the miraculous new notions in the story of the Powers of Two.Multiverse: Anthropic principle (Item page)From Ti, the primordial space-time foam, countless universes arise with widely different characteristics: the Multiverse. The Anthropic Principle is a philosophical consideration which states that we, people, will find ourselves in a universe that is suitable for intelligent life to emerge. Therefore, this Principle demonstrates that conditions in our Universe are not “fine-tuned” to the existence of human life and a “creator” doesn’t exist.Big bang (1 bit: 21 =2 states)At the Big Bang the first bit is created. From the indistinguishable unity of the primordial foam Ti, “the zeros were separated from the 1’s”: the first bit corresponds to two possible states. This bit is the first step on our journey to capture the ever-increasing complexity of our expanding Universe in terms of information, through the increasing powers of two.What is a bit? (Item page)The bit is at the core of the concept of information. A bit is any system that can have two states. Humans assign meanings to these states, which are illustrated with the concept of the traffic light: red or green, stop or go. The combination of multiple bits creates an exponentially increasing number of possible states, and hence meanings.Multicellular life (2 bit: 22 =4 states) / (4 bit: 24 =16 states)?Life started with exchanging information between cells. This is fundamental for the evolution of any kind of life. It took at least two billion years for uni-cellular to evolve into multi-cellular organisms around 600 million years ago, and to start the exchange of information between their different cells. By exchanging information, cells collaborate and act as a unified whole: life.The game of life (Item page)The characteristic features of life (or any complex system in the Universe) can be created from information. A simple computer game is all you need to demonstrate this concept. A famous example is Conway's Game of Life, which is full of visuals of living, growing, moving and dying objects. This game was already made on the computers of the early 70's with just a few lines of code.Chapter 2: People's Information UniverseASCII (7 bit: 27 =128 states)There is currently no physical theory how the digital world connects to the human consciousness. In the world of Information Technology (IT) all information exchange is based on agreements between people. For instance, ASCII, a simple list relating each letter of the alphabet to a 7-bit string, connects the digital world to the human consciousness. Machu Picchu (8 bit: 28 =256, 1 byte)The Intiwatana stone, a giant rock carved by the Inca's of ancient Machu Picchu in Peru, can be considered as a first 8-bit hard disk. Why so? As the sunrays lit the different surfaces of this huge rock throughout the year, it triggered the Inca's activities: sowing, harvesting, celebrating and praying.This ancient stone dissolves both the boundaries between heaven and earth, and those between the digital and natural Information Universe. In fact, the stone represents an ultimate picture of the cross-over between the in vivo and the in vitro Information Universe - a main theme of the book. In vitro being the man made technology to handle information and in vivo being the information built in nature, in this case the orbit and the light rays of the sun.First computers (16 bit: 216 =65.536, 2 byte)When computers emerged in the 1970's, astronomers first adopted them to steer their telescopes. Back then, a maximal effort to understand the mathematics of the problem was needed to squeeze the solution into the small computer memory. Nowadays, with large amounts of computing power and machine learning at their disposal, scientists and computer programmers often do the reverse.Star Peace vs. Star Wars (Item page)King Juan Carlos adored the harmony of galaxies as a source of inspiration for people on earth, in those days when Ronald Reagan was promoting his Star-wars programme. With this adoration in mind, in 1985, he gave an inspiring speech at the Royal inauguration of the international astronomical observatory on La Palma, Canary Islands. The inauguration was attended by, for those days, an unprecedented large crowd of European royals and government officials despite the great threat of terrorist attacks by the ETA. (the next and later spreads on facts vs fakes elucidate the relevance of this spread in the story line).Pre-internet Facts and Fakes (Item page)“Edwin Valentijn saved the life of the Dutch Queen Beatrix by catching her just before falling off a cliff at the inauguration on La Palma”, according to the headlines in Dutch newspapers. Fake news-stories are at all times alike and can only be dispelled by tracing links of information to their source, links or associations being a fundamental property of the Information Universe. Later, I discuss the less innocent case of overdrawing attention to terrorist attacks in the past decade.Hard disk (24 bit: 224 =1.6*107, 2 Mb)Only sixty years ago, a 5 MB hard disk weighed over five tons, and had to be loaded onto an aeroplane by using a truck. Now, we carry a thousand times more information in our trouser pocket. This demonstrates the amazing advance of information technology over the past decades. (Picture: first IBM hard disk loaded onto a plane).The telephone (Item page) As a precursor of the Internet, the telephone offered many of the same advantages and dangers, and was heavily discussed at its introduction. Whether telephone or the Internet, it all revolves around communication or copying of information. The telephone, as example of it, is one of the major discoveries of the 20th century. DNA (32 bit: 232 = 4*109, 500 Mb) – Guest author: Charley Lineweaver The information in the DNA creates life. All base pairs of the human DNA can be stored on a 500 Mb drive. How is this information communicated? How does a cell know it has to build part of a liver and not an eye, while they all have the same DNA? Apoptosis and the role of information exchange.Where does biological Information come from? (Item page) – Guest author: Charley Lineweaver Charley Lineweaver, expert on evolutionary biology, exoplanetology and astrobiology, will expand on the role of information in the evolution of life.Lifelines (Item page) – Guest author: Morris SwertzWhat is the role of nature versus that of nurture? A key question in modern health research. In Lifesciences, this question is addressed now using Big Data, like the astronomers who acquire huge data volumes to address the same question on the nature of galaxies. In Lifelines, a cohort of 165.000 people is studied over a period of 30 years using hospital data, blood samples and DNA scans.DVD (33 bit: 233 =9*109, 1 Gb)It’ s amazing how fast the digital image revolution went since 1989.30 years ago, Philips lab approached me since they had made a big discovery: it was possible to store many digital images on a CD. They were chasing me for digital images. While NASA had less than a thousand, I had 32.000 galaxy images obtained by scanning photographic plates from the European Southern Observatory – the first large digital image collection.Human Brain (36 bit: 236 =7*1010, 9 Gb) – Guest author: Katrin Amunts- JulichIn the large EU human brain project, the activities of the human brain are simulated in computers. This is a very difficult mission since the transistors in computers consume 100.000 billion times more energy than the synapsis of neurons. Our brains consist of 1011 neurons, corresponding to 9 Gb of data.Thinking of Karlheinz Meier, coordinator of the Human Brain Project in Heidelberg, Katrin Amunts will author two spreads on the role of information in the human brain.Neuromorphic computing – Guest author: Katrin AmuntsCurrently, it takes a hundred years of a supercomputer’s time to compete with the learning power of only a single day of the human brain. “Neuromorphic computing” researchers design electronic systems inspired by the human brain, in order to make computers many times faster and more energy efficient.CT scan (38 bit: 238 =3*1011, 34 Gb) – Guest author: Anders YnnermanNow it is possible to look inside animal and human bodies on touchscreens. Forensic investigations on, for instance, corpses of victims can be done with touch-screen tables. You can look inside, rotate, scroll and zoom animal and human bodies using tens of gigabytes of CT scan data. Prof. Anders Ynnerman explains how he does it.Terabytes (45 bit: 245 =4.4*1012, 1 Tb) - The largest (astronomical) datasetsDark energy and dark matter: two mysterious constituents of our Universe. How do astronomers get and handle the data from the VLT Survey Telescope on a high mountain top in Chile to shed lights on these ‘still too dark’ topics. This Telescope surveys the sky every hour at night generating Terabytes of astronomical data.Gravity as a lens (Item page) – Guest author: Margot BrouwerWhen light rays are bent by the gravity of a heavy object, this object acts as a lens. This effect can be used to map dark matter, which is invisible but constitutes 80% of the matter in our visible Universe. In 1915, Albert Einstein posed that gravity is equivalent to the curvature of the fabric of space and time itself, leading to the lensing effect.Weak gravitational lensing surveys – Guest author: Margot BrouwerTerabytes of astronomical data are reduced to a few numbers, describing how dark matter behaves and what is its true nature. https://www.youtube.com/watch?v=ZCyYGWqCmFw&t=23sEntering the Petabyte regime (53 bit: 253 =1*1015, 1 Pb)How do we technically acquire and deal with Petabytes of data?Dark Matter maps (Item page)A first dark matter map projected on the night sky. An ultimate encounter between the digital world of modern astronomical observations, and nature: the mysterious dark matter mapped on top of the everyday “night” stellar sky. A visualization that condenses Terabytes of astronomical data to a simple map.Metadata for Peta-data (62 bit: 262 =6*1017, 600 Pb)With pointers, one can connect everything in the Information Universe. Pointers are often inserted in Metadata (data about data) - an ultimate tool for dealing with Big Data. It is possible to create unique pointers to hundreds of Petabytes of data, using a string of less than 64 bits. This is what makes pointers so powerful and indispensable in current and future stages of the big data era; not only for astronomical research, but also for companies like Google, Amazon and Facebook.Downloading the Universe (Item page)The universe can be seen as a spreadsheet, certainly in the way we map it on our computers (in vitro), but also in nature (in vivo). Perceiving the Universe as a spreadsheet links bit to It.Meta data (Item page)A visualisation of the enormous complexity of data models which trace all pointers between data items. (picture: thrilling still from a full dome animation of a data model)Future (astronomical) datasets (item page)While current telescopes collect astronomical datasets of Terabytes, future telescopes such as the LSST and the Euclid satellite, instead, will collect Petabytes. These enormous amounts of data need a whole new approach to data management. For the Euclid satellite my “Universe as a spreadsheet” approach has been adopted.The Euclid satellite (Item page) – Guest author: Margot BrouwerEuclid is ESA’s new space mission to map the Dark Universe. At a distance of 1.5 million kilometres from Earth, this telescope will observe billions of galaxies. Its goal: to shed light on the nature of Dark Matter and Dark Energy, which make up 95% of our Universe. Dr. Margot Brouwer, Dutch scientific communication officer for Euclid, will explain more.The Information Universe (Item page)The resemblance of the overall structure of the real observed Universe (in vivo) with the simulated universe (in vitro), based on the concurrent cosmological model, gave a lot of credit to the latter. When we zoom out the Universe, we see billions of galaxies forming a web-like structure. Amazingly, astronomers can now compute and simulate these structures with very large supercomputers.The lost boy (Item page)Information is timeless, and knows no boundaries. It crosses over the in vivo and the in vitro Information Universe. This concept is well illustrated through daily life stories involving time. At the age of five, a boy loses sight of his older brother on a train in India, and eventually gets lost on the streets of Mumbai. Twenty years later, after being adopted by a family in Australia, he is able to find his natural mother (in vivo) through only searching on Google maps (in vitro).Qbits (50 qbit: 250 =1.1*1015 qbit, 1 Pbit) – Guest author: Lieven VandersypenUsing fundamental particles (quanta, such as electrons) to perform calculations and build computers, is one of the most exciting cross-overs between the in vivo and the in vitro Information Universe. Prof. Lieven Vandersypen, who leads a Quantum Computing group at TU Delft in the Netherlands, will explain how this technology will change the way we compute.Quantum entanglement (Item page) – Guest author: Lieven VandersypenThe states of two particles can be intimately linked (entangled), no matter how far they are separated. What Einstein famously dismissed as “spooky action at a distance”, can now be established on demand at TU Delft in the Netherlands. Prof. Vandersypen will explain how his research group, for the first time ever, both create and apply this entanglement in laboratory.Entanglement (item page) - EVThe Square Kilometre Array (64 bit: 264 =1.3*1018, 1 Eb) – Guest author: TBAThe Square Kilometre Telescope will collect data at the rate of the global internet traffic of 2013, in its endeavour to answer fundamental questions about the origin and evolution of the Universe, and its search for extra-terrestrial life.Cryptography (128 bit: 2128 =3.4*1038) – Guest author Tanja LangeEncrypted messages should not be decoded by adversaries, be they criminals or hostile countries. Cryptography enables secure communications and is one of the few applications which require 128-bit numbers. A guest author will explain more.Chapter 3: Deep spaceThe Desert (128-256 bit) Theoretical physics is not progressing much in the last decennia – some call it a crisis. Likely, an observational breakthrough is out of reach: the highest man-made information density on earth is produced by the high energy accelerators at CERN. But these accelerators have to be 1013 -1015 more powerful to reach the fundamental unit of information, which is probably at the same level of the Planck length. Unfortunately, there is no way to reach this unit of information with these instruments. This enormous gap in reaching all the domains in the Information Universe is illustrated in a figure and in a very sobering, but instructive table in the Appendix.Black holes (128-256 bit?) – Guest author: Manus VisserCan information disappear into a black hole? The Information paradox. Stephen Hawking wondered it and started a field in which space and time are described in terms of information. Dr. Manus Visser, expert on gravity and space-time, will explain more.Observing a Black Hole: Event Horizon Telescope – Guest author: Heino FalckeThe first image of a black hole. Prof. Heino Falcke, chair of the Event Horizon Telescope Science Council, will explain how information from a world-wide network of telescopes was combined using atomic clocks, to create the first ever image of a black hole. (Picture: first image of a black hole)Cogwheels: a deeper level – Guest author: Gerard 't HooftNobel laureate ‘t Hooft explains his views on cogwheels, carrying the fundamental information in the Universe.Gravitational waves – Guest author: Chris van den BroeckLinks: The Universe as a spreadsheetLinks, joins, references, URLs, blockchain, associations and even entanglement in physics are all different words for the same building block, forming the connections in the Information Universe.Cosmic Microwave Background – Guest author: Margot BrouwerParticles of light created in the hot and dense state of the Universe after the Big Bang are still flying through the Universe today. Together, these 1077 photons contain the largest amount of information known in the Universe. This information can still be accessed through telescopes, and brings us invaluable information about the dawn of our Universe.Emergent Gravity – Guest author: Erik VerlindeProf. Erik Verlinde, professor of theoretical physics at the University of Amsterdam, won the Spinoza prize for his new theory explaining gravity. In his theory, all matter, space and time consist of information and are all connected by entanglement. If this theory is correct, the information content of the entire Universe is 2399. This is the highest power described in this book, and actually, in physics.Chapter 4: It from BitOne big information processing machine – Guest author: Gerard 't Hooft (TBC)t Hooftt Hooft: : ““there is something happening at a different level of nature”there is something happening at a different level of nature”..On the origin of physical information. – Guest author: Stefano GottardiThe ear In the ear information is copied a dozen times!The eye – on the visual perception of data- climate change. Links to - facts and fakes- the system of ScienceThe System of ScienceHow does this system work? Discussing Hegel’s system of science, logic, technology, Nature, life, physics, consciousness.Artificial IntelligenceThe machine learning and the data-base oriented communities are still living on different planets. I discuss and revisit Tegmark’s recent book Life 3.0 by comparing 3 crosscuts through the Information Universe: i) the classical computer centric view ii) the data centric view iii) the artificial intelligence view.Information densityThe average information density of the universe can be compared to that of written text.Black Body radiation On the information aspects of the third big physical breakthrough of the 20th century (next to General relativity and quantum mechanics).EntropyDiscussing Shannon’s work and identifying that “Information only exists in relation to its environment”. Examples will be given.Cosmic information, cosmogenesis and dark energy by PadmanabhanCosmic information connects the cosmological constant to cosmogenesisIt from BitIs the Universe one big information processing machine?ConsciousnessVery little is known about the consciousness and I refrain from addressing the consciousness per se. A relevant list of about 5 facts we do know are listed. Any view on the relation between the consciousness and the Information Universe should at least deal with this list.Somnium – Musician Jacco Gardner performing at DOTLiveplanetarium at Eurosonic 2019 show case music festival- Inspired by Kepler’s Somnium – directed by EV The Information UniverseAn overview.Facts and fakesHow is all this related to the current facts and fakes issues on the Internet? How do you make sure that what you are reading is accurate and comes from a reliable source?The link between Open Science, FAIR and reliability of data.

Read more less

Book SynopsisThis introductory book on quantum computing includes an emphasis on the development of algorithms. Appropriate for both university students as well as software developers interested in programming a quantum computer, this practical approach to modern quantum computing takes the reader through the required background and up to the latest developments. Beginning with introductory chapters on the required math and quantum mechanics, Fundamentals of Quantum Computing proceeds to describe four leading qubit modalities and explains the core principles of quantum computing in detail. Providing a step-by-step derivation of math and source code, some of the well-known quantum algorithms are explained in simple ways so the reader can try them either on IBM Q or Microsoft QDK. The book also includes a chapter on adiabatic quantum computing and modern concepts such as topological quantum computing and surface codes.Features:o Foundational chapters that build the necessary background on math and quantum mechanics.o Examples and illustrations throughout provide a practical approach to quantum programming with end-of-chapter exercises.o Detailed treatment on four leading qubit modalities -- trapped-ion, superconducting transmons, topological qubits, and quantum dots -- teaches how qubits work so that readers can understand how quantum computers work under the hood and devise efficient algorithms and error correction codes. Also introduces protected qubits - 0-π qubits, fluxon parity protected qubits, and charge-parity protected qubits. o Principles of quantum computing, such as quantum superposition principle, quantum entanglement, quantum teleportation, no-cloning theorem, quantum parallelism, and quantum interference are explained in detail. A dedicated chapter on quantum algorithm explores both oracle-based, and Quantum Fourier Transform-based algorithms in detail with step-by-step math and working code that runs on IBM QisKit and Microsoft QDK. Topics on EPR Paradox, Quantum Key Distribution protocols, Density Matrix formalism, and Stabilizer formalism are intriguing. While focusing on the universal gate model of quantum computing, this book also introduces adiabatic quantum computing and quantum annealing.This book includes a section on fault-tolerant quantum computing to make the discussions complete. The topics on Quantum Error Correction, Surface codes such as Toric code and Planar code, and protected qubits help explain how fault tolerance can be built at the system level.Trade Review“The book represents a new and fresh approach to quantum computing, starting with theoretical physical knowledge that is highlighted by beautiful figures. Then, quantum computing is explained by quantum programing languages and extensive languages. It is recommended to everyone interested in quantum computing. It is easy to follow through a beautiful and clear presentation, programming examples and additional exercises.” (Andreas Wichert, zbMATH 1477.68005, 2022)Table of ContentsPART ONE 1 Foundations of Quantum Mechanics 1.1 Matter 1.2 Atoms, Elementary Particles, and Molecules 1.3 Light and Quantization of Energy 1.4 Electron Configuration 1.5 Wave-Particle Duality and Probabilistic Nature 1.6 Wavefunctions and Probability Amplitudes 1.7 Some exotic states of matter 1.8 Summary 1.9 Practice Problems 1.10 References and further reading 2 Dirac’s bra-ket notation and Hermitian Operators2.1 Scalars 2.2 Complex Numbers 2.3 Vectors 2.4 Matrices 2.5 Linear Vector Spaces 2.6 Using Dirac’s bra-ket notation 2.7 Expectation Values and Variances2.8 Eigenstates, Eigenvalues and Eigenfunctions2.9 Characteristic Polynomial 2.10 Definite Symmetric Matrices 2.11 Tensors2.12 Statistics and Probability2.13 Summary 2.14 Practice problems2.15 References and further reading3 The Quantum Superposition Principle and Bloch Sphere Representation3.1 Euclidian Space3.2 Metric Space3.3 Hilbert space.3.4 Schrodinger Equation3.5 Postulates of Quantum Mechanics3.6 Quantum Tunneling3.7 Stern and Gerlach Experiment3.8 Bloch sphere representation3.9 Projective Measurements3.10 Qudits3.11 Summary3.12 Practice Problems3.13 References and further readingPART TWO4 Qubit Modalities4.1 The vocabulary of quantum computing4.2 Classical Computers – a recap 4.3 Qubits and usability4.4 Noisy Intermediate Scale Quantum Technology4.5 Qubit Metrics4.6 Leading Qubit Modalities4.7 A note on the dilution refrigerator4.8 Summary4.9 Practice Problems4.10 References and further reading5 Quantum Circuits and DiVincenzo Criteria5.1 Setting up the development environment5.2 Learning Quantum Programming Languages 5.3 Introducing Quantum Circuits 5.4 Quantum Gates 5.5 The Compute Stage5.6 Quantum Entanglement5.7 No-Cloning theorem5.8 Quantum Teleportation5.9 Superdense coding5.10 Greenberger–Horne–Zeilinger state (GHZ state)5.11 Walsh-Hadamard Transform5.12 Quantum Interference5.13 Phase kickback5.14 DiVincenzo’s criteria for quantum computation5.15 Summary 5.16 Practice Problems5.17 References and further reading6 Quantum Communications6.1 EPR Paradox6.2 Density Matrix Formalism6.3 Von Neumann Entropy6.4 Photons6.5 Quantum Communication6.6 The Quantum Channel6.7 Quantum Communication Protocols6.8 RSA Security6.9 Summary6.10 Practice Problems6.11 References and further reading7 Quantum Algorithms7.1 Quantum Ripple Adder Circuit7.2 Quantum Fourier Transformation7.3 Deutsch-Jozsa oracle7.4 The Bernstein-Vazirani Oracle7.5 Simon’s algorithm7.6 Quantum arithmetic using QFT7.7 Modular exponentiation7.8 Grover’s search algorithm 7.9 Shor’s algorithm7.10 A quantum algorithm for k-means7.11 Quantum Phase Estimation (QPE)7.12 HHL algorithm for solving linear equations7.13 Quantum Complexity Theory7.14 Summary 7.15 Practice Problems7.16 References and further reading8 Adiabatic Optimization and Quantum Annealing8.1 Adiabatic evolution8.2 Proof of the Adiabatic Theorem8.3 Adiabatic optimization8.4 Quantum Annealing8.5 Summary8.6 Practice Problems8.7 References and further reading9 Quantum Error Correction9.1 Classical Error Correction9.2 Quantum Error Codes9.3 Stabilizer formalism9.4 The path forward – fault-tolerant quantum computing9.5 Surface codes9.6 Protected qubits9.7 Practice Problems9.8 References and further reading10 Conclusion10.1 How many qubits do we need?10.2 Classical simulation10.3 Backends today10.4 Future state10.5 References

Read more less

Book SynopsisThis book covers algorithm portfolios, multi-method schemes that harness optimization algorithms into a joint framework to solve optimization problems. It is expected to be a primary reference point for researchers and doctoral students in relevant domains that seek a quick exposure to the field. The presentation focuses primarily on the applicability of the methods and the non-expert reader will find this book useful for starting designing and implementing algorithm portfolios. The book familiarizes the reader with algorithm portfolios through current advances, applications, and open problems. Fundamental issues in building effective and efficient algorithm portfolios such as selection of constituent algorithms, allocation of computational resources, interaction between algorithms and parallelism vs. sequential implementations are discussed. Several new applications are analyzed and insights on the underlying algorithmic designs are provided. Future directions, new challenges, and open problems in the design of algorithm portfolios and applications are explored to further motivate research in this field.Table of Contents1. Metaheuristic optimization algorithms.- 2. Algorithm portfolios.- 3. Selection of constituent algorithms.- 4. Allocation of computation resources.- 5. Sequential and parallel models.- 6. Recent applications.- 7. Epilogue.- References.

Read more less

Book SynopsisThis textbook provides a comprehensive introduction to statistical principles, concepts and methods that are essential in modern statistics and data science. The topics covered include likelihood-based inference, Bayesian statistics, regression, statistical tests and the quantification of uncertainty. Moreover, the book addresses statistical ideas that are useful in modern data analytics, including bootstrapping, modeling of multivariate distributions, missing data analysis, causality as well as principles of experimental design. The textbook includes sufficient material for a two-semester course and is intended for master’s students in data science, statistics and computer science with a rudimentary grasp of probability theory. It will also be useful for data science practitioners who want to strengthen their statistics skills.Table of ContentsIntroduction.- Background in Probability.- Parametric Statistical Models.- Maximum Likelihood Inference.- Bayesian Statistics.- Statistical Decisions.- Regression.- Bootstrapping.- Model Selection and Model Averaging.- Multivariate and Extreme Value Distributions.- Missing and Deficient Data.- Experiments and Causality.

Read more less

Book SynopsisSecurity Policies and Access Control.- Public key encryption, digital signatures.- Number theory, primality tests, discrete log, factorisation.- Public-key cryptography, hardware, physical attacks.- Implementation aspects of cryptographic algorithms.- Hardware attacks.- Multi-party computation, voting schemes, digital signature schemes.- Web security.- DBMS and Application Security.- Biometrics.- Software Security.- Network Security.- Formal Methods and Assurance.- Sensor and Ad Hoc Networks.- DOS.- Privacy-preserving data mining.- Private information retrieval.- Privacy metrics and data protection.- Wireless Security.- Broadcast channel, secret sharing, threshold schemes, subliminal channels.- Risk management and organizational security and privacy.- Usable/user-centric privacy.- Less-constrained biometrics.- Access and Query Privacy.- Cryptocurrencies.- Encryption-Based Access Control Based on Public Key Cryptography.- Cyber-physical systems and infrastructure: security andprivacy.- Location privacy and privacy in locations-based applications.- Privacy in emerging scenarios.- Privacy and security in social networks.- Economics of security and privacy.- Key management.- Elliptic curve cryptography.- Sequences, Boolean functions, stream ciphers.- Secure multiparty computations.- Human Aspects in Security and Privacy.- Trustworthy Computing, Physical/Hardware Security.- AI approaches for security and privacy.- Privacy and anonymity in communication networks.- Privacy laws and directives.

Read more less

Book SynopsisThis open access two-volume set constitutes the proceedings of the 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2021, which was held during March 27 – April 1, 2021, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021. The conference was planned to take place in Luxembourg and changed to an online format due to the COVID-19 pandemic.The total of 41 full papers presented in the proceedings was carefully reviewed and selected from 141 submissions. The volume also contains 7 tool papers; 6 Tool Demo papers, 9 SV-Comp Competition Papers. The papers are organized in topical sections as follows: Part I: Game Theory; SMT Verification; Probabilities; Timed Systems; Neural Networks; Analysis of Network Communication. Part II: Verification Techniques (not SMT); Case Studies; Proof Generation/Validation; Tool Papers; Tool Demo Papers; SV-Comp Tool Competition Papers.Table of ContentsGame Theory.- A Game for Linear-time - Branching-time Spectroscopy.- On Satisficing in Quantitative Games.- Quasipolynomial Computation of Nested Fixpoints.- SMT Verification.- A Flexible Proof Format for SAT Solver-Elaborator Communication.- Generating Extended Resolution Proofs with a BDD-Based SAT Solver.- Bounded Model Checking for Hyperproperties.- Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays.- SAT Solving with GPU Accelerated Inprocessing.- FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions.- Probabilities.- Finding Provably Optimal Markov Chains.- Inductive Synthesis for Probabilistic Programs Reaches New Horizons.- Analysis of Markov Jump Processes under Terminal Constraints.- Multi-objective Optimization of Long-run Average and Total Rewards.- Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes.- Probabilistic and Systematic Coverage of Consecutive Test-Method Pairs for Detecting Order-Dependent Flaky Tests.- Timed Systems.- Timed Automata Relaxation for Reachability.- Iterative Bounded Synthesis for Efficient Cycle Detection in Parametric Timed Automata.- Algebraic Quantitative Semantics for Efficient Online Temporal Monitoring.- Neural Networks.- Synthesizing Context-free Grammars from Recurrent Neural Networks.- Automated and Formal Synthesis of Neural Barrier Certificates for Dynamical Models.- Improving Neural Network Verification through Spurious Region Guided Refinement.- Analysis of Network Communication Resilient Capacity-Aware Routing.- Network Traffic Classification by Program Synthesis.

Read more less

Book SynopsisThis textbook offers an algorithmic introduction to the field of computer algebra. A leading expert in the field, the author guides readers through numerous hands-on tutorials designed to build practical skills and algorithmic thinking. This implementation-oriented approach equips readers with versatile tools that can be used to enhance studies in mathematical theory, applications, or teaching. Presented using Mathematica code, the book is fully supported by downloadable sessions in Mathematica, Maple, and Maxima. Opening with an introduction to computer algebra systems and the basics of programming mathematical algorithms, the book goes on to explore integer arithmetic. A chapter on modular arithmetic completes the number-theoretic foundations, which are then applied to coding theory and cryptography. From here, the focus shifts to polynomial arithmetic and algebraic numbers, with modern algorithms allowing the efficient factorization of polynomials. The final chapters offer extensions into more advanced topics: simplification and normal forms, power series, summation formulas, and integration. Computer Algebra is an indispensable resource for mathematics and computer science students new to the field. Numerous examples illustrate algorithms and their implementation throughout, with online support materials to encourage hands-on exploration. Prerequisites are minimal, with only a knowledge of calculus and linear algebra assumed. In addition to classroom use, the elementary approach and detailed index make this book an ideal reference for algorithms in computer algebra.Trade Review“Strong interplay between the abstract exposition, which includes the relevant theorems as well as their proofs, and the practical utilization of those concepts in Mathematica is certainly a remarkable feature of this textbook. … Overall, the book is very well written and the approach to provide examples as actual Mathematica sessions is commendable.” (Andreas Maletti, zbMATH 1484.68004, 2022)Table of Contents

Read more less

Book SynopsisThis book is a collection of reflections by thought leaders at first-mover organizations in the exploding field of "Data Science for Social Good", meant as the application of knowledge from computer science, complex systems and computational social science to challenges such as humanitarian response, public health, sustainable development. The book provides both an overview of scientific approaches to social impact – identifying a social need, targeting an intervention, measuring impact – and the complementary perspective of funders and philanthropies that are pushing forward this new sector. This book will appeal to students and researchers in the rapidly growing field of data science for social impact, to data scientists at companies whose data could be used to generate more public value, and to decision makers at nonprofits, foundations, and agencies that are designing their own agenda around data.Table of ContentsIntroduction.- The Value of Data and Data Collaboratives for Good: A Roadmap for Philanthropies to Facilitate Systems Change through Data.- UN Global Pulse: A UN Innovation Initiative with a Multiplier Effect.- Building the Field of Data for Good.- When Philanthropy Meets Data Science: A Framework for Governance to Achieve Data-Driven Decision-Making for Public Good.- Data for Good: Unlocking Privately-Held Data to the Benefit of the Many.- Building a Funding Data Ecosystem: Grantmaking in the UK.- A Reflection on the Role of Data for Health: COVID-19 and Beyond.

Read more less

Book SynopsisThis book provides empirical evidence and statistical analyses to uncover answers to some of the most debated questions in the NBA. The sports world lives and breathes off of debates on who deserves an MVP award, and which athletes should be considered all-stars. This book provides some statistics-backed perspectives to some of these debates that are specific to the NBA. Was LeBron snubbed of an MVP in the 2010-2011 season? Why has the G.O.A.T. debate turned into LeBron vs. Jordan….Did Kobe get overlooked? How come Klay Thompson didn’t get All-NBA honors in the 2018-2019 season? This book explores these questions and many more with empirical evidence. This book is invaluable for any undergraduate or masters level course in sport analytics, sports marketing, or sports management. It will also be incredibly useful for scouts, recruiters, and general managers in the NBA who would like to use analytics in their work.Table of ContentsIntroduction.- 1. Da Real MVP.- 2. A Tribe of Goats.- 3. The Myth of the Superteam.- 4. Hey Now, You're an All-Star...But Are You All-NBA?- 5. Small Ball in a Big Man's Game.- 6.Is the Clutch Gene Real.- 7. Offense Wins Games, But Does Defense Win Championships? - 8. Strategic Implications of the Findings in This Book.- 9. Debates the Future Work Should Consider.

Read more less

Book SynopsisGraph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, such as approximation, combinatorial optimization, graphics, and operations research, graph algorithms have recently attracted increased attention from computational molecular biology and computational chemistry. Centered around the fundamental issue of graph isomorphism, this text goes beyond classical graph problems of shortest paths, spanning trees, flows in networks, and matchings in bipartite graphs. Advanced algorithmic results and techniques of practical relevance are presented in a coherent and consolidated way. This book introduces graph algorithms on an intuitive basis followed by a detailed exposition in a literate programming style, with correctness proofs as well as worst-case analyses. Furthermore, full C++ implementations of all algorithms presented are given using the LEDA library of efficient data structures and algorithms.Table of Contents1. Introduction.- 2. Algorithmic Techniques.- 3. Tree Traversal.- 4. Tree Isomorphism.- 5. Graph Traversal.- 6. Clique, Independent Set, and Vertex Cover.- 7. Graph Isomorphism.

Read more less

Book SynopsisThis book addresses controversies concerning the epistemological foundations of data science: Is it a genuine science? Or is data science merely some inferior practice that can at best contribute to the scientific enterprise, but cannot stand on its own? The author proposes a coherent conceptual framework with which these questions can be rigorously addressed. Readers will discover a defense of inductivism and consideration of the arguments against it: an epistemology of data science more or less by definition has to be inductivist, given that data science starts with the data. As an alternative to enumerative approaches, the author endorses Federica Russo’s recent call for a variational rationale in inductive methodology. Chapters then address some of the key concepts of an inductivist methodology including causation, probability and analogy, before outlining an inductivist framework. The inductivist framework is shown to be adequate and useful for an analysis of the epistemological foundations of data science. The author points out that many aspects of the variational rationale are present in algorithms commonly used in data science. Introductions to algorithms and brief case studies of successful data science such as machine translation are included. Data science is located with reference to several crucial distinctions regarding different kinds of scientific practices, including between exploratory and theory-driven experimentation, and between phenomenological and theoretical science. Computer scientists, philosophers and data scientists of various disciplines will find this philosophical perspective and conceptual framework of great interest, especially as a starting point for further in-depth analysis of algorithms used in data science. Trade Review“Readers are taken on a journey where they will discover step-by-step methodologies for data-driven research. Judiciously, each key concept of data science is concisely defined, and examples and the when, why, and how to use them are provided. … I fully recommend it.” (Thierry Edoh, Computing Reviews, February 7, 2023)Table of ContentsPreface.- Chapter 1. Introduction.- Chapter 2. Inductivism.- Chapter 3. Phenomenological Science.- Chapter 4. Variational Induction.- Chapter 5. Causation As Difference Making.- Chapter 6. Evidence.- Chapter 7. Concept Formation.- Chapter 8. Analogy.- Chapter 9. Causal Probability.- Chapter 10. Conclusion.- Index.

Read more less

Book SynopsisThis two-volume set LNCS 12918 - 12919 constitutes the refereed proceedings of the 23nd International Conference on Information and Communications Security, ICICS 2021, held in Chongqing, China, in September 2021. The 49 revised full papers presented in the book were carefully selected from 182 submissions. The papers in Part II are organized in the following thematic blocks:​ machine learning security; multimedia security; security analysis; post-quantum cryptography; applied cryptography.Table of ContentsMachine Learning Security.- Multimedia Security.- Security Analysis.- Post-Quantum Cryptography.- Applied Cryptography.

Read more less

Book SynopsisIn this monograph, the authors develop a methodology that allows one to construct and substantiate optimal and suboptimal algorithms to solve problems in computational and applied mathematics. Throughout the book, the authors explore well-known and proposed algorithms with a view toward analyzing their quality and the range of their efficiency. The concept of the approach taken is based on several theories (of computations, of optimal algorithms, of interpolation, interlination, and interflatation of functions, to name several). Theoretical principles and practical aspects of testing the quality of algorithms and applied software, are a major component of the exposition. The computer technology in construction of T-efficient algorithms for computing ε-solutions to problems of computational and applied mathematics, is also explored. The readership for this monograph is aimed at scientists, postgraduate students, advanced students, and specialists dealing with issues of developing algorithmic and software support for the solution of problems of computational and applied mathematics.Table of Contents-Preface.- Introduction.- List of symbols and abbreviations.- 1. Elements of the computing theory.- 2. Theories of computational complexity.- 3. Interlination of functions.- 4. Interflatation of functions.- 5. Cubature formulae using interlanation functions.- 6. Testing the quality of algorithm programs.- 7. Computer technologies of solving problems of computational and applied mathematics with fixed values of quality characteristics.- Bilbiography.- Index.- About the Authors.

Read more less

Book SynopsisTeaching quantum computation and information is notoriously difficult, because it requires covering subjects from various fields of science, organizing these subjects consistently in a unified way despite their tendency to favor their specific languages, and overcoming the subjects’ abstract and theoretical natures, which offer few examples of actual realizations. In this book, we have organized all the subjects required to understand the principles of quantum computation and information processing in a manner suited to physics, mathematics, and engineering courses as early as undergraduate studies.In addition, we provide a supporting package of quantum simulation software from Wolfram Mathematica, specialists in symbolic calculation software. Throughout the book’s main text, demonstrations are provided that use the software package, allowing the students to deepen their understanding of each subject through self-practice. Readers can change the code so as to experiment with their own ideas and contemplate possible applications. The information in this book reflects many years of experience teaching quantum computation and information. The quantum simulation-based demonstrations and the unified organization of the subjects are both time-tested and have received very positive responses from the students who have experienced them.Trade Review“The book provides an extensive bibliography and index. … this volume is well suited for a advanced graduate or first-year PhD course in quantum mechanics, with ample time available for self-study.” (L.-F. Pau, Computing Reviews, January 30, 2023)Table of Contents1 The Postulates of Quantum Mechanics.- 2 Virtual Realization of Quantum Computers.- 3 Quantum Computation: Overview.- 4 Quantum Algorithms: Introduction.- 5 Quantum Information: Introduction.- 6 Quantum Error Correction Codes: Introduction.- Appendix A Linear Algebra.- Appendix B Mathematica Application Q3.- References.

Read more less

Book SynopsisThis book is devoted to intelligent models and algorithms as the core components of cyber-physical systems. The complexity of cyber-physical systems developing and deploying requires new approaches to its modelling and design. Presents results in the field of modelling technologies that leverage the exploitation of artificial intelligence, including artificial general intelligence (AGI) and weak artificial intelligence. Provides scientific, practical, and methodological approaches based on bio-inspired methods, fuzzy models and algorithms, predictive modelling, computer vision and image processing. The target audience of the book are practitioners, enterprises representatives, scientists, PhD and Master students who perform scientific research or applications of intelligent models and algorithms in cyber-physical systems for various domains.Table of ContentsBio-inspired modelling.- Fuzzy models and algorithms.- Predictive modelling.- Computer Vision and Image Processing.

Read more less

Book SynopsisSimulating the behavior of a human heart, predicting tomorrow's weather, optimizing the aerodynamics of a sailboat, finding the ideal cooking time for a hamburger: to solve these problems, cardiologists, meteorologists, sportsmen, and engineers can count on math help. This book will lead you to the discovery of a magical world, made up of equations, in which a huge variety of important problems for our life can find useful answers.Trade Review“By providing tools and current examples on modeling issues ... the book makes a contribution answering the becoming more and more prevalent presence of Mathematics in our daily lives. The examples come essentially from the physical and natural sciences, but the book can be relied on in other areas, including the humanities, aside seminal works on mathematical modeling ... . The journey consists in eight rigorous and enjoying chapters.” (Lisa Morhaim, zbMATH 1519.00001, 2023)Table of Contents1 The model, aka the magic box.- 2 Weather Forecast Models.- 3 Epidemics: the Mathematics of Contagion.- 4 Mathematical Hearth.- 5 Mathematics in the Wind.- 6 Flying on Sun Power.- 7 The taste for Mathematics.- 8 Conclusions.

Read more less

Book SynopsisAs the first book of a three-part series, this book is offered as a tribute to pioneers in vision, such as Béla Julesz, David Marr, King-Sun Fu, Ulf Grenander, and David Mumford. The authors hope to provide foundation and, perhaps more importantly, further inspiration for continued research in vision. This book covers David Marr's paradigm and various underlying statistical models for vision. The mathematical framework herein integrates three regimes of models (low-, mid-, and high-entropy regimes) and provides foundation for research in visual coding, recognition, and cognition. Concepts are first explained for understanding and then supported by findings in psychology and neuroscience, after which they are established by statistical models and associated learning and inference algorithms. A reader will gain a unified, cross-disciplinary view of research in vision and will accrue knowledge spanning from psychology to neuroscience to statistics. Table of ContentsPreface.- About the Authors.- 1 Introduction.- 2 Statistics of Natural Images.- 3 Textures.- 4 Textons.- 5 Gestalt Laws and Perceptual Organizations.- 6 Primal Sketch: Integrating Textures and Textons.- 7 2.1D Sketch and Layered Representation.- 8 2.5D Sketch and Depth Maps.- 9 Learning about information Projection.- 10 Informing Scaling and Regimes of Models.- 11 Deep Images and Models.- 12 A Tale of Three Families: Discriminative, Generative and Descriptive Models.- Bibliography

Read more less

Book SynopsisThis volume constitutes selected papers presented at the First International Conference on Emerging Technology Trends in IoT and Computing, TIOTC 2021, held in Erbil, Iraq, in June 2021. The 26 full papers were thoroughly reviewed and selected from 182 submissions. The papers are organized in the following topical sections: Internet of Things (IOT): services and applications; Internet of Things (IOT) in healthcare industry; IOT in networks, communications and distributed computing; real world application fields in information science and technology.Table of ContentsInternet of Things (IOT): Services and Applications.- Internet of Things (IOT) in Healthcare Industry.- IOT in Networks, Communications and Distributed Computing.- Real World Application Fields in information Science and Technology.

Read more less