The book is a concise, self-contained and fully updated introduction to automata theory - a fundamental topic of computer sciences and engineering. The material is presented in a rigorous yet convincing way and is supplied with a wealth of examples, exercises and down-to-the earth convincing explanatory notes. An ideal text to a spectrum of one-term courses in computer sciences, both at the senior undergraduate and graduate students.

This is the first comprehensive overview of the 'science of science,' an emerging interdisciplinary field that relies on big data to unveil the reproducible patterns that govern individual scientific careers and the workings of science. It explores the roots of scientific impact, the role of productivity and creativity, when and what kind of collaborations are effective, the impact of failure and success in a scientific career, and what metrics can tell us about the fundamental workings of science. The book relies on data to draw actionable insights, which can be applied by individuals to further their career or decision makers to enhance the role of science in society. With anecdotes and detailed, easy-to-follow explanations of the research, this book is accessible to all scientists and graduate students, policymakers, and administrators with an interest in the wider scientific enterprise.

Want to kill it at your job interview in the tech industry? Want to win that coding competition? Learn all the algorithmic techniques and programming skills you need from two experienced coaches, problem setters, and jurors for coding competitions. The authors highlight the versatility of each algorithm by considering a variety of problems and show how to implement algorithms in simple and efficient code. Readers can expect to master 128 algorithms in Python and discover the right way to tackle a problem and quickly implement a solution of low complexity. Classic problems like Dijkstra's shortest path algorithm and Knuth-Morris-Pratt's string matching algorithm are featured alongside lesser known data structures like Fenwick trees and Knuth's dancing links. The book provides a framework to tackle algorithmic problem solving, including: Definition, Complexity, Applications, Algorithm, Key Information, Implementation, Variants, In Practice, and Problems. Python code included in the book and on the companion website.

Anomaly detection is the detective work of machine learning: finding the unusual, catching the fraud, discovering strange activity in large and complex datasets. But, unlike Sherlock Holmes, you may not know what the puzzle is, much less what "suspects" you're looking for. This O'Reilly report uses practical examples to explain how the underlying concepts of anomaly detection work. From banking security to natural sciences, medicine, and marketing, anomaly detection has many useful applications in this age of big data. And the search for anomalies will intensify once the Internet of Things spawns even more new types of data. The concepts described in this report will help you tackle anomaly detection in your own project. Use probabilistic models to predict what's normal and contrast that to what you observe Set an adaptive threshold to determine which data falls outside of the normal range, using the t-digest algorithm Establish normal fluctuations in complex systems and signals (such as an EKG) with a more adaptive probablistic model Use historical data to discover anomalies in sporadic event streams, such as web traffic Learn how to use deviations in expected behavior to trigger fraud alerts

There are no silver bullets in algorithm design, and no single algorithmic idea is powerful and flexible enough to solve every computational problem. Nor are there silver bullets in algorithm analysis, as the most enlightening method for analyzing an algorithm often depends on the problem and the application. However, typical algorithms courses rely almost entirely on a single analysis framework, that of worst-case analysis, wherein an algorithm is assessed by its worst performance on any input of a given size. The purpose of this book is to popularize several alternatives to worst-case analysis and their most notable algorithmic applications, from clustering to linear programming to neural network training. Forty leading researchers have contributed introductions to different facets of this field, emphasizing the most important models and results, many of which can be taught in lectures to beginning graduate students in theoretical computer science and machine learning.

In recent years, the United Kingdom's Home Office has started using automated systems to make immigration decisions. These systems promise faster, more accurate, and cheaper decision-making, but in practice they have exposed people to distress, disruption, and even deportation. This book identifies a pattern of risky experimentation with automated systems in the Home Office. It analyses three recent case studies including: a voice recognition system used to detect fraud in English-language testing; an algorithm for identifying 'risky' visa applications; and automated decision-making in the EU Settlement Scheme. The book argues that a precautionary approach is essential to ensure that society benefits from government automation without exposing individuals to unacceptable risks.

