Expected publication date is August 27, 2003
From reviews for Foliations I:
"Overall presentation is first-rate
... diagrams ... are
well-crafted and reflect the strongly `graphical'
nature of the
subject ... A prospective reader who cares
to invest the time
needed to plough seriously through the book
ought to be rewarded
with a gratifying mathematical experience
... can also be
recommended to more advanced researchers,
who would enjoy seeing
a compendium of major results."
-- Bulletin of the LMS
"The authors pay great attention to
examples, and you can
find a large number of them in the book ...
They are well-chosen
and will keep the interest of the reader
on a high level ... [The
book is] a fundamental source for everybody
with a serious
interest in foliations."
-- European Mathematical Society Newsletter
"The large number of well-chosen examples
is one of the most
striking features of the book ... [It] contains
several beautiful
figures which help one to imagine and better
understand
situations described formally in the text.
Therefore, graduate
students, young researchers, and in fact,
everybody interested in
foliations should profit from this book."
-- Mathematical Reviews
Description
This is the second of two volumes on the
qualitative theory of
foliations. For this volume, the authors
have selected three
special topics: analysis on foliated spaces,
characteristic
classes of foliations, and foliated manifolds.
Each of these is
an example of deep interaction between foliation
theory and some
other highly-developed area of mathematics.
In all cases, the
authors present useful, in-depth introductions,
which lead to
further study using the extensive available
literature.
This comprehensive volume has something to
offer a broad spectrum
of readers: from beginners to advanced students
to professional
researchers. It contains exercises and many
illustrations. The
book would make an elegant supplementary
text for a topics course
at the advanced graduate level. Foliations
I is Volume 23 in the
AMS series, Graduate Studies in Mathematics.
Contents
Part 1: Analysis and geometry on foliated
spaces
Foreword to part 1
The C^*-algebra of a foliated space
Harmonic measures for foliated spaces
Generic leaves
Part 2: Characteristic classes and foliations
Foreword to part 2
The Euler class of circle bundles
The Chern-Weil construction
Characteristic classes and integrability
The Godbillon-Vey classes
Part 3: Foliated 3-manifolds
Foreword to part 3
Constructing foliations
Reebless foliations
Foliations and the Thurston norm
Disk decomposition and foliations of link
complements
C^*-Algebras
Riemannian geometry and heat diffusion
Brownian motion
Planar foliations
Bibliography
Index
Details:
Series: Graduate Studies in Mathematics,
Volume: 60
Publication Year: 2003
ISBN: 0-8218-0881-8
Paging: approximately 560 pp.
Binding: Hardcover
Expected publication date is July 12, 2003
Description
This book reproduces the doctoral thesis
written by a remarkable
mathematician, Sergei V. Kerov. His untimely
death at age 54 left
the mathematical community with an extensive
body of work and
this one-of-a-kind monograph. Here, he gives
a clear and lucid
account of results and methods of asymptotic
representation
theory. The book is a unique source of information
on an
important topic of current research.
Asymptotic representation theory of symmetric
groups deals with
problems of two types: asymptotic properties
of representations
of symmetric groups of large order and representations
of the
limiting object, i.e., the infinite symmetric
group. The author
contributed significantly in the development
of both directions.
His book presents an account of these contributions,
as well as
those of other researchers.
Among the problems of the first type, the
author discusses the
properties of the distribution of the normalized
cycle length in
a random permutation and the limiting shape
of a random (with
respect to the Plancherel measure) Young
diagram. He also studies
stochastic properties of the deviations of
random diagrams from
the limiting curve.
Among the problems of the second type, Kerov
studies an important
problem of computing irreducible characters
of the infinite
symmetric group. This leads to the study
of a continuous analog
of the notion of Young diagram, and in particular,
to a
continuous analogue of the hook walk algorithm,
which is well
known in the combinatorics of finite Young
diagrams. In turn,
this construction provides a completely new
description of the
relation between the classical moment problems
of Hausdorff and
Markov.
The book is suitable for graduate students
and research
mathematicians interested in representation
theory and
combinatorics.
Contents
Introduction
Boundaries and dimension groups of certain
graphs
The boundary of the Young graph and MacDonald
polynomials
The Plancherel measure of the symmetric group
Young diagrams in problems of analysis
References
Comments to Kerov's thesis by G. Olshanski
Additional references
Details:
Series: Translations of Mathematical Monographs,
Volume: 219
Publication Year: 2003
ISBN: 0-8218-3440-1
Paging: 201 pp.
Binding: Hardcover
ISBN: 0-201-74128-8
Copyright: 2003
Format: Paper Bound w/CD-ROM; 408 pp
Description
This primer on data mining provides an introduction
to the
principles and techniques for extracting
information from a
business-minded perspective. A basic familiarity
with the field
of data mining concepts is built and then
enhanced via 13 data
mining tutorials. Upon completion of these
tutorials, students
will be fully able to data mine. This book
is appropriate for
students of CS, MIS, and Information Technology.
Table of Contents
(Each Chapter concludes with a Chapter Summary,
Key Terms, and
Exercises.)
Preface.
I. DATA MINING FUNDAMENTALS.
1. Data Mining: A First View.
2. Data Mining: A Closer Look.
3. Basic Data Mining Techniques.
4. An Excel-Based Data Mining Tool.
II. TOOLS FOR KNOWLEDGE DISCOVERY.
5. Knowledge Discovery in Databases.
6. The Data Warehouse.
7. Formal Evaluation Techniques.
III. ADVANCED DATA MINING TECHNIQUES.
8. Neural Networks.
9. Building Neural Networks with iDA.
10. Statistical Techniques.
11. Specialized Techniques.
IV. INTELLIGENT SYSTEMS.
12. Rule-Based Systems.
13. Managing Uncertainty in Rule-Based Systems.
14. Intelligent Agents.
Appendix.
Bibliography.
ISBN: 0-201-79644-9
Copyright: 2004
Format: Paper; 496 pp
Description
Distributed Computing provides an introduction
to the core
concepts and principles of distributed programming
techniques. It
takes a ghow-toh approach where students
learn by doing.
Designed for students familiar with Java,
the book covers
programming paradigms, protocols, and application
program
interfaces (API's), including RMI, COBRA,
IDL, WWW, and SOAP.
Each chapter introduces a paradigm and/or
protocol, and then
presents the use of a DPI that illustrates
the concept. The
presentation uses narrative, code examples,
and diagrams designed
to explain the topics in a manner that is
clear and concise. End
of chapter exercises provide analytical as
well as hands-on
exercises to prompt the reader to practice
the concepts and the
use of the API covered in the chapter. Using
this text, students
will gain an understanding of, and be able
to execute, basic
distributed programming techniques used to
create network
services and network applications, including
Internet
applications.
Table of Contents
1. Introduction.
2. Interprocess Communication.
3. Distributed Computing Paradigms.
4. The Socket API.
5. The Client-server Paradigm.
6. Group Communications.
7. Distributed objects.
8. Advanced Remote Method Invocations (RMI).
9. Internet applications.
10. The Common Object Request Broker Architecture
(CORBA).
11. Internet Applications - continued.
12. Advanced Distributed Computing Paradigms.