This book uses new mathematical tools to examine broad computability and complexity questions in enumerative combinatorics, with applications to other areas of mathematics, theoretical computer science, and physics. A focus on effective algorithms leads to the development of computer algebra software of use to researchers in these domains. After a survey of current results and open problems on decidability in enumerative combinatorics, the text shows how the cutting edge of this research is the new domain of Analytic Combinatorics in Several Variables (ACSV). The remaining chapters of the text alternate between a pedagogical development of the theory, applications (including the resolution by this author of conjectures in lattice path enumeration which resisted several other approaches), and the development of algorithms. The final chapters in the text show, through examples and general theory, how results from stratified Morse theory can help refine some of these computability questions. Complementing the written presentation are over 50 worksheets for the SageMath and Maple computer algebra systems working through examples in the text.

This book engages in an ongoing topic, such as the implementation of nature-inspired metaheuristic algorithms, with a main concentration on optimization problems in different fields of engineering optimization applications. The chapters of the book provide concise overviews of various nature-inspired metaheuristic algorithms, defining their profits in obtaining the optimal solutions of tiresome engineering design problems that cannot be efficiently resolved via conventional mathematical-based techniques. Thus, the chapters report on advanced studies on the applications of not only the traditional, but also the contemporary certain nature-inspired metaheuristic algorithms to specific engineering optimization problems with single and multi-objectives. Harmony search, artificial bee colony, teaching learning-based optimization, electrostatic discharge, grasshopper, backtracking search, and interactive search are just some of the methods exhibited and consulted step by step in application contexts. The book is a perfect guide for graduate students, researchers, academicians, and professionals willing to use metaheuristic algorithms in engineering optimization applications.

This edited book focuses on concepts and their applications using the theory of conceptual spaces, one of today's most central tracks of cognitive science discourse. It features 15 papers based on topics presented at the Conceptual Spaces @ Work 2016 conference. The contributors interweave both theory and applications in their papers. Among the first mentioned are studies on metatheories, logical and systemic implications of the theory, as well as relations between concepts and language. Examples of the latter include explanatory models of paradigm shifts and evolution in science as well as dilemmas and issues of health, ethics, and education. The theory of conceptual spaces overcomes many translational issues between academic theoretization and practical applications. The paradigm is mainly associated with structural explanations, such as categorization and meronomy. However, the community has also been relating it to relations, functions, and systems. The book presents work that provides a geometric model for the representation of human conceptual knowledge that bridges the symbolic and the sub-conceptual levels of representation. The model has already proven to have a broad range of applicability beyond cognitive science and even across a number of disciplines related to concepts and representation.

As today's world continues to advance, Artificial Intelligence (AI) is a field that has become a staple of technological development and led to the advancement of numerous professional industries. An application within AI that has gained attention is machine learning. Machine learning uses statistical techniques and algorithms to give computer systems the ability to understand and its popularity has circulated through many trades. Understanding this technology and its countless implementations is pivotal for scientists and researchers across the world. The Handbook of Research on Emerging Trends and Applications of Machine Learning provides a high-level understanding of various machine learning algorithms along with modern tools and techniques using Artificial Intelligence. In addition, this book explores the critical role that machine learning plays in a variety of professional fields including healthcare, business, and computer science. While highlighting topics including image processing, predictive analytics, and smart grid management, this book is ideally designed for developers, data scientists, business analysts, information architects, finance agents, healthcare professionals, researchers, retail traders, professors, and graduate students seeking current research on the benefits, implementations, and trends of machine learning.

Quantum logic gates are the crucial information-processing operation of quantumcomputers. Two crucial performance metrics for logic gates are their precision andspeed. Quantum processors based on trapped ions have always been the touchstonefor gate precision, but have suffered from slow speed relative to other quantum logicplatforms such as solid state systems. This thesis shows that it is possible to acceleratethe logic "clock speed" from kHz to MHz speeds, whilst maintaining a precision of99.8%. This is almost as high as the world record for conventional trapped-ion gates,but more than 20 times faster. It also demonstrates entanglement generation in atime (480ns) shorter than the natural timescale of the ions' motion in the trap, whichstarts to probe an interesting new regime of ion trap physics. In separate experiments, some of the first "mixed-species" quantum logic gates areperformed, both between two different elements, and between different isotopes.The mixed-isotope gate is used to make the first test of the quantum-mechanical Bellinequality between two different species of isolated atoms.