These contributions, written by the foremost international researchers and practitioners of Genetic Programming (GP), explore the synergy between theoretical and empirical results on real-world problems, producing a comprehensive view of the state of the art in GP. Topics in this volume include: gene expression regulation, novel genetic models for glaucoma, inheritable epigenetics, combinators in genetic programming, sequential symbolic regression, system dynamics, sliding window symbolic regression, large feature problems, alignment in the error space, HUMIE winners, Boolean multiplexer function, and highly distributed genetic programming systems. Application areas include chemical process control, circuit design, financial data mining and bioinformatics. Readers will discover large-scale, real-world applications of GP to a variety of problem domains via in-depth presentations of the latest and most significant results.

Recursion is one of the most fundamental concepts in computer science and a key programming technique that allows computations to be carried out repeatedly. Despite the importance of recursion for algorithm design, most programming books do not cover the topic in detail, despite the fact that numerous computer programming professors and researchers in the field of computer science education agree that recursion is difficult for novice students. Introduction to Recursive Programming provides a detailed and comprehensive introduction to recursion. This text will serve as a useful guide for anyone who wants to learn how to think and program recursively, by analyzing a wide variety of computational problems of diverse difficulty. It contains specific chapters on the most common types of recursion (linear, tail, and multiple), as well as on algorithm design paradigms in which recursion is prevalent (divide and conquer, and backtracking). Therefore, it can be used in introductory programming courses, and in more advanced classes on algorithm design. The book also covers lower-level topics related to iteration and program execution, and includes a rich chapter on the theoretical analysis of the computational cost of recursive programs, offering readers the possibility to learn some basic mathematics along the way. It also incorporates several elements aimed at helping students master the material. First, it contains a larger collection of simple problems in order to provide a solid foundation of the core concepts, before diving into more complex material. In addition, one of the book's main assets is the use of a step-by-step methodology, together with specially designed diagrams, for guiding and illustrating the process of developing recursive algorithms. Furthermore, the book covers combinatorial problems and mutual recursion. These topics can broaden students' understanding of recursion by forcing them to apply the learned concepts differently, or in a more sophisticated manner. The code examples have been written in Python 3, but should be straightforward to understand for students with experience in other programming languages. Finally, worked out solutions to over 120 end-of-chapter exercises are available for instructors.

Blockchain 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.

Systematically teaches key paradigmic algorithm design methods

Provides a deep insight into randomization

Networks powered by algorithms are pervasive. Major contemporary technology trends - Internet of Things, Big Data, Digital Platform Power, Blockchain, and the Algorithmic Society - are manifestations of this phenomenon. The internet, which once seemed an unambiguous benefit to society, is now the basis for invasions of privacy, massive concentrations of power, and wide-scale manipulation. The algorithmic networked world poses deep questions about power, freedom, fairness, and human agency. The influential 1997 Federal Communications Commission whitepaper "Digital Tornado" hailed the "endless spiral of connectivity" that would transform society, and today, little remains untouched by digital connectivity. Yet fundamental questions remain unresolved, and even more serious challenges have emerged. This important collection, which offers a reckoning and a foretelling, features leading technology scholars who explain the legal, business, ethical, technical, and public policy challenges of building pervasive networks and algorithms for the benefit of humanity. This title is also available as Open Access on Cambridge Core.

Maintaining a practical perspective, Python Programming: A Practical Approach acquaints you with the wonderful world of programming. The book is a starting point for those who want to learn Python programming. The backbone of any programming, which is the data structure and components such as strings, lists, etc., have been illustrated with many examples and enough practice problems to instill a level of self-confidence in the reader. Drawing on knowledge gained directly from teaching Computer Science as a subject and working on a wide range of projects related to ML, AI, deep learning, and blockchain, the authors have tried their best to present the necessary skills for a Python programmer. Once the foundation of Python programming is built and the readers are aware of the exact structure, dimensions, processing, building blocks, and representation of data, they can readily take up their specific problems from the area of interest and solve them with the help of Python. These include, but are not limited to, operators, control flow, strings, functions, module processing, object-oriented programming, exception and file handling, multithreading, synchronization, regular expressions, and Python database programming. This book on Python programming is specially designed to keep readers busy with learning fundamentals and generates a sense of confidence by attempting the assignment problems. We firmly believe that explaining any particular technology deviates from learning the fundamentals of a programming language. This book is focused on helping readers attempt implementation in their areas of interest through the skills imparted through this book. We have attempted to present the real essence of Python programming, which you can confidently apply in real life by using Python as a tool. Salient Features Based on real-world requirements and solution. Simple presentation without avoiding necessary details of the topic. Executable programs on almost every topic. Plenty of exercise questions, designed to test readers' skills and understanding. Purposefully designed to be instantly applicable, Python Programming: A Practical Approach provides implementation examples so that the described subject matter can be immediately implemented due to the well-known versatility of Python in handling different data types with ease.

