JON BARWISE / University of Indiana at Bloomington
and JOHN ETCHEMENDY / Stanford University
Turing's World 3.0 for Windows
Turing's World introduces users to the key concepts in computability theory through a sequence of over 100 exercises and projects. Within minutes, users learn to build simple Turing machines using a convenient package of graphical functions. Exercises then progress through a significant portion of elementary computability theory, covering such topics as the Halting problem, the Busy Beaver function, recursive functions and undecidabirlty. Version 3.0 is an extensive revision and enhancement of earlier releases of the program,. allowing the construction of one-way and two-way finite state machines (finite automata), as well as non-deterministic Turing and finitedate machines. Special exercises allow users to expore these alternative
machines.
Contents: 1. About Turing machines; 2. Running Turing's machines; 3. Building Turing's machines; 4. Editing a state diagram; 5. Using submachines; 6. Other features of Turing's world; 7. Other kinds of machines; 8. Additional exercises and projects; Appendix: Windows termindogy;
Index.
Selling Points:
･ Over 100 exercises and projects
･ Helps the user to learn through active tutorial style learning
･ Previous versions have received excellent reviews
Subject areas : Logic, computer science
Series: Center for the Study of Language and Information Publicatl-On Lecture Notes, 63
181526887 Paperback 134pp c March 2000
RICHARD HARTLEY / General Electric, Schenectady
and ANDREW ZISSERMAN / University of Oxford
Multiple View Geometry
A basic problem in computer vision is to understand the structure of a real world scene given several images of it. Recent major developments in the theory and practice of scene reconstruction are described in detail in a unified framework. The book covers the geomethc principles and how to represent objects algebraically so
they can be computed and applied. The authors provide comprehensive background material and explain how to apply the methods and implement the algorithms directly.
Contents: Introduction; Part l. The Background: Projective Geometry, Transformations and Estimation: 1. Outline of Part I; 2. Projective geometry and transformations of 2D; 3. Projective geometry and transformations of 3D; 4. Estimation - 2D projective transforms; Part lI. Camera Geometry and Single View Geometry: 6. Outline of Part ll; 6. Camera models; 7. Camera calibration; 8. More single view geometry; Part lll. Two View Geometry: 9. Outline of Part Ill; 10. Epipolar geometry and the fundamental matrix; 1 1. 3D reconstruction and structure computations; 12. Computation of F; 13. Structure computation; 14. The case of planes; 15. AfRne epipolar geometry; Part lV. Three View Geometry: 16. Outline of Part lV; 17. The trifocal tensor; 18. Computation of T; Part V. N View Geometry: 19. Outline of Part V; 20. N-linearities; 21.
Computation of the quadrifocal tensor; 22. N-view cpmputational methods; 23. Chirality; 24. Degenerate configurations; 25. Auto-calibration; 26. Image rectification; Appendix 1. Useful formulas; Appendix 2. Tensor notation; Appendix 3. Gaussian (normal) and chi-squared distributions; Appendix 4. Numerical algorithms; Bibliography; Index.
Selling Points: .
･ Describes the geometry, algebraic representation and computational algorithms for the geometry of multiple views
･ Includes plentiful examples and illustrations. Useable for learning principles, for teaching principles and as a reference book
･ There is no other book at the moment with this scope
Subject areas : computer science (robotics, vision), engineering (robotics, vision)
Market: academic researchers, graduate students, professionals
0521 623049 Hardback 550pp March 2000
DONALD E. KNUTH
Professor Emeritus, Stanford University
Selected Papers on the Analysis of AIgorithms
Donald Knuth's influence in computer science ranges from the invention of methods for translating and defining programming languages to the creation of the TeX and METAFONT systems for desktop publishing. The present volume is devoted to an important subfield of Computer Science that Knuth founded in the 1960s and still considers his main life's work. This field, to which he gave the name Analysis of Algorithms, deals with quantitative studies of computer techniques, leading to methods for understanding and predicting the efficiency of computer programs.
Contents: 1. An almost linear recurrence; 2. The problem of compatible representatives; 3. The analysis of algorithms; 4. Mathematical analysis of algorithms; 5. The average height of planted plane trees,. 6. An experiment in optimal sorting: 7. Shellsort with three increments; 8. The dangers of computer science theory; 9. Optimum measurement points for program frequency counts; 10. Ordered Hash tables; 1 1. Recurrence relations based on minimization; 12. Estimating the efficiency of backtrack programs; 13. An analysis of alpha-beta pruning; 14. Linear probing and graphs; 15. Activity in an interleaved memory-, 16. Notes on generalized Dedekind sums; 17. AnalysI'S Of the subtractive algorithm for greatest common divisors; 18. Complexity results for bandwidth minimization; 19. Analysis of a simple factorization algorithm; 20. The complexity of nonuniform random number generation; 21 , A trivial algorithm whose analysis isn't; 22. Evaluation
of Porter's constant; 23. The expectant linearity of a simple equivalence algorithm; 24. Deletions that preserve randomness; 25. The average time for carry propogation; 26. A temlinological proposal; 27. An analysis of optimum caching; 28. Optimal prepaging and font caching', 29. The distribution of continued fraction approximations; 30. The toilet paper problem; 31. A recurrence related to trees; 32. Stable husbands; 33. Postscript about NP-hard problems; 34. Nested satisfiabirlty; 35. Textbook examples of recursion; 36. An exact analysis of stable allocation; 37. Big omicron and big omega and big theta.
Selling Points:
･ The field covered in this book, the analysis ofalgorithms, was founded by the author
･ Basic concepts and techniques explored in this book still used by computer Science
･ The analysis of algon'thms is the unifying theme underlyl-ng Knuth's well-known books The Art of Computer Programming.
Subject areas :computer science, mathematics, logic
Market: undergraduate students, academic researchers
Series: Center for the Study of Language and Information Publication Lecture Notes, 102
1575862115 Hardback 134pp March 2000
1575862123 Paperback 134pp March 2000
ANDREW LIDDLE / lmperiaI College, London
and DAVID LYTH / University of Lancaster
Cosmological Inflation and Large Scale Structure
A thorough and up-to-date introduction to l'nflationary cosmology - currently the most promising theory for the origin of structure in the Universe. Enormous progress has been made in this area in the last few years and this book is the first to provide a modern and unified overview. lt covers all aspects of the theory and compares predictions with the latest observations. With the host of international experiments currently underway this area promises to be one of the most fruitful topics of research in science in the next decade.
Contents: 1. lntroduction; 2. The hot Big Bang cosmology; 3. Inflation; 4. The simplest model for the origin of structure l; 5. The simplest model for the origin of structure ll; 6. Extensions to the smplest model; 7. Scalar Relds and the vacuum fluctuation; 8. Building and testing models of inflation; 9. The cosmic microwave background; 10. Galaxy motions and clustering; 11. The Quasi-Linear regime; 12. Putting observations together; 13. Outlook for the future; 14. Advanced topic: cosmological Perturbation theory; 15. Advanced topic: diffusion and free streaming; Index.
Selling Points:
･The first book to provide a unified and accessible introduction to an area of research that has exploded in the last 6 years
･ An ideal introduction for graduate students to what promises to be one of the most exciting and fruitful topics of research in science in the next decade
･ lncludes problems at the end of each chapter, and numerical answers and helpful hints at the end ofthe book
Subject areas : astrophysics, cosmology, theoretical physics, particle physics, applied mathematics
Market: graduate students, academic researchers ,
0521 66022X Hardback 430pp March2000 66 line diagrams 1,0 tables
0521 575982 Paperback 430pp March2000
SHAHN MAJID
University of Cambridge
Foundations of Quantum Group Theory
ペーパー版出来
Now in paperback, this graduate level text for theoretical physicists and mathematicians systematically lays out the foundations for the subject of Quantum Groups in a clear and accessible style. This is a comprehensive introduction to an exciting new area, from an internationally respected researcher in the field. Explicit proofs and many examples allow the reader to pick up the techniques need for working in this exciting new field.
書評-". a coherent, detailed path through the field, with full, followable proofs and clear, readable explanations. lt is a pleasure to follow this path with a guide who, unlike many mathematical authors, does not shirk his duty to write, and who shares with his readers his general understanding of and above all his enthusiasm for his subject: Tony Sudbery, Bulletin of the London Mathematical Society
Contents: Introduction; 1. Definition of Hopf algebras; 2. Quasitriangular Hopf algebras; 3, Quantum enveloping algebras; 4. Matrix quantum groups; 5. Quantum random walks and combinatorics; 6. Bicrossproduct Hopf algebras; 7. Quantum double and double cross products; 8. Lie algebras and Poisson brackets; 9. Representation theory; 10. Braided groups and q-deformation; References; Index.
,
Selling Points:
･ Comprehensive introduction to an exciting new area
･ Accessible to both physicists and mathematicians
･ Internationally respected author who is known well on both sides of the physics/mathematics divide
Subject areas : theoretical physics, applied mathematics
Market: academic researchers, graduate students
0521 64868 8 Paperback 430pp March 2000
S. Kusuoka, Graduate School of Mathematical Sciences, University of Tokyo, Tokyo, Japan
T. Maruyama, Department of Economics, Keio University, Tokyo, Japan (Eds.)
Advances in Mathematical Economics, VoL2
2000年出版 162頁 ハードカバー \6,000 ISBN 4-431-70278-4
本書は、1997年に国際的な数理経済学研究者グループとして結成された「数理経済学研究センター」の協力のも とに，年1回の割合で刊行されるシリーズ“数理経済学の進歩”の第2巷である。数学的推論の経済理論への応用，解析・代数学・幾何学，確率論などの数学的手法と経済理論，数学的研究成果の経済理論への応用，数理経済学 の歴史的研究などのトピックスに関する重要な研究成果が収録され数理経済学研究の現状が論じられている。
なお，上記シリーズは，新しい立場から経済現象の数学的解明をめざす経済学書と，経済理論における有効な数 学的手法の開発と応用を追求する数学者を対象に，数理経済学の最新成果を扱っている。
理論経済学，数学両分野の専門家，大学院学生におすすめする。
●収載論文は下記のとおり。
S.V. Anoulova, I.V. Evs.tingneev, V.M. Gundlach
Turnpike theorems for positive multivalued stochastic operators
C. Casiaing, A.G. Ibrahim
Functional differential indusion on closed sets in Banach spaces
T. Ichiishi, S. Koray
Job matching: a multiirincipal. multi-agent model
S. Kusuoka
Term structure and SPDE
K.Urai
Fixed point theorerems and the existence of economic equilibraia based on conditions for local directions of
mappings.
A, Yamazaki
Efficiency of stochastic transfers in a directed graph
A.J. Zaslavski
Allocations of labour resources on trajectories for the model with discrete innovations
Subjec Index .
下記もお取り揃え下さい。
Advances in MathematicaI Economics, Vol. 1
1999出版 140頁 ハードカバー \6,300 lSBN 4-431-70251-2