Series: Texts in Computer Science
2006, Hardcover
ISBN-10: 0-387-95570-4
ISBN-13: 978-0-387-95570-4
Due: December 2006
About this textbook
High Algorithms is a text geared to a junior level course in
algorithms using Scheme as the programming language. Using the
high- level language Scheme allows the author to make extensive
use of concise yet highly readable source code or psuedocode for
the implementation of all the algorithms covered in the book.
This avoids a major weakness of other books currently used as
texts for a course in algorithms. The resulting book covers all
the traditional algorithms and introduces students to
abstractions in a gradual and sensible manner. It is a light and
lively presentation including prose descriptions, mathematical
presntations and psuedocode for a comprehensive list of the major
algorithms. The book lends itself to an accompanying lab on the
topic and much supporting material both for teachers and readers
or students is available at the accompanying website for the book.
Table of contents
Part I: Introduction Orientation * Higher-Order Procedures Part
II: Pure Functional Algorithms * List Algorithms * Linear
Containers * Tree Altorithms * Graph Algorithms * Text Algorithms
* Combinatorial Algorithms Part III: High Algorithms on Objects
with State Using Assignment Effectively * Random Numbers * Hash
Tables * Vector Algorithms Print version
Recommend to others
Series: Monographs in Theoretical Computer Science. An EATCS
Series
2007, VIII, 238 p., 70 illus., Hardcover
ISBN-10: 3-540-35853-6
ISBN-13: 978-3-540-35853-4
About this book
Local search has been applied successfully to a diverse
collection of optimization problems. It's appreciated for its
basic conceptual foundation, its general applicability, and its
power to serve as a source for new search paradigms. The typical
characteristics of combinatorial optimization problems to which
local search can be applied, its relation to complexity theory,
and the combination with randomized search features have led to a
wealth of interesting theoretical results. However, these results
are scattered throughout the literature.
This is the first book that presents a large collection of
theoretical results in a consistent manner, thus providing the
reader with a coherent overview of the achievements obtained so
far, but also serving as a source of inspiration for the
development of novel results in the challenging field of local
search.
Table of contents
Series: Springer Series in Computational Mathematics , Vol. 24
2007, Approx. 500 p., Hardcover
ISBN-10: 3-540-34466-7
ISBN-13: 978-3-540-34466-7
Due: July 2007
About this book
This considerably extended and completely revised second edition
incorporates many new developments in the thriving field of
numerical methods for singularly perturbed differential equations.
It provides a thorough foundation for the numerical analysis and
solution of these problems, which model many physical phenomena
whose solutions exhibit layers. The book focuses on linear
convection-diffusion equations and on nonlinear flow problems
that appear in computational fluid dynamics. It offers a
comprehensive overview of suitable numerical methods while
emphasizing those with realistic error estimates. The book should
be useful for scientists requiring effective numerical methods
for singularly perturbed differential equations.
Table of contents
I. Ordinary Differential Equations: The analytical behaviour of
solutions - numerical methods for second-order boundary value
problems - numerical methods for higher-order problems II.
Parabolic Initial-Boundary Value Problems in One Space Dimension:
Analytical behaviour of solutions - finite difference methods -
finite element methods - adaptive methods III. Elliptic Boundary
Value Problems: Analytical behaviour of solutions - finite
difference methods - finite element methods IV. Incompressible
Navier-Stokes Equations: Existence and uniqueness results - an
upwind finite element method - stabilized higher order methods -
adaptive error control Appendix: Robust Solvers for Linear
Systems
Originally published in the series: The International Series
on Discrete Event Dynamic Systems
2007, Approx. 900 p., Hardcover
ISBN-10: 0-387-33332-0
ISBN-13: 978-0-387-33332-8
Due: January 2007
About this textbook
Introduction to Discrete Event Systems is a comprehensive
introduction to the field of discrete event systems, offering a
breadth of coverage that makes the material accessible to readers
of varied backgrounds. The book emphasizes a unified modeling
framework that transcends specific application areas, linking the
following topics in a coherent manner: language and automata
theory, supervisory control, Petri net theory, Markov chains and
queuing theory, discrete-event simulation, and concurrent
estimation techniques. This edition includes recent research
results pertaining to the diagnosis of discrete event systems,
decentralized supervisory control, and interval-based timed
automata and hybrid automata models.
Table of contents
Series: Monographs in Computer Science
Originally published by Ellis Horwood Ltd, Prentice Hall, UK
2007, Approx. 510 p., 225 illus., Hardcover
ISBN-10: 0-387-20248-X
ISBN-13: 978-0-387-20248-8
Due: January 2007
About this book
Parsing--syntax analysis by computer--has been and continues to
be an essential part of computer science. Parsing techniques have
provided a solid basis for compiler construction since the mid-1960s,
and continue to do so, thereby contributing to all existing
software today. The enable Web browsers to analyze HTML pages,
and PostScript printers to analyze PostScript, among other
things; and some of the more advanced techniques are being used
in code generation in compilers and in data compression. In
linguistics, the importance of formal grammars was recognized
early on, but only relatively recently have the corresponding
parsing techniques been applied extensively; and their importance
as general pattern recognizers is slowly being acknowledged.
Today, with problems of speed and memory largely out of the way,
these general techniques have grown considerably in importance,
both in computer science, where advanced compilers now often use
general CF parsers, and in computational linguistics, where such
parsers are the only option. They are used in a variety of
software products including Web browsers, interpreters in
computer devices, and data compression programs; and they are
used extensively in linguistics.
To provide readers with low-threshold access to the full field of
parsing techniques, this second edition uses a two-tiered
structure. The basic ideas behind the dozen or so existing
parsing techniques are explained in an intuitive and narrative
style, starting from first principles of data structures and
algorithms this provides breadth and accessibility. The hundreds
of realizations and improvements of these techniques are then
explained n a much terser yet still informal, style in the
summaries of more than 700 papers referenced in the book; this
provides depth.
Table of contents
Introduction.- Grammars as a Generating Device.- Introduction to
Parsing.- General Non-Directional Parsing.- Regular Grammars and
Finite-State Automata.- General Directional Top-Down Parsing.-
General Directional Bottom-Up Parsing.- Deterministic Top-Down
Parsing.- Deterministic Bottom-Up Parsing.- Non-Canonical Parsers.-
Generalized Deterministic Parsers.- Substring Parsing.- Parsing
as Intersection.- Parallel Parsing.- Non-Chonsky Grammars and
Their Parsers.- Error Handling.- Practical Parser Writing and
Usage.- Annotated Bibliography in 24 Categories.
*
Collection: Lecture Notes in Mathematics , Vol. 1901
2007, VIII, 218 p., Broche
ISBN-10: 3-540-69137-5
ISBN-13: 978-3-540-69137-2
A propos de ce livre
Cet ouvrage est consacre a l'arithmetique des surfaces fibrees en
courbes de genre 1 au-dessus de la droite projective, et a
l'arithmetique des intersections de deux quadriques dans l'espace
projectif. Swinnerton-Dyer introduisit en 1993 une technique
permettant d'etudier les points rationnels des pinceaux de
courbes de genre 1. La premiere moitie de l'ouvrage reprend et
developpe cette technique ainsi que ses generalisations
ulterieures. La seconde moitie, qui repose sur la premiere, porte
sur les surfaces de del Pezzo de degre 4 et sur les intersections
de deux quadriques de dimension superieure; les resultats
annonces dans [C. R. Math. Acad. Sci. Paris 342 (2006), no. 4,
223--227] y sont demontres.
Sommaire
General Introduction.- Introduction generale.- Conventions.-
Arithmetique des Pinceaux Semi-stables de Courbes de genre 1 (Premiere
Partie).- Arithmetique des Pinceaux Semi-stables de Courbes de
genre 1 (Seconde Partie).- Principe de Hasse pour les Surfaces de
del Pezzo de Degre 4.- Annexe.- Bibliograpie.- Index des
notations.- Index Terminologique.