This book is intended to be used as a textbook for graduate students studying theoretical computer science. It can also be used as a reference book for researchers in the area of design and analysis of approximation algorithms. Design and Analysis of Approximation Algorithms is a graduate course in theoretical computer science taught widely in the universities, both in the United States and abroad. There are, however, very few textbooks available for this course. Among those available in the market, most books follow a problem-oriented format; that is, they collected many important combinatorial optimization problems and their approximation algorithms, and organized them based on the types, or applications, of problems, such as geometric-type problems, algebraic-type problems, etc. Such arrangement of materials is perhaps convenient for a researcher to look for the problems and algorithms related to his/her work, but is difficult for a student to capture the ideas underlying the various algorithms. In the new book proposed here, we follow a more structured, technique-oriented presentation. We organize approximation algorithms into different chapters, based on the design techniques for the algorithms, so that the reader can study approximation algorithms of the same nature together. It helps the reader to better understand the design and analysis techniques for approximation algorithms, and also helps the teacher to present the ideas and techniques of approximation algorithms in a more unified way.

Eigenvalue computations are ubiquitous in science and engineering. John Francis's implicitly shifted QR algorithm has been the method of choice for small to medium sized eigenvalue problems since its invention in 1959. This book presents a new view of this classical algorithm. While Francis's original procedure chases bulges, the new version chases core transformations, which allows the development of fast algorithms for eigenvalue problems with a variety of special structures. This also leads to a fast and backward stable algorithm for computing the roots of a polynomial by solving the companion matrix eigenvalue problem. The authors received a SIAM Outstanding Paper prize for this work. This book will be of interest to researchers in numerical linear algebra and their students.

The two volume set CCIS 1030 and 1031 constitutes the refereed proceedings of the Second International Conference on Computational Intelligence, Communications, and Business Analytics, CICBA 2018, held in Kalyani, India, in July 2018. The 76 revised full papers presented in the two volumes were carefully reviewed and selected from 240 submissions. The papers are organized in topical sections on computational intelligence; signal processing and communications; microelectronics, sensors, and intelligent networks; data science & advanced data analytics; intelligent data mining & data warehousing; and computational forensics (privacy and security).

This two-volume set LNCS 11554 and 11555 constitutes the refereed proceedings of the 16th International Symposium on Neural Networks, ISNN 2019, held in Moscow, Russia, in July 2019. The 111 papers presented in the two volumes were carefully reviewed and selected from numerous submissions. The papers were organized in topical sections named: Learning System, Graph Model, and Adversarial Learning; Time Series Analysis, Dynamic Prediction, and Uncertain Estimation; Model Optimization, Bayesian Learning, and Clustering; Game Theory, Stability Analysis, and Control Method; Signal Processing, Industrial Application, and Data Generation; Image Recognition, Scene Understanding, and Video Analysis; Bio-signal, Biomedical Engineering, and Hardware.

This book constitutes the proceedings of the 17th International Conference on Practical Applications of Agents and Multi-Agent Systems, PAAMS 2019, held in Avila, Spain, in June 2019. The 19 regular and 14 demo papers presented in this volume were carefully reviewed and selected from 55 submissions. They deal with the application and validation of agent-based models, methods, and technologies in a number of key applications areas, including: Agronomy and Internet of Things, coordination and structure, finance and energy, function and autonomy, humans and societies, reasoning and optimization, traffic and routing.

This book constitutes the refereed proceedings of the 16th International Symposium on Algorithms and Data Structures, WADS, 2019, held in Edmonton, AB, Canada, in August 2019. The 42 full papers presented together with 3 invited lectures, we carefully reviewed and selected from a total of 88 submissions. They present original research on the theory and application of algorithms and data structures in many areas, including combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.

