This undergraduate textbook provides an introduction to graph theory, which has numerous applications in modeling problems in science and technology, and has become a vital component to computer science, computer science and engineering, and mathematics curricula of universities all over the world. The author follows a methodical and easy to understand approach. Beginning with the historical background, motivation and applications of graph theory, the author first explains basic graph theoretic terminologies. From this firm foundation, the author goes on to present paths, cycles, connectivity, trees, matchings, coverings, planar graphs, graph coloring and digraphs as well as some special classes of graphs together with some research topics for advanced study. Filled with exercises and illustrations, Basic Graph Theory is a valuable resource for any undergraduate student to understand and gain confidence in graph theory and its applications to scientific research, algorithms and problem solving.

This book constitutes the proceedings of the 20th International Conference on Fundamental Approaches to Software Engineering, FASE 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017. The 23 papers presented in this volume were carefully reviewed and selected from 91 submissions. They were organized in topical sections named: learning and inference; test selection; program and system analysis; graph modeling and transformation; model transformations; configuration and synthesis; and software product lines.

This book constitutes the refereed proceedings of the Second Russian Supercomputing Days, RuSCDays 2016, held in Moscow, Russia, in September 2016. The 28 revised full papers presented were carefully reviewed and selected from 94 submissions. The papers are organized in topical sections on the present of supercomputing: large tasks solving experience; the future of supercomputing: new technologies.

This book constitutes the revised selected papers of the 11th Italian Workshop on Advances in Artificial Life, Evolutionary Computation and Systems Chemistry, WIVACE 2016, held at Fisciano, Italy, in October 2016. The 16 full papers together with 1 short papers presented have been thoroughly reviewed and selected from 54 submissions. They cover the following topics: evolutionary computation, bioinspired algorithms, genetic algorithms, bioinformatics and computational biology, modelling and simulation of artificial and biological systems, complex systems, synthetic and systems biology, systems chemistry.

Assess the quality of your prediction and classification models in ways that accurately reflect their real-world performance, and then improve this performance using state-of-the-art algorithms such as committee-based decision making, resampling the dataset, and boosting. This book presents many important techniques for building powerful, robust models and quantifying their expected behavior when put to work in your application. Considerable attention is given to information theory, especially as it relates to discovering and exploiting relationships between variables employed by your models. This presentation of an often confusing subject avoids advanced mathematics, focusing instead on concepts easily understood by those with modest background in mathematics. All algorithms include an intuitive explanation of operation, essential equations, references to more rigorous theory, and commented C++ source code. Many of these techniques are recent developments, still not in widespread use. Others are standard algorithms given a fresh look. In every case, the emphasis is on practical applicability, with all code written in such a way that it can easily be included in any program. What You'll Learn Compute entropy to detect problematic predictors Improve numeric predictions using constrained and unconstrained combinations, variance-weighted interpolation, and kernel-regression smoothing Carry out classification decisions using Borda counts, MinMax and MaxMin rules, union and intersection rules, logistic regression, selection by local accuracy, maximization of the fuzzy integral, and pairwise coupling Harness information-theoretic techniques to rapidly screen large numbers of candidate predictors, identifying those that are especially promising Use Monte-Carlo permutation methods to assess the role of good luck in performance results Compute confidence and tolerance intervals for predictions, as well as confidence levels for classification decisions Who This Book is For Anyone who creates prediction or classification models will find a wealth of useful algorithms in this book. Although all code examples are written in C++, the algorithms are described in sufficient detail that they can easily be programmed in any language.

