Bauer, F.L., Munich Institute of Technology, Munich, Germany
Decrypted Secrets 2nd, rev. and extended ed.
Methods and Maxims of Cryptology
2000. XII, 470 pp. 166 figs, 16 in color, 26 tabs.
3-540-66871-3
Cryptology, for millennia a "secret science", is rapidly gaining in practical importance for the
protection of communication channels, databases, and software. Beside its role in computerized
information systems (public key systems), more and more applications within computer systems
and networks are appearing, which also extend to access rights and source file protection. The first
part of this book treats secret codes and their uses - cryptography. The second part deals with the
process of covertly decrypting a secret code - cryptanalysis - where in particular advice on
assessing methods is given. The book presupposes only elementary mathematical knowledge.
Spiced with a wealth of exciting, amusing, and sometimes personal stories from the history of
cryptology, it will also interest general readers.
Decrypted Secrets has become a standard book on cryptology. The new edition has been revised
and extended in many details.
Keywords: Cryptography, cryptanalysis, public keys, cryptosystems
Fields: Data Encryption; Coding and Information Theory; Number Theory
Written for: Scientists, students and practitioners in applied mathematics,
computer science and information technology, and the general reader
Book category: Monograph
Publication language: English
Mathsoft Incorporated, Cambridge, MA, USA (Ed.)
Mathcad 2000
Professional. The worldwide standard for technical calculations
2000. CD-ROM, with handbook approx. 400 pp.
3-540-14859-0
Award-winning Mathcad is the industry's most complete calculation, visualization and
documentation package. The Student Version of Mathcad 2000 Professional provides students with
the calculation and analytical power needed to solve the widest range of engineering, mathematical
and science problems. Excellent 3D graphing and visualization, powerful solving technology
supporting linear programming, advanced functionality and programming routines, automatical
documentation of your work, built-in web connection, seamlessly working with other Windows
applications like Excel, Word, etc. are one only few out of the broad range of features that make
Mathcad to the world's best-selling calculation software.
Keywords: Mathcad, industrial calculation, industrial visualization, industrial documentation
System requirements: Personal Computer with Pentium processor-90 or higher. Windows 95, 98,
NT 4.0 or higher. 32 MB of RAM required, 48 MB or higher recommended. At least 26 MB of disk
space (105 for full installation). CD-ROM drive, SVGA or higher graphics card and monitor. Mouse
or compatible device.
Fields: Mechanical Engineering; Symbolic Computation, Computer Algebra
Written for: Students in mechanical engineering
Book category: Application Software
Publication language: English
Berg, M.de, University of Utrecht, The Netherlands
Kreveld, M.van, University of Utrecht, The Netherlands
Overmars, M., University of Utrecht, The Netherlands
Schwarzkopf, O., Pohang University of Science and Technology, Pohang, South Korea
Computational Geometry
Algorithms and Applications 2nd rev. ed.
2000. XII, 367 pp. 370 figs.
3-540-65620-0
This well-accepted introduction to computational geometry is a textbook for high-level
undergraduate and low-level graduate courses. The focus is on algorithms and hence the book is
well suited for students in computer science and engineering. Motivation is provided from the
application areas: all solutions and techniques from computational geometry are related to
particular applications in robotics, graphics, CAD/CAM, and geographic information systems. For
students this motivation will be especially welcome. Modern insights in computational geometry are
used to provide solutions that are both efficient and easy to understand and implement. All the
basic techniques and topics from computational geometry, as well as several more advanced
topics, are covered. The book is largely self-contained and can be used for self-study by anyone
with a basic background in algorithms. In the second edition, besides revisions to the first edition, a
number of new exercises have been added.
Keywords: Computational Geometry, Robotics, Computer Graphics, CAD / CAM, Geographic
Information Systems
Fields: Math. Appl. in Computer Science; Algorithm Analysis and Problem
Complexity; Computer Graphics
Written for: Students, researchers and professionals in computer science,
mathematics and engineering
Book category: Graduate Textbook
Publication language: English
Naylor, A.W., University of Michigan, Ann Arbor, MI, USA
Sell, G.R., University of Minnesota, MN, USA
Linear Operator Theory in Engineering and Science
1st ed. 1982. 2nd printing 2000.
Approx. 665 pp. 120 figs.
0-387-95001-X
A unique introduction to the theory of linear operators on Hilbert space. The author presents the
basic facts of functional analysis in a form suitable for engineers, scientists, and applied
mathematicians. Although the Definition-Theorem-Proof format of mathematics is used, careful
attention is given to motivation of the material covered and many illustrative examples are
presented.
Contents: Preface.- Introduction.- Set-Theoretic Structure.- Topological Structure.- Algebraic
Structure.- Combined Topological and Algebraic Structure.- Analysis of Linear Operators (Compact
Case).- Analysis of Unbounded Operators.- The Hoelder, Schwartz, and Minkowski Inequalities.-
Cardinality.- Zorn's Lemma.- Integration and Measure Theory.- Probability Spaces and Stochastic
Processes.- Index of Symbols.- Index.
Series: Applied Mathematical Sciences.VOL. 40
Fields: Functional Analysis,Operator Theory; Linear and Multilinear
Algebras,Matrix Theory
Written for: Mathematicians
Book category: Monograph
Publication language: English
Spears, W.M., Naval Research Laboratory, Washington, DC, USA
Evolutionary Algorithms
The Role of Mutation and Recombination
2000. XIV, 231 pp.
3-540-66950-7
Despite decades of work in evolutionary algorithms, there remains a lot of uncertainty as to when it
is beneficial or detrimental to use recombination or mutation. This book provides a characterization
of the roles that recombination and mutation play in evolutionary algorithms. It integrates prior
theoretical work and introduces new theoretical techniques for studying evolutionary algorithms. An
aggregation algorithm for Markov chains is introduced which is useful for studying not only
evolutionary algorithms specifically, but also complex systems in general. Practical consequences
of the theory are explored and a novel method for comparing search and optimization algorithms is
introduced. A focus on discrete rather than real-valued representations allows the book to bridge
multiple communities, including evolutionary biologists and population geneticists.
Keywords: Evolutionary algorithms, genetic algorithms, recombination, mutation, Markov chains
Contents: Glossary.- Part I. Setting the Stage: Introduction.- Background.- Part II. Static
Theoretical Analyses: A Survival Schema Theory for Recombination.- A Construction Schema
Theory for Recombination.- Survival and Construction Schema Theory for Recombination.- A
Survival Schema Theory for Mutation.- A Construction Schema Theory for Mutation.- Schema
Theory: Mutation versus Recombination.- Other Static Characterizations of Mutation and
Recombination.- Part III. Dynamic Theoretical Analyses: Dynamic Analyses of Mutation and
Recombination.- A Dynamic Model of Selection and Mutation.- A Dynamic Model of Selection,
Recombination and Mutation.- An Aggregation Algorithm for Markov Chains.- Part IV. Empirical
Analyses: Empirical Validation.- Part V. Summary: Summary and Discussion.- Appendix: Formal
Computations for the Aggregation Algorithm.- Bibliography.
Series: Natural Computing Series.
Fields: Artificial Intelligence; Algorithm Analysis and Problem Complexity;
Mathematics of Computing
Written for: Computer scientists and mathematicians specializing in
evolutionary algorithms; evolutionary biologists and population geneticists;
and practitioners interested in evaluating and comparing different search and
optimization algorithms
Book category: Monograph
Publication language: English
Comtet, A., /Jolicoeur, T.,
Ouvry, S., / David, F.,(Eds.)
Ecole de Physique des Houches, France
Topological Aspects of Low Dimensional Systems
1999. XXXIV, 912 pp. 190 figs.
3-540-66909-4
The book contains the worked out lecture notes of the courses delivered at the summer school in
Les Houches. They address graduate students and are of interest for researchers as well. The book
can be used as an introduction into three closely related fields: anyons and fractional statistics,
fractional quantum Hall effect and knot theory. The theoretical papers are occasionally completed
by reports on experimental techniques, and besides of physics some application to biological
systems can be found.
Keywords: anyons, quantum Hall effect, knot theory, Chern-Simons-Theory, Spinliquids,
superconductivity, DNA-molecules
Series: Les Houches.
Fields: Mathematical Physics; Quantum Physics; Condensed Matter and
Properties of Materials
Written for: Researchers, graduate students
Book category: Proceedings
Publication language: English