This book presents a complete and accurate study of arithmetic and algebraic circuits. The first part offers a review of all important basic concepts: it describes simple circuits for the implementation of some basic arithmetic operations; it introduces theoretical basis for residue number systems; and describes some fundamental circuits for implementing the main modular operations that will be used in the text. Moreover, the book discusses floating-point representation of real numbers and the IEEE 754 standard. The second and core part of the book offers a deep study of arithmetic circuits and specific algorithms for their implementation. It covers the CORDIC algorithm, and optimized arithmetic circuits recently developed by the authors for adders and subtractors, as well as multipliers, dividers and special functions. It describes the implementation of basic algebraic circuits, such as LFSRs and cellular automata. Finally, it offers a complete study of Galois fields, showing some exemplary applications and discussing the advantages in comparison to other methods. This dense, self-contained text provides students, researchers and engineers, with extensive knowledge on and a deep understanding of arithmetic and algebraic circuits and their implementation.

Numerical Methods for Linear Control Systems Design and Analysis is an interdisciplinary textbook aimed at systematic descriptions and implementations of numerically-viable algorithms based on well-established, efficient and stable modern numerical linear techniques for mathematical problems arising in the design and analysis of linear control systems both for the first- and second-order models. MATLAB-based software is included for implementing all of the major algorithms from the book.
* Unique coverage of modern mathematical concepts such as parallel computations, second-order systems, and large-scale solutions
* Background material in linear algebra, numerical linear algebra, and control theory included in text
* Step-by-step explanations of the algorithms and examples
* Includes MATLAB-based solution software

Rooted in a pedagogically successful problem-solving approach to linear algebra, this work fills a gap in the literature that is sharply divided between, on the one end, elementary texts with only limited exercises and examples, and, at the other end, books too advanced in prerequisites and too specialized in focus to appeal to a wide audience. Instead, it clearly develops the theoretical foundations of vector spaces, linear equations, matrix algebra, eigenvectors, and orthogonality, while simultaneously emphasizing applications to fields such as biology, economics, computer graphics, electrical engineering, cryptography, and political science.Key features: * Intertwined discussion of linear algebra and geometry* Example-driven exposition; each section starts with a concise overview of important concepts, followed by a selection of fully-solved problems* Over 500 problems are carefully selected for instructive appeal, elegance, and theoretical importance; roughly half include complete solutions* Two or more solutions provided to many of the problems; paired solutions range from step-by-step, elementary methods whose purpose is to strengthen basic comprehension to more sophisticated, self-study manual for professional scientists and mathematicians. Complete with bibliography and index, this work is a natural bridge between pure/ applied mathematics and the natural/social sciences, appropriate for any student or researcher who needs a strong footing in the theory, problem-solving, and model-building that are the subject's hallmark. I

Voronoi diagrams partition space according to the influence certain sites exert on their environment. Since the 17th century, such structures play an important role in many areas like Astronomy, Physics, Chemistry, Biology, Ecology, Economics, Mathematics and Computer Science. They help to describe zones of political influence, to determine the hospital nearest to an accident site, to compute collision-free paths for mobile robots, to reconstruct curves and surfaces from sample points, to refine triangular meshes, and to design location strategies for competing markets. This unique book offers a state-of-the-art view of Voronoi diagrams and their structure, and it provides efficient algorithms towards their computation. Readers with an entry-level background in algorithms can enjoy a guided tour of gently increasing difficulty through a fascinating area. Lecturers might find this volume a welcome source for their courses on computational geometry. Experts are offered a broader view, including many alternative solutions, and up-to-date references to the existing literature; they might benefit in their own research or application development.

