Browse

Neural network research often builds on the fiction that neurons are simple linear threshold units, completely neglecting the highly dynamic and complex nature of synapses, dendrites, and voltage-dependent ionic currents. Biophysics of Computation: Information Processing in Single Neurons challenges this notion, using richly detailed experimental and theoretical findings from cellular biophysics to explain the repertoire of computational functions available to single neurons. The author shows how individual nerve cells can multiply, integrate, or delay synaptic inputs and how information can be encoded in the voltage across the membrane, in the intracellular calcium concentration, or in the timing of individual spikes. Key topics covered include the linear cable equation; cable theory as applied to passive dendritic trees and dendritic spines; chemical and electrical synapses and how to treat them from a computational point of view; nonlinear interactions of synaptic input in passive and active dendritic trees; the Hodgkin-Huxley model of action potential generation and propagation; phase space analysis; linking stochastic ionic channels to membrane-dependent currents; calcium and potassium currents and their role in information processing; the role of diffusion, buffering and binding of calcium, and other messenger systems in information processing and storage; short- and long-term models of synaptic plasticity; simplified models of single cells; stochastic aspects of neuronal firing; the nature of the neuronal code; and unconventional models of sub-cellular computation. Biophysics of Computation: Information Processing in Single Neurons serves as an ideal text for advanced undergraduate and graduate courses in cellular biophysics, computational neuroscience, and neural networks, and will appeal to students and professionals in neuroscience, electrical and computer engineering, and physics.

The completion of the first draft of the human genome has led to an explosion of interest in genetics and molecular biology. The view of the genome as a network of interacting computational components is well-established, but researchers are now trying to reverse the analogy, by using living organisms to construct logic circuits. The potential applications for such technologies is huge, ranging from bio-sensors, through industrial applications to drug delivery and diagnostics. This book would be the first to deal with the implementation of this technology, describing several working experimental demonstrations using cells as components of logic circuits, building toward computers incorporating biological components in their functioning.

Currently there is growing interest in the application of dynamical methods to the study of cognition. Computation, Dynamics, and Cognition investigates this convergence from a theoretical and philosophical perspective, generating a provocative new view of the aims and methods of cognitive science. Advancing the dynamical approach as the methodological frame best equipped to guide inquiry in the field's two main research programs--the symbolic and connectionist approaches--Marco Giunti engages a host of questions crucial not only to the science of cognition, but also to computation theory, dynamical systems theory, philosophy of mind, and philosophy of science. In chapter one Giunti employs a dynamical viewpoint to explore foundational issues in computation theory. Using the concept of Turing computability, he precisely and originally defines the nature of a computational system, sharpening our understanding of computation theory and its applications. In chapter two he generalizes his definition of a computational system, arguing that the concept of Turing computability itself is relative to the kind of support on which Turing machine operate. Chapter three completes the book's conceptual foundation, discussing a form of scientific explanation for real dynamical systems that Giunti calls "Galilean explanation." The book's fourth and final chapter develops the methodological thesis that all cognitive systems are dynamical systems. On Giunti's view, a dynamical approach is likely to benefit even those scientific explanations of cognition which are based on symbolic models. Giunti concludes by proposing a new modeling practice for cognitive science, one based on "Galilean models" of cognitive systems. Innovative, lucidly-written, and broad-ranging in its analysis, Computation, Dynamics, and Cognition will interest philosophers of science and mind, as well as cognitive scientists, computer scientists, and theorists of dynamical systems. This book elaborates a comprehensive picture of the application of dynamical methods to the study of cognition. Giunti argues that both computational systems and connectionist networks are special types of dynamical systems. He shows how this dynamical approach can be applied to problems of cognition, information processing, consciousness, meaning, and the relation between body and mind.

Computer science and physics have been closely linked since the birth of modern computing. In recent years, an interdisciplinary area has blossomed at the junction of these fields, connecting insights from statistical physics with basic computational challenges. Researchers have successfully applied techniques from the study of phase transitions to analyze NP-complete problems such as satisfiability and graph coloring. This is leading to a new understanding of the structure of these problems, and of how algorithms perform on them. Computational Complexity and Statistical Physics will serve as a standard reference and pedagogical aid to statistical physics methods in computer science, with a particular focus on phase transitions in combinatorial problems. Addressed to a broad range of readers, the book includes substantial background material along with current research by leading computer scientists, mathematicians, and physicists. It will prepare students and researchers from all of these fields to contribute to this exciting area.

Scientific descriptions of the climate have traditionally been based on the study of average meteorological values taken from different positions around the world. In recent years however it has become apparent that these averages should be considered with other statistics that ultimately characterize spatial and temporal variability. This book is designed to meet that need. It is based on a course in computational statistics taught by the author that arose from a variety of projects on the design and development of software for the study of climate change, using statistics and methods of random functions.

