This first introductory text to discrete integrable systems introduces key notions of integrability from the vantage point of discrete systems, also making connections with the continuous theory where relevant. While treating the material at an elementary level, the book also highlights many recent developments. Topics include: Darboux and Bäcklund transformations; difference equations and special functions; multidimensional consistency of integrable lattice equations; associated linear problems (Lax pairs); connections with Padé approximants and convergence algorithms; singularities and geometry; Hirota's bilinear formalism for lattices; intriguing properties of discrete Painlevé equations; and the novel theory of Lagrangian multiforms. The book builds the material in an organic way, emphasizing interconnections between the various approaches, while the exposition is mostly done through explicit computations on key examples. Written by respected experts in the field, the numerous exer
This is a concise presentation of the concepts underlying the design of digital communication systems, without the detail that can overwhelm students. Many examples, from the basic to the cutting-edge, show how the theory is used in the design of modern systems and the relevance of this theory will motivate students. The theory is supported by practical algorithms so that the student can perform computations and simulations. Leading edge topics in coding and wireless communication make this an ideal text for students taking just one course on the subject. Fundamentals of Digital Communications has coverage of turbo and LDPC codes in sufficient detail and clarity to enable hands-on implementation and performance evaluation, as well as 'just enough' information theory to enable computation of performance benchmarks to compare them against. Other unique features include space-time communication and geometric insights into noncoherent communication and equalization.
The emerging field of computational topology utilizes theory from topology and the power of computing to solve problems in diverse fields. Recent applications include computer graphics, computer-aided design (CAD), and structural biology, all of which involve understanding the intrinsic shape of some real or abstract space. A primary goal of this book is to present basic concepts from topology and Morse theory to enable a non-specialist to grasp and participate in current research in computational topology. The author gives a self-contained presentation of the mathematical concepts from a computer scientist's point of view, combining point set topology, algebraic topology, group theory, differential manifolds, and Morse theory. He also presents some recent advances in the area, including topological persistence and hierarchical Morse complexes. Throughout, the focus is on computational challenges and on presenting algorithms and data structures when appropriate.
This book should prove to be the definitive work explaining van der Waals forces, how to calculate them and take account of their impact under any circumstances and conditions. These weak intermolecular forces are of truly pervasive impact, and biologists, chemists, physicists and engineers will profit greatly from the thorough grounding in these fundamental forces that this book offers. Parsegian has organized his book at three successive levels of mathematical sophistication, to satisfy the needs and interests of readers at all levels of preparation. The Prelude and Level 1 are intended to give everyone an overview in words and pictures of the modern theory of van der Waals forces. Level 2 gives the formulae and a wide range of algorithms to let readers compute the van der Waals forces under virtually any physical or physiological conditions. Level 3 offers a rigorous basic formulation of the theory.
This book discusses recent research in the theoretical foundations of several subjects of importance for the design of hardware, and for computer science in general. The physical technologies of very large scale integration (VLSI) are having major effects on the electronic industry. The potential diversity and complexity of digital systems have begun a revolution in the technologies of digital design, involving the application of concepts and methods to do with algorithms and programming. In return, the problems of VLSI design have led to new subjects becoming of importance in computer science. Topics covered in this volume include: models of VLSI complexity; complexity theory; systolic algorithm design; specification theory; verification theory; design by stepwise refinement and transformations. A thorough literature survey with an exhaustive bibliography is also included. The book has grown from a workshop held at the Centre for Theoretical Computer Science at Leeds University and or
Research in computational group theory, an active subfield of computational algebra, has emphasised three areas: finite permutation groups, finite solvable groups, and finitely presented groups. This book deals with the third of these areas. The author emphasises the connections with fundamental algorithms from theoretical computer science, particularly the theory of automata and formal languages, computational number theory, and computational commutative algebra. The LLL lattice reduction algorithm and various algorithms for Hermite and Smith normal forms from computational number theory are used to study the abelian quotients of a finitely presented group. The work of Baumslag, Cannonito and Miller on computing nonabelian polycyclic quotients is described as a generalisation of Buchberger's Gröbner basis methods to right ideals in the integral group ring of a polycyclic group. Researchers in computational group theory, mathematicians interested in finitely presented groups and theore
Adopting a balanced mix of theory, algorithms and practical design issues, this comprehensive volume explores cutting-edge applications in adaptive wireless communications and the implications these techniques have for future wireless network performance. Presenting practical concerns in the context of different strands from information theory, parameter estimation theory, array processing and wireless communication, the authors present a complete picture of the field. Topics covered include advanced multiple-antenna adaptive processing, ad hoc networking, MIMO, MAC protocols, space-time coding, cellular networks and cognitive radio, with the significance and effects of both internal and external interference a recurrent theme throughout. A broad, self-contained technical introduction to all the necessary mathematics, statistics, estimation theory and information theory is included, and topics are accompanied by a range of engaging end-of-chapter problems. With solutions available onli
Understand the theory and implementation of simulation. This book covers simulation topics from a scenario-driven approach using Python and rich visualizations and tabulations. The book discusses simulation used in the natural and social sciences and with simulations taken from the top algorithms used in the industry today. The authors use an engaging approach that mixes mathematics and programming experiments with beginning-intermediate level Python code to create an immersive learning experience that is cohesive and integrated. After reading this book, you will have an understanding of simulation used in natural sciences, engineering, and social sciences using Python. What You Will LearnUse Python and numerical computation to demonstrate the power of simulationChoose a paradigm to run a simulationDraw statistical insights from numerical experimentsKnow how simulation is used to solve real-world problems Who This Book Is ForEntry-level to mid-level Python developers from various backg
This book surveys the state-of-the-art in the theory of combinatorial games, that is games not involving chance or hidden information. Enthusiasts will find a wide variety of exciting topics, from a trailblazing presentation of scoring to solutions of three piece ending positions of bidding chess. Theories and techniques in many subfields are covered, such as universality, Wythoff Nim variations, misère play, partizan bidding (a.k.a. Richman games), loopy games, and the algebra of placement games. Also included are an updated list of unsolved problems, extremely efficient algorithms for taking and breaking games, a historical exposition of binary numbers and games by David Singmaster, chromatic Nim variations, renormalization for combinatorial games, and a survey of temperature theory by Elwyn Berlekamp, one of the founders of the field. The volume was initiated at the Combinatorial Game Theory Workshop, January 2011, held at the Banff International Research Station.
Providing an up-to-date overview of the most popular global optimization methods used in interpreting geophysical observations, this new edition includes a detailed description of the theoretical development underlying each method and a thorough explanation of the design, implementation and limitations of algorithms. New and expanded chapters provide details of recently developed methods, such as the neighborhood algorithm, particle swarm optimization, hybrid Monte Carlo and multi-chain MCMC methods. Other chapters include new examples of applications, from uncertainty in climate modeling to whole Earth studies. Several different examples of geophysical inversion, including joint inversion of disparate geophysical datasets, are provided to help readers design algorithms for their own applications. This is an authoritative and valuable text for researchers and graduate students in geophysics, inverse theory and exploration geoscience, and an important resource for professionals working
Providing the first truly comprehensive overview of Network Tomography - a novel network monitoring approach that makes use of inference techniques to reconstruct the internal network state from external vantage points - this rigorous yet accessible treatment of the fundamental theory and algorithms of network tomography covers the most prominent results demonstrated on real-world data, including identifiability conditions, measurement design algorithms, and network state inference algorithms, alongside practical tools for applying these techniques to real-world network management. It describes the main types of mathematical problems, along with their solutions and properties, and emphasizes the actions that can be taken to improve the accuracy of network tomography. With proofs and derivations introduced in an accessible language for easy understanding, this is an essential resource for professional engineers, academic researchers, and graduate students in network management and netwo
This book presents and applies a framework for studying the complexity of algorithms. It is aimed at logicians, computer scientists, mathematicians and philosophers interested in the theory of computation and its foundations, and it is written at a level suitable for non-specialists. Part I provides an accessible introduction to abstract recursion theory and its connection with computability and complexity. This part is suitable for use as a textbook for an advanced undergraduate or graduate course: all the necessary elementary facts from logic, recursion theory, arithmetic and algebra are included. Part II develops and applies an extension of the homomorphism method due jointly to the author and Lou van den Dries for deriving lower complexity bounds for problems in number theory and algebra which (provably or plausibly) restrict all elementary algorithms from specified primitives. The book includes over 250 problems, from simple checks of the reader's understanding, to current open pr
Communication complexity is the mathematical study of scenarios where several parties need to communicate to achieve a common goal, a situation that naturally appears during computation. This introduction presents the most recent developments in an accessible form, providing the language to unify several disjoint research subareas. Written as a guide for a graduate course on communication complexity, it will interest a broad audience in computer science, from advanced undergraduates to researchers in areas ranging from theory to algorithm design to distributed computing. The first part presents basic theory in a clear and illustrative way, offering beginners an entry into the field. The second part describes applications including circuit complexity, proof complexity, streaming algorithms, extension complexity of polytopes, and distributed computing. Proofs throughout the text use ideas from a wide range of mathematics, including geometry, algebra, and probability. Each chapter contain
