Algorithms

Computer Manual to Accompany Pattern Classification and its associated MATLAB software is an excellent companion to Duda: Pattern Classfication, 2nd ed, (DH&S). The code contains all algorithms descri

Intended for computer science students, this textbook explains current efforts to use algorithms, heuristics, and methodologies based on the ways in which the human brain solves problems in the fields

Written for SAR system designers and remote sensing specialists, this practical reference shows you how to produce higher quality SAR images using data-driven algorithms, and how to apply powerful new

This book presents an easy-to-read discussion of domain decomposition algorithms, their implementation and analysis. The relationship between domain decomposition and multigrid methods is carefully explained at an elementary level, and discussions of the implementation of domain decomposition methods on massively parallel super computers are also included. All algorithms are fully described and explained, and a mathematical framework for the analysis and complete understanding of the methods is also carefully developed. In addition, numerous numerical examples are included to demonstrate the behaviour of this important class of numerical methods. This book is ideal for graduate students about to embark on a career in computational science. It will also be a valuable resource for all those interested in parallel computing and numerical computational methods.

This book provides the communications engineer involved in the physical layer of communications systems, the signal processing techniques and design tools needed to develop efficient algorithms for th

Concrete Abstract Algebra develops the theory of abstract algebra from numbers to Gröbner bases, whilst taking in all the usual material of a traditional introductory course. In addition there is a rich supply of topics like cryptography, factoring algorithms for integers, quadratic residues, finite fields, factoring algorithms for polynomials and systems of non-linear equations. A special feature is that Gröbner bases do not appear as an isolated example. They are fully integrated as a subject that can be successfully taught in an undergraduate context. Lauritzen's approach to teaching abstract algebra is based on an extensive use of examples, applications and exercises. The basic philosophy is that inspiring, non-trivial applications and examples give motivation and ease the learning of abstract concepts. This book is built on several years of experience teaching introductory abstract algebra at Aarhus, where the emphasis on concrete and inspiring examples has improved student perfor

Concrete Abstract Algebra develops the theory of abstract algebra from numbers to Gröbner bases, whilst taking in all the usual material of a traditional introductory course. In addition there is a rich supply of topics like cryptography, factoring algorithms for integers, quadratic residues, finite fields, factoring algorithms for polynomials and systems of non-linear equations. A special feature is that Gröbner bases do not appear as an isolated example. They are fully integrated as a subject that can be successfully taught in an undergraduate context. Lauritzen's approach to teaching abstract algebra is based on an extensive use of examples, applications and exercises. The basic philosophy is that inspiring, non-trivial applications and examples give motivation and ease the learning of abstract concepts. This book is built on several years of experience teaching introductory abstract algebra at Aarhus, where the emphasis on concrete and inspiring examples has improved student perfor

This book provides a strong coverage of both the theoretical and application aspects of neural networks, fuzzy logic, genetic algorithms and hybrid intelligent techniques in robotics. Specific emphasi

This book provides a strong coverage of both the theoretical and application aspects of neural networks, fuzzy logic, genetic algorithms and hybrid intelligent techniques in robotics. Specific emphas

The aim of this volume is to show how Fuzzy Sets and Systems can help to provide robust and adaptive heuristic optimization algorithms in a variety of situations. The book presents the state of the ar

In our day-to-day lives we constantly make decisions which are simply 'good enough' rather than optimal. Most computer-based decision-making algorithms, on the other hand, doggedly seek only the optimal solution based on rigid criteria and reject any others. In this book, Professor Stirling outlines an alternative approach, using novel algorithms and techniques which can be used to find satisficing solutions. Building on traditional decision and game theory, these techniques allow decision-making systems to cope with more subtle situations where self and group interests conflict, perfect solutions can't be found and human issues need to be taken into account - in short, more closely modelling the way humans make decisions. The book will therefore be of great interest to engineers, computer scientists and mathematicians working on artificial intelligence and expert systems.

Poetry. "What do Hugh MacDiarmid, Donkey Kong and the algorithms of pornolize.com have to do with each other? Was Wordsworth all wrong, and is the democratization of language to be found in the work o

A collection of surveys and research papers on mathematical software and algorithms. The common thread is that the field of mathematical applications lies on the border between algebra and geometry. T

Polynomial equations have been long studied, both theoretically and with a view to solving them. Until recently, manual computation was the only solution method and the theory was developed to accommodate it. With the advent of computers, the situation changed dramatically. Many classical results can be more usefully recast within a different framework which in turn lends itself to further theoretical development tuned to computation. This first book in a trilogy is devoted to the new approach. It is a handbook covering the classical theory of finding roots of a univariate polynomial, emphasising computational aspects, especially the representation and manipulation of algebraic numbers, enlarged by more recent representations like the Duval Model and the Thom Codification. Mora aims to show that solving a polynomial equation really means finding algorithms that help one manipulate roots rather than simply computing them; to that end he also surveys algorithms for factorizing univariate

The Rapid Evaluation of Potential Fields in Particle Systems presents a group of algorithms for the computation of the potential and force fields in large-scale systems of particles that are likely to

Randomization is an important tool in the design of algorithms, and the ability of randomization to provide enhanced power is a major research topic in complexity theory. Noam Nisan continues the inve

An in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization. These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong l

This text: is well-suited for self-study and can be used as the basis for an advanced undergraduate or beginning graduate course; maintains the style set by Elementary Algorithms; introduces advanced

Solar Resources takes stock of the resource - sunlight - on which any plan for solar heat conversion technologies must be based. It describes the evolution of theoretical models, algorithms, and equip

This is the definitive guide to best antipsychotic prescribing practice today. It includes case studies, switching algorithms and a comprehensive guide to history-taking and rating scales administrati

