C.R. Leedham-Green, Professor of Pure Mathematics, Queen Mary, University of London,
S. McKay, School of Mathematical Sciences, Queen Mary, University of London
The Structure of Groups of Prime Power Order
0-19-853548-1
Publication date: 28 February 2002
Clarendon Press 324 pages, none, 234mm x 156mm
Series: London Mathematical Society Monographs
First account of the modern theory of finite p-groups
Introduces important material on cohmology of groups, spectral sequences, and representation theory
Develops the theory of pro-p groups
New material on the Nottingham and Grigorchuk groups
Exercises provided throughout
Description
An important monograph summarising the development of a classification system fo finite p-groups.
Readership: Researchers in group theory
Contents/contributors
1 Preliminaries
2 New groups from old
3 p-groups of maximal class
4 Finite p-groups acting uniserially
5 Lie Methods
6 The proof of Conjecture A
7 Pro-p-groups
8 Constructing finite p-groups
9 Homological algebra
10 Uniserial p-adic space groups
11 The structure of finite p-groups
12 Beyond coclass
Bibliography
Symbol index
index
Franz J. Vesely
Institute of Experimental Physics, University of Vienna, Austria
Computational Physics
An Introduction: Second Edition
The essential point in computational physics is not the use of machines, but the systematic application of numerical techniques in place of, and in addition to, analytical methods, in order to render accessible to computation as large a part of physical reality as possible.
The various available techniques, disparate as they may seem, are traced back to only three main methodological sources; finite difference calculus, linear algebra, and stochastics. Each algorithm is carefully introduced and every computational tool is explained in terms of fundamental numerical techniques. Examples from statistical mechanics, quantum mechanics, and hydrodynamics are employed to bridge the gap between basic methodology and modern research.
This second edition of Franz Vesely's renowned textbook takes into account the new vistas that have opened up recently in this rapidly evolving field. Furthermore, web-based sample programs augment the text.
Contents
I. The Three Pillars of Computational Physics. 1. Finite Differences. 2. Linear Algebra. 3. Stochastics. II. Everything Flows. 4. Ordinary Differential Equations. 5. Partial Differential Equations. III. Anchors Aweigh. 6. Simulation and Statistical Mechanics. 7. Quantum Mechanical Simulation. 8. Hydrodynamics. Appendix. A. Machine Errors. B. Discrete Fourier Transformation. References. Index.
Hardbound, ISBN 0-306-46631-7
September 2001 , 278 pp.
Branislav Kisacanin / Delphi Delco Electronics Systems, Kokomo, IN, USA
Gyan C. Agarwal / University of Illinois at Chicago, USA
Linear Control Systems
With Solved Problems and MATLAB Examples
Book Series: UNIVERSITY SERIES IN MATHEMATICS
Anyone seeking a gentle introduction to the methods of modern control theory and engineering, written at the level of a first-year graduate course, should consider this book seriously. It contains:
A generous historical overview of automatic control, from Ancient Greece to the 1970s, when this discipline matured into an essential field for electrical, mechanical, aerospace, chemical, and biomedical engineers, as well as mathematicians, and more recently, computer scientists;
A balanced presentation of the relevant theory: the main state-space methods for description, analysis, and design of linear control systems are derived, without overwhelming theoretical arguments;
Over 250 solved and exercise problems for both continuous- and discrete-time systems, often including MATLAB simulations; and
Appendixes on MATLAB, advanced matrix theory, and the history of mathematical tools such as differential calculus, transform methods, and linear algebra.
Another noteworthy feature is the frequent use of an inverted pendulum on a cart to illustrate the most important concepts of automatic control, such as:
Linearization and discretization;
Stability, controllability, and observability;
State feedback, controller design, and optimal control; and
Observer design, reduced order observers, and Kalman filtering.
Most of the problems are given with solutions or MATLAB simulations. All MATLAB programs from the book are available on the enclosed CD. Whether the book is used as a textbook or as a self-study guide, the knowledge gained from it will be an excellent platform for students and practising engineers to explore further the recent developments and applications of control theory.
Contents
Foreword. Preface. I: Theory of linear control systems. 1. Historical overview of automatic control. 2. Modern control theory. II: Solved problems. 3. Continuous linear systems. 4. Discrete linear systems. 5. Exercise problems. III: Appendixes. Bibliography. Index.
Kluwer Academic/Plenum Publishers
Hardbound, ISBN 0-306-46743-7
December 2001 , 396 pp.
Rajat P. Garg / Ilya Sharapov
Techniques for Optimizing Applications:
High Performance Computing
Copyright 2002, 662 pp.
Paper format
ISBN 0-13-093476-3
Preface
This book is a practical guide to optimizing performance of computationally intensive applications on Sun UltraSPARC platforms. It offers techniques for improving performance of applications that are predominantly compute-intensive or CPU-bound.
We wrote this book with a general enough scope so that it would be useful to as many developers of technical applications on Sun platforms as possible. Also, we made the material practical by showing developers how to use each optimization method.
For information on related topics such as system configuration and tuning, or improving the I/O and network performance, we refer readers to other resources.
This book differs from other books and technical documents written aboutperformance optimization of high performance computing (HPC) applications. In many cases, other resources either give a detailed description of a product or provide general recommendations that are sometimes difficult to apply to practical tasks. In addition, some older resources are not as useful because of changes in technology.
Though many of the techniques we offer apply to other platforms, we limited the scope of this guide to Sun compilers and UltraSPARC-based Solaris systems. We address new features in Sun compilers and in the Solaris Operating Environment, and we show readers how to use these products to get maximum performance on Sun hardware.
Wade Trappe / Lawrence C. Washington
both of University of Maryland
Introduction to Cryptography with Coding Theory
Copyright 2002, 504 pp.
Cloth format
ISBN 0-13-061814-4
Features
Up-to-date.
Covers AES (Rijndael), e-commerce, elliptic curves, and quantum cryptography.
Flexible organization?Each chapter is modular and can be covered in any order.
Computer examples included in Appendix?Using Mathematica, Maple, MATLAB, these examples explain how to do computations and demonstrate important concepts. They can also be downloaded from the companion website.
Full chapter on error correcting codes?Allows professors to introduce the basic elements of coding theory.
top
Table of Contents
Preface.
1. Overview.
2. Classical Cryptosystems.
3. Basic Number Theory.
4. The Data Encryption Standard.
5. AES: Rijndael.
6. The RSA Algorithm.
7. Discrete Logarithms.
8. Digital Signatures.
9. E-Commerce and Digital Cash.
10. Secret Sharing Schemes.
11. Games.
12. Zero Knowledge Techniques.
13. Key Establishment Protocols.
14. Information Theory.
15. Elliptic Curves.
16. Error Correcting Codes.
17. Quantum Cryptography.
Appendix A: Mathematica.
Appendix B: Maple.
Appendix C: Matlab.
Appendix D: Further Reading.
Bibliography.
Index.