This interdisciplinary book covers a wide range of subjects, from pure mathematics (knots, braids, homotopy theory, number theory) to more applied mathematics (cryptography, algebraic specification of algorithms, dynamical systems) and concrete applications (modeling of polymers and ionic liquids, video, music and medical imaging). The main mathematical focus throughout the book is on algebraic modeling with particular emphasis on braid groups. The research methods include algebraic modeling using topological structures, such as knots, 3-manifolds, classical homotopy groups, and braid groups. The applications address the simulation of polymer chains and ionic liquids, as well as the modeling of natural phenomena via topological surgery. The treatment of computational structures, including finite fields and cryptography, focuses on the development of novel techniques. These techniques can be applied to the design of algebraic specifications for systems modeling and verification. This book is the outcome of a workshop in connection with the research project Thales on Algebraic Modeling of Topological and Computational Structures and Applications, held at the National Technical University of Athens, Greece in July 2015. The reader will benefit from the innovative approaches to tackling difficult questions in topology, applications and interrelated research areas, which largely employ algebraic tools.

This book provides a critical examination of how the choice of what to believe is represented in the standard model of belief change. In particular the use of possible worlds and infinite remainders as objects of choice is critically examined. Descriptors are introduced as a versatile tool for expressing the success conditions of belief change, addressing both local and global descriptor revision. The book presents dynamic descriptors such as Ramsey descriptors that convey how an agent's beliefs tend to be changed in response to different inputs. It also explores sentential revision and demonstrates how local and global operations of revision by a sentence can be derived as a special case of descriptor revision. Lastly, the book examines revocation, a generalization of contraction in which a specified sentence is removed in a process that may possibly also involve the addition of some new information to the belief set.

This book presents task-scheduling techniques for emerging complex parallel architectures including heterogeneous multi-core architectures, warehouse-scale datacenters, and distributed big data processing systems. The demand for high computational capacity has led to the growing popularity of multicore processors, which have become the mainstream in both the research and real-world settings. Yet to date, there is no book exploring the current task-scheduling techniques for the emerging complex parallel architectures. Addressing this gap, the book discusses state-of-the-art task-scheduling techniques that are optimized for different architectures, and which can be directly applied in real parallel systems. Further, the book provides an overview of the latest advances in task-scheduling policies in parallel architectures, and will help readers understand and overcome current and emerging issues in this field.

The two-book set LNCS 10205 + 10206 constitutes the proceedings of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017.The 48 full papers, 4 tool demonstration papers, and 12 software competition papers presented in these volumes were carefully reviewed and selected from 181 submissions to TACAS and 32 submissions to the software competition. They were organized in topical sections named: verification techniques; learning; synthesis; automata; concurrency and bisimulation; hybrid systems; security; run-time verification and logic; quantitative systems; SAT and SMT; and SV COMP.

The two-book set LNCS 10205 + 10206 constitutes the proceedings of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017.The 48 full papers, 4 tool demonstration papers, and 12 software competition papers presented in these volumes were carefully reviewed and selected from 181 submissions to TACAS and 32 submissions to the software competition. They were organized in topical sections named: verification techniques; learning; synthesis; automata; concurrency and bisimulation; hybrid systems; security; run-time verification and logic; quantitative systems; SAT and SMT; and SV COMP.

This book provides an introduction to logic and mathematical induction which are the basis of any deductive computational framework. A strong mathematical foundation of the logical engines available in modern proof assistants, such as the PVS verification system, is essential for computer scientists, mathematicians and engineers to increment their capabilities to provide formal proofs of theorems and to certify the robustness of software and hardware systems. The authors present a concise overview of the necessary computational and mathematical aspects of 'logic', placing emphasis on both natural deduction and sequent calculus. Differences between constructive and classical logic are highlighted through several examples and exercises. Without neglecting classical aspects of computational logic, the authors also highlight the connections between logical deduction rules and proof commands in proof assistants, presenting simple examples of formalizations of the correctness of algebraic functions and algorithms in PVS. Applied Logic for Computer Scientists will not only benefit students of computer science and mathematics but also software, hardware, automation, electrical and mechatronic engineers who are interested in the application of formal methods and the related computational tools to provide mathematical certificates of the quality and accuracy of their products and technologies.