This book discusses recent advances and research in applied mathematics, statistics and their applications in computing. It features papers presented at the fourth conference in the series organized at the Indian Institute of Technology (Banaras Hindu University), Varanasi, India, on 9 - 11 January 2018 on areas of current interest, including operations research, soft computing, applied mathematical modelling, cryptology, and security analysis. The conference has emerged as a powerful forum, bringing together leading academic scientists, experts from industry, and researchers and offering a venue to discuss, interact and collaborate to stimulate the advancement of mathematics and its applications in computer science. The education of future consumers, users, producers, developers and researchers of mathematics and its applications is an important challenge in modern society, and as such, mathematics and its application in computer science are of vital significance to all spectrums of the community, as well as to mathematicians and computing professionals across different educational levels and disciplines. With contributions by leading international experts, this book motivates and creates interest among young researchers.

This book presents a comprehensive overview of fundamental issues and recent advances in graph data management. Its aim is to provide beginning researchers in the area of graph data management, or in fields that require graph data management, an overview of the latest developments in this area, both in applied and in fundamental subdomains. The topics covered range from a general introduction to graph data management, to more specialized topics like graph visualization, flexible queries of graph data, parallel processing, and benchmarking. The book will help researchers put their work in perspective and show them which types of tools, techniques and technologies are available, which ones could best suit their needs, and where there are still open issues and future research directions. The chapters are contributed by leading experts in the relevant areas, presenting a coherent overview of the state of the art in the field. Readers should have a basic knowledge of data management techniques as they are taught in computer science MSc programs.

The books in this trilogy capture the foundational core of advanced informatics. The authors make the foundations accessible, enabling students to become effective problem solvers. This first volume establishes the inductive approach as a fundamental principle for system and domain analysis. After a brief introduction to the elementary mathematical structures, such as sets, propositional logic, relations, and functions, the authors focus on the separation between syntax (representation) and semantics (meaning), and on the advantages of the consistent and persistent use of inductive definitions. They identify compositionality as a feature that not only acts as a foundation for algebraic proofs but also as a key for more general scalability of modeling and analysis. A core principle throughout is invariance, which the authors consider a key for the mastery of change, whether in the form of extensions, transformations, or abstractions. This textbook is suitable for undergraduate and graduate courses in computer science and for self-study. Most chapters contain exercises and the content has been class-tested over many years in various universities.

This book is published open access under a CC BY 4.0 license. This book presents computer programming as a key method for solving mathematical problems. This second edition of the well-received book has been extensively revised: All code is now written in Python version 3.6 (no longer version 2.7). In addition, the two first chapters of the previous edition have been extended and split up into five new chapters, thus expanding the introduction to programming from 50 to 150 pages. Throughout the book, the explanations provided are now more detailed, previous examples have been modified, and new sections, examples and exercises have been added. Also, a number of small errors have been corrected. The book was inspired by the Springer book TCSE 6: A Primer on Scientific Programming with Python (by Langtangen), but the style employed is more accessible and concise, in keeping with the needs of engineering students. The book outlines the shortest possible path from no previous experience with programming to a set of skills that allows students to write simple programs for solving common mathematical problems with numerical methods in the context of engineering and science courses. The emphasis is on generic algorithms, clean program design, the use of functions, and automatic tests for verification.

This book explores emerging topics in atomic- and nano-scale electronics after the era of Moore's Law, covering both the physical principles behind, and technological implementations for many devices that are now expected to become key elements of the future of nanoelectronics beyond traditional complementary metal-oxide semiconductors (CMOS). Moore's law is not a physical law itself, but rather a visionary prediction that has worked well for more than 50 years but is rapidly coming to its end as the gate length of CMOS transistors approaches the length-scale of only a few atoms. Thus, the key question here is: "What is the future for nanoelectronics beyond CMOS?" The possible answers are found in this book. Introducing novel quantum devices such as atomic-scale electronic devices, ballistic devices, memristors, superconducting devices, this book also presents the reader with the physical principles underlying new ways of computing, as well as their practical implementation. Topics such as quantum computing, neuromorphic computing are highlighted here as some of the most promising candidates for ushering in a new era of atomic-scale electronics beyond CMOS.

This second volume of Handbook of Automated Reasoning covers topics such as higher-order logic and logical frameworks, higher-order unification and matching, logical frameworks, proof-assistants using dependent type systems, and nonclassical logics.

