- Email: [email protected]
Concurrency in Ada (second edition)
BOOK REPORTS
123
Diqital Siqnal Processmq Alqorithms: Number Theortl, Convolution, Fast Fourier Transforms, and Applications. By Hm'i Krishna Garg. CRC Press, Boca Raton, FL. (1998). 637 pages. $79.95; DM 166.00, 6S 1.212.00, skY 150.00, GBP 64.00. contents: 1. Introduction. I. Computational number theory. Thoughts on Part I. 2. Computational number theory. 3. Polynomial algebra. 4. Theoretical aspects of the discrete Fourier transform and convolution. 5. Cyclotomic polynomial factorization and associated fields. 6. Cyclotomic polynomial factorization in finite fields. 7. Finite integer rings: Polynomial algebra and cyclotomic facorization. II. Convolution algorithms. Thoughts on Part II. 8. Fast algorithms for acyclic convolution. 9. Fast one-dimensional cyclic convolution algorithms. 10. Two- and higher-dimensional cyclic convolution algorithms. 11. Validity of fast algorithms over different number systems. 12. Fault tolerance for integer sequences. III. Fast Fourier transform (FFT) algorithms. Thoughts on Part III. 13. Fast Fourier transform: One-dimensional data sequences. 14. Fast Fourier transform: Multidimensional data sequences. IV. Recent results on algorithms in finite integer rings. Thoughts on Part IV. Paper one: A number theoretic approach to fast algorithms for two-dimensional digital signal processing in finite integer rings. Paper two: On fast algorithms for one-dimensional digital signal processing in finite integer and complex integer rings. Paper three: Cyclotomic polynomial factorization in finite integer rings with applications to digital signal processing. Paper four: Error control techniques for data sequences defined in finite integer rings. Appendices. A. Small length acyclic convolution algorithms. B. Classification of cyclotomic polynomials. Index. Aloorithmic Geometru. Jean-Daniel Boissonnat and Mariette Yvinec. Cambridge University Press, New York. (1998). 519 pages. $95.00 (hardback), $39.95 (paperback). Contents: Preface. Translator's preface. Acknowledgments. I. Algorithmic tools. 1. Notions of complexity. 2. Basic data structures. 3. Deterministic methods used in geometry. 4. Random sampling. 5. Randomized algorithms. 6. Dynamic randomized algorithms. II. Convex hulls. 7. Polytopes. 8. Incremental convex hulls. 9. Convex hulls in two and three dimensions. 10. Linear programming. III. Triangulations. 11. Complexes and triangulations. 12. Triangulations in dimension 2. 13. Triangulations in dimension 3. IV. Arrangements. 14. Arrangements of hyperplanes. 15. Arrangements of line segments in the plane. 16. Arrangements of triangles. V. Voronoi diagrams. 17. Euclidean metric. 18. Non-Euclidean metrics. 19. Diagrams in the plane. References. Notation. Index. Concurrenc~ in Ads (Second edition). By Alan Burns and Andy Wellings. Cambridge University Press, New York. (1998). 390 pages. $32.95. Contents: Foreword to the first edition. Preface to second edition. Preface to first edition. 1. The Ada language. 2. The nature and uses of concurrent programming. 3. Inter-process communication. 4. Ada task types and objects. 5. The rendezvous. 6. The select statement and the rendezvous. 7. Protected objects and dat~-oriented communication. 8. Avoidance synchronisation and the requene facility. 9. Using protected objects as building blocks. 10. Exceptions, abort and asynchronous transfer of control. 11. Tasking and systems programming. 12. Realtime programming. 13. Object-oriented programming and tasking. 14. Distributed systems. 15. Conclusion. References. Index. Fast Parallel Aleorithms for Graph Matchina Problems. By Marek Karpinski and Wojciech Rytter. Clarendon Press, Oxford. (1998). 212 pages. $65.00. Contents: 1. Introduction. 2. Combinatorial tools. 3. Three sequential algorithms. 4. Probabilistic tools. 5. Algebraic tools. 6. Maximum cardinality matchings. 7. Inclusion maximal matchings. 8. Maximal independent sets. 9. Four easy subclasses of graphs. 10. Families of intervals. 11. Parallel algorithms for f-matchings. 12. Parallelization of sequential algorithms. 13. Pfaflians, counting the number of matchings, and plannar graphs. 14. Basic applications of parallel matching. 15. More applications. Bibliography. Index. Reasoninq with the In,hire: ~ the Closed World to the Mathematical Universe. By Michel Blay (Translated by M. B. DeBevoise). University of Chicago Press, Chicago. (1998). 216 pages. $30.00; £25.95. Contents: Translator's note. Introduction. I. Infinity eliminated; or, Huygen's theory of the motion of heavy bodies. 1. Establishing the general fact of gravity. 2. Mathematical speculations about curvilinear falls. 3. The deductive scheme of the science of motion of heavy bodies. II. First and last ratios in the Newtonian theory of central forces. 1. The construction of circular motion. 2. Mechanist interlude: Centrifugal force and weight. 3. The deductive scheme of Newton's Principia. III. The science of motion in the workshops of infinity. 1. Satisfying reason. 2. Ratios of the beginnings, ends, and continuous evolution of motions. IV. Motion algorithmized. 1. Introduction and import of the Leibnizian calculus. 2. The new algorithmic science of motion. Epilogue: Fontenelle and the reasons of infinity. 1. The mathematics of infinity. 2. Mathematical physics and the rationalization of infinites. Notes. Bibliography. Index.
123
Diqital Siqnal Processmq Alqorithms: Number Theortl, Convolution, Fast Fourier Transforms, and Applications. By Hm'i Krishna Garg. CRC Press, Boca Raton, FL. (1998). 637 pages. $79.95; DM 166.00, 6S 1.212.00, skY 150.00, GBP 64.00. contents: 1. Introduction. I. Computational number theory. Thoughts on Part I. 2. Computational number theory. 3. Polynomial algebra. 4. Theoretical aspects of the discrete Fourier transform and convolution. 5. Cyclotomic polynomial factorization and associated fields. 6. Cyclotomic polynomial factorization in finite fields. 7. Finite integer rings: Polynomial algebra and cyclotomic facorization. II. Convolution algorithms. Thoughts on Part II. 8. Fast algorithms for acyclic convolution. 9. Fast one-dimensional cyclic convolution algorithms. 10. Two- and higher-dimensional cyclic convolution algorithms. 11. Validity of fast algorithms over different number systems. 12. Fault tolerance for integer sequences. III. Fast Fourier transform (FFT) algorithms. Thoughts on Part III. 13. Fast Fourier transform: One-dimensional data sequences. 14. Fast Fourier transform: Multidimensional data sequences. IV. Recent results on algorithms in finite integer rings. Thoughts on Part IV. Paper one: A number theoretic approach to fast algorithms for two-dimensional digital signal processing in finite integer rings. Paper two: On fast algorithms for one-dimensional digital signal processing in finite integer and complex integer rings. Paper three: Cyclotomic polynomial factorization in finite integer rings with applications to digital signal processing. Paper four: Error control techniques for data sequences defined in finite integer rings. Appendices. A. Small length acyclic convolution algorithms. B. Classification of cyclotomic polynomials. Index. Aloorithmic Geometru. Jean-Daniel Boissonnat and Mariette Yvinec. Cambridge University Press, New York. (1998). 519 pages. $95.00 (hardback), $39.95 (paperback). Contents: Preface. Translator's preface. Acknowledgments. I. Algorithmic tools. 1. Notions of complexity. 2. Basic data structures. 3. Deterministic methods used in geometry. 4. Random sampling. 5. Randomized algorithms. 6. Dynamic randomized algorithms. II. Convex hulls. 7. Polytopes. 8. Incremental convex hulls. 9. Convex hulls in two and three dimensions. 10. Linear programming. III. Triangulations. 11. Complexes and triangulations. 12. Triangulations in dimension 2. 13. Triangulations in dimension 3. IV. Arrangements. 14. Arrangements of hyperplanes. 15. Arrangements of line segments in the plane. 16. Arrangements of triangles. V. Voronoi diagrams. 17. Euclidean metric. 18. Non-Euclidean metrics. 19. Diagrams in the plane. References. Notation. Index. Concurrenc~ in Ads (Second edition). By Alan Burns and Andy Wellings. Cambridge University Press, New York. (1998). 390 pages. $32.95. Contents: Foreword to the first edition. Preface to second edition. Preface to first edition. 1. The Ada language. 2. The nature and uses of concurrent programming. 3. Inter-process communication. 4. Ada task types and objects. 5. The rendezvous. 6. The select statement and the rendezvous. 7. Protected objects and dat~-oriented communication. 8. Avoidance synchronisation and the requene facility. 9. Using protected objects as building blocks. 10. Exceptions, abort and asynchronous transfer of control. 11. Tasking and systems programming. 12. Realtime programming. 13. Object-oriented programming and tasking. 14. Distributed systems. 15. Conclusion. References. Index. Fast Parallel Aleorithms for Graph Matchina Problems. By Marek Karpinski and Wojciech Rytter. Clarendon Press, Oxford. (1998). 212 pages. $65.00. Contents: 1. Introduction. 2. Combinatorial tools. 3. Three sequential algorithms. 4. Probabilistic tools. 5. Algebraic tools. 6. Maximum cardinality matchings. 7. Inclusion maximal matchings. 8. Maximal independent sets. 9. Four easy subclasses of graphs. 10. Families of intervals. 11. Parallel algorithms for f-matchings. 12. Parallelization of sequential algorithms. 13. Pfaflians, counting the number of matchings, and plannar graphs. 14. Basic applications of parallel matching. 15. More applications. Bibliography. Index. Reasoninq with the In,hire: ~ the Closed World to the Mathematical Universe. By Michel Blay (Translated by M. B. DeBevoise). University of Chicago Press, Chicago. (1998). 216 pages. $30.00; £25.95. Contents: Translator's note. Introduction. I. Infinity eliminated; or, Huygen's theory of the motion of heavy bodies. 1. Establishing the general fact of gravity. 2. Mathematical speculations about curvilinear falls. 3. The deductive scheme of the science of motion of heavy bodies. II. First and last ratios in the Newtonian theory of central forces. 1. The construction of circular motion. 2. Mechanist interlude: Centrifugal force and weight. 3. The deductive scheme of Newton's Principia. III. The science of motion in the workshops of infinity. 1. Satisfying reason. 2. Ratios of the beginnings, ends, and continuous evolution of motions. IV. Motion algorithmized. 1. Introduction and import of the Leibnizian calculus. 2. The new algorithmic science of motion. Epilogue: Fontenelle and the reasons of infinity. 1. The mathematics of infinity. 2. Mathematical physics and the rationalization of infinites. Notes. Bibliography. Index.