Mathematics of Discrete Structures for Computer Science

Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operat

In this new text, designed for sophomores studying mathematics and computer science, the authors cover the basics of difference equations and some of their applications in computing and in population

The 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 scienc

The study of structural analysis and design is a central subject in civil, aeronautical and mechanical engineering. This book presents a modern and unified introduction to structural analysis, with a strong emphasis on how structures actually behave. The unifying theme is the application of energy methods, developed without the formal mathematics of the calculus of variations. The energy approach makes it possible to articulate the logical relationship between equilibrium and compatibility; emphasise the unity of structural analysis, particularly for indeterminate structures; and identify the roles of idealization and discretization in structural modelling. Thus, energy methods also serve as a prelude to the main ideas behind modern computational approaches to structural analysis and design. As an aid to upper-level undergraduate students in mastering this material, the text includes numerous worked examples, as well as homework problems.

This volume contains survey articles based on the invited lectures given at the Twentieth British Combinatorial Conference, organised jointly by the University of Durham and the Open University. It was held in July 2005 at the University of Durham. This biennial conference is a well-established international event, with speakers from all over the world. By its nature this volume provides an up-to-date overview of current research activity in several areas of combinatorics, ranging from combinatorial number theory to geometry. The authors are some of the world's foremost researchers in their fields, and here they summarize existing results, and give a unique preview of work currently being written up. The book provides a valuable survey of the present state of knowledge in combinatorics. It will be useful to research workers and advanced graduate students, primarily in mathematics but also in computer science, statistics and engineering.

How the cerebellum accomplishes its highly complex feats of coordination has been the subject of much inquiry; one of the pre-eminent theories places adaptive control at the forefront. This book reinforces the view that the cerebellum functions as an adaptive control system; that is, it automatically adjusts its output as needed for such eventualities as temporary or lasting weakness of muscle. It is the first text to synthesize the substantial body of literature on the subject, combining the neuroscience of the cerebellum with the science of control theory common to electrical and computer engineers. Organized in four parts, the book examines cerebellar anatomy and physiology; cerebellar function; models and theories; and ends with a summary and conclusions. The author's clinical perspective offers a broader view of cerebellar function beyond the basic neuroscience. An appendix demonstrates evidence supporting the adaptive control model from a detailed comparison of the cerebellum wit

In this book the theories, techniques and applications of reflection electron microscopy (REM), reflection high-energy electron diffraction (RHEED) and reflection electron energy-loss spectroscopy (REELS) are comprehensively reviewed for the first time. The book is divided into three parts: diffraction, imaging and spectroscopy. The text is written to combine basic techniques with special applications, theories with experiments, and the basic physics with materials science, so that a full picture of RHEED and REM emerges. An entirely self-contained study, the book contains much invaluable reference material, including FORTRAN source codes for calculating crystal structures data and electron energy loss spectra in different scattering geometries. This and many other features make the book an important and timely addition to the materials science literature.

Classical logic has proved inadequate in various areas of computer science, artificial intelligence, mathematics, philosopy and linguistics. This is an introduction to extensions of first-order logic, based on the principle that many-sorted logic (MSL) provides a unifying framework in which to place, for example, second-order logic, type theory, modal and dynamic logics and MSL itself. The aim is two fold: only one theorem-prover is needed; proofs of the metaproperties of the different existing calculi can be avoided by borrowing them from MSL. To make the book accessible to readers from different disciplines, whilst maintaining precision, the author has supplied detailed step-by-step proofs, avoiding difficult arguments, and continually motivating the material with examples. Consequently this can be used as a reference, for self-teaching or for first-year graduate courses.

The quantitative analysis of biological sequence data is based on methods from statistics coupled with efficient algorithms from computer science. Algebra provides a framework for unifying many of the seemingly disparate techniques used by computational biologists. This book, first published in 2005, offers an introduction to this mathematical framework and describes tools from computational algebra for designing new algorithms for exact, accurate results. These algorithms can be applied to biological problems such as aligning genomes, finding genes and constructing phylogenies. The first part of this book consists of four chapters on the themes of Statistics, Computation, Algebra and Biology, offering speedy, self-contained introductions to the emerging field of algebraic statistics and its applications to genomics. In the second part, the four themes are combined and developed to tackle real problems in computational genomics. As the first book in the exciting and dynamic area, it wi

