Explore the vast range of titles available.

Kalman filter, particle filter, IMM, PDA, ITS, random sets... The number of useful object-tracking methods is exploding. But how are they related? How do they help track everything from aircraft, missiles and extra-terrestrial objects to people and lymphocyte cells? How can they be adapted to novel applications? Fundamentals of Object Tracking tells you how. Starting with the generic object-tracking problem, it outlines the generic Bayesian solution. It then shows systematically how to formulate the major tracking problems – maneuvering, multiobject, clutter, out-of-sequence sensors – within this Bayesian framework and how to derive the standard tracking solutions. This structured approach makes very complex object-tracking algorithms accessible to the growing number of users working on real-world tracking problems and supports them in designing their own tracking filters under their unique application constraints. The book concludes with a chapter on issues critical to successful implementation of tracking algorithms, such as track initialization and merging.

The P-NP problem is the most important open problem in computer science, if not all of mathematics.The Golden Ticketprovides a nontechnical introduction to P-NP, its rich history, and its algorithmic implications for everything we do with computers and beyond. In this informative and entertaining book, Lance Fortnow traces how the problem arose during the Cold War on both sides of the Iron Curtain, and gives examples of the problem from a variety of disciplines, including economics, physics, and biology. He explores problems that capture the full difficulty of the P-NP dilemma, from discovering the shortest route through all the rides at Disney World to finding large groups of friends on Facebook. But difficulty also has its advantages. Hard problems allow us to safely conduct electronic commerce and maintain privacy in our online lives. The Golden Ticketexplores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of the P-NP problem.

Robust optimization is still a relatively new approach to optimization problems affected by uncertainty, but it has already proved so useful in real applications that it is difficult to tackle such problems today without considering this powerful methodology. Written by the principal developers of robust optimization, and describing the main achievements of a decade of research, this is the first book to provide a comprehensive and up-to-date account of the subject. Robust optimization is designed to meet some major challenges associated with uncertainty-affected optimization problems: to operate under lack of full information on the nature of uncertainty; to model the problem in a form that can be solved efficiently; and to provide guarantees about the performance of the solution. The book starts with a relatively simple treatment of uncertain linear programming, proceeding with a deep analysis of the interconnections between the construction of appropriate uncertainty sets and the classical chance constraints (probabilistic) approach. It then develops the robust optimization theory for uncertain conic quadratic and semidefinite optimization problems and dynamic (multistage) problems. The theory is supported by numerous examples and computational illustrations. An essential book for anyone working on optimization and decision making under uncertainty,Robust Optimizationalso makes an ideal graduate textbook on the subject.

Modern complex large-scale dynamical systems exist in virtually every aspect of science and engineering, and are associated with a wide variety of physical, technological, environmental, and social phenomena, including aerospace, power, communications, and network systems, to name just a few. This book develops a general stability analysis and control design framework for nonlinear large-scale interconnected dynamical systems, and presents the most complete treatment on vector Lyapunov function methods, vector dissipativity theory, and decentralized control architectures. Large-scale dynamical systems are strongly interconnected and consist of interacting subsystems exchanging matter, energy, or information with the environment. The sheer size, or dimensionality, of these systems necessitates decentralized analysis and control system synthesis methods for their analysis and design. Written in a theorem-proof format with examples to illustrate new concepts, this book addresses continuous-time, discrete-time, and hybrid large-scale systems. It develops finite-time stability and finite-time decentralized stabilization, thermodynamic modeling, maximum entropy control, and energy-based decentralized control. This book will interest applied mathematicians, dynamical systems theorists, control theorists, and engineers, and anyone seeking a fundamental and comprehensive understanding of large-scale interconnected dynamical systems and control.

The Final Volume of the Groundbreaking Trilogy on Agent-Based Modeling In this pioneering synthesis, Joshua Epstein introduces a new theoretical entity: Agent_Zero. This software individual, or \"agent,\" is endowed with distinct emotional/affective, cognitive/deliberative, and social modules. Grounded in contemporary neuroscience, these internal components interact to generate observed, often far-from-rational, individual behavior. When multiple agents of this new type move and interact spatially, they collectively generate an astonishing range of dynamics spanning the fields of social conflict, psychology, public health, law, network science, and economics. Epstein weaves a computational tapestry with threads from Plato, Hume, Darwin, Pavlov, Smith, Tolstoy, Marx, James, and Dostoevsky, among others. This transformative synthesis of social philosophy, cognitive neuroscience, and agent-based modeling will fascinate scholars and students of every stripe. Epstein's computer programs are provided in the book or on its Princeton University Press website, along with movies of his \"computational parables.? Agent_Zero is a signal departure in what it includes (e.g., a new synthesis of neurally grounded internal modules), what it eschews (e.g., standard behavioral imitation), the phenomena it generates (from genocide to financial panic), and the modeling arsenal it offers the scientific community. For generative social science, Agent_Zero presents a groundbreaking vision and the tools to realize it.

Written by prominent experts in the field, this monograph provides the first comprehensive, unified presentation of the structural, algorithmic and applied aspects of the theory of Boolean functions. The book focuses on algebraic representations of Boolean functions, especially disjunctive and conjunctive normal form representations. This framework looks at the fundamental elements of the theory (Boolean equations and satisfiability problems, prime implicants and associated short representations, dualization), an in-depth study of special classes of Boolean functions (quadratic, Horn, shellable, regular, threshold, read-once functions and their characterization by functional equations) and two fruitful generalizations of the concept of Boolean functions (partially defined functions and pseudo-Boolean functions). Several topics are presented here in book form for the first time. Because of the depth and breadth and its emphasis on algorithms and applications, this monograph will have special appeal for researchers and graduate students in discrete mathematics, operations research, computer science, engineering and economics.

The goal of this book is to present the main ideas and techniques in the field of continuous smooth and nonsmooth optimization. Starting with the case of differentiable data and the classical results on constrained optimization problems, and continuing with the topic of nonsmooth objects involved in optimization theory, the book concentrates on both theoretical and practical aspects of this field. This book prepares those who are engaged in research by giving repeated insights into ideas that are subsequently dealt with and illustrated in detail.

The problem of distributing gas through a network of pipelines is formulated as a cost minimization subject to nonlinear flow-pressure relations, material balances, and pressure bounds. The solution method is based on piecewise linear approximations of the nonlinear flow-pressure relations. The approximated problem is solved by an extension of the Simplex method. The solution method is tested on real-world data and compared with alternative solution methods.