This volume contains papers based on presentations at the "Nagoya Winter Workshop 2015: Reality and Measurement in Algebraic Quantum Theory (NWW 2015)", held in Nagoya, Japan, in March 2015. The foundations of quantum theory have been a source of mysteries, puzzles, and confusions, and have encouraged innovations in mathematical languages to describe, analyze, and delineate this wonderland. Both ontological and epistemological questions about quantum reality and measurement have been placed in the center of the mysteries explored originally by Bohr, Heisenberg, Einstein, and Schroedinger. This volume describes how those traditional problems are nowadays explored from the most advanced perspectives. It includes new research results in quantum information theory, quantum measurement theory, information thermodynamics, operator algebraic and category theoretical foundations of quantum theory, and the interplay between experimental and theoretical investigations on the uncertainty principle. This book is suitable for a broad audience of mathematicians, theoretical and experimental physicists, and philosophers of science.

This book is dedicated to the systematization and development of models, methods, and algorithms for queuing systems with correlated arrivals. After first setting up the basic tools needed for the study of queuing theory, the authors concentrate on complicated systems: multi-server systems with phase type distribution of service time or single-server queues with arbitrary distribution of service time or semi-Markovian service. They pay special attention to practically important retrial queues, tandem queues, and queues with unreliable servers. Mathematical models of networks and queuing systems are widely used for the study and optimization of various technical, physical, economic, industrial, and administrative systems, and this book will be valuable for researchers, graduate students, and practitioners in these domains.

This book presents the Statistical Learning Theory in a detailed and easy to understand way, by using practical examples, algorithms and source codes. It can be used as a textbook in graduation or undergraduation courses, for self-learners, or as reference with respect to the main theoretical concepts of Machine Learning. Fundamental concepts of Linear Algebra and Optimization applied to Machine Learning are provided, as well as source codes in R, making the book as self-contained as possible. It starts with an introduction to Machine Learning concepts and algorithms such as the Perceptron, Multilayer Perceptron and the Distance-Weighted Nearest Neighbors with examples, in order to provide the necessary foundation so the reader is able to understand the Bias-Variance Dilemma, which is the central point of the Statistical Learning Theory. Afterwards, we introduce all assumptions and formalize the Statistical Learning Theory, allowing the practical study of different classification algorithms. Then, we proceed with concentration inequalities until arriving to the Generalization and the Large-Margin bounds, providing the main motivations for the Support Vector Machines. From that, we introduce all necessary optimization concepts related to the implementation of Support Vector Machines. To provide a next stage of development, the book finishes with a discussion on SVM kernels as a way and motivation to study data spaces and improve classification results.

This book provides a tutorial in the use of Altair Compose and Altair Activate, software packages that provide system modeling and simulation facilities. Advanced system modeling software provide multiple ways of creating models: models can be programmed in specialized languages, graphically constructed as block-diagrams and state machines, or expressed mathematically in equation-based languages. Compose and Activate are introduced in this text in two parts. The first part introduces the multi-language environment of Compose and its use for modeling, simulation and optimization. The second describes the graphical system modeling and optimization with Activate, an open-system environment providing signal-based modeling as well as physical system component-based modeling. Throughout both parts are applied examples from mechanical, biological, and electrical systems, as well as control and signal processing systems. This book will be an invaluable addition with many examples both for those just interested in OML and those doing industrial scale modeling, simulation, and design. All examples are worked using the free basic editions of Activate and Compose that are available.

Rising concerns about the security of our data have made quantum cryptography a very active research field in recent years. Quantum cryptographic protocols promise everlasting security by exploiting distinctive quantum properties of nature. The most extensively implemented protocol is quantum key distribution (QKD), which enables secure communication between two users. The aim of this book is to introduce the reader to state-of-the-art QKD and illustrate its recent multi-user generalization: quantum conference key agreement. With its pedagogical approach that doesn't disdain going into details, the book enables the reader to join in cutting-edge research on quantum cryptography.