This is a timely book in light of increasing concern over global warming and environmental pollution. It describes a simulation system based on sets of computer algorithms for comprehensive analysis o

Observers are digital algorithms that combine sensor outputs with knowledge of the system to provide results superior to traditional structures, which rely wholly on sensors. Observers have been used

The momentous task of assembling such a comprehensive and accurate collection of calendars could only have been achieved by the authors of the definitive text on calendar algorithms, Calendrical Calculations. Using the algorithms outlined in their earlier book, Professors Reingold and Dershowitz have achieved the near-impossible task of simultaneously displaying the date on thirteen different calendars over a three-hundred year period. Represented here are the Gregorian, ISO, Hebrew, Chinese, Coptic, Ethiopic, Persian, Hindu lunar, Hindu solar, and Islamic calendars; another three are easily obtained from the tables with minimal arithmetic ( J.D., R.D. and Julian). The tables also include phases of the moon, dates of solstices and equinoxes, and religious and other special holidays for all the calendars shown. Why produce a book of tables in the computer age? Because computer programs can cover only one or two calendars, have a limited range, are of dubious accuracy, are difficult for

This book is a clear and informative introduction to cryptography and data protection--subjects of considerable social and political importance. It explains what algorithms do, how they are used, the

Intended for clinicians, this pocket-sized reference summarizes the most essential information for laboratory testing and diagnosis. Algorithms outline the steps involved in ordering a work-up for pat

Based on a lecture course given at Chalmers University of Technology, this 2002 book is ideal for advanced undergraduate or beginning graduate students. The author first develops the necessary background in probability theory and Markov chains before applying it to study a range of randomized algorithms with important applications in optimization and other problems in computing. Amongst the algorithms covered are the Markov chain Monte Carlo method, simulated annealing, and the recent Propp-Wilson algorithm. This book will appeal not only to mathematicians, but also to students of statistics and computer science. The subject matter is introduced in a clear and concise fashion and the numerous exercises included will help students to deepen their understanding.

If you are a C programmer interested in music or a composer hoping to expand your musical horizons, Computer Music in C provides you with a practical library of algorithms and related C programming fu

Provides an innovative hands-on introduction to techniques for specifying the behaviour of software components. It is primarily intended for use as a text book for a course in the 2nd or 3rd year of Computer Science and Computer Engineering programs, but it is also suitable for self-study. Using this book will help the reader improve programming skills and gain a sound foundation and motivation for subsequent courses in advanced algorithms and data structures, software design, formal methods, compilers, programming languages, and theory. The presentation is based on numerous examples and case studies appropriate to the level of programming expertise of the intended readership. The main topics covered are techniques for using programmer-friendly assertional notations to specify, develop, and verify small but non-trivial algorithms and data representations, and the use of state diagrams, grammars, and regular expressions to specify and develop recognizers for formal languages.

Provides an innovative hands-on introduction to techniques for specifying the behaviour of software components. It is primarily intended for use as a text book for a course in the 2nd or 3rd year of Computer Science and Computer Engineering programs, but it is also suitable for self-study. Using this book will help the reader improve programming skills and gain a sound foundation and motivation for subsequent courses in advanced algorithms and data structures, software design, formal methods, compilers, programming languages, and theory. The presentation is based on numerous examples and case studies appropriate to the level of programming expertise of the intended readership. The main topics covered are techniques for using programmer-friendly assertional notations to specify, develop, and verify small but non-trivial algorithms and data representations, and the use of state diagrams, grammars, and regular expressions to specify and develop recognizers for formal languages.

Important text examines algorithms for optimizing large systems and clarifying relations between optimization procedures. Much data appear as charts and graphs and will be highly valuable to readers i

Here is an accessible, algorithmically oriented guide to some of the most interesting techniques of complexity theory. The book shows that simple algorithms are at the heart of complexity theory. The

The boost graph library (BGL) is the first C++ graph library to apply the notion of generic programming to the construction of graph algorithms. This book introduces the major features of BGL, applie

Evolutionary Algorithms (EAs) have grown into a mature field of research in optimization, and have proven to be effective and robust problem solvers for a broad range of static real-world optimization

This is the second volume in a projected five-volume survey of numerical linear algebra and matrix algorithms. Stressing depth over breadth, Professor Stewart treats the derivation and implementation

This book provides a unified view of tomographic techniques, a common mathematical framework, and an in-depth treatment of reconstruction algorithms. It focuses on the reconstruction of a function fro

As remote sensing data and methods have become increasingly complex and varied - and increasingly reliable - so have their uses in forest management. New algorithms have been developed in virtually ev

The book combines topics in mathematics (geometry and topology), computer science (algorithms), and engineering (mesh generation). The motivation for these topics is the difficulty, both conceptually and in the technical execution, of combining elements of combinatorial and of numerical algorithms. Mesh generation is a topic where a meaningful combination of these different approaches to problem solving is inevitable. The book develops methods from both areas that are amenable to combination, and explains breakthrough solutions to meshing that fit into this category. This book emphasizes topics that are elementary, attractive, useful, interesting, and lend themselves to teaching, making it an ideal graduate text for courses on mesh generation.

Graph drawing comprises all aspects of visualizing structural relations between objects. The range of topics dealt with extends from graph theory, graph algorithms, geometry, and topology to visual la

This long-awaited update of Meyer's Wavelets: Algorithms and Applications includes completely new chapters on four topics: wavelets and the study of turbulence, wavelets and fractals (which includes a

This is the first comprehensive reference on trust-region methods, a class of numerical algorithms for the solution of nonlinear convex optimization methods. Its unified treatment covers both unconstr