Algorithms play a central role both in the theory and in the practice of computing. The goal of the authors was to write a textbook that would not trivialize the subject but would still be readable by most students on their own. The book contains over 120 exercises. Some of them are drills; others make important points about the material covered in the text or introduce new algorithms not covered there. The book also provides programming projects. From the Table of Contents: Chapter 1: Basic knowledge of Mathematics, Relations, Recurrence relation and Solution techniques, Function and Growth of functions. Chapter 2: Different Sorting Techniques and their analysis. Chapter 3: Greedy approach, Dynamic Programming, Branch and Bound techniques, Backtracking and Problems, Amortized analysis, and Order Statics. Chapter 4: Graph algorithms, BFS, DFS, Spanning Tree, Flow Maximization Algorithms. Shortest Path Algorithms. Chapter 5: Binary search tree, Red black Tree, Binomial heap, B-Tree and Fibonacci Heap. Chapter 6: Approximation Algorithms, Sorting Networks, Matrix operations, Fast Fourier Transformation, Number theoretic Algorithm, Computational geometry Randomized Algorithms, String matching, NP-Hard, NP-Completeness, Cooks theorem.

The two-volume set LNCS 11508 and 11509 constitutes the refereed proceedings of of the 18th International Conference on Artificial Intelligence and Soft Computing, ICAISC 2019, held in Zakopane, Poland, in June 2019. The 122 revised full papers presented were carefully reviewed and selected from 333 submissions. The papers included in the first volume are organized in the following five parts: neural networks and their applications; fuzzy systems and their applications; evolutionary algorithms and their applications; pattern classification; artificial intelligence in modeling and simulation. The papers included in the second volume are organized in the following five parts: computer vision, image and speech analysis; bioinformatics, biometrics, and medical applications; data mining; various problems of artificial intelligence; agent systems, robotics and control.

This book constitutes the revised selected papers of the 13th Italian Workshop on Artificial Life and Evolutionary Computation, WIVACE 2018, held in Parma, Italy, in September 2018. The 12 full papers presented were thoroughly reviewed and selected from 30 submissions. They cover the following topics: Boolean networks and complex systems; economic, societal and technological applications; chemical, biological and medical applications. The chapter "Unveiling Latent Relations in the Photonics Techno-Economic Complex System" is open access under a CC BY 4.0 license at link.springer.com.

This book constitutes the proceedings of the 8th International Workshop on Design, Modeling, and Evaluation of Cyber Physical Systems, CyPhy 2018 and 14th International Workshop on Embedded and Cyber-Physical Systems Education, WESE 2018, held in conjunction with ESWeek 2018, in Torino, Italy, in October 2018.The 13 full papers presented together with 1 short paper in this volume were carefully reviewed and selected from 18 submissions. The conference presents a wide range of domains including Modeling, simulation, verification, design, cyber-physical systems, embedded systems, real-time systems, safety, and reliability.

This Festschrift volume is published in honor of Bernhard Steffen, Professor at the Technical University of Dortmund, on the occasion of his 60th birthday. His vision as well as his theoretical and practical work span the development and implementation of novel, specific algorithms, and the establishment of cross-community relationships with the effect to obtain simpler, yet more powerful solutions. He initiated many new lines of research through seminal papers that pioneered various fields, starting with the Concurrency Workbench, a model checking toolbox that significantly influenced the research and development of mode based high assurance systems worldwide. The contributions in this volume reflect the breadth and impact of his work. The introductory paper by the volume editors, the 23 full papers and two personal statements relate to Bernhard's research and life. This volume, the talks and the entire B-Day at ISoLA 2018 are a tribute to the first 30 years of Bernhard's passion, impact and vision for many facets of computer science in general and for formal methods in particular. Impact and vision include the many roles that formal methods-supported software development should play in education, in industry and in society.

This two-volume set LNCS 11554 and 11555 constitutes the refereed proceedings of the 16th International Symposium on Neural Networks, ISNN 2019, held in Moscow, Russia, in July 2019. The 111 papers presented in the two volumes were carefully reviewed and selected from numerous submissions. The papers were organized in topical sections named: Learning System, Graph Model, and Adversarial Learning; Time Series Analysis, Dynamic Prediction, and Uncertain Estimation; Model Optimization, Bayesian Learning, and Clustering; Game Theory, Stability Analysis, and Control Method; Signal Processing, Industrial Application, and Data Generation; Image Recognition, Scene Understanding, and Video Analysis; Bio-signal, Biomedical Engineering, and Hardware.