With the diversification of Internet services and the increase in mobile users, efficient management of network resources has become an extremely important issue in the field of wireless communication networks (WCNs). Adaptive resource management is an effective tool for improving the economic efficiency of WCN systems as well as network design and construction, especially in view of the surge in mobile device demands. This book presents modelling methods based on queueing theory and Markov processes for a wide variety of WCN systems, as well as precise and approximate analytical solution methods for the numerical evaluation of the system performance. This is the first book to provide an overview of the numerical analyses that can be gleaned by applying queueing theory, traffic theory and other analytical methods to various WCN systems. It also discusses the recent advances in the resource management of WCNs, such as broadband wireless access networks, cognitive radio networks, and green cloud computing. It assumes a basic understanding of computer networks and queueing theory, and familiarity with stochastic processes is also recommended. The analysis methods presented in this book are useful for first-year-graduate or senior computer science and communication engineering students. Providing information on network design and management, performance evaluation, queueing theory, game theory, intelligent optimization, and operations research for researchers and engineers, the book is also a valuable reference resource for students, analysts, managers and anyone in the industry interested in WCN system modelling, performance analysis and numerical evaluation.

This book presents a collection of papers on recent advances in problems concerning dynamics, optimal control and optimization. In many chapters, computational techniques play a central role. Set-oriented techniques feature prominently throughout the book, yielding state-of-the-art algorithms for computing general invariant sets, constructing globally optimal controllers and solving multi-objective optimization problems.

This textbook provides an introduction to the growing interdisciplinary field of computational science. It combines a foundational development of numerical methods with a variety of illustrative applications spread across numerous areas of science and engineering. The intended audience is the undergraduate who has completed introductory coursework in mathematics and computer science. Students gain computational acuity by authoring their own numerical routines and by practicing with numerical methods as they solve computational models. This education encourages students to learn the importance of answering: How expensive is a calculation, how trustworthy is a calculation, and how might we model a problem to apply a desired numerical method? The text is written in two parts. Part I provides a succinct, one-term inauguration into the primary routines on which a further study of computational science rests. The material is organized so that the transition to computational science from coursework in calculus, differential equations, and linear algebra is natural. Beyond the mathematical and computational content of Part I, students gain proficiency with elemental programming constructs and visualization, which are presented in MATLAB syntax. The focus of Part II is modeling, wherein students build computational models, compute solutions, and report their findings. The models purposely intersect numerous areas of science and engineering to demonstrate the pervasive role played by computational science.

The third edition of this handbook is designed to provide a broad coverage of the concepts, implementations, and applications in metaheuristics. The book's chapters serve as stand-alone presentations giving both the necessary underpinnings as well as practical guides for implementation. The nature of metaheuristics invites an analyst to modify basic methods in response to problem characteristics, past experiences, and personal preferences, and the chapters in this handbook are designed to facilitate this process as well. This new edition has been fully revised and features new chapters on swarm intelligence and automated design of metaheuristics from flexible algorithm frameworks. The authors who have contributed to this volume represent leading figures from the metaheuristic community and are responsible for pioneering contributions to the fields they write about. Their collective work has significantly enriched the field of optimization in general and combinatorial optimization in particular.Metaheuristics are solution methods that orchestrate an interaction between local improvement procedures and higher level strategies to create a process capable of escaping from local optima and performing a robust search of a solution space. In addition, many new and exciting developments and extensions have been observed in the last few years. Hybrids of metaheuristics with other optimization techniques, like branch-and-bound, mathematical programming or constraint programming are also increasingly popular. On the front of applications, metaheuristics are now used to find high-quality solutions to an ever-growing number of complex, ill-defined real-world problems, in particular combinatorial ones. This handbook should continue to be a great reference for researchers, graduate students, as well as practitioners interested in metaheuristics.

Cyber-physical systems (CPSs) combine cyber capabilities, such as computation or communication, with physical capabilities, such as motion or other physical processes. Cars, aircraft, and robots are prime examples, because they move physically in space in a way that is determined by discrete computerized control algorithms. Designing these algorithms is challenging due to their tight coupling with physical behavior, while it is vital that these algorithms be correct because we rely on them for safety-critical tasks. This textbook teaches undergraduate students the core principles behind CPSs. It shows them how to develop models and controls; identify safety specifications and critical properties; reason rigorously about CPS models; leverage multi-dynamical systems compositionality to tame CPS complexity; identify required control constraints; verify CPS models of appropriate scale in logic; and develop an intuition for operational effects. The book is supported with homework exercises, lecture videos, and slides.