Eduard Feireisl, Mathematical Institute of the Academy of Sciences of the Czech Republic

Dynamics of Viscous Compressible Fluids

0-19-852838-8
Hardback
Publication date: December 2003
260 pages, 234mm x 156mm
Series: Oxford Lecture Series in Mathematics and Its Applications

Timely text from a leading researcher
Presents a complete mathematical theory for the full system of the Navier-Stokes equations of viscous, compressible and heat conducting fluids
Highlights the most recent theoretical developments in a way which is accessible even to non-specialists in the field
Contains new proofs of known results
Extensive bibliography

Description

A timely research text by a leading academic on the mathematical theory of viscous compressible fluids. Containing the most recent results in the field, described in a clear self-contained manner, it is aimed at research mathematicians, theoretical physicists, engineers and graduate students.

Readership: Researchers and graduate students in mathematics, theoretical physics, and engineering.

Contents/contributors
1 Physical background
2 Mathematical preliminaries
3 A priori estimates
4 Variational solutions
5 Pressure and temperature estimates
6 Fundamental ideas
7 Global existence

James A. Anderson, University of South Carolina-Spartanburg

Discrete Mathematics with Combinatorics, 2/E

ISBN: 0-13-045791-4
Publisher: Prentice Hall
Copyright: 2004
Format: Paper; 928 pp
Published: 08/19/2003
Spring 2004 Classes!

Description
For one-/two- semester, freshman courses in Discrete Mathematics.

This carefully organized, very readable text covers every essential topic in discrete mathematics in a logical fashion. Placing each topic in context, it covers concepts associated with discrete mathematical systems that have applications in computer science, engineering, and mathematics. The author introduces more basic concepts at the freshman level than are found in other texts, in a simple, accessible form. Introductory material is balanced with extensive coverage of graphs, trees, recursion, algebra, theory of computing, and combinatorics. Extensive examples throughout the text reinforce concepts.

Table of contentes


William Stallings

Computer Networking with Internet Protocols

ISBN: 0-13-141098-9
Copyright: 2004
Format: Cloth; 656 pp
ISBN: 0-13-191155-4
Format:Soft; 656 pp
Published: 09/10/2003

Description

For undergraduate or graduate-level courses in Computer Networks, Internet Technology, Computer Communications and Networks, and Data Communications and Networks in the departments of Computer Science, Computer Engineering, Electrical Engineering, or Information Science and Engineering.

Building on the strength of his two other successful texts, Stallings' new text provides a fresh gTop Downh and comprehensive gTop Downh survey of the entire field of computer networks and Internet technology?including an up-to-date report of leading-edge technologies. It emphasizes both the fundamental principles as well as the critical role of performance in driving protocol and network design. The basic themes of principles, design approaches, and standards throughout the text unify the discussion.

Table of Contents


Kellerer, Hans, Pferschy, Ulrich, Pisinger, David

Knapsack Problems

2004, XX, 546 p. 105 illus., Hardcover
ISBN: 3-540-40286-1
Due: November 25, 2003

About this book

This book provides a full-scale presentation of all methods and techniques available for the solution of the Knapsack problem. This most basic combinatorial optimization problem appears explicitly or as a subproblem in a wide range of optimization models with backgrounds such diverse as cutting and packing, finance, logistics or general integer programming. This monograph spans the range from a comprehensive introduction of classical algorithmic methods to the unified presentation of the most recent and advanced results in this area many of them originating from the authors. The chapters dealing with particular versions and extensions of the Knapsack problem are self-contained to a high degree and provide a valuable source of reference for researchers. Due to its simple structure, the Knapsack problem is an ideal model for introducing solution techniques to students of computer science, mathematics and economics. The first three chapters give an in-depth treatment of several basic techniques, making the book also suitable as underlying literature for courses in combinatorial optimization and approximation.

Table of contents

Introduction.- Basic Algorithmic Concepts.- Advanced Algorithmic Concepts.- The Subset Sun Problem.- Exact Solution of the Knapsack Problem.- Approximation Algorithms for the Knapsack Problem.- The Bounded Knapsack Problem.- The Unbounded Knapsack Problem.- Multidimensional Knapsack Problems.- Multiple Knapsack Problems.- The Multiple-Choice Knapsack Problem.- The Quadratic Knapsack Problem.- Other Knapsack Problems.- Stochastic Aspects of Knapsack Problems.- Some Selected Applications.- Introduction to NP-Completeness of Knapsack Problems.

Hirvensalo, Mika

Quantum Computing, 2nd ed.

Series: Natural Computing Series
2004, Approx. 230 p., Hardcover
ISBN: 3-540-40704-9

About this textbook

This book is devoted to quantum computing, a new, multidisciplinary research area crossing quantum mechanics, theoretical computer science and mathematics. It contains an introduction to quantum computing as well as the most important recent results on the topic. Two famous algorithms, fast factorization and Grover search, are presented in separate chapters because these inventions are important structurally and developmentally. The presentation of the topic is uniform and computer science-oriented. Thus, the book differs from most of the previous ones which are mainly physics-oriented. The special style of presentation makes the theory of quantum computing accessible to a larger audience, including also the mathematics-oriented oriented readers. Many examples and exercises ease the understanding. In this edition new perspectives on quantum information have been added, and numerous corrections, amendments and extensions have been incorporated throughout the text.

Table of contents

Introduction.- Quantum Information.- Devices for Computation.- Fast Factorization.- Finding the Hidden Subgroup.- Grover's Search Algorithm.- Complexity Lower Bounds for Quantum Circuits.- Appendix A: Quantum Physics.- Appendix B: Mathematical Background.- References.- Index.

Straughan, Brian

The Energy Method, Stability, and Nonlinear Convection,2nd ed.

Series: Applied Mathematical Sciences , Vol. 91

2003, XII, 242 p. 30 illus., Hardcover
ISBN: 0-387-00453-X

About this book

This volume is a substantially revised new edition of the earlier book of the same title. Six new chapters (14-19) deal with topics of current interest: multi-component convection diffusion, convection in a compressible fluid, convenction with temperature dependent viscosity and thermal conductivity, penetrative convection, nonlinear stability in ocean circulation models, and numerical solution of eigenvalue problems. The book presents convection studies in a variety of fluid and porous media contexts. It begins at an elementary level and should be accessible to a wide audience of applied mathematicians, physicists, and engineers.

Written for:

Researchers and graduate students in applied mathematics, physics, and engineering