This book provides practical applications of doubly classified models by using R syntax to generate the models. It also presents these models in symbolic tables so as to cater to those who are not mathematically inclined, while numerous examples throughout the book illustrate the concepts and their applications. For those who are not aware of this modeling approach, it serves as a good starting point to acquire a basic understanding of doubly classified models. It is also a valuable resource for academics, postgraduate students, undergraduates, data analysts and researchers who are interested in examining square contingency tables.

This monograph gives a thorough treatment of the celebrated compositions of signature and encryption that allow for verifiability, that is, to efficiently prove properties about the encrypted data. This study is provided in the context of two cryptographic primitives: (1) designated confirmer signatures, an opaque signature which was introduced to control the proliferation of certified copies of documents, and (2) signcryption, a primitive that offers privacy and authenticity at once in an efficient way. This book is a useful resource to researchers in cryptology and information security, graduate and PhD students, and security professionals.

This book is intended to make recent results on the derivation of higher order numerical schemes for random ordinary differential equations (RODEs) available to a broader readership, and to familiarize readers with RODEs themselves as well as the closely associated theory of random dynamical systems. In addition, it demonstrates how RODEs are being used in the biological sciences, where non-Gaussian and bounded noise are often more realistic than the Gaussian white noise in stochastic differential equations (SODEs). RODEs are used in many important applications and play a fundamental role in the theory of random dynamical systems. They can be analyzed pathwise with deterministic calculus, but require further treatment beyond that of classical ODE theory due to the lack of smoothness in their time variable. Although classical numerical schemes for ODEs can be used pathwise for RODEs, they rarely attain their traditional order since the solutions of RODEs do not have sufficient smoothness to have Taylor expansions in the usual sense. However, Taylor-like expansions can be derived for RODEs using an iterated application of the appropriate chain rule in integral form, and represent the starting point for the systematic derivation of consistent higher order numerical schemes for RODEs. The book is directed at a wide range of readers in applied and computational mathematics and related areas as well as readers who are interested in the applications of mathematical models involving random effects, in particular in the biological sciences.The level of this book is suitable for graduate students in applied mathematics and related areas, computational sciences and systems biology. A basic knowledge of ordinary differential equations and numerical analysis is required.

This book presents a deep spectrum of musical, mathematical, physical, and philosophical perspectives that have emerged in this field at the intersection of music and mathematics. In particular the contributed chapters introduce advanced techniques and concepts from modern mathematics and physics, deriving from successes in domains such as Topos theory and physical string theory. The authors include many of the leading researchers in this domain, and the book will be of value to researchers working in computational music, particularly in the areas of counterpoint, gesture, and Topos theory.

This book presents recent research on Advanced Computing in Industrial Mathematics, which is one of the most prominent interdisciplinary areas, bringing together mathematics, computer science, scientific computations, engineering, physics, chemistry, medicine, etc. Further, the book presents the major tools used in Industrial Mathematics, which are based on mathematical models, and the corresponding computer codes, which are used to perform virtual experiments to obtain new data or to better understand previous experimental findings. The book gathers the peer-reviewed papers presented at the 11th Annual Meeting of the Bulgarian Section of SIAM (BGSIAM), from December 20 to 22, 2016 in Sofia, Bulgaria.

This collection of high-quality articles in the field of combinatorics, geometry, algebraic topology and theoretical computer science is a tribute to Jiri Matousek, who passed away prematurely in March 2015. It is a collaborative effort by his colleagues and friends, who have paid particular attention to clarity of exposition - something Jirka would have approved of. The original research articles, surveys and expository articles, written by leading experts in their respective fields, map Jiri Matousek's numerous areas of mathematical interest.

This thesis describes experimental work in the field of trapped-ion quantum computation. It outlines the theory of Raman interactions, examines the various sources of error in two-qubit gates, and describes in detail experimental explorations of the sources of infidelity in implementations of single- and two-qubit gates. Lastly, it presents an experimental demonstration of a mixed-species entangling gate.