This book brings together the two disparate worlds of computational text analysis and biology and presents some of the latest methods and applications to proteomics, sequence analysis and gene expression data. Modern genomics generates large and comprehensive data sets but their interpretation requires an understanding of a vast number of genes, their complex functions, and interactions. Keeping up with the literature on a single gene is a challenge itself-for thousands of genes it is simply impossible. Here, Soumya Raychaudhuri presents the techniques and algorithms needed to access and utilize the vast scientific text, i.e. methods that automatically "read" the literature on all the genes. Including background chapters on the necessary biology, statistics and genomics, in addition to practical examples of interpreting many different types of modern experiments, this book is ideal for students and researchers in computational biology, bioinformatics, genomics, statistics and computer science.

For a physicist, all the world is information. The Universe and its workings are the ebb and flow of information. We are all transient patterns of information, passing on the recipe for our basic forms to future generations using a four-letter digital code called DNA. In this engaging and mind-stretching account, Vlatko Vedral considers some of the deepest questions about the Universe and considers the implications of interpreting it in terms of information. He explains the nature of information, the idea of entropy, and the roots of this thinking in thermodynamics. He describes the bizarre effects of quantum behaviour -- effects such as 'entanglement', which Einstein called 'spooky action at a distance', and explores cutting edge work on harnessing quantum effects in hyperfast quantum computers, and how recent evidence suggests that the weirdness of the quantum world, once thought limited to the tiniest scales, may reach into the macro world. Vedral finishes by considering the answer to the ultimate question: where did all of the information in the Universe come from? The answers he considers are exhilarating, drawing upon the work of distinguished physicist John Wheeler. The ideas challenge our concept of the nature of particles, of time, of determinism, and of reality itself. This edition includes a new foreword from the author, reflecting on changes in the world of quantum information since first publication. Oxford Landmark Science books are 'must-read' classics of modern science writing which have crystallized big ideas, and shaped the way we think.

Fueled by advances in computer technology, model-based approaches to the control of industrial processes are now widespread. While there is an enormous literature on modeling, the difficult first step of selecting an appropriate model structure has received almost no attention. This book fills the gap, providing practical insight into model selection for chemical processes and emphasizing structures suitable for control system design.

Kurt Godel, the greatest logician of our time, startled the world of mathematics in 1931 with his Theorem of Undecidability, which showed that some statements in mathematics are inherently "undecidable." His work on the completeness of logic, the incompleteness of number theory, and the consistency of the axiom of choice and the continuum theory brought him further worldwide fame. In this introductory volume, Raymond Smullyan, himself a well-known logician, guides the reader through the fascinating world of Godel's incompleteness theorems. The level of presentation is suitable for anyone with a basic acquaintance with mathematical logic. As a clear, concise introduction to a difficult but essential subject, the book will appeal to mathematicians, philosophers, and computer scientists.

Fourier analysis has many scientific applications - in physics, number theory, combinatorics, signal processing, probability theory, statistics, option pricing, cryptography, acoustics, oceanography, optics and diffraction, geometry, and other areas. In signal processing and related fields, Fourier analysis is typically thought of as decomposing a signal into its component frequencies and their amplitudes. This practical, applications-based professional handbook comprehensively covers the theory and applications of Fourier Analysis, spanning topics from engineering mathematics, signal processing and related multidimensional transform theory, and quantum physics to elementary deterministic finance and even the foundations of western music theory. As a definitive text on Fourier Analysis, Handbook of Fourier Analysis and Its Applications is meant to replace several less comprehensive volumes on the subject, such as Processing of Multifimensional Signals by Alexandre Smirnov, Modern Sampling Theory by John J. Benedetto and Paulo J.S.G. Ferreira, Vector Space Projections by Henry Stark and Yongyi Yang and Fourier Analysis and Imaging by Ronald N. Bracewell. In addition to being primarily used as a professional handbook, it includes sample problems and their solutions at the end of each section and thus serves as a textbook for advanced undergraduate students and beginning graduate students in courses such as: Multidimensional Signals and Systems, Signal Analysis, Introduction to Shannon Sampling and Interpolation Theory, Random Variables and Stochastic Processes, and Signals and Linear Systems.

This volume presents a set of coherent, cross-referenced perspectives on incorporating the spatial representation and analytical power of GIS with agent-based modelling of evolutionary and non-linear processes and phenomena. Many recent advances in software algorithms for incorporating geographic data in modeling social and ecological behaviors, and successes in applying such algorithms, had not been adequately reported in the literature. This book seeks to serve as the standard guide to this broad area.

This book provides a comprehensive analysis of the most important topics in parallel computation. It is written so that it may be used as a self-study guide to the field, and researchers in parallel computing will find it a useful reference for many years to come. The first half of the book consists of an introduction to many fundamental issues in parallel computing. The second half provides lists of P-complete- and open problems. These lists will have lasting value to researchers in both industry and academia. The lists of problems, with their corresponding remarks, the thorough index, and the hundreds of references add to the exceptional value of this resource. While the exciting field of parallel computation continues to expand rapidly, this book serves as a guide to research done through 1994 and also describes the fundamental concepts that new workers will need to know in coming years. It is intended for anyone interested in parallel computing, including senior level undergraduate students, graduate students, faculty, and people in industry. As an essential reference, the book will be needed in all academic libraries.

Filling a void in chemical engineering and optimization literature, this book presents the theory and methods for nonlinear and mixed-integer optimization, and their applications in the important area of process synthesis. Other topics include modeling issues in process synthesis, and optimization-based approaches in the synthesis of heat recovery systems, distillation-based systems, and reactor-based systems. The basics of convex analysis and nonlinear optimization are also covered and the elementary concepts of mixed-integer linear optimization are introduced. All chapters have several illustrations and geometrical interpretations of the material as well as suggested problems. Nonlinear and Mixed-Integer Optimization will prove to be an invaluable source--either as a textbook or a reference--for researchers and graduate students interested in continuous and discrete nonlinear optimization issues in engineering design, process synthesis, process operations, applied mathematics, operations research, industrial management, and systems engineering.

Optimal Solution of Nonlinear Equations is a text/monograph designed to provide an overview of optimal computational methods for the solution of nonlinear equations, fixed points of contractive and noncontractive mapping, and for the computation of the topological degree. It is of interest to any reader working in the area of Information-Based Complexity. The worst-case settings are analyzed here. Several classes of functions are studied with special emphasis on tight complexity bounds and methods which are close to or achieve these bounds. Each chapter ends with exercises, including companies and open-ended research based exercises.

This is the first book on constructive methods for, and applications of orthogonal polynomials, and the first available collection of relevant Matlab codes. The book begins with a concise introduction to the theory of polynomials orthogonal on the real line (or a portion thereof), relative to a positive measure of integration. Topics which are particularly relevant to computation are emphasized. The second chapter develops computational methods for generating the coefficients in the basic three-term recurrence relation. The methods are of two kinds: moment-based methods and discretization methods. The former are provided with a detailed sensitivity analysis. Other topics addressed concern Cauchy integrals of orthogonal polynomials and their computation, a new discussion of modification algorithms, and the generation of Sobolev orthogonal polynomials. The final chapter deals with selected applications: the numerical evaluation of integrals, especially by Gauss-type quadrature methods, polynomial least squares approximation, moment-preserving spline approximation, and the summation of slowly convergent series. Detailed historic and bibliographic notes are appended to each chapter. The book will be of interest not only to mathematicians and numerical analysts, but also to a wide clientele of scientists and engineers who perceive a need for applying orthogonal polynomials.

The prefix operation on a set of data is one of the simplest and most useful building blocks in parallel algorithms. This introduction to those aspects of parallel programming and parallel algorithms that relate to the prefix problem emphasizes its use in a broad range of familiar and important problems. The book illustrates how the prefix operation approach to parallel computing leads to fast and efficient solutions to many different kinds of problems. Students, teachers, programmers, and computer scientists will want to read this clear exposition of an important approach.

Issues of matching and searching on elementary discrete structures arise pervasively in computer science and many of its applications, and their relevance is expected to grow as information is amassed and shared at an accelerating pace. Several algorithms were discovered as a result of these needs, which in turn created the subfield of Pattern Matching. This book provides an overview of the current state of Pattern Matching as seen by specialists who have devoted years of study to the field. It covers most of the basic principles and presents material advanced enough to faithfully portray the current frontier of research. Because of these recent advances, this is the right time for a book that brings together information relevant to both graduate students and specialists in need of an in-depth reference.

This book is a collection of essays exploring adaptive systems from many perspectives, ranging from computational applications to models of adaptation in living and social systems. The essays on computation discuss history, theory, applications, and possible threats of adaptive and evolving computations systems. The modeling chapters cover topics such as evolution in microbial populations, the evolution of cooperation, and how ideas about evolution relate to economics. The title Perspectives on Adaptation in Natural and Artificial Systems honors John Holland, whose 1975 Book, Adaptation in Natural and Artificial Systems has become a classic text for many disciplines in which adaptation play a central role. The essays brought together here were originally written to honor John Holland, and span most of the different areas touched by his wide-ranging and influential research career. The authors include some of the most prominent scientists in the fields of artificial intelligence evolutionary computation, and complex adaptive systems. Taken together, these essays present a broad modern picture of current research on adaptation as it relates to computers, living systems, society, and their complex interactions.

Quantum information- the subject- is a new and exciting area of science, which brings together physics, information theory, computer science and mathematics. Quantum Information- the book- is based on two successful lecture courses given to advanced undergraduate and beginning postgraduate students in physics. The intention is to introduce readers at this level to the fundamental, but offer rather simple, ideas behind ground-breaking developments including quantum cryptography, teleportation and quantum computing. The text is necessarily rather mathematical in style, but the mathematics nowhere allowed priority over the key physical ideas. My aim throughout was to be as complete and self- contained but to avoid, as far as possible, lengthy and formal mathematical proofs. Each of the eight chapters is followed by about forty exercise problems with which the reader can test their understanding and hone their skills. These will also provide a valuable resource to tutors and lectures. To request a copy of the Solutions Manual, visit: http://global.oup.com/uk/academic/physics/admin/solutions

This work is a sequel to the author's Gödel's Incompleteness Theorems, though it can be read independently by anyone familiar with Gödel's incompleteness theorem for Peano arithmetic. The book deals mainly with those aspects of recursion theory that have applications to the metamathematics of incompleteness, undecidability, and related topics. It is both an introduction to the theory and a presentation of new results in the field.