Algorithms

What is the best way to divide a 'cake' and allocate the pieces among some finite collection of players? In this book, the cake is a measure space, and each player uses a countably additive, non-atomic probability measure to evaluate the size of the pieces of cake, with different players generally using different measures. The author investigates efficiency properties (is there another partition that would make everyone at least as happy, and would make at least one player happier, than the present partition?) and fairness properties (do all players think that their piece is at least as large as every other player's piece?). He focuses exclusively on abstract existence results rather than algorithms, and on the geometric objects that arise naturally in this context. By examining the shape of these objects and the relationship between them, he demonstrates results concerning the existence of efficient and fair partitions.

This 2005 volume brings together twelve papers by many of the most prominent applied general equilibrium modelers honoring Herbert Scarf, the father of equilibrium computation in economics. It deals with developments in applied general equilibrium, a field which has broadened greatly since the 1980s. The contributors discuss some traditional as well as some modern topics in the field, including non-convexities in economy-wide models, tax policy, developmental modeling and energy modeling. The book also covers a range of distinct approaches, conceptual issues and computational algorithms, such as calibration and areas of application such as macroeconomics of real business cycles and finance. An introductory chapter written by the editors maps out issues and scenarios for the future evolution of applied general equilibrium.

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.

Paul Erdös was one of the greatest mathematicians of this century, known the world over for his brilliant ideas and stimulating questions. On the date of his 80th birthday a conference was held in his honour at Trinity College, Cambridge. Many leading combinatorialists attended. Their subsequent contributions are collected here. The areas represented range from set theory and geometry, through graph theory, group theory and combinatorial probability, to randomised algorithms and statistical physics. Erdös himself was able to give a survey of recent progress made on his favourite problems. Consequently this volume, consisting of in-depth studies at the frontier of research, provides a valuable panorama across the breadth of combinatorics as it is today.

Acta Numerica surveys annually the most important developments in numerical mathematics and scientific computing. The subjects and authors of the substantive survey articles are chosen by a distinguished international editorial board so as to report the most important and timely developments in a manner accessible to the wider community of professionals with an interest in scientific computing. Acta Numerica volumes have proved to be a valuable tool not only for researchers and professionals wishing to develop their understanding of numerical techniques and algorithms and follow new developments, but also as an advanced teaching aid at colleges and universities. Many of the original articles have been used as the prime resource for graduate courses. This particular volume was originally published in 2004.

There has been no exposition of group representations and harmonic analysis suitable for graduate students for over twenty years. In this, the first of two projected volumes, the authors remedy the situation by surveying all the basic theory developed since the pioneering work of Kirillov in 1958, and consolidating more recent results. Topics covered include basic Kirillov theory, algorithms for parametrizing all coadjoint orbits. The authors have not only given here a modern account of all topics necessary for current research, but have also included many computed examples. This volume can serve then either as a handbook for specialists, with a complete, self-contained exposition of major results, or as a textbook suitable for graduate courses in harmonic analysis.

This is a lively textbook providing a solid introduction to financial option valuation for undergraduate students armed with a working knowledge of a first year calculus. Written in a series of short chapters, its self-contained treatment gives equal weight to applied mathematics, stochastics and computational algorithms. No prior background in probability, statistics or numerical analysis is required. Detailed derivations of both the basic asset price model and the Black–Scholes equation are provided along with a presentation of appropriate computational techniques including binomial, finite differences and in particular, variance reduction techniques for the Monte Carlo method. Each chapter comes complete with accompanying stand-alone MATLAB code listing to illustrate a key idea. Furthermore, the author has made heavy use of figures and examples, and has included computations based on real stock market data.

Signal processing is everywhere in modern technology. Its mathematical basis and many areas of application are the subject of this book, based on a series of graduate-level lectures held at the Mathematical Sciences Research Institute. Emphasis is on challenges in the subject, particular techniques adapted to particular technologies, and certain advances in algorithms and theory. The book covers two main areas: computational harmonic analysis, envisioned as a technology for efficiently analysing real data using inherent symmetries; and the challenges inherent in the acquisition, processing and analysis of images and sensing data in general [EMDASH] ranging from sonar on a submarine to a neuroscientist's fMRI study.

This new and fully updated edition of Anaesthetic Aide-Memoire provides a compilation of key lists, numerical data, physiological and pharmacological formulae, procedural algorithms, important information on illnesses pertaining to anaesthesia, data on equipment, clinical measurement, and intensive care management that will serve as a valuable quick reference for senior anaesthetists in training and for consultants in anaesthesia. It is the ideal first reference source to consult when a fact, statistic, or formula eludes the memory, and as such will also prove to be a useful aid to teaching. It will also be useful for candidates for the FRCA examination who will already understand the basic physiology and pharmacology underpinning anaesthesia but who need reminding occasionally in a clear, concise, didactic way.

A First Course in Combinatorial Optimization is a text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. It is a self-contained treatment of the subject, requiring only some mathematical maturity. Topics include: linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Central to the exposition is the polyhedral viewpoint, which is the key principle underlying the successful integer-programming approach to combinatorial-optimization problems. Another key unifying topic is matroids. The author does not dwell on data structures and implementation details, preferring to focus on the key mathematical ideas that lead to useful models and algorithms. Problems and exercises are included throughout as well as references for further study.

A First Course in Combinatorial Optimization is a text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. It is a self-contained treatment of the subject, requiring only some mathematical maturity. Topics include: linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Central to the exposition is the polyhedral viewpoint, which is the key principle underlying the successful integer-programming approach to combinatorial-optimization problems. Another key unifying topic is matroids. The author does not dwell on data structures and implementation details, preferring to focus on the key mathematical ideas that lead to useful models and algorithms. Problems and exercises are included throughout as well as references for further study.

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

This book presents an overview of the computational framework in which calculations of relativistic hydrodynamics have been developed. It summarizes the jargon and methods used in the field, and provides illustrative applications to real physical systems. The authors explain how to break down the complexities of Einstein's equations and fluid dynamics, stressing the viability of the Euler–Lagrange approach to astrophysical problems. The book contains techniques and algorithms enabling one to build computer simulations of relativistic fluid problems for various astrophysical systems in one, two and three dimensions. It also shows the reader how to test relativistic hydrodynamics codes. Suitable for graduate courses on astrophysical hydrodynamics and relativistic astrophysics, this book also provides a valuable reference for researchers already working in the field.

In this handbook, the emergency physician-neurologist editorial team from the acclaimed comprehensive text Emergency Neurology bring its expertise to a readily accessible reference tool for the emergency department. With a symptom-based emphasis, the text, tables, and illustrations guide the emergency physician in the recognition, diagnosis, and management of neurological disorders both common and complex. Integrating fundamental neurological concepts with the practical realities and demands of emergency care, this handbook features management algorithms for dozens of conditions, and a list of 'pearls and pitfalls' at the conclusion of each of the 38 chapters. This survey of best practices in emergency neurology provides succinct and crucial clinical information for all emergency physicians who diagnose and manage neurologic disorders such as headache, seizure, and spinal cord injury. Emphasizing efficient neurological examination techniques, this is an essential handbook for emergency

The interplay between algebra and geometry is a beautiful (and fun!) area of mathematical investigation. Advances in computing and algorithms make it possible to tackle many classical problems in a down-to-earth and concrete fashion. This opens wonderful new vistas and allows us to pose, study and solve problems that were previously out of reach. Suitable for graduate students, the objective of this 2003 book is to bring advanced algebra to life with lots of examples. The first chapters provide an introduction to commutative algebra and connections to geometry. The rest of the book focuses on three active areas of contemporary algebra: Homological Algebra (the snake lemma, long exact sequence inhomology, functors and derived functors (Tor and Ext), and double complexes); Algebraic Combinatorics and Algebraic Topology (simplicial complexes and simplicial homology, Stanley-Reisner rings, upper bound theorem and polytopes); and Algebraic Geometry (points and curves in projective space, Ri

The interplay between algebra and geometry is a beautiful (and fun!) area of mathematical investigation. Advances in computing and algorithms make it possible to tackle many classical problems in a down-to-earth and concrete fashion. This opens wonderful new vistas and allows us to pose, study and solve problems that were previously out of reach. Suitable for graduate students, the objective of this 2003 book is to bring advanced algebra to life with lots of examples. The first chapters provide an introduction to commutative algebra and connections to geometry. The rest of the book focuses on three active areas of contemporary algebra: Homological Algebra (the snake lemma, long exact sequence inhomology, functors and derived functors (Tor and Ext), and double complexes); Algebraic Combinatorics and Algebraic Topology (simplicial complexes and simplicial homology, Stanley-Reisner rings, upper bound theorem and polytopes); and Algebraic Geometry (points and curves in projective space, Ri

How is language organized in the human brain? The Neuroscience of Language, published in 2003, puts forth a systematic model of language to bridge the gap between linguistics and neuroscience. Neuronal models of word and serial order processing are presented in the form of a computational, connectionist neural network. The linguistic emphasis is on words and elementary syntactic rules. Introductory chapters focus on neuronal structure and function, cognitive brain processes, the basics of classical aphasia research and modern neuroimaging of language, neural network approaches to language, and the basics of syntactic theories. The essence of the work is contained in chapters on neural algorithms and networks, basic syntax, serial order mechanisms, and neuronal grammar. Throughout, excursuses illustrate the functioning of brain models of language, some of which are accessible as animations on the book's accompanying web site. It will appeal to graduate students and researchers in neuros

How is language organized in the human brain? The Neuroscience of Language, published in 2003, puts forth a systematic model of language to bridge the gap between linguistics and neuroscience. Neuronal models of word and serial order processing are presented in the form of a computational, connectionist neural network. The linguistic emphasis is on words and elementary syntactic rules. Introductory chapters focus on neuronal structure and function, cognitive brain processes, the basics of classical aphasia research and modern neuroimaging of language, neural network approaches to language, and the basics of syntactic theories. The essence of the work is contained in chapters on neural algorithms and networks, basic syntax, serial order mechanisms, and neuronal grammar. Throughout, excursuses illustrate the functioning of brain models of language, some of which are accessible as animations on the book's accompanying web site. It will appeal to graduate students and researchers in neuros

Acta Numerica surveys annually the most important developments in numerical mathematics and scientific computing. The subjects and authors of the substantive survey articles are chosen by a distinguished international editorial board so as to report the most important and timely developments in a manner accessible to the wider community of professionals with an interest in scientific computing. Acta Numerica volumes have proved to be a valuable tool not only for researchers and professionals wishing to develop their understanding of numerical techniques and algorithms and follow new developments, but also as an advanced teaching aid at colleges and universities. Many of the original articles have been used as the prime resource for graduate courses. This particular volume was originally published in 2002.

Felix Klein, one of the great nineteenth-century geometers, discovered in mathematics an idea prefigured in Buddhist mythology: the heaven of Indra contained a net of pearls, each of which was reflected in its neighbour, so that the whole Universe was mirrored in each pearl. Klein studied infinitely repeated reflections and was led to forms with multiple coexisting symmetries. For a century, these images barely existed outside the imagination of mathematicians. However, in the 1980s, the authors embarked on the first computer exploration of Klein's vision, and in doing so found many further extraordinary images. Join the authors on the path from basic mathematical ideas to the simple algorithms that create the delicate fractal filigrees, most of which have never appeared in print before. Beginners can follow the step-by-step instructions for writing programs that generate the images. Others can see how the images relate to ideas at the forefront of research.

This 2001 book provides a practical and systematic approach to the acquisition, interpretation, and reporting of physiologic responses to exercise. Pulmonologists, cardiologists, and sports physicians, as well as respiratory therapists and other allied health professionals will find this book an indispensable resource when learning to select proper instruments, identify the most appropriate test protocols, and integrate and interpret physiologic response variables. The final chapter presents clinical cases to illuminate useful strategies for exercise testing and interpretation. Useful appendices offer laboratory forms, algorithms and calculations, as well as answers to FAQs. A glossary of terms, symbols, and definitions is also included. Exercise Testing and Interpretation: A Practical Approach offers clearly defined responses (both normal and abnormal) to over thirty performance variables including aerobic, cardiovascular, ventilatory, and gas-exchange variables. Practical, portable,

Mechanisms are fundamental components of machines. They are used to transmit forces and moments and to manipulate objects in industrial machinery, robots, automobiles, aircraft, mechatronics devices and biomechanical systems. A knowledge of the kinematic and dynamic properties of mechanisms is essential for their design and control. This book describes methods and algorithms for the analysis of kinematic systems. Beginning with basic concepts, the book then discusses a variety of problem-solving approaches and computational techniques. Its distinctive feature is its focus on the contour equation as a powerful, computationally efficient tool that will help the reader to design complex spatial mechanisms. This handy text will be useful for senior or graduate students, researchers and practising engineers working in robotics, vehicle dynamics, mechatronics and machine design.

Optimal Reliability Design, first published in 2000, provides a detailed introduction to systems reliability and reliability optimization. Techniques for maximizing system reliability are described, focusing on component reliability enhancement and redundancy arrangement. The authors present several case studies and show how optimization techniques are applied in practice. They also pay particular attention to finding methods that give the optimal trade-off between reliability and cost. The book begins with a review of key background material, and a discussion of a range of optimization models. The authors go on to cover optimization tools, such as heuristics, discrete optimization, nonlinear programming, mixed integer programming, optimal arrangement, and metaheuristic algorithms. They also describe the computational implementation of these tools. Many numerical examples are included, and the book contains over 180 homework exercises. It is suitable as a textbook for graduate-level co

Reactive flows encompass a broad range of physical phenomena, interacting over many different time and space scales. Such flows occur in combustion, chemical lasers, the earth's oceans and atmosphere, and stars and interstellar space. Despite the obvious physical differences in these flows, there is a striking similarity in the forms of their descriptive equations. Thus, the considerations and procedures for constructing numerical models of these systems are also similar, and these similarities can be exploited. Moreover, using the latest technology, what were once difficult and expensive computations can now be done on desktop computers. This book takes account of the explosive growth in computer technology and the greatly increased capacity for solving complex reactive flow problems that have occurred since the first edition of Numerical Simulation of Reactive Flow was published in 1987. It presents algorithms useful for reactive flow simulations, describes trade-offs involved in the

Commerce, Complexity, and Evolution is a significant contribution to the paradigm - straddling economics, finance, marketing, and management - which acknowledges that commercial systems are evolutionary, and must therefore be analysed using evolutionary tools. Evolutionary systems display complicated behaviours which are to a significant degree generated endogenously, rather than being solely the product of exogenous shocks, hence the conjunction of complexity with evolution. This volume considers a wide range of systems, from the entire economy at one extreme to the behaviour of single markets at the other. The papers are united by methodologies which at their core are evolutionary, though the techniques cover a wide range, from philosophical discourse to differential equations, genetic algorithms, multi-agent simulations and cellular automata. Issues considered include the dynamics of debt-deflation, stock management in a complex environment, interactions between consumers and its ef

Written for a broad audience of students in mathematics, computer science, operations research, statistics, and engineering, this textbook presents a short, lively survey of several fascinating non-calculus topics in modern applied mathematics. Coverage includes probability, mathematical finance, graphs, linear programming, statistics, computer science algorithms, and groups. A key feature is the abundance of interesting examples not normally found in standard finite mathematics courses, such as options pricing and arbitrage, tournaments, and counting formulas. The author assumes a level of mathematical sophistication at the beginning calculus level, that is, students should have had at least a course in pre-calculus, and the added sophistication attained from studying calculus would be useful.

This book describes theoretical advances in the study of artificial neural networks. It explores probabilistic models of supervised learning problems, and addresses the key statistical and computational questions. Research on pattern classification with binary-output networks is surveyed, including a discussion of the relevance of the Vapnik–Chervonenkis dimension, and calculating estimates of the dimension for several neural network models. A model of classification by real-output networks is developed, and the usefulness of classification with a 'large margin' is demonstrated. The authors explain the role of scale-sensitive versions of the Vapnik–Chervonenkis dimension in large margin classification, and in real prediction. They also discuss the computational complexity of neural network learning, describing a variety of hardness results, and outlining two efficient constructive learning algorithms. The book is self-contained and is intended to be accessible to researchers and gradua

Reflecting the central place of neurological evaluation and management in the daily practice of emergency medicine, this clinician's reference systematically reviews the main interventions in emergency neurology at all levels of emergency care, from prehospital management through the emergency department, to final disposition of the patient. The book is in seven sections, each integrating neurological concepts with the practical realities and demands of emergency care, and extending from the neurological examination and neurodiagnostic testing through common neurological presentations to specific neurological conditions and recent developments in brain resuscitation. Pediatric neurology and neurological emergencies of pregnancy are fully covered. Generously illustrated with scans and line diagrams, it also features management algorithms for many conditions, and each chapter ends with a list of 'pearls and pitfalls'. It is a comprehensive survey of best practice for emergency physicians

The pi-calculus differs from other models of communicating behaviour mainly in its treatment of mobility. The movement of a piece of data inside a computer program is treated exactly the same as the transfer of a message - or indeed an entire computer program - across the internet. One can also describe networks which reconfigure themselves. The calculus is very simple but powerful; its most prominent ingredient is the notion of a name. Its theory has two important ingredients: the concept of behavioural (or observational) equivalence, and the use of a new theory of types to classify patterns of interactive behaviour. The internet, and its communication protocols, fall within the scope of the theory just as much as computer programs, data structures, algorithms and programming languages. This book is the first textbook on the subject; it has been long-awaited by professionals and will be welcomed by them, and their students.

The pi-calculus differs from other models of communicating behaviour mainly in its treatment of mobility. The movement of a piece of data inside a computer program is treated exactly the same as the transfer of a message - or indeed an entire computer program - across the internet. One can also describe networks which reconfigure themselves. The calculus is very simple but powerful; its most prominent ingredient is the notion of a name. Its theory has two important ingredients: the concept of behavioural (or observational) equivalence, and the use of a new theory of types to classify patterns of interactive behaviour. The internet, and its communication protocols, fall within the scope of the theory just as much as computer programs, data structures, algorithms and programming languages. This book is the first textbook on the subject; it has been long-awaited by professionals and will be welcomed by them, and their students.

Partial differential equations arise in almost all areas of science, engineering, modeling, and forecasting. During the last two decades pseudospectral methods have emerged as successful alternatives to better known computational procedures, (e.g. finite difference and finite element methods of numerical solution), in several key application areas. These areas include computational fluid dynamics, wave motion, and weather forecasting. This book explains how, when and why this pseudospectral approach works. In order to make the subject accessible to students as well as researchers and engineers, the subject is presented using illustrations, examples, heuristic explanations, and algorithms rather than rigorous theoretical arguments. This book will be of interest to graduate students, scientists and engineers interested in applying pseudospectral methods to real problems.

On-line learning is one of the most powerful and commonly used techniques for training large layered networks and has been used successfully in many real-world applications. Traditional analytical methods have been recently complemented by ones from statistical physics and Bayesian statistics. This powerful combination of analytical methods provides more insight and deeper understanding of existing algorithms and leads to novel and principled proposals for their improvement. This book presents a coherent picture of the state-of-the-art in the theoretical analysis of on-line learning. An introduction relates the subject to other developments in neural networks and explains the overall picture. Surveys by leading experts in the field combine new and established material and enable non-experts to learn more about the techniques and methods used. This book, the first in the area, provides a comprehensive view of the subject and will be welcomed by mathematicians, scientists and engineers,

The use of neural networks in signal processing is becoming increasingly widespread, with applications in many areas. Applied Neural Networks for Signal Processing is the first book to provide a comprehensive introduction to this broad field. It begins by covering the basic principles and models of neural networks in signal processing. The authors then discuss a number of powerful algorithms and architectures for a range of important problems, and describe practical implementation procedures. A key feature of the book is that many carefully designed simulation examples are included to help guide the reader in the development of systems for new applications. The book will be an invaluable reference for scientists and engineers working in communications, control or any other field related to signal processing. It can also be used as a textbook for graduate courses in electrical engineering and computer science.

This 1999 book describes the implementation of multilevel methods for the numerical simulation of turbulent flows. The general ideas for the algorithms presented stem from dynamical systems theory and are based on the decomposition of the unknown function into two or more arrays corresponding to different scales in the Fourier space. Before describing in detail the numerical algorithm, survey chapters are included on the mathematical theory of the Navier-Stokes equations and on the physics of the conventional theory of turbulence. The multilevel methods are applied here to the simulation of homogeneous isotropic turbulent flows as well as turbulent channel flows. The implementation issues are discussed in detail and numerical simulations of the flows cited above are presented and analysed. The methods have been applied in the context of the direct numerical simulation and are therefore compared to such simulations.

Beginning with a brief introduction to algorithms and diophantine equations, this volume aims to provide a coherent account of the methods used to find all the solutions to certain diophantine equations, particularly those procedures which have been developed for use on a computer. The study is divided into three parts, the emphasis throughout being on examining approaches with a wide range of applications. The first section considers basic techniques including local methods, sieving, descent arguments and the LLL algorithm. The second section explores problems which can be solved using Baker's theory of linear forms in logarithms. The final section looks at problems associated with curves, mainly focusing on rational and integral points on elliptic curves. Each chapter concludes with a useful set of exercises. A detailed bibliography is included. This book will appeal to graduate students and research workers, with a basic knowledge of number theory, who are interested in solving diop

Beginning with a brief introduction to algorithms and diophantine equations, this volume aims to provide a coherent account of the methods used to find all the solutions to certain diophantine equations, particularly those procedures which have been developed for use on a computer. The study is divided into three parts, the emphasis throughout being on examining approaches with a wide range of applications. The first section considers basic techniques including local methods, sieving, descent arguments and the LLL algorithm. The second section explores problems which can be solved using Baker's theory of linear forms in logarithms. The final section looks at problems associated with curves, mainly focusing on rational and integral points on elliptic curves. Each chapter concludes with a useful set of exercises. A detailed bibliography is included. This book will appeal to graduate students and research workers, with a basic knowledge of number theory, who are interested in solving diop

Advances in the field of computer vision are leading to radical changes in the way we interact with computers. At the time of this book's publication in 1998, it would soon be possible to enable a computer linked to a video camera to detect the presence of users, track faces, arms and hands in real time, and analyse expressions and gestures. The implications for interface design are immense and are expected to have major repercussions for all areas where computers are used, from the work place to recreation. This book collects the ideas and algorithms from the world's leading scientists, offering a glimpse of the radical changes that are round the corner and which will change the way we will interact with computers in the near future.

The theory of Gröbner bases, invented by Bruno Buchberger, is a general method by which many fundamental problems in various branches of mathematics and engineering can be solved by structurally simple algorithms. The method is now available in all major mathematical software systems. This book provides a short and easy-to-read account of the theory of Gröbner bases and its applications. It is in two parts, the first consisting of tutorial lectures, beginning with a general introduction. The subject is then developed in a further twelve tutorials, written by leading experts, on the application of Gröbner bases in various fields of mathematics. In the second part are seventeen original research papers on Gröbner bases. An appendix contains the English translations of the original German papers of Bruno Buchberger in which Gröbner bases were introduced.

The most comprehensive overview of signal detection available. This is a thorough, up-to-date introduction to optimizing detection algorithms for implementation on digital computers. It focuses extensively on real-world signal processing applications, including state-of-the-art speech and communications technology as well as traditional sonar/radar systems. Start with a quick review of the fundamental issues associated with mathematical detection, as well as the most important probability density functions and their properties. Next, review Gaussian, Chi-Squared, F, Rayleigh, and Rician PDFs, quadratic forms of Gaussian random variables, asymptotic Gaussian PDFs, and Monte Carlo Performance Evaluations. Three chapters introduce the basics of detection based on simple hypothesis testing, including the Neyman-Pearson Theorem, handling irrelevant data, Bayes Risk, multiple hypothesis testing, and both deterministic and random signals. The author then presents exceptionally detailed covera

Type theory is one of the most important tools in the design of higher-level programming languages, such as ML. This book introduces and teaches its techniques by focusing on one particularly neat system and studying it in detail. In this way, all the key ideas are covered without getting involved in the complications of more advanced systems, but concentrating rather on the principles that make the theory work in practice. This book takes a type-assignment approach to type theory, and the system considered is the simplest polymorphic one. The author covers all the basic ideas, including the system's relation to propositional logic, and gives a careful treatment of the type-checking algorithm which lies at the heart of every such system. Also featured are two other interesting algorithms that have been buried in inaccessible technical literature. The mathematical presentation is rigorous but clear, making the book at a level which can be used as an introduction to type theory for comp