During the past few decades, the gradual merger of Discrete Geometry and the newer discipline of Computational Geometry has provided enormous impetus to mathematicians and computer scientists interested in geometric problems. This 2005 volume, which contains 32 papers on a broad range of topics of interest in the field, is an outgrowth of that synergism. It includes surveys and research articles exploring geometric arrangements, polytopes, packing, covering, discrete convexity, geometric algorithms and their complexity, and the combinatorial complexity of geometric objects, particularly in low dimension. There are points of contact with many applied areas such as mathematical programming, visibility problems, kinetic data structures, and biochemistry, as well as with algebraic topology, geometric probability, real algebraic geometry, and combinatorics.

In this text for advanced undergraduate and graduate students in areas such as communications, computer science, economics, and public health, Kapadia (biostatistics, University of Texas School of Pub

This book provides a thorough introduction to one of the most efficient approximation methods for the analysis and solution of problems in theoretical physics and applied mathematics. It is written with practical needs in mind and contains a discussion of 50 problems with solutions, of varying degrees of difficulty. The problems are taken from quantum mechanics, but the method has important applications in any field of science involving second order ordinary differential equations. The power of the asymptotic solution of second order differential equations is demonstrated, and in each case the authors clearly indicate which concepts and results of the general theory are needed to solve a particular problem. This book will be ideal as a manual for users of the phase-integral method, as well as a valuable reference text for experienced research workers and graduate students.

A series of important applications of combinatorics on words has emerged with the development of computerized text and string processing. The aim of this volume, the third in a trilogy, is to present a unified treatment of some of the major fields of applications. After an introduction that sets the scene and gathers together the basic facts, there follow chapters in which applications are considered in detail. The areas covered include core algorithms for text processing, natural language processing, speech processing, bioinformatics, and areas of applied mathematics such as combinatorial enumeration and fractal analysis. No special prerequisites are needed, and no familiarity with the application areas or with the material covered by the previous volumes is required. The breadth of application, combined with the inclusion of problems and algorithms and a complete bibliography will make this book ideal for graduate students and professionals in mathematics, computer science, biology a

Sir Arthur Eddington, the celebrated astrophysicist, made great strides towards his own 'theory of everything' in his last two books published in 1936 and 1946. Unlike his earlier lucid and authoritative works, these are strangely tentative and obscure - as if he were nervous of the significant advances that he might be making. This 1995 volume examines both how Eddington came to write these uncharacteristic books - in the context of the physics and history of the day - and what value they have to modern physics. The result is an illuminating description of the development of theoretical physics, in the first half of the twentieth century, from a unique point of view: how it affected Eddington's thought. This will provide fascinating reading for scholars in the philosophy of science, theoretical physics, applied mathematics and the history of science.

In the view of Helma (Institute of Computer Science, U. of Freiburg, Germany), a predictive toxicology system consists of descriptions of chemicals and biological systems as input for predictions, pre

This is the 2005 second edition of a highly successful and well-respected textbook on the numerical techniques used to solve partial differential equations arising from mathematical models in science, engineering and other fields. The authors maintain an emphasis on finite difference methods for simple but representative examples of parabolic, hyperbolic and elliptic equations from the first edition. However this is augmented by new sections on finite volume methods, modified equation analysis, symplectic integration schemes, convection-diffusion problems, multigrid, and conjugate gradient methods; and several sections, including that on the energy method of analysis, have been extensively rewritten to reflect modern developments. Already an excellent choice for students and teachers in mathematics, engineering and computer science departments, the revised text includes more latest theoretical and industrial developments.

In online computation a computer algorithm must decide how to act on incoming items of information without any knowledge of future inputs. How should it route the next telephone call? Where in memory should it store a just-closed record? This book provides an in-depth presentation of competitive analysis, an attractive framework within which such problems can be analyzed and solved. In this framework, the quality of an algorithm is measured relative to the best possible performance of an algorithm that has complete knowledge of the future. This methodology for the analysis of online decision making has become a standard approach in computer science. Starting with the basic definitions of the competitive analysis model, the authors present most of the essential techniques through various examples, some of which are among the central problems of the field, such as list accessing, paging in a virtual memory system, routing in a communication network, metrical task systems, k-server system

The richness of Putnam's philosophical oeuvre consists not only in the broad spectrum of problems addressed, but also in the transformations and restructuring his positions have undergone over the years. The essays collected in this volume are sensitive to both these dimensions. They discuss Putnam's major philosophical contributions to the theory of meaning, the philosophy of mind, the philosophy of science and mathematics, and moral theory. But, in addition, tracing threads of change and continuity, they analyze the dynamics underlying the unfolding of Putnam's thought. The volume also constitutes a critical introduction to a number of central issues in contemporary philosophy, including quantum logic, realism, functionalism, the 'minds as computer' metaphor, and the fact/value dichotomy.

Wireless communication has become a ubiquitous part of modern life, from global cellular telephone systems to local and even personal-area networks. This 2004 book provides a tutorial introduction to digital mobile wireless networks, illustrating theoretical underpinnings with a wide range of real-world examples. The book begins with a review of propagation phenomena, and goes on to examine channel allocation, modulation techniques, multiple access schemes, and coding techniques. GSM and IS-95 systems are reviewed and 2.5G and 3G packet-switched systems are discussed in detail. Performance analysis and accessing and scheduling techniques are covered, and the book closes with a chapter on wireless LANs and personal-area networks. Many worked examples and homework exercises are provided and a solutions manual is available for instructors. The book is an ideal text for electrical engineering and computer science students taking courses in wireless communications. It will also be an invalu

This book, first published in 2004, provides an introduction to the major mathematical structures used in physics today. It covers the concepts and techniques needed for topics such as group theory, Lie algebras, topology, Hilbert space and differential geometry. Important theories of physics such as classical and quantum mechanics, thermodynamics, and special and general relativity are also developed in detail, and presented in the appropriate mathematical language. The book is suitable for advanced undergraduate and beginning graduate students in mathematical and theoretical physics, as well as applied mathematics. It includes numerous exercises and worked examples, to test the reader's understanding of the various concepts, as well as extending the themes covered in the main text. The only prerequisites are elementary calculus and linear algebra. No prior knowledge of group theory, abstract vector spaces or topology is required.

The TCP/IP family of protocols have become the de facto standard in the world of networking, are found in virtually all computer communication systems, and form the basis of today's Internet. TCP/IP Essentials is a hands-on guide to TCP/IP technologies, and shows how the protocols are implemented in practice. The book contains a series of extensively tested laboratory experiments that span the various elements of protocol definition and behavior. Topics covered include bridges, routers, LANs, static and dynamic routing, multicast and realtime service, and network management and security. The experiments are described in a Linux environment, with parallel notes on Solaris implementation. The book includes many homework exercises, and supplementary material for instructors is available. The book is aimed at students of electrical and computer engineering and students of computer science taking courses in networking. It is also an ideal guide for engineers studying for networking certific

Alfred Tarski, one of the greatest logicians of all time, is widely thought of as 'the man who defined truth'. His work on the concepts of truth and logical consequence are cornerstones of modern logic, influencing developments in mathematics, philosophy, linguistics, and computer science. Tarski was a charismatic teacher and zealous promoter of his view of logic as the foundation of all rational thought, a bon vivant and a womanizer, who played the 'great man' to the hilt. A fortuitous trip to the United States at the outbreak of World War II saved his life and turned his career around, even while it separated him from his family for years. From the cafés of Warsaw and Vienna to the mountains and deserts of California, this first full-length biography places Tarski in the social, intellectual, and historical context of his times and presents a frank, vivid picture of a personally and professionally passionate man - interlaced with an account of his major scientific achievements.

The rapidly expanding area of algebraic graph theory uses two different branches of algebra to explore various aspects of graph theory: linear algebra (for spectral theory) and group theory (for studying graph symmetry). These areas have links with other areas of mathematics, such as logic and harmonic analysis, and are increasingly being used in such areas as computer networks where symmetry is an important feature. Other books cover portions of this material, but this book is unusual in covering both of these aspects and there are no other books with such a wide scope. Peter J. Cameron, internationally recognized for his substantial contributions to the area, served as academic consultant for this volume, and the result is ten expository chapters written by acknowledged international experts in the field. Their well-written contributions have been carefully edited to enhance readability and to standardize the chapter structure, terminology and notation throughout the book. To help th

Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems in many areas of computer science and operations research

This book is an introduction to finite model theory which stresses the computer science origins of the area. In addition to presenting the main techniques for analyzing logics over finite models, the

This comprehensive book provides an overview of the key techniques used in the fabrication of micron-scale structures in silicon. Recent advances in these techniques have made it possible to create a new generation of microsystem devices, such as microsensors, accelerometers, micropumps, and miniature robots. The authors underpin the discussion of each technique with a brief review of the fundamental physical and chemical principles involved. They pay particular attention to methods such as isotropic and anisotropic wet chemical etching, wafer bonding, reactive ion etching, and surface micromachining. There is a special section on bulk micromachining, and the authors also discuss release mechanisms for movable microstructures. The book is a blend of detailed experimental and theoretical material, and will be of great interest to graduate students and researchers in electrical engineering and materials science whose work involves the study of micro-electromechanical systems (MEMS).

Information retrieval, IR, the science of extracting information from any potential source, can be viewed in a number of ways: logical, probabilistic and vector space models are some of the most important. In this book, the author, one of the leading researchers in the area, shows how these views can be reforged in the same framework used to formulate the general principles of quantum mechanics. All the usual quantum-mechanical notions have their IR-theoretic analogues, and the standard results can be applied to address problems in IR, such as pseudo-relevance feedback, relevance feedback and ostensive retrieval. The relation with quantum computing is also examined. To keep the book self-contained appendices with background material on physics and mathematics are included. Each chapter ends with bibliographic remarks that point to further reading. This is an important, ground-breaking book, with much new material, for all those working in IR, AI and natural language processing.

Higher-dimensional category theory is the study of n-categories, operads, braided monoidal categories, and other such exotic structures. It draws its inspiration from areas as diverse as topology, quantum algebra, mathematical physics, logic, and theoretical computer science. The heart of this book is the language of generalized operads. This is as natural and transparent a language for higher category theory as the language of sheaves is for algebraic geometry, or vector spaces for linear algebra. It is introduced carefully, then used to give simple descriptions of a variety of higher categorical structures. In particular, one possible definition of n-category is discussed in detail, and some common aspects of other possible definitions are established. This is the first book on the subject and lays its foundations. It will appeal to both graduate students and established researchers who wish to become acquainted with this modern branch of mathematics.

For the past two decades, researchers in such fields as computer science, electrical engineering, and material science have been working to develop methods capable of finding high-quality approximate

The problem of evaluating integrals is well known to every student who has had a year of calculus. It was an especially important subject in 19th century analysis and it has now been revived with the appearance of symbolic languages. In this book, the authors use the problem of exact evaluation of definite integrals as a starting point for exploring many areas of mathematics. The questions discussed in this book, first published in 2004, are as old as calculus itself. In presenting the combination of methods required for the evaluation of most integrals, the authors take the most interesting, rather than the shortest, path to the results. Along the way, they illuminate connections with many subjects, including analysis, number theory, algebra and combinatorics. This will be a guided tour of exciting discovery for undergraduates and their teachers in mathematics, computer science, physics, and engineering.

This is a self-contained, modern treatment of the algebraic theory of machines. Dr Holcombe examines various applications of the idea of a machine in biology, biochemistry and computer science and gives also a rigorous treatment of the way in which these machines can be decomposed and simulated by simpler ones. This treatment is based on fundamental ideas from modern algebra. Motivation for many of the newer results is provided by way of applications so this account should be accessible and valuable for those studying applied algebra or theoretical computer science at advanced undergraduate or beginning postgraduate level, as well as for those undertaking research in those areas.

The problem of evaluating integrals is well known to every student who has had a year of calculus. It was an especially important subject in 19th century analysis and it has now been revived with the appearance of symbolic languages. In this book, the authors use the problem of exact evaluation of definite integrals as a starting point for exploring many areas of mathematics. The questions discussed in this book, first published in 2004, are as old as calculus itself. In presenting the combination of methods required for the evaluation of most integrals, the authors take the most interesting, rather than the shortest, path to the results. Along the way, they illuminate connections with many subjects, including analysis, number theory, algebra and combinatorics. This will be a guided tour of exciting discovery for undergraduates and their teachers in mathematics, computer science, physics, and engineering.

This textbook is an introduction to algebra via examples. The book moves from properties of integers, through other examples, to the beginnings of group theory. Applications to public key codes and to error correcting codes are emphasised. These applications, together with sections on logic and finite state machines, make the text suitable for students of computer science as well as mathematics students. Attention is paid to historical development of the mathematical ideas. This second edition contains new material on mathematical reasoning skills and a new chapter on polynomials has been added. The book was developed from first-level courses taught in the UK and USA. These courses proved successful in developing not only a theoretical understanding but also algorithmic skills. This book can be used at a wide range of levels: it is suitable for first- or second-level university students, and could be used as enrichment material for upper-level school students.

Fox (computer science, Virginia Polytechnic Institute and State U., Blacksburg) introduces the electronic thesis/dissertation (ETD) as part of academic institutions' efforts to develop a networked glo

The study of algorithmic graph theory and structured families of graphs is an important branch of discrete mathematics. It finds numerous applications, from data transmission through networks to efficiently scheduling aircraft and crews, as well as contributing to breakthroughs in genetic analysis and studies of the brain. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. One of these is the study of tolerance graphs and tolerance orders. This book contains the first thorough study of tolerance graphs and related topics, indeed the authors have included proofs of major results previously unpublished in book form. It will act as a springboard for researchers, and especially graduate students, to pursue new directions of investigation. With many examples and exercises it is also suitable for use as the text for a graduate course in graph theory.

Certain constrained combinatorial optimization problems have a natural analogue in the continuous setting of the classical isoperimetric problem. The study of so called combinatorial isoperimetric problems exploits similarities between these two, seemingly disparate, settings. This text focuses on global methods. This means that morphisms, typically arising from symmetry or direct product decomposition, are employed to transform new problems into more restricted and easily solvable settings whilst preserving essential structure. This book is based on Professor Harper's many years' experience in teaching this subject and is ideal for graduate students entering the field. The author has increased the utility of the text for teaching by including worked examples, exercises and material about applications to computer science. Applied systematically, the global point of view can lead to surprising insights and results, and established researchers will find this to be a valuable reference wo

Convex optimization problems arise frequently in many different fields. This book provides a comprehensive introduction to the subject, and shows in detail how such problems can be solved numerically with great efficiency. The book begins with the basic elements of convex sets and functions, and then describes various classes of convex optimization problems. Duality and approximation techniques are then covered, as are statistical estimation techniques. Various geometrical problems are then presented, and there is detailed discussion of unconstrained and constrained minimization problems, and interior-point methods. The focus of the book is on recognizing convex optimization problems and then finding the most appropriate technique for solving them. It contains many worked examples and homework exercises and will appeal to students, researchers and practitioners in fields such as engineering, computer science, mathematics, statistics, finance and economics.

This unique book is a guide for students and graduates of mathematics, statistics, economics, finance, and other number-based disciplines contemplating a career in actuarial science. Given the compre

Coding theory is concerned with successfully transmitting data through a noisy channel and correcting errors in corrupted messages. It is of central importance for many applications in computer science or engineering. This book gives a comprehensive introduction to coding theory whilst only assuming basic linear algebra. It contains a detailed and rigorous introduction to the theory of block codes and moves on to more advanced topics like BCH codes, Goppa codes and Sudan's algorithm for list decoding. The issues of bounds and decoding, essential to the design of good codes, features prominently. The authors of this book have, for several years, successfully taught a course on coding theory to students at the National University of Singapore. This book is based on their experiences and provides a thoroughly modern introduction to the subject. There are numerous examples and exercises, some of which introduce students to novel or more advanced material.

This book, first published in 2004, describes the application of statistical physics and complex systems theory to the study of the evolution and structure of the Internet. Using a statistical physics approach the Internet is viewed as a growing system that evolves in time through the addition and removal of nodes and links. This perspective permits us to outline the dynamical theory required for a description of the macroscopic evolution of the Internet. The presence of such a theoretical framework appears to be a revolutionary and promising path towards our understanding of the Internet and the various processes taking place on this network, including, for example, the spread of computer viruses or resilience to random or intentional damages. This book will be of interest to graduate students and researchers in statistical physics, computer science and mathematics studying in this subject.