This book provides the mathematical fundamentals of linear algebra to practicers in computer vision, machine learning, robotics, applied mathematics, and electrical engineering. By only assuming a knowledge of calculus, the authors develop, in a rigorous yet down to earth manner, the mathematical theory behind concepts such as: vectors spaces, bases, linear maps, duality, Hermitian spaces, the spectral theorems, SVD, and the primary decomposition theorem. At all times, pertinent real-world applications are provided. This book includes the mathematical explanations for the tools used which we believe that is adequate for computer scientists, engineers and mathematicians who really want to do serious research and make significant contributions in their respective fields.

The two-volume set, CCIS 681 and CCIS 682, constitutes the proceedings of the 11th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2016, held in Xi'an, China, in October 2016.The 115 revised full papers presented were carefully reviewed and selected from 343 submissions. The papers of Part I are organized in topical sections on DNA Computing; Membrane Computing; Neural Computing; Machine Learning. The papers of Part II are organized in topical sections on Evolutionary Computing; Multi-objective Optimization; Pattern Recognition; Others.

This textbook gives a systematized and compact summary, providing the most essential types of modern models for languages and computation together with their properties and applications. Most of these models properly reflect and formalize current computational methods, based on parallelism, distribution and cooperation covered in this book. As a result, it allows the user to develop, study, and improve these methods very effectively. This textbook also represents the first systematic treatment of modern language models for computation. It covers all essential theoretical topics concerning them. From a practical viewpoint, it describes various concepts, methods, algorithms, techniques, and software units based upon these models. Based upon them, it describes several applications in biology, linguistics, and computer science. Advanced-level students studying computer science, mathematics, linguistics and biology will find this textbook a valuable resource. Theoreticians, practitioners and researchers working in today's theory of computation and its applications will also find this book essential as a reference.

The 14 contributed chapters in this book survey the most recent developments in high-performance algorithms for NGS data, offering fundamental insights and technical information specifically on indexing, compression and storage; error correction; alignment; and assembly. The book will be of value to researchers, practitioners and students engaged with bioinformatics, computer science, mathematics, statistics and life sciences.

This book constitutes the refereed proceedings of the 6th International Symposium on Leveraging Applications of Formal Methods, Verification, and Validation, ISoLA 2014, held in Corfu, Greece, in October 2014, and the 5th International Symposium, ISoLA 2012, held in Heraklion, Crete, Greece, in October 2012. The 9 revised full papers presented were carefully reviewed and selected from 22 submissions. This volume combines the post-conference proceedings of the 2014 Doctoral Symposium and the 2014 Tutorial "Automata Learning in Practice" with the post-conference publication of selected contributions from the Tracks "Process-Oriented Geoinformation Systems and Applications" and "Processes and Data Integration in the Networked Healthcare" of ISoLA 2012.

Growth curve models in longitudinal studies are widely used to model population size, body height, biomass, fungal growth, and other variables in the biological sciences, but these statistical methods for modeling growth curves and analyzing longitudinal data also extend to general statistics, economics, public health, demographics, epidemiology, SQC, sociology, nano-biotechnology, fluid mechanics, and other applied areas. There is no one-size-fits-all approach to growth measurement. The selected papers in this volume build on presentations from the GCM workshop held at the Indian Statistical Institute, Giridih, on March 28-29, 2016. They represent recent trends in GCM research on different subject areas, both theoretical and applied. This book includes tools and possibilities for further work through new techniques and modification of existing ones. The volume includes original studies, theoretical findings and case studies from a wide range of applied work, and these contributions have been externally refereed to the high quality standards of leading journals in the field.

This book presents new efficient methods for optimization in realistic large-scale, multi-agent systems. These methods do not require the agents to have the full information about the system, but instead allow them to make their local decisions based only on the local information, possibly obtained during communication with their local neighbors. The book, primarily aimed at researchers in optimization and control, considers three different information settings in multi-agent systems: oracle-based, communication-based, and payoff-based. For each of these information types, an efficient optimization algorithm is developed, which leads the system to an optimal state. The optimization problems are set without such restrictive assumptions as convexity of the objective functions, complicated communication topologies, closed-form expressions for costs and utilities, and finiteness of the system's state space.