# bibtab

bibtype: book
filename: master.bib
label: Baggott:2024:QDB
author: Jim Baggott and John L. Heilbron
title: Quantum Drama from the Bohr--Einstein Debate to the Riddle of Entanglement
publisher: pub-OXFORD
address: pub-OXFORD:adr
pages: 352
year: 2024
LCCN: QC173.98 .B35 2024
bibdate: Mon Apr 29 11:37:22 MDT 2024
bibtimestamp: 2024.04.29 11:37:22 MDT
URL: https://global.oup.com/academic/product/quantum-drama-9780192846105?
acknowledgement: ack-nhfb
rawauthor: Jim Baggott and John L. Heilbron
rawtitle: Quantum Drama from the {Bohr--Einstein} Debate to the Riddle of Entanglement
ISBN:
0-19-284610-8 (hardcover), 0-19-193849-1, 0-19-266125-6 (e-book), 0-19-266125-6 (e-pub), OR 0192846108 (hardcover), 0191938491, 0192661256 (ebook), 0192661256 (epub),

ISBN13:
978-0-19-284610-5 (hardcover), 978-0-19-193849-8, 978-0-19-266125-8 (e-book), 978-0-19-266125-8 (e-pub), OR 9780192846105 (hardcover), 9780191938498, 9780192661258 (ebook), 9780192661258 (epub),

bibsource:
fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib; https://www.math.utah.edu/pub/tex/bib/einstein.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

TOC:
Prologue Act I: Correspondence to Complementarity 1. Mutual Admiration 2. An Honourable Funeral 3. New Ways to Calculate 4. New Ways to Think Act II: Uncertainty to Orthodoxy 5. Incompatible Conceptions 6. Measurement and Impossibility 7. EPR, Faust, and the Cat 8. Missionaries of the Copenhagen Spirit Act III: Orthodoxy to Uncertainty 9. Postwar Hostilities 10. Skirmishes in Princeton 11. Juvenile Deviationism 12. Passing the Torch Act IV: Productive Inequalities 13. The Theorem of John S. Bell 14. Bell Tests and Protests 15. While the Photons are Dancing 16. Adventures in Quantum Information 17. Where to Cut? Which Way to Go? Epilogue Acknowledgements Figure and Photo Captions/Credits Endnotes Sources

rawTOC:
Prologue \\ Act I: Correspondence to Complementarity \\ 1. Mutual Admiration \\ 2. An Honourable Funeral \\ 3. New Ways to Calculate \\ 4. New Ways to Think \\ Act II: Uncertainty to Orthodoxy \\ 5. Incompatible Conceptions \\ 6. Measurement and Impossibility \\ 7. EPR, Faust, and the Cat \\ 8. Missionaries of the Copenhagen Spirit \\ Act III: Orthodoxy to Uncertainty \\ 9. Postwar Hostilities \\ 10. Skirmishes in Princeton \\ 11. Juvenile Deviationism \\ 12. Passing the Torch \\ Act IV: Productive Inequalities \\ 13. The Theorem of John S. Bell \\ 14. Bell Tests and Protests \\ 15. While the Photons are Dancing \\ 16. Adventures in Quantum Information \\ 17. Where to Cut? Which Way to Go? \\ Epilogue \\ Acknowledgements \\ Figure and Photo Captions/Credits \\ Endnotes \\ Sources

entry:
@Book{Baggott:2024:QDB,
  author =       "Jim Baggott and John L. Heilbron",
  title =        "Quantum Drama from the {Bohr--Einstein} Debate to the
                 Riddle of Entanglement",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "352",
  year =         "2024",
  ISBN =         "0-19-284610-8 (hardcover), 0-19-193849-1,
                 0-19-266125-6 (e-book), 0-19-266125-6 (e-pub),",
  ISBN-13 =      "978-0-19-284610-5 (hardcover), 978-0-19-193849-8,
                 978-0-19-266125-8 (e-book), 978-0-19-266125-8
                 (e-pub),",
  LCCN =         "QC173.98 .B35 2024",
  bibdate =      "Mon Apr 29 11:37:22 MDT 2024",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "https://global.oup.com/academic/product/quantum-drama-9780192846105?",
  acknowledgement = ack-nhfb,
  tableofcontents = "Prologue \\
                 Act I: Correspondence to Complementarity \\
                 1. Mutual Admiration \\
                 2. An Honourable Funeral \\
                 3. New Ways to Calculate \\
                 4. New Ways to Think \\
                 Act II: Uncertainty to Orthodoxy \\
                 5. Incompatible Conceptions \\
                 6. Measurement and Impossibility \\
                 7. EPR, Faust, and the Cat \\
                 8. Missionaries of the Copenhagen Spirit \\
                 Act III: Orthodoxy to Uncertainty \\
                 9. Postwar Hostilities \\
                 10. Skirmishes in Princeton \\
                 11. Juvenile Deviationism \\
                 12. Passing the Torch \\
                 Act IV: Productive Inequalities \\
                 13. The Theorem of John S. Bell \\
                 14. Bell Tests and Protests \\
                 15. While the Photons are Dancing \\
                 16. Adventures in Quantum Information \\
                 17. Where to Cut? Which Way to Go? \\
                 Epilogue \\
                 Acknowledgements \\
                 Figure and Photo Captions/Credits \\
                 Endnotes \\
                 Sources",
}


bibtype: inproceedings
filename: master.bib
label: Bailey:1992:MPS
author: David H. Bailey
booktitle: Proceedings Supercomputing '92
title: Misleading Performance in the Supercomputing Field
publisher: pub-IEEE
address: pub-IEEE:adr
pages: 155--158
year: 1992
ISBN: 0-8186-2630-5, 0-89791-537-2 OR 0818626305, 0897915372
ISBN13: 978-0-8186-2630-2, 978-0-89791-537-3 OR 9780818626302, 9780897915373
LCCN: QA76.5 S87a 1992
bibdate: Sat Feb 12 11:55:01 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.02.12 11:55:01 ???
acknowledgement: ack-nhfb
rawauthor: David H. Bailey
rawbooktitle: Proceedings Supercomputing '92
rawtitle: Misleading Performance in the Supercomputing Field
entry:
@InProceedings{Bailey:1992:MPS,
  author =       "David H. Bailey",
  booktitle =    "Proceedings Supercomputing '92",
  title =        "Misleading Performance in the Supercomputing Field",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "155--158",
  year =         "1992",
  ISBN =         "0-8186-2630-5, 0-89791-537-2",
  ISBN-13 =      "978-0-8186-2630-2, 978-0-89791-537-3",
  LCCN =         "QA76.5 S87a 1992",
  bibdate =      "Sat Feb 12 11:55:01 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Bailey:2007:EMA
title: Experimental Mathematics in Action
publisher: pub-A-K-PETERS
address: pub-A-K-PETERS:adr
pages: xii + 322
year: 2007
ISBN: 1-56881-271-X OR 156881271X
ISBN13: 978-1-56881-271-7 OR 9781568812717
LCCN: QA8.7 .E97 2007
bibdate: Thu Oct 25 18:45:59 MDT 2007
bibtimestamp: 2007.10.25 18:45:59 MDT
URL: http://docserver.carma.newcastle.edu.au/1733/
subject: Experimental mathematics
acknowledgement: ack-nhfb
rawtitle: Experimental Mathematics in Action
author:
David H. Bailey and Jonathan M. Borwein and Neil J. Calkin and Roland Girgensohn and D. Russell Luke and Victor Moll

bibsource:
https://www.math.utah.edu/pub/bibnet/authors/b/borwein-jonathan-m.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager

TOC:
Preface / xi 1 A Philosophical Introduction / 1 1.1 Introduction / 1 1.2 Mathematical Knowledge as We View It / 1 1.3 Mathematical Reasoning / 2 1.4 Philosophy of Experimental Mathematics / 3 1.5 Our Experimental Mathodology / 11 1.6 Finding Things versus Proving Things / 15 1.7 Conclusions / 24 2 Algorithms for Experimental Mathematics I / 29 2.1 The Poetry of Computation / 29 2.2 High-Precision Arithmetic / 30 2.3 Integer Relation Detection / 31 2.4 Illustrations and Examples / 33 2.5 Definite Integrals and Infinite Series Summations / 43 2.6 Computation of Multivariate Zeta Values / 44 2.7 Ramanujan-Type Elliptic Series / 45 3 Algorithms for Experimental Mathematics II / 53 3.1 True Scientific Value / 53 3.2 Prime Number Computations / 55 3.3 Roots of Polynomials / 58 3.4 Numerical Quadrature / 61 3.5 Infinite Series Summation / 67 3.6 Apery-Like Summations / 70 4 Exploration and Discovery in Inverse Scattering / 79 4.1 Metaphysics and Mechanics / 79 4.2 The Physical Experiment / 80 4.3 The Model / 83 4.4 The Mathematical Experiment: Qualitative Inverse Scattering / 90 4.5 Current Research / 107 5 Exploring Strange Functions on the Computer / 113 5.1 What Is ``Strange''? / 113 5.2 Nowhere Differentiable Functions / 114 5.3 Bernoulli Convolutions / 126 6 Random Vectors and Factoring Integers: A Case Study / 139 6.1 Learning from Experience / 139 6.2 Integer Factorization / 140 6.3 Random Models / 143 6.4 The Main Questions / 144 6.5 Bounds / 145 6.6 Which Model Is Best? / 149 6.7 Experimental Evidence / 155 6.8 Conclusions / 158 7 A Selection of Integrals from a Popular Table / 161 7.1 The Allure of the Integral / 161 7.2 The Project and Its Experimental Nature / 163 7.3 Families and Individuals / 164 7.4 An Experimental Derivation of Wallis' Formula / 167 7.5 A Hyperbolic Example / 170 7.6 A Formula Hidden in the List / 174 7.7 Some Experiments on Valuations / 177 7.8 An Error in the Latest Edition / 184 7.9 Some Examples Involving the Hurwitz Zeta Function / 185 8 Experimental Mathematics: A Computational Conclusion / 189 8.1 Mathematicians Are a Kind of Frenchmen / 189 8.2 Putting Lessons in Action / 190 8.3 Visual Computing / 191 8.4 A Preliminary Example: Visualizing DNA Strands / 194 8.5 What Is a Chaos Game? / 195 8.6 Hilbert's Inequality and Witten's Zeta Function / 202 8.7 Computational Challenge Problems / 214 8.8 Last Words / 222 9 Exercises / 225 Exercises for Chapter 1 / 225 Exercises for Chapter 2 / 231 Exercises for Chapter 3 / 249 Exercises for Chapter 4 / 256 Exercises for Chapter 5 / 260 Exercises for Chapter 6 / 262 Exercises for Chapter 7 / 265 Exercises for Chapter 8 / 273 Additional Exercises / 280 Bibliography / 301 Index / 317

rawauthor:
David H. Bailey and Jonathan M. Borwein and Neil J. Calkin and Roland Girgensohn and D. Russell Luke and Victor Moll

rawTOC:
Preface / xi \\ 1 A Philosophical Introduction / 1 \\ 1.1 Introduction / 1 \\ 1.2 Mathematical Knowledge as We View It / 1 \\ 1.3 Mathematical Reasoning / 2 \\ 1.4 Philosophy of Experimental Mathematics / 3 \\ 1.5 Our Experimental Mathodology / 11 \\ 1.6 Finding Things versus Proving Things / 15 \\ 1.7 Conclusions / 24 \\ 2 Algorithms for Experimental Mathematics I / 29 \\ 2.1 The Poetry of Computation / 29 \\ 2.2 High-Precision Arithmetic / 30 \\ 2.3 Integer Relation Detection / 31 \\ 2.4 Illustrations and Examples / 33 \\ 2.5 Definite Integrals and Infinite Series Summations / 43 \\ 2.6 Computation of Multivariate Zeta Values / 44 \\ 2.7 Ramanujan-Type Elliptic Series / 45 \\ 3 Algorithms for Experimental Mathematics II / 53 \\ 3.1 True Scientific Value / 53 \\ 3.2 Prime Number Computations / 55 \\ 3.3 Roots of Polynomials / 58 \\ 3.4 Numerical Quadrature / 61 \\ 3.5 Infinite Series Summation / 67 \\ 3.6 Ap{\'e}ry-Like Summations / 70 \\ 4 Exploration and Discovery in Inverse Scattering / 79 \\ 4.1 Metaphysics and Mechanics / 79 \\ 4.2 The Physical Experiment / 80 \\ 4.3 The Model / 83 \\ 4.4 The Mathematical Experiment: Qualitative Inverse Scattering / 90 \\ 4.5 Current Research / 107 \\ 5 Exploring Strange Functions on the Computer / 113 \\ 5.1 What Is ``Strange''? / 113 \\ 5.2 Nowhere Differentiable Functions / 114 \\ 5.3 Bernoulli Convolutions / 126 \\ 6 Random Vectors and Factoring Integers: A Case Study / 139 \\ 6.1 Learning from Experience / 139 \\ 6.2 Integer Factorization / 140 \\ 6.3 Random Models / 143 \\ 6.4 The Main Questions / 144 \\ 6.5 Bounds / 145 \\ 6.6 Which Model Is Best? / 149 \\ 6.7 Experimental Evidence / 155 \\ 6.8 Conclusions / 158 \\ 7 A Selection of Integrals from a Popular Table / 161 \\ 7.1 The Allure of the Integral / 161 \\ 7.2 The Project and Its Experimental Nature / 163 \\ 7.3 Families and Individuals / 164 \\ 7.4 An Experimental Derivation of Wallis' Formula / 167 \\ 7.5 A Hyperbolic Example / 170 \\ 7.6 A Formula Hidden in the List / 174 \\ 7.7 Some Experiments on Valuations / 177 \\ 7.8 An Error in the Latest Edition / 184 \\ 7.9 Some Examples Involving the Hurwitz Zeta Function / 185 \\ 8 Experimental Mathematics: A Computational Conclusion / 189 \\ 8.1 Mathematicians Are a Kind of Frenchmen / 189 \\ 8.2 Putting Lessons in Action / 190 \\ 8.3 Visual Computing / 191 \\ 8.4 A Preliminary Example: Visualizing DNA Strands / 194 \\ 8.5 What Is a Chaos Game? / 195 \\ 8.6 Hilbert's Inequality and Witten's Zeta Function / 202 \\ 8.7 Computational Challenge Problems / 214 \\ 8.8 Last Words / 222 \\ 9 Exercises / 225 \\ Exercises for Chapter 1 / 225 \\ Exercises for Chapter 2 / 231 \\ Exercises for Chapter 3 / 249 \\ Exercises for Chapter 4 / 256 \\ Exercises for Chapter 5 / 260 \\ Exercises for Chapter 6 / 262 \\ Exercises for Chapter 7 / 265 \\ Exercises for Chapter 8 / 273 \\ Additional Exercises / 280 \\ Bibliography / 301 \\ Index / 317

entry:
@Book{Bailey:2007:EMA,
  author =       "David H. Bailey and Jonathan M. Borwein and Neil J.
                 Calkin and Roland Girgensohn and D. Russell Luke and
                 Victor Moll",
  title =        "Experimental Mathematics in Action",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  pages =        "xii + 322",
  year =         "2007",
  ISBN =         "1-56881-271-X",
  ISBN-13 =      "978-1-56881-271-7",
  LCCN =         "QA8.7 .E97 2007",
  bibdate =      "Thu Oct 25 18:45:59 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/borwein-jonathan-m.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://docserver.carma.newcastle.edu.au/1733/",
  acknowledgement = ack-nhfb,
  subject =      "Experimental mathematics",
  tableofcontents = "Preface / xi \\
                 1 A Philosophical Introduction / 1 \\
                 1.1 Introduction / 1 \\
                 1.2 Mathematical Knowledge as We View It / 1 \\
                 1.3 Mathematical Reasoning / 2 \\
                 1.4 Philosophy of Experimental Mathematics / 3 \\
                 1.5 Our Experimental Mathodology / 11 \\
                 1.6 Finding Things versus Proving Things / 15 \\
                 1.7 Conclusions / 24 \\
                 2 Algorithms for Experimental Mathematics I / 29 \\
                 2.1 The Poetry of Computation / 29 \\
                 2.2 High-Precision Arithmetic / 30 \\
                 2.3 Integer Relation Detection / 31 \\
                 2.4 Illustrations and Examples / 33 \\
                 2.5 Definite Integrals and Infinite Series Summations /
                 43 \\
                 2.6 Computation of Multivariate Zeta Values / 44 \\
                 2.7 Ramanujan-Type Elliptic Series / 45 \\
                 3 Algorithms for Experimental Mathematics II / 53 \\
                 3.1 True Scientific Value / 53 \\
                 3.2 Prime Number Computations / 55 \\
                 3.3 Roots of Polynomials / 58 \\
                 3.4 Numerical Quadrature / 61 \\
                 3.5 Infinite Series Summation / 67 \\
                 3.6 Ap{\'e}ry-Like Summations / 70 \\
                 4 Exploration and Discovery in Inverse Scattering / 79
                 \\
                 4.1 Metaphysics and Mechanics / 79 \\
                 4.2 The Physical Experiment / 80 \\
                 4.3 The Model / 83 \\
                 4.4 The Mathematical Experiment: Qualitative Inverse
                 Scattering / 90 \\
                 4.5 Current Research / 107 \\
                 5 Exploring Strange Functions on the Computer / 113 \\
                 5.1 What Is ``Strange''? / 113 \\
                 5.2 Nowhere Differentiable Functions / 114 \\
                 5.3 Bernoulli Convolutions / 126 \\
                 6 Random Vectors and Factoring Integers: A Case Study /
                 139 \\
                 6.1 Learning from Experience / 139 \\
                 6.2 Integer Factorization / 140 \\
                 6.3 Random Models / 143 \\
                 6.4 The Main Questions / 144 \\
                 6.5 Bounds / 145 \\
                 6.6 Which Model Is Best? / 149 \\
                 6.7 Experimental Evidence / 155 \\
                 6.8 Conclusions / 158 \\
                 7 A Selection of Integrals from a Popular Table / 161
                 \\
                 7.1 The Allure of the Integral / 161 \\
                 7.2 The Project and Its Experimental Nature / 163 \\
                 7.3 Families and Individuals / 164 \\
                 7.4 An Experimental Derivation of Wallis' Formula / 167
                 \\
                 7.5 A Hyperbolic Example / 170 \\
                 7.6 A Formula Hidden in the List / 174 \\
                 7.7 Some Experiments on Valuations / 177 \\
                 7.8 An Error in the Latest Edition / 184 \\
                 7.9 Some Examples Involving the Hurwitz Zeta Function /
                 185 \\
                 8 Experimental Mathematics: A Computational Conclusion
                 / 189 \\
                 8.1 Mathematicians Are a Kind of Frenchmen / 189 \\
                 8.2 Putting Lessons in Action / 190 \\
                 8.3 Visual Computing / 191 \\
                 8.4 A Preliminary Example: Visualizing DNA Strands /
                 194 \\
                 8.5 What Is a Chaos Game? / 195 \\
                 8.6 Hilbert's Inequality and Witten's Zeta Function /
                 202 \\
                 8.7 Computational Challenge Problems / 214 \\
                 8.8 Last Words / 222 \\
                 9 Exercises / 225 \\
                 Exercises for Chapter 1 / 225 \\
                 Exercises for Chapter 2 / 231 \\
                 Exercises for Chapter 3 / 249 \\
                 Exercises for Chapter 4 / 256 \\
                 Exercises for Chapter 5 / 260 \\
                 Exercises for Chapter 6 / 262 \\
                 Exercises for Chapter 7 / 265 \\
                 Exercises for Chapter 8 / 273 \\
                 Additional Exercises / 280 \\
                 Bibliography / 301 \\
                 Index / 317",
}


bibtype: article
filename: master.bib
label: Bailey:IJSA-5-3-63
title: The NAS Parallel Benchmarks
journal: j-IJSAHPC
volume: 5
number: 3
pages: 63--73
month: Fall
year: 1991
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawtitle: The {NAS} Parallel Benchmarks
author:
D. H. Bailey and E. Barszcz and J. T. Barton and D. S. Browning and R. L. Carter and L. Dagum and R. A. Fatoohi and P. O. Frederickson and T. A. Lasinski and R. S. Schreiber and H. D. Simon and V. Venkatakrishnan and S. K. Weeratunga

rawauthor:
D. H. Bailey and E. Barszcz and J. T. Barton and D. S. Browning and R. L. Carter and L. Dagum and R. A. Fatoohi and P. O. Frederickson and T. A. Lasinski and R. S. Schreiber and H. D. Simon and V. Venkatakrishnan and S. K. Weeratunga

entry:
@Article{Bailey:IJSA-5-3-63,
  author =       "D. H. Bailey and E. Barszcz and J. T. Barton and D. S.
                 Browning and R. L. Carter and L. Dagum and R. A.
                 Fatoohi and P. O. Frederickson and T. A. Lasinski and
                 R. S. Schreiber and H. D. Simon and V. Venkatakrishnan
                 and S. K. Weeratunga",
  title =        "The {NAS} Parallel Benchmarks",
  journal =      j-IJSAHPC,
  volume =       "5",
  number =       "3",
  pages =        "63--73",
  month =        "Fall",
  year =         "1991",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Bain:1999:EEB
author: David Haward Bain
title: Empire Express: Building the First Transcontinental Railroad
publisher: pub-PENGUIN
address: pub-PENGUIN:adr
pages: xiii + 797 + 32
year: 1999
ISBN: 0-670-80889-X, 0-14-008499-1 OR 067080889X, 0140084991
ISBN13: 978-0-670-80889-2, 978-0-14-008499-3 OR 9780670808892, 9780140084993
LCCN: HE2751 .B24 1999
bibdate: Thu May 17 07:24:45 MDT 2018
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2018.05.17 07:24:45 MDT
acknowledgement: ack-nhfb
rawauthor: David Haward Bain
rawtitle: Empire Express: Building the First Transcontinental Railroad
URL:
http://books.google.com/books?isbn=067080889X; http://lcweb.loc.gov/catdir/toc/99033375.html; http://www.booknotes.org/Watch/155004-1/David+Haward+Bain.aspx

abstract:
Chronicles the events that took place in the thirty years it took to complete the first transcontinental railroad, profiling the key players in its development, the major setbacks the workers faced, and the public objections to the railroad's completion.

subject:
Railroads; United States; History; Railroads; Spoorwegen; History; Transcontinental railroad (United States); West (U.S.); United States, West

TOC:
Part I. 1845--57 A procession of dreamers ``For all the human family'' ``Who can oppose such a work?'' ``I must walk toward Oregon'' ``The great object for which we were created'' ``An uninhabited and dreary waste'' Part II. 1860--61 Union, disunion, incorporation ``Raise the money and I will build your road'' ``There comes crazy Judah'' ``The marks left by the Donner Party'' ``The most difficult country ever conceived'' ``We have drawn the elephant'' Part III. 1863 Last of the dreamers ``Speculation is as fatal to it as secession'' ``I have had a big row and fight'' Part IV. 1864 Struggle for momentum ``First dictator of the railroad world'' ``Dancing with a whirlwind'' ``Trustees of the bounty of Congress'' Part V. 1865 The losses mount ``The great cloud darkening the land'' ``If we can save our scalps'' ``I hardly expect to live to see it completed'' Part VI. 1866 Eyeing the main chance ``Vexation, trouble, and continual hindrance'' ``The Napoleon of railways'' ``We swarmed the mountains with men'' ``Until they are severely punished'' Part VII. 1867 Hell on wheels ``Nitroglycerine tells'' ``Our future power and influence'' ``They all died in their boots'' ``There are only five of us'' Part VIII. 1868 Going for broke ``More hungry men in Congress'' ``Bring on your eight thousand men'' ``We are in a terrible sweat'' ``A man for breakfast every morning'' Part IX. 1869 Battleground and meeting ground ``A resistless power'' ``We have got done praying'' Part X. 1872--73 Scandals, scapegoats, and dodgers Epilogue: ``Trial of the innocents.'' Notes Bibliography Index

rawabstract:
Chronicles the events that took place in the thirty years it took to complete the first transcontinental railroad, profiling the key players in its development, the major setbacks the workers faced, and the public objections to the railroad's completion.

rawTOC:
Part I. 1845--57 \\ A procession of dreamers \\ ``For all the human family'' \\ ``Who can oppose such a work?'' \\ ``I must walk toward Oregon'' \\ ``The great object for which we were created'' \\ ``An uninhabited and dreary waste'' \\ Part II. 1860--61 \\ Union, disunion, incorporation \\ ``Raise the money and I will build your road'' \\ ``There comes crazy Judah'' \\ ``The marks left by the Donner Party'' \\ ``The most difficult country ever conceived'' \\ ``We have drawn the elephant'' \\ Part III. 1863 \\ Last of the dreamers \\ ``Speculation is as fatal to it as secession'' \\ ``I have had a big row and fight'' \\ Part IV. 1864 \\ Struggle for momentum \\ ``First dictator of the railroad world'' \\ ``Dancing with a whirlwind'' \\ ``Trustees of the bounty of Congress'' \\ Part V. 1865 \\ The losses mount \\ ``The great cloud darkening the land'' \\ ``If we can save our scalps'' \\ ``I hardly expect to live to see it completed'' \\ Part VI. 1866 \\ Eyeing the main chance \\ ``Vexation, trouble, and continual hindrance'' \\ ``The Napoleon of railways'' \\ ``We swarmed the mountains with men'' \\ ``Until they are severely punished'' \\ Part VII. 1867 \\ Hell on wheels \\ ``Nitroglycerine tells'' \\ ``Our future power and influence'' \\ ``They all died in their boots'' \\ ``There are only five of us'' \\ Part VIII. 1868 \\ Going for broke \\ ``More hungry men in Congress'' \\ ``Bring on your eight thousand men'' \\ ``We are in a terrible sweat'' \\ ``A man for breakfast every morning'' \\ Part IX. 1869 \\ Battleground and meeting ground \\ ``A resistless power'' \\ ``We have got done praying'' \\ Part X. 1872--73 \\ Scandals, scapegoats, and dodgers \\ Epilogue: ``Trial of the innocents.'' \\ Notes \\ Bibliography \\ Index

entry:
@Book{Bain:1999:EEB,
  author =       "David Haward Bain",
  title =        "Empire Express: Building the First Transcontinental
                 Railroad",
  publisher =    pub-PENGUIN,
  address =      pub-PENGUIN:adr,
  pages =        "xiii + 797 + 32",
  year =         "1999",
  ISBN =         "0-670-80889-X, 0-14-008499-1",
  ISBN-13 =      "978-0-670-80889-2, 978-0-14-008499-3",
  LCCN =         "HE2751 .B24 1999",
  bibdate =      "Thu May 17 07:24:45 MDT 2018",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://books.google.com/books?isbn=067080889X;
                 http://lcweb.loc.gov/catdir/toc/99033375.html;
                 http://www.booknotes.org/Watch/155004-1/David+Haward+Bain.aspx",
  abstract =     "Chronicles the events that took place in the thirty
                 years it took to complete the first transcontinental
                 railroad, profiling the key players in its development,
                 the major setbacks the workers faced, and the public
                 objections to the railroad's completion.",
  acknowledgement = ack-nhfb,
  subject =      "Railroads; United States; History; Railroads;
                 Spoorwegen; History; Transcontinental railroad (United
                 States); West (U.S.); United States, West",
  tableofcontents = "Part I. 1845--57 \\
                 A procession of dreamers \\
                 ``For all the human family'' \\
                 ``Who can oppose such a work?'' \\
                 ``I must walk toward Oregon'' \\
                 ``The great object for which we were created'' \\
                 ``An uninhabited and dreary waste'' \\
                 Part II. 1860--61 \\
                 Union, disunion, incorporation \\
                 ``Raise the money and I will build your road'' \\
                 ``There comes crazy Judah'' \\
                 ``The marks left by the Donner Party'' \\
                 ``The most difficult country ever conceived'' \\
                 ``We have drawn the elephant'' \\
                 Part III. 1863 \\
                 Last of the dreamers \\
                 ``Speculation is as fatal to it as secession'' \\
                 ``I have had a big row and fight'' \\
                 Part IV. 1864 \\
                 Struggle for momentum \\
                 ``First dictator of the railroad world'' \\
                 ``Dancing with a whirlwind'' \\
                 ``Trustees of the bounty of Congress'' \\
                 Part V. 1865 \\
                 The losses mount \\
                 ``The great cloud darkening the land'' \\
                 ``If we can save our scalps'' \\
                 ``I hardly expect to live to see it completed'' \\
                 Part VI. 1866 \\
                 Eyeing the main chance \\
                 ``Vexation, trouble, and continual hindrance'' \\
                 ``The Napoleon of railways'' \\
                 ``We swarmed the mountains with men'' \\
                 ``Until they are severely punished'' \\
                 Part VII. 1867 \\
                 Hell on wheels \\
                 ``Nitroglycerine tells'' \\
                 ``Our future power and influence'' \\
                 ``They all died in their boots'' \\
                 ``There are only five of us'' \\
                 Part VIII. 1868 \\
                 Going for broke \\
                 ``More hungry men in Congress'' \\
                 ``Bring on your eight thousand men'' \\
                 ``We are in a terrible sweat'' \\
                 ``A man for breakfast every morning'' \\
                 Part IX. 1869 \\
                 Battleground and meeting ground \\
                 ``A resistless power'' \\
                 ``We have got done praying'' \\
                 Part X. 1872--73 \\
                 Scandals, scapegoats, and dodgers \\
                 Epilogue: ``Trial of the innocents.'' \\
                 Notes \\
                 Bibliography \\
                 Index",
}


bibtype: book
filename: master.bib
label: Bak:1962:EIM
author: Borge Bak
title: Elementary Introduction to Molecular Spectra
publisher: pub-NORTH-HOLLAND
address: pub-NORTH-HOLLAND:adr
edition: Second
pages: xi + 144
year: 1962
LCCN: QC451 .B2 1962
bibdate: Sat Jul 25 13:55:27 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.07.25 13:55:27 ???
acknowledgement: ack-nhfb
rawauthor: B{\o}rge Bak
rawtitle: Elementary Introduction to Molecular Spectra
entry:
@Book{Bak:1962:EIM,
  author =       "B{\o}rge Bak",
  title =        "Elementary Introduction to Molecular Spectra",
  publisher =    pub-NORTH-HOLLAND,
  address =      pub-NORTH-HOLLAND:adr,
  edition =      "Second",
  pages =        "xi + 144",
  year =         "1962",
  LCCN =         "QC451 .B2 1962",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Bak:1966:VTG
author: Thor A. Bak and Jonas Lichtenberg
title: Vectors, Tensors, and Groups
volume: 1
publisher: pub-BENJAMIN
address: pub-BENJAMIN:adr
pages: xi + 144
year: 1966
LCCN: QA37 .B35 1967
bibdate: Wed Dec 15 15:32:13 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 15:32:13 ???
series: Mathematics for Scientists
acknowledgement: ack-nhfb
rawauthor: Thor A. Bak and Jonas Lichtenberg
rawtitle: Vectors, Tensors, and Groups
entry:
@Book{Bak:1966:VTG,
  author =       "Thor A. Bak and Jonas Lichtenberg",
  title =        "Vectors, Tensors, and Groups",
  volume =       "1",
  publisher =    pub-BENJAMIN,
  address =      pub-BENJAMIN:adr,
  year =         "1966",
  LCCN =         "QA37 .B35 1967",
  bibdate =      "Wed Dec 15 15:32:13 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Mathematics for Scientists",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Balbaert:2015:RE
author: Ivo Balbaert
title: Rust Essentials
publisher: pub-PACKT
address: pub-PACKT:adr
pages: x + 161
year: 2015
ISBN: 1-78528-213-1 OR 1785282131
ISBN13: 978-1-78528-213-3, 978-1-78528-576-9 OR 9781785282133, 9781785285769
LCCN: QA76.73.R87 B35 2015
bibdate: Tue Dec 10 05:44:53 MST 2019
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2019.12.10 05:44:53 MST
URL: http://proquest.safaribooksonline.com/9781785285769
acknowledgement: ack-nhfb
rawauthor: Ivo Balbaert
rawtitle: {Rust} Essentials
abstract:
Discover how to use Rust to write fast, secure, and concurrent systems and applications In Detail Starting by comparing Rust with other programming languages, this book will show you where and how to use Rust. It will discuss primitive types along with variables and their scope, binding and casting, simple functions, and ways to control execution flow in a program. Next, the book covers flexible arrays, vectors, tuples, enums, and structs. You will then generalize the code with higher-order functions and generics applying it to closures, iterators, consumers, and so on. Memory safety is ensured by the compiler by using references, pointers, boxes, reference counting, and atomic reference counting. You will learn how to build macros and crates and discover concurrency for multicore execution. By the end of this book, you will have successfully migrated to using Rust and will be able to use it as your main programming language. What You Will Learn Set up your Rust environment for maximum productivity Bridge the performance gap between safe and unsafe languages with Rust Use pattern matching to create flexible code Apply generics and traits to develop widely applicable code Organize your code in modules and crates Build macros to extend Rust's capabilities and reach Apply threads to tackle problems concurrently and in distributed environments Interface with C and isolate unsafe code Downloading the example code for this book. You can download the example code files for all Packt books you have purchased from your account at http://www.PacktPub.com. If you purchased this book elsewhere, you can visit http://www.PacktPub.com/support and register to have the files e-mailed directly to you.

subject:
C (Computer program language); Software engineering; C (Computer program language); Software engineering

TOC:
Preface 1: Starting with Rust The advantages of Rust The trifecta of Rust safety, speed, and concurrency Comparison with other languages Using Rust Servo Installing Rust The Rust compiler rustc Our first program Working with Cargo Developer tools Using Sublime Text Other tools Summary 2: Using Variables and Types Comments Global constants Printing with string interpolation Values and primitive types Consulting Rust documentation Binding variables to values Mutable and immutable variables Scope of a variable and shadowing Type checking and conversions Aliasing Expressions The stack and the heap Summary 3: Using Functions and Control Structures Branching on a condition Looping Functions Documenting a function Attributes Conditional compilation Testing Testing with cargo Summary 4: Structuring Data and Matching Patterns Strings Arrays, vectors, and slices Vectors Slices Strings and arrays Tuples Structs Enums Result and Option Getting input from the console Matching patterns 7: Organizing Code and Macros Modules and crates Building crates Defining a module Visibility of items Importing modules and file hierarchy Importing external crates Exporting a public interface Adding external crates to a project The test module Macros Why do we use macros? Developing macros Repetition Creating a new function Using macros from crates Summary 8: Concurrency and Parallelism Concurrency and threads Creating threads Starting a number of threads Panicking threads Thread-safety Shared mutable state The Sync trait Communication through channels Sending and receiving data Synchronous and asynchronous communication Summary 9: Programming at the Boundaries Program arguments Unsafe Raw pointers Interfacing with C Using a C library Inlining assembly code Calling Rust from other languages Summary Appendix: Exploring Further Stability of Rust and the standard library The ecosystem of crates Other resources for learning Rust Files and databases Graphics and games Web development Index

rawabstract:
Discover how to use Rust to write fast, secure, and concurrent systems and applications In Detail Starting by comparing Rust with other programming languages, this book will show you where and how to use Rust. It will discuss primitive types along with variables and their scope, binding and casting, simple functions, and ways to control execution flow in a program. Next, the book covers flexible arrays, vectors, tuples, enums, and structs. You will then generalize the code with higher-order functions and generics applying it to closures, iterators, consumers, and so on. Memory safety is ensured by the compiler by using references, pointers, boxes, reference counting, and atomic reference counting. You will learn how to build macros and crates and discover concurrency for multicore execution. By the end of this book, you will have successfully migrated to using Rust and will be able to use it as your main programming language. What You Will Learn Set up your Rust environment for maximum productivity Bridge the performance gap between safe and unsafe languages with Rust Use pattern matching to create flexible code Apply generics and traits to develop widely applicable code Organize your code in modules and crates Build macros to extend Rust's capabilities and reach Apply threads to tackle problems concurrently and in distributed environments Interface with C and isolate unsafe code Downloading the example code for this book. You can download the example code files for all Packt books you have purchased from your account at http://www.PacktPub.com. If you purchased this book elsewhere, you can visit http://www.PacktPub.com/support and register to have the files e-mailed directly to you.

rawTOC:
Preface \\ 1: Starting with Rust \\ The advantages of Rust \\ The trifecta of Rust \\ safety, speed, and concurrency \\ Comparison with other languages \\ Using Rust \\ Servo \\ Installing Rust \\ The Rust compiler \\ rustc \\ Our first program \\ Working with Cargo \\ Developer tools \\ Using Sublime Text \\ Other tools \\ Summary \\ 2: Using Variables and Types \\ Comments \\ Global constants \\ Printing with string interpolation \\ Values and primitive types \\ Consulting Rust documentation \\ Binding variables to values \\ Mutable and immutable variables \\ Scope of a variable and shadowing \\ Type checking and conversions \\ Aliasing \\ Expressions \\ The stack and the heap \\ Summary \\ 3: Using Functions and Control Structures \\ Branching on a condition \\ Looping \\ Functions \\ Documenting a function \\ Attributes \\ Conditional compilation \\ Testing \\ Testing with cargo \\ Summary \\ 4: Structuring Data and Matching Patterns \\ Strings \\ Arrays, vectors, and slices \\ Vectors \\ Slices \\ Strings and arrays \\ Tuples \\ Structs \\ Enums \\ Result and Option \\ Getting input from the console \\ Matching patterns 7: Organizing Code and Macros \\ Modules and crates \\ Building crates \\ Defining a module \\ Visibility of items \\ Importing modules and file hierarchy \\ Importing external crates \\ Exporting a public interface \\ Adding external crates to a project \\ The test module \\ Macros \\ Why do we use macros? \\ Developing macros \\ Repetition \\ Creating a new function \\ Using macros from crates \\ Summary \\ 8: Concurrency and Parallelism \\ Concurrency and threads \\ Creating threads \\ Starting a number of threads \\ Panicking threads \\ Thread-safety \\ Shared mutable state \\ The Sync trait \\ Communication through channels \\ Sending and receiving data \\ Synchronous and asynchronous communication \\ Summary \\ 9: Programming at the Boundaries \\ Program arguments \\ Unsafe \\ Raw pointers \\ Interfacing with C \\ Using a C library \\ Inlining assembly code \\ Calling Rust from other languages \\ Summary \\ Appendix: Exploring Further \\ Stability of Rust and the standard library \\ The ecosystem of crates \\ Other resources for learning Rust \\ Files and databases \\ Graphics and games \\ Web development \\ Index

entry:
@Book{Balbaert:2015:RE,
  author =       "Ivo Balbaert",
  title =        "{Rust} Essentials",
  publisher =    pub-PACKT,
  address =      pub-PACKT:adr,
  pages =        "x + 161",
  year =         "2015",
  ISBN =         "1-78528-213-1",
  ISBN-13 =      "978-1-78528-213-3, 978-1-78528-576-9",
  LCCN =         "QA76.73.R87 B35 2015",
  bibdate =      "Tue Dec 10 05:44:53 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://proquest.safaribooksonline.com/9781785285769",
  abstract =     "Discover how to use Rust to write fast, secure, and
                 concurrent systems and applications In Detail Starting
                 by comparing Rust with other programming languages,
                 this book will show you where and how to use Rust. It
                 will discuss primitive types along with variables and
                 their scope, binding and casting, simple functions, and
                 ways to control execution flow in a program. Next, the
                 book covers flexible arrays, vectors, tuples, enums,
                 and structs. You will then generalize the code with
                 higher-order functions and generics applying it to
                 closures, iterators, consumers, and so on. Memory
                 safety is ensured by the compiler by using references,
                 pointers, boxes, reference counting, and atomic
                 reference counting. You will learn how to build macros
                 and crates and discover concurrency for multicore
                 execution. By the end of this book, you will have
                 successfully migrated to using Rust and will be able to
                 use it as your main programming language. What You Will
                 Learn Set up your Rust environment for maximum
                 productivity Bridge the performance gap between safe
                 and unsafe languages with Rust Use pattern matching to
                 create flexible code Apply generics and traits to
                 develop widely applicable code Organize your code in
                 modules and crates Build macros to extend Rust's
                 capabilities and reach Apply threads to tackle problems
                 concurrently and in distributed environments Interface
                 with C and isolate unsafe code Downloading the example
                 code for this book. You can download the example code
                 files for all Packt books you have purchased from your
                 account at http://www.PacktPub.com. If you purchased
                 this book elsewhere, you can visit
                 http://www.PacktPub.com/support and register to have
                 the files e-mailed directly to you.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "C (Computer program language); Software engineering; C
                 (Computer program language); Software engineering",
  tableofcontents = "Preface \\
                 1: Starting with Rust \\
                 The advantages of Rust \\
                 The trifecta of Rust \\
                 safety, speed, and concurrency \\
                 Comparison with other languages \\
                 Using Rust \\
                 Servo \\
                 Installing Rust \\
                 The Rust compiler \\
                 rustc \\
                 Our first program \\
                 Working with Cargo \\
                 Developer tools \\
                 Using Sublime Text \\
                 Other tools \\
                 Summary \\
                 2: Using Variables and Types \\
                 Comments \\
                 Global constants \\
                 Printing with string interpolation \\
                 Values and primitive types \\
                 Consulting Rust documentation \\
                 Binding variables to values \\
                 Mutable and immutable variables \\
                 Scope of a variable and shadowing \\
                 Type checking and conversions \\
                 Aliasing \\
                 Expressions \\
                 The stack and the heap \\
                 Summary \\
                 3: Using Functions and Control Structures \\
                 Branching on a condition \\
                 Looping \\
                 Functions \\
                 Documenting a function \\
                 Attributes \\
                 Conditional compilation \\
                 Testing \\
                 Testing with cargo \\
                 Summary \\
                 4: Structuring Data and Matching Patterns \\
                 Strings \\
                 Arrays, vectors, and slices \\
                 Vectors \\
                 Slices \\
                 Strings and arrays \\
                 Tuples \\
                 Structs \\
                 Enums \\
                 Result and Option \\
                 Getting input from the console \\
                 Matching patterns 7: Organizing Code and Macros \\
                 Modules and crates \\
                 Building crates \\
                 Defining a module \\
                 Visibility of items \\
                 Importing modules and file hierarchy \\
                 Importing external crates \\
                 Exporting a public interface \\
                 Adding external crates to a project \\
                 The test module \\
                 Macros \\
                 Why do we use macros? \\
                 Developing macros \\
                 Repetition \\
                 Creating a new function \\
                 Using macros from crates \\
                 Summary \\
                 8: Concurrency and Parallelism \\
                 Concurrency and threads \\
                 Creating threads \\
                 Starting a number of threads \\
                 Panicking threads \\
                 Thread-safety \\
                 Shared mutable state \\
                 The Sync trait \\
                 Communication through channels \\
                 Sending and receiving data \\
                 Synchronous and asynchronous communication \\
                 Summary \\
                 9: Programming at the Boundaries \\
                 Program arguments \\
                 Unsafe \\
                 Raw pointers \\
                 Interfacing with C \\
                 Using a C library \\
                 Inlining assembly code \\
                 Calling Rust from other languages \\
                 Summary \\
                 Appendix: Exploring Further \\
                 Stability of Rust and the standard library \\
                 The ecosystem of crates \\
                 Other resources for learning Rust \\
                 Files and databases \\
                 Graphics and games \\
                 Web development \\
                 Index",
}


bibtype: book
filename: master.bib
label: Baldwin:2015:MNH
author: Melinda Baldwin
title: Making booktitle Nature: the History of a Scientific Journal
publisher: pub-U-CHICAGO
address: pub-U-CHICAGO:adr
pages: 309
year: 2015
ISBN: 0-226-26145-X (hardcover), 0-226-26159-X (e-book) OR 022626145X (hardcover), 022626159X (ebook)
LCCN: Q1.N23 B35 2015
bibdate: Thu Oct 31 12:19:53 MDT 2019
bibtimestamp: 2019.10.31 12:19:53 MDT
acknowledgement: ack-nhfb
rawauthor: Melinda Baldwin
rawtitle: Making {{\booktitle{Nature}}}: the History of a Scientific Journal
ISBN13:
978-0-226-26145-4 (hardcover), 978-0-226-26159-1 (e-book) OR 9780226261454 (hardcover), 9780226261591 (ebook)

bibsource:
fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/bibnet/authors/r/rutherford-ernest.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
booktitle Making `Nature' is the first book to chronicle the foundation and development of booktitle Nature, one of the world's most influential scientific institutions. Now nearing its hundred and fiftieth year of publication, booktitle Nature is the international benchmark for scientific publication. Its contributors include Charles Darwin, Ernest Rutherford, and Stephen Hawking, and it has published many of the most important discoveries in the history of science, including articles on the structure of DNA, the discovery of the neutron, the first cloning of a mammal, and the human genome. But how did booktitle Nature become such an essential institution? In booktitle Making Nature, Melinda Baldwin charts the rich history of this extraordinary publication from its foundation in 1869 to current debates about online publishing and open access. This pioneering study not only tells booktitle Nature's story but also sheds light on much larger questions about the history of science publishing, changes in scientific communication, and shifting notions of 'scientific community.' booktitle Nature, as Baldwin demonstrates, helped define what science is and what it means to be a scientist.

remark:
It was Ernest Rutherford's use of letters to the journal booktitle Nature that led to its growth as a premier venue for announcement of new scientific results. See cite [pages 30--33]Baldwin:2021:ERA

subject:
Nature (London, England); Nature (London, England); Science; Periodicals; History; Science publishing; Periodicals; Science publishing; Entwicklung; Naturwissenschaften; Wissenschaftliche Zeitschrift

TOC:
Citations and Abbreviations / vii Introduction: Who is a ``Scientist''? / 4 1: booktitle Nature's shifting audience: 1869--1875 / 21 2: booktitle Nature's contributors and the changing of Britain's scientific guard: 1872--1895 / 48 3: Defining the ``man of science'' in booktitle Nature / 74 4: Scientific internationalism and scientific nationalism / 100 5: booktitle Nature, interwar politics, and intellectual freedom / 123 6: ``It almost came out on its own'': booktitle Nature under L. J. F. Brimble and A. J. V. Gale / 145 7: booktitle Nature, the Cold War, and the rise of the United States / 170 8: ``Disorderly publication'': booktitle Nature and scientific self-policing in the 1980s / 200 Conclusion / 228 Acknowledgments / 243 Notes / 247 Bibliography / 285 Index / 301

rawabstract:
\booktitle{Making `Nature'} is the first book to chronicle the foundation and development of \booktitle{Nature}, one of the world's most influential scientific institutions. Now nearing its hundred and fiftieth year of publication, \booktitle{Nature} is the international benchmark for scientific publication. Its contributors include Charles Darwin, Ernest Rutherford, and Stephen Hawking, and it has published many of the most important discoveries in the history of science, including articles on the structure of DNA, the discovery of the neutron, the first cloning of a mammal, and the human genome. But how did \booktitle{Nature} become such an essential institution? In \booktitle{Making Nature}, Melinda Baldwin charts the rich history of this extraordinary publication from its foundation in 1869 to current debates about online publishing and open access. This pioneering study not only tells \booktitle{Nature}'s story but also sheds light on much larger questions about the history of science publishing, changes in scientific communication, and shifting notions of 'scientific community.' \booktitle{Nature}, as Baldwin demonstrates, helped define what science is and what it means to be a scientist.

rawTOC:
Citations and Abbreviations / vii \\ Introduction: Who is a ``Scientist''? / 4 \\ 1: \booktitle{Nature}'s shifting audience: 1869--1875 / 21 \\ 2: \booktitle{Nature}'s contributors and the changing of Britain's scientific guard: 1872--1895 / 48 \\ 3: Defining the ``man of science'' in \booktitle{Nature} / 74 \\ 4: Scientific internationalism and scientific nationalism / 100 \\ 5: \booktitle{Nature}, interwar politics, and intellectual freedom / 123 \\ 6: ``It almost came out on its own'': \booktitle{Nature} under L. J. F. Brimble and A. J. V. Gale / 145 \\ 7: \booktitle{Nature}, the Cold War, and the rise of the United States / 170 \\ 8: ``Disorderly publication'': \booktitle{Nature} and scientific self-policing in the 1980s / 200 \\ Conclusion / 228 \\ Acknowledgments / 243 \\ Notes / 247 \\ Bibliography / 285 \\ Index / 301

entry:
@Book{Baldwin:2015:MNH,
  author =       "Melinda Baldwin",
  title =        "Making {{\booktitle{Nature}}}: the History of a
                 Scientific Journal",
  publisher =    pub-U-CHICAGO,
  address =      pub-U-CHICAGO:adr,
  pages =        "309",
  year =         "2015",
  ISBN =         "0-226-26145-X (hardcover), 0-226-26159-X (e-book)",
  ISBN-13 =      "978-0-226-26145-4 (hardcover), 978-0-226-26159-1
                 (e-book)",
  LCCN =         "Q1.N23 B35 2015",
  bibdate =      "Thu Oct 31 12:19:53 MDT 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/r/rutherford-ernest.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "\booktitle{Making `Nature'} is the first book to
                 chronicle the foundation and development of
                 \booktitle{Nature}, one of the world's most influential
                 scientific institutions. Now nearing its hundred and
                 fiftieth year of publication, \booktitle{Nature} is the
                 international benchmark for scientific publication. Its
                 contributors include Charles Darwin, Ernest Rutherford,
                 and Stephen Hawking, and it has published many of the
                 most important discoveries in the history of science,
                 including articles on the structure of DNA, the
                 discovery of the neutron, the first cloning of a
                 mammal, and the human genome. But how did
                 \booktitle{Nature} become such an essential
                 institution? In \booktitle{Making Nature}, Melinda
                 Baldwin charts the rich history of this extraordinary
                 publication from its foundation in 1869 to current
                 debates about online publishing and open access. This
                 pioneering study not only tells \booktitle{Nature}'s
                 story but also sheds light on much larger questions
                 about the history of science publishing, changes in
                 scientific communication, and shifting notions of
                 'scientific community.' \booktitle{Nature}, as Baldwin
                 demonstrates, helped define what science is and what it
                 means to be a scientist.",
  acknowledgement = ack-nhfb,
  remark =       "It was Ernest Rutherford's use of letters to the
                 journal \booktitle{Nature} that led to its growth as a
                 premier venue for announcement of new scientific
                 results. See \cite[pages 30--33]{Baldwin:2021:ERA}",
  subject =      "Nature (London, England); Nature (London, England);
                 Science; Periodicals; History; Science publishing;
                 Periodicals; Science publishing; Entwicklung;
                 Naturwissenschaften; Wissenschaftliche Zeitschrift",
  tableofcontents = "Citations and Abbreviations / vii \\
                 Introduction: Who is a ``Scientist''? / 4 \\
                 1: \booktitle{Nature}'s shifting audience: 1869--1875 /
                 21 \\
                 2: \booktitle{Nature}'s contributors and the changing
                 of Britain's scientific guard: 1872--1895 / 48 \\
                 3: Defining the ``man of science'' in
                 \booktitle{Nature} / 74 \\
                 4: Scientific internationalism and scientific
                 nationalism / 100 \\
                 5: \booktitle{Nature}, interwar politics, and
                 intellectual freedom / 123 \\
                 6: ``It almost came out on its own'':
                 \booktitle{Nature} under L. J. F. Brimble and A. J. V.
                 Gale / 145 \\
                 7: \booktitle{Nature}, the Cold War, and the rise of
                 the United States / 170 \\
                 8: ``Disorderly publication'': \booktitle{Nature} and
                 scientific self-policing in the 1980s / 200 \\
                 Conclusion / 228 \\
                 Acknowledgments / 243 \\
                 Notes / 247 \\
                 Bibliography / 285 \\
                 Index / 301",
}


bibtype: book
filename: master.bib
label: Ball:1997:MMN
author: Philip Ball
title: Made to Measure: New Materials for the 21st Century
publisher: pub-PRINCETON
address: pub-PRINCETON:adr
pages: vii + 458
year: 1997
ISBN: 0-691-02733-1 OR 0691027331
ISBN13: 978-0-691-02733-3 OR 9780691027333
LCCN: TA403.B2247 1997
bibdate: Wed Nov 26 05:45:47 2003
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2003.11.26 05:45:47 ???
acknowledgement: ack-nhfb
rawauthor: Philip Ball
rawtitle: Made to Measure: New Materials for the {21st Century}
abstract:
This text describes how scientists are inventing thousands of materials, ranging from synthetic skin, blood and bone, to substances that repair themselves and adapt to their environment, that swell and flex like muscles, that repel any ink and paint, and that capture and store the energy from the Sun. It shows that this is being accomplished because materials are being designed for particular applications, rather than being discovered in nature or by haphazard experimentation. Linking insights from chemistry, biology and physics, with those from engineering, the book outlines the various areas in which newly-invented materials will transform our lives in the 21st century. The chapters provide vignettes from a broad range of selected areas of materials science and can be read as separate essays. The subjects include: photonic materials; materials for information storage; smart materials; biomaterials; biomedical materials; materials for clean energy; porous materials; diamond and hard materials; polymers; and surfaces and interfaces. This text describes how scientists are inventing thousands of materials, ranging from synthetic skin, blood and bone, to substances that repair themselves and adapt to their environment. It outlines how newly-invented materials will transform our lives in the 21st century.

TOC:
The art of making Light talk: photonic materials Total recall: materials for information storage Clever stuff: smart materials Only natural: biomaterials Spare parts: biomedical materials Full power: materials for clean energy Tunnel vision: porous materials Hard work: diamond and hard materials Chain reactions: the new polymers Face value: surfaces and interfaces

rawabstract:
This text describes how scientists are inventing thousands of materials, ranging from synthetic skin, blood and bone, to substances that repair themselves and adapt to their environment, that swell and flex like muscles, that repel any ink and paint, and that capture and store the energy from the Sun. It shows that this is being accomplished because materials are being designed for particular applications, rather than being discovered in nature or by haphazard experimentation. Linking insights from chemistry, biology and physics, with those from engineering, the book outlines the various areas in which newly-invented materials will transform our lives in the 21st century. The chapters provide vignettes from a broad range of selected areas of materials science and can be read as separate essays. The subjects include: photonic materials; materials for information storage; smart materials; biomaterials; biomedical materials; materials for clean energy; porous materials; diamond and hard materials; polymers; and surfaces and interfaces. This text describes how scientists are inventing thousands of materials, ranging from synthetic skin, blood and bone, to substances that repair themselves and adapt to their environment. It outlines how newly-invented materials will transform our lives in the 21st century.

rawTOC:
The art of making \\ Light talk: photonic materials \\ Total recall: materials for information storage \\ Clever stuff: smart materials \\ Only natural: biomaterials \\ Spare parts: biomedical materials \\ Full power: materials for clean energy \\ Tunnel vision: porous materials \\ Hard work: diamond and hard materials \\ Chain reactions: the new polymers \\ Face value: surfaces and interfaces

entry:
@Book{Ball:1997:MMN,
  author =       "Philip Ball",
  title =        "Made to Measure: New Materials for the {21st
                 Century}",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "vii + 458",
  year =         "1997",
  ISBN =         "0-691-02733-1",
  ISBN-13 =      "978-0-691-02733-3",
  LCCN =         "TA403.B2247 1997",
  bibdate =      "Wed Nov 26 05:45:47 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "This text describes how scientists are inventing
                 thousands of materials, ranging from synthetic skin,
                 blood and bone, to substances that repair themselves
                 and adapt to their environment, that swell and flex
                 like muscles, that repel any ink and paint, and that
                 capture and store the energy from the Sun. It shows
                 that this is being accomplished because materials are
                 being designed for particular applications, rather than
                 being discovered in nature or by haphazard
                 experimentation. Linking insights from chemistry,
                 biology and physics, with those from engineering, the
                 book outlines the various areas in which newly-invented
                 materials will transform our lives in the 21st century.
                 The chapters provide vignettes from a broad range of
                 selected areas of materials science and can be read as
                 separate essays. The subjects include: photonic
                 materials; materials for information storage; smart
                 materials; biomaterials; biomedical materials;
                 materials for clean energy; porous materials; diamond
                 and hard materials; polymers; and surfaces and
                 interfaces. This text describes how scientists are
                 inventing thousands of materials, ranging from
                 synthetic skin, blood and bone, to substances that
                 repair themselves and adapt to their environment. It
                 outlines how newly-invented materials will transform
                 our lives in the 21st century.",
  acknowledgement = ack-nhfb,
  tableofcontents = "The art of making \\
                 Light talk: photonic materials \\
                 Total recall: materials for information storage \\
                 Clever stuff: smart materials \\
                 Only natural: biomaterials \\
                 Spare parts: biomedical materials \\
                 Full power: materials for clean energy \\
                 Tunnel vision: porous materials \\
                 Hard work: diamond and hard materials \\
                 Chain reactions: the new polymers \\
                 Face value: surfaces and interfaces",
}


bibtype: book
filename: master.bib
label: Ball:2014:SRS
author: Philip Ball
title: Serving the Reich: the struggle for the soul of physics under Hitler
publisher: pub-U-CHICAGO
address: pub-U-CHICAGO:adr
pages: ix + 303
year: 2014
ISBN: 0-226-20457-X (hardcover), 0-226-20460-X (e-book) OR 022620457X (hardcover), 022620460X (ebook)
LCCN: QC773.3.G3 B35 2014
bibdate: Thu Jan 8 08:07:26 MST 2015
bibtimestamp: 2015.01.08 08:07:26 MST
acknowledgement: ack-nhfb
authordates: 1962--
subjectdates: 1858--1947; 1884--1966; 1901--1976
rawauthor: Philip Ball
rawtitle: Serving the {Reich}: the struggle for the soul of physics under {Hitler}
ISBN13:
978-0-226-20457-4 (hardcover), 978-0-226-20460-4 (e-book) OR 9780226204574 (hardcover), 9780226204604 (ebook)

bibsource:
https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager

subject:
National socialism and science; Nuclear physics; Germany; History; 20th century; World War, 1939--1945; Science; Moral and ethical aspects; 1933--1945; Planck, Max; Debye, Peter J. W (Peter Josef William); Heisenberg, Werner

TOC:
Introduction: Nobel Prize-winner with dirty hands As conservatively as possible Physics must be rebuilt The beginning of something new Intellectual freedom is a thing of the past Service to science must be service to the nation There is very likely a Nordic science You obviously cannot swim against the tide ``I have seen my death!'' As a scientist or as a man Hitherto unknown destructive power Heisenberg was mostly silent We are what we pretend to be Epilogue: We did not speak the same language

rawTOC:
Introduction: Nobel Prize-winner with dirty hands \\ As conservatively as possible \\ Physics must be rebuilt \\ The beginning of something new \\ Intellectual freedom is a thing of the past \\ Service to science must be service to the nation \\ There is very likely a Nordic science \\ You obviously cannot swim against the tide \\ ``I have seen my death!'' \\ As a scientist or as a man \\ Hitherto unknown destructive power \\ Heisenberg was mostly silent \\ We are what we pretend to be \\ Epilogue: We did not speak the same language

entry:
@Book{Ball:2014:SRS,
  author =       "Philip Ball",
  title =        "Serving the {Reich}: the struggle for the soul of
                 physics under {Hitler}",
  publisher =    pub-U-CHICAGO,
  address =      pub-U-CHICAGO:adr,
  pages =        "ix + 303",
  year =         "2014",
  ISBN =         "0-226-20457-X (hardcover), 0-226-20460-X (e-book)",
  ISBN-13 =      "978-0-226-20457-4 (hardcover), 978-0-226-20460-4
                 (e-book)",
  LCCN =         "QC773.3.G3 B35 2014",
  bibdate =      "Thu Jan 8 08:07:26 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "1962--",
  subject =      "National socialism and science; Nuclear physics;
                 Germany; History; 20th century; World War, 1939--1945;
                 Science; Moral and ethical aspects; 1933--1945; Planck,
                 Max; Debye, Peter J. W (Peter Josef William);
                 Heisenberg, Werner",
  subject-dates = "1858--1947; 1884--1966; 1901--1976",
  tableofcontents = "Introduction: Nobel Prize-winner with dirty hands
                 \\
                 As conservatively as possible \\
                 Physics must be rebuilt \\
                 The beginning of something new \\
                 Intellectual freedom is a thing of the past \\
                 Service to science must be service to the nation \\
                 There is very likely a Nordic science \\
                 You obviously cannot swim against the tide \\
                 ``I have seen my death!'' \\
                 As a scientist or as a man \\
                 Hitherto unknown destructive power \\
                 Heisenberg was mostly silent \\
                 We are what we pretend to be \\
                 Epilogue: We did not speak the same language",
}


bibtype: book
filename: master.bib
label: Ball:2018:WIG
author: Thorsten Ball
title: Writing an Interpreter in Go: version 1.6
publisher: Thorsten Ball
pages: 263
year: 2018
ISBN: 3-9820161-1-8 (paperback) OR 3982016118 (paperback)
ISBN13: 978-3-9820161-1-5 (paperback) OR 9783982016115 (paperback)
LCCN: QA76.76.C65 .B35 2018
bibdate: Mon Sep 20 07:33:32 MDT 2021
bibtimestamp: 2021.09.20 07:33:32 MDT
acknowledgement: ack-nhfb
rawauthor: Thorsten Ball
rawtitle: Writing an Interpreter in {Go}: version 1.6
shortTOC: Introduction Lexing Parsing Evaluation Extending the interpreter Going further
rawshortTOC: Introduction \\ Lexing \\ Parsing \\ Evaluation \\ Extending the interpreter \\ Going further
bibsource:
fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/go.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
In this book we will create a programming language together. We'll start with 0 lines of code and end up with a fully working interpreter for the Monkey programming language. Step by step. From tokens to output. All code shown and included. Fully tested.

subject:
Interpreters (Computer programs); Study and teaching; Programming languages (Electronic computers); Computer programs; Computer software; Computer programs; Computer software; Study and teaching

TOC:
Acknowledgments / 5 Introduction / 6 The Monkey Programming Language & Interpreter / 8 Why Go? / 10 How to Use this Book / 11 1 Lexing / 13 1.1 Lexical Analysis / 13 1.2 Defining Our Tokens / 15 1.3 The Lexer / 17 1.4 Extending our Token Set and Lexer / 27 1.5 Start of a REPL / 33 2 Parsing / 36 2.1 Parsers / 36 2.2 Why not a parser generator? / 39 2.3 Writing a Parser for the Monkey Programming Language / 41 2.4 Parser's first steps: parsing let statements / 41 2.5 Parsing Return Statements / 56 2.6 Parsing Expressions / 59 Expressions in Monkey / 60 Top Down Operator Precedence (or Pratt Parsing) / 61 Terminology / 62 Preparing the AST / 63 Implementing the Pratt Parser / 67 Identifiers / 68 Integer Literals / 72 Prefix Operators / 75 Infix Operators / 81 2.7 How Pratt Parsing Works / 88 2.8 Extending the Parser / 99 Boolean Literals / 101 Grouped Expressions / 105 If Expressions / 107 Function Literals / 113 Call Expressions / 119 Removing TODOs / 124 2.9 Read-Parse-Print-Loop / 126 3 Evaluation / 130 3.1 Giving Meaning to Symbols / 130 3.2 Strategies of Evaluation / 131 3.3 A Tree-Walking Interpreter / 133 3.4 Representing Objects / 135 Foundation of our Object System / 136 Integers / 137 Booleans / 138 Null / 138 3.5 Evaluating Expressions / 139 Integer Literals / 140 15 Completing the REPL / 143 Boolean Literals / 145 Null / 147 Prefix Expressions / 147 Infix Expressions / 151 3.6 Conditionals / 157 3.7 Return Statements / 161 3.8 Abort! Abort! There's been a mistake!, or: Error Handling / 165 3.9 Bindings & The Environment / 172 3.10 Functions & Function Calls / 177 3.11 Who's taking the trash out? / 189 4 Extending the Interpreter / 192 4.1 Data Types & Functions / 192 4.2 Strings / 193 Supporting Strings in our Lexer / 193 Parsing Strings / 196 Evaluating Strings / 197 String Concatenation / 199 4.3 Built-in Functions / 201 len / 202 4.4 Array / 207 Supporting Arrays in our Lexer / 208 Parsing Array Literals / 210 Parsing Index Operator Expressions / 213 Evaluating Array Literals / 217 Evaluating Index Operator Expressions / 219 Adding Built-in Functions for Arrays / 223 Test-Driving Arrays / 227 4.5 Hashes / 228 Lexing Hash Literals / 229 Parsing Hash Literals / 231 Hashing Objects / 236 Evaluating Hash Literals / 242 Evaluating Index Expressions With Hashes / 245 4.6 The Grand Finale / 249 Going Further / 252 The Lost Chapter / 252 Writing A Compiler In Go / 253 Resources / 254 Feedback / 257 Changelog / 285

rawabstract:
In this book we will create a programming language together. We'll start with 0 lines of code and end up with a fully working interpreter for the Monkey programming language. Step by step. From tokens to output. All code shown and included. Fully tested.

rawTOC:
Acknowledgments / 5 \\ Introduction / 6 \\ The Monkey Programming Language \& Interpreter / 8 \\ Why Go? / 10 \\ How to Use this Book / 11 \\ 1 Lexing / 13 \\ 1.1 Lexical Analysis / 13 \\ 1.2 Defining Our Tokens / 15 \\ 1.3 The Lexer / 17 \\ 1.4 Extending our Token Set and Lexer / 27 \\ 1.5 Start of a REPL / 33 \\ 2 Parsing / 36 \\ 2.1 Parsers / 36 \\ 2.2 Why not a parser generator? / 39 \\ 2.3 Writing a Parser for the Monkey Programming Language / 41 \\ 2.4 Parser's first steps: parsing let statements / 41 \\ 2.5 Parsing Return Statements / 56 \\ 2.6 Parsing Expressions / 59 \\ Expressions in Monkey / 60 \\ Top Down Operator Precedence (or Pratt Parsing) / 61 \\ Terminology / 62 \\ Preparing the AST / 63 \\ Implementing the Pratt Parser / 67 \\ Identifiers / 68 \\ Integer Literals / 72 \\ Prefix Operators / 75 \\ Infix Operators / 81 \\ 2.7 How Pratt Parsing Works / 88 \\ 2.8 Extending the Parser / 99 \\ Boolean Literals / 101 \\ Grouped Expressions / 105 \\ If Expressions / 107 \\ Function Literals / 113 \\ Call Expressions / 119 \\ Removing TODOs / 124 \\ 2.9 Read-Parse-Print-Loop / 126 \\ 3 Evaluation / 130 \\ 3.1 Giving Meaning to Symbols / 130 \\ 3.2 Strategies of Evaluation / 131 \\ 3.3 A Tree-Walking Interpreter / 133 \\ 3.4 Representing Objects / 135 \\ Foundation of our Object System / 136 \\ Integers / 137 \\ Booleans / 138 \\ Null / 138 \\ 3.5 Evaluating Expressions / 139 \\ Integer Literals / 140 \\ 15 Completing the REPL / 143 \\ Boolean Literals / 145 \\ Null / 147 \\ Prefix Expressions / 147 \\ Infix Expressions / 151 \\ 3.6 Conditionals / 157 \\ 3.7 Return Statements / 161 \\ 3.8 Abort! Abort! There's been a mistake!, or: Error Handling / 165 \\ 3.9 Bindings \& The Environment / 172 \\ 3.10 Functions \& Function Calls / 177 \\ 3.11 Who's taking the trash out? / 189 \\ 4 Extending the Interpreter / 192 \\ 4.1 Data Types \& Functions / 192 \\ 4.2 Strings / 193 \\ Supporting Strings in our Lexer / 193 \\ Parsing Strings / 196 \\ Evaluating Strings / 197 \\ String Concatenation / 199 \\ 4.3 Built-in Functions / 201 \\ len / 202 \\ 4.4 Array / 207 \\ Supporting Arrays in our Lexer / 208 \\ Parsing Array Literals / 210 \\ Parsing Index Operator Expressions / 213 \\ Evaluating Array Literals / 217 \\ Evaluating Index Operator Expressions / 219 \\ Adding Built-in Functions for Arrays / 223 \\ Test-Driving Arrays / 227 \\ 4.5 Hashes / 228 \\ Lexing Hash Literals / 229 \\ Parsing Hash Literals / 231 \\ Hashing Objects / 236 \\ Evaluating Hash Literals / 242 \\ Evaluating Index Expressions With Hashes / 245 \\ 4.6 The Grand Finale / 249 \\ Going Further / 252 \\ The Lost Chapter / 252 \\ Writing A Compiler In Go / 253 \\ Resources / 254 \\ Feedback / 257 \\ Changelog / 285

entry:
@Book{Ball:2018:WIG,
  author =       "Thorsten Ball",
  title =        "Writing an Interpreter in {Go}: version 1.6",
  publisher =    "Thorsten Ball",
  address =      "????",
  pages =        "263",
  year =         "2018",
  ISBN =         "3-9820161-1-8 (paperback)",
  ISBN-13 =      "978-3-9820161-1-5 (paperback)",
  LCCN =         "QA76.76.C65 .B35 2018",
  bibdate =      "Mon Sep 20 07:33:32 MDT 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/go.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "In this book we will create a programming language
                 together. We'll start with 0 lines of code and end up
                 with a fully working interpreter for the Monkey
                 programming language. Step by step. From tokens to
                 output. All code shown and included. Fully tested.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Introduction \\
                 Lexing \\
                 Parsing \\
                 Evaluation \\
                 Extending the interpreter \\
                 Going further",
  subject =      "Interpreters (Computer programs); Study and teaching;
                 Programming languages (Electronic computers); Computer
                 programs; Computer software; Computer programs;
                 Computer software; Study and teaching",
  tableofcontents = "Acknowledgments / 5 \\
                 Introduction / 6 \\
                 The Monkey Programming Language \& Interpreter / 8 \\
                 Why Go? / 10 \\
                 How to Use this Book / 11 \\
                 1 Lexing / 13 \\
                 1.1 Lexical Analysis / 13 \\
                 1.2 Defining Our Tokens / 15 \\
                 1.3 The Lexer / 17 \\
                 1.4 Extending our Token Set and Lexer / 27 \\
                 1.5 Start of a REPL / 33 \\
                 2 Parsing / 36 \\
                 2.1 Parsers / 36 \\
                 2.2 Why not a parser generator? / 39 \\
                 2.3 Writing a Parser for the Monkey Programming
                 Language / 41 \\
                 2.4 Parser's first steps: parsing let statements / 41
                 \\
                 2.5 Parsing Return Statements / 56 \\
                 2.6 Parsing Expressions / 59 \\
                 Expressions in Monkey / 60 \\
                 Top Down Operator Precedence (or Pratt Parsing) / 61
                 \\
                 Terminology / 62 \\
                 Preparing the AST / 63 \\
                 Implementing the Pratt Parser / 67 \\
                 Identifiers / 68 \\
                 Integer Literals / 72 \\
                 Prefix Operators / 75 \\
                 Infix Operators / 81 \\
                 2.7 How Pratt Parsing Works / 88 \\
                 2.8 Extending the Parser / 99 \\
                 Boolean Literals / 101 \\
                 Grouped Expressions / 105 \\
                 If Expressions / 107 \\
                 Function Literals / 113 \\
                 Call Expressions / 119 \\
                 Removing TODOs / 124 \\
                 2.9 Read-Parse-Print-Loop / 126 \\
                 3 Evaluation / 130 \\
                 3.1 Giving Meaning to Symbols / 130 \\
                 3.2 Strategies of Evaluation / 131 \\
                 3.3 A Tree-Walking Interpreter / 133 \\
                 3.4 Representing Objects / 135 \\
                 Foundation of our Object System / 136 \\
                 Integers / 137 \\
                 Booleans / 138 \\
                 Null / 138 \\
                 3.5 Evaluating Expressions / 139 \\
                 Integer Literals / 140 \\
                 15 Completing the REPL / 143 \\
                 Boolean Literals / 145 \\
                 Null / 147 \\
                 Prefix Expressions / 147 \\
                 Infix Expressions / 151 \\
                 3.6 Conditionals / 157 \\
                 3.7 Return Statements / 161 \\
                 3.8 Abort! Abort! There's been a mistake!, or: Error
                 Handling / 165 \\
                 3.9 Bindings \& The Environment / 172 \\
                 3.10 Functions \& Function Calls / 177 \\
                 3.11 Who's taking the trash out? / 189 \\
                 4 Extending the Interpreter / 192 \\
                 4.1 Data Types \& Functions / 192 \\
                 4.2 Strings / 193 \\
                 Supporting Strings in our Lexer / 193 \\
                 Parsing Strings / 196 \\
                 Evaluating Strings / 197 \\
                 String Concatenation / 199 \\
                 4.3 Built-in Functions / 201 \\
                 len / 202 \\
                 4.4 Array / 207 \\
                 Supporting Arrays in our Lexer / 208 \\
                 Parsing Array Literals / 210 \\
                 Parsing Index Operator Expressions / 213 \\
                 Evaluating Array Literals / 217 \\
                 Evaluating Index Operator Expressions / 219 \\
                 Adding Built-in Functions for Arrays / 223 \\
                 Test-Driving Arrays / 227 \\
                 4.5 Hashes / 228 \\
                 Lexing Hash Literals / 229 \\
                 Parsing Hash Literals / 231 \\
                 Hashing Objects / 236 \\
                 Evaluating Hash Literals / 242 \\
                 Evaluating Index Expressions With Hashes / 245 \\
                 4.6 The Grand Finale / 249 \\
                 Going Further / 252 \\
                 The Lost Chapter / 252 \\
                 Writing A Compiler In Go / 253 \\
                 Resources / 254 \\
                 Feedback / 257 \\
                 Changelog / 285",
}


bibtype: book
filename: master.bib
label: Ball:2019:WCG
author: Thorsten Ball
title: Writing a compiler in Go
publisher: Thorsten Ball
address: Aschaffenburg, Germany
edition: Version 1.1.
pages: 351
year: 2019
ISBN: 3-9820161-0-X OR 398201610X
ISBN13: 978-3-9820161-0-8 OR 9783982016108
LCCN: QA76.73.G63 B348 2019
bibdate: Mon Sep 20 07:28:07 MDT 2021
bibtimestamp: 2021.09.20 07:28:07 MDT
acknowledgement: ack-nhfb
rawauthor: Thorsten Ball
rawtitle: Writing a compiler in {Go}
bibsource:
fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/go.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
This is the sequel to booktitle Writing An Interpreter In Go. We're picking up right where we left off and write a compiler and a virtual machine for Monkey. Runnable and tested code front and center, built from the ground up, step by step --- just like before. But this time, we're going to define bytecode, compile Monkey and execute it in our very own virtual machine. It's the next step in Monkey's evolution.

subject:
Go (Computer program language); Compilers (Computer programs); Computer programming; Compilers (Computer programs); Computer programming; Go (Computer program language)

TOC:
Acknowledgments / 5 Introduction / 6 Evolving Monkey / 7 The Past and Present / 7 The Future / 11 Use This Book / 11 1 Compilers & Virtual Machines / 13 Compilers / 14 Virtual and Real Machines / 18 Real Machines / 19 What Is a Virtual Machine? / 25 Why Build One? / 28 Bytecode / 30 What We're Going to Do, or: the Duality of VM and Compiler / 33 2 Hello Bytecode! / 34 First Instructions / 35 Starting With Bytes / 36 The Smallest Compiler / 42 Bytecode, Disassemble! / 48 Back to the Task at Hand / 53 Powering On the Machine / 56 Adding on the Stack / 64 Hooking up the REPL / 70 3 Compiling Expressions / 73 Cleaning Up the Stack / 73 Infix Expressions / 78 Booleans / 83 Comparison Operators / 88 Prefix Expressions / 96 4 Conditionals / 103 Jumps / 106 Compiling Conditionals / 109 Executing Jumps / 125 Welcome Back, Null! / 129 5 Keeping Track of Names / 138 The Plan / 139 Compiling Bindings / 141 Introducing: the Symbol Table / 144 Using Symbols in the Compiler / 147 Adding Globals to the VM / 150 6 String, Array and Hash / 156 String / 157 Array / 162 Hash / 168 Adding the index operator / 175 7 Functions / 182 Dipping Our Toes: a Simple Function / 182 Representing Functions / 183 Opcodes to Execute Functions / 184 Compiling Function Literals / 188 Compiling Function Calls / 204 Functions in the VM / 207 A Little Bonus / 219 Local Bindings / 220 Opcodes for Local Bindings / 221 Compiling Locals / 225 Implementing Local Bindings in the VM / 239 Arguments / 249 Compiling Calls With Arguments / 250 Resolving References to Arguments / 256 Arguments in the VM / 259 8 Built-in Functions / 269 Making the Change Easy / 270 Making the Change: the Plan / 277 A New Scope for Built-in Functions / 277 Executing built-in functions / 283 9 Closures / 290 The Problem / 291 The Plan / 292 Everything's a closure / 294 Compiling and resolving free variables / 307 Creating real closures at run time / 320 Recursive Closures / 325 10 Taking Time / 341 Resources / 345 Feedback / 348 Changelog /349

rawabstract:
This is the sequel to \booktitle{Writing An Interpreter In Go}. We're picking up right where we left off and write a compiler and a virtual machine for Monkey. Runnable and tested code front and center, built from the ground up, step by step --- just like before. But this time, we're going to define bytecode, compile Monkey and execute it in our very own virtual machine. It's the next step in Monkey's evolution.

shortTOC:
Compilers and virtual machines Hello bytecode! Compiling expressions Conditionals Keeping track of names String, array and hash Functions Built-in functions Closures Taking time

rawshortTOC:
Compilers and virtual machines \\ Hello bytecode! \\ Compiling expressions \\ Conditionals \\ Keeping track of names \\ String, array and hash \\ Functions \\ Built-in functions \\ Closures \\ Taking time

rawTOC:
Acknowledgments / 5 \\ Introduction / 6 \\ Evolving Monkey / 7 \\ The Past and Present / 7 \\ The Future / 11 \\ Use This Book / 11 \\ 1 Compilers \& Virtual Machines / 13 \\ Compilers / 14 \\ Virtual and Real Machines / 18 \\ Real Machines / 19 \\ What Is a Virtual Machine? / 25 \\ Why Build One? / 28 \\ Bytecode / 30 \\ What We're Going to Do, or: the Duality of VM and Compiler / 33 \\ 2 Hello Bytecode! / 34 \\ First Instructions / 35 \\ Starting With Bytes / 36 \\ The Smallest Compiler / 42 \\ Bytecode, Disassemble! / 48 \\ Back to the Task at Hand / 53 \\ Powering On the Machine / 56 \\ Adding on the Stack / 64 \\ Hooking up the REPL / 70 \\ 3 Compiling Expressions / 73 \\ Cleaning Up the Stack / 73 \\ Infix Expressions / 78 \\ Booleans / 83 \\ Comparison Operators / 88 \\ Prefix Expressions / 96 \\ 4 Conditionals / 103 \\ Jumps / 106 \\ Compiling Conditionals / 109 \\ Executing Jumps / 125 \\ Welcome Back, Null! / 129 \\ 5 Keeping Track of Names / 138 \\ The Plan / 139 \\ Compiling Bindings / 141 \\ Introducing: the Symbol Table / 144 \\ Using Symbols in the Compiler / 147 \\ Adding Globals to the VM / 150 \\ 6 String, Array and Hash / 156 \\ String / 157 \\ Array / 162 \\ Hash / 168 \\ Adding the index operator / 175 \\ 7 Functions / 182 \\ Dipping Our Toes: a Simple Function / 182 \\ Representing Functions / 183 \\ Opcodes to Execute Functions / 184 \\ Compiling Function Literals / 188 \\ Compiling Function Calls / 204 \\ Functions in the VM / 207 \\ A Little Bonus / 219 \\ Local Bindings / 220 \\ Opcodes for Local Bindings / 221 \\ Compiling Locals / 225 \\ Implementing Local Bindings in the VM / 239 \\ Arguments / 249 \\ Compiling Calls With Arguments / 250 \\ Resolving References to Arguments / 256 \\ Arguments in the VM / 259 \\ 8 Built-in Functions / 269 \\ Making the Change Easy / 270 \\ Making the Change: the Plan / 277 \\ A New Scope for Built-in Functions / 277 \\ Executing built-in functions / 283 \\ 9 Closures / 290 \\ The Problem / 291 \\ The Plan / 292 \\ Everything's a closure / 294 \\ Compiling and resolving free variables / 307 \\ Creating real closures at run time / 320 \\ Recursive Closures / 325 \\ 10 Taking Time / 341 \\ Resources / 345 \\ Feedback / 348 \\ Changelog /349

entry:
@Book{Ball:2019:WCG,
  author =       "Thorsten Ball",
  title =        "Writing a compiler in {Go}",
  publisher =    "Thorsten Ball",
  address =      "Aschaffenburg, Germany",
  edition =      "Version 1.1.",
  pages =        "351",
  year =         "2019",
  ISBN =         "3-9820161-0-X",
  ISBN-13 =      "978-3-9820161-0-8",
  LCCN =         "QA76.73.G63 B348 2019",
  bibdate =      "Mon Sep 20 07:28:07 MDT 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/go.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "This is the sequel to \booktitle{Writing An
                 Interpreter In Go}. We're picking up right where we
                 left off and write a compiler and a virtual machine for
                 Monkey. Runnable and tested code front and center,
                 built from the ground up, step by step --- just like
                 before. But this time, we're going to define bytecode,
                 compile Monkey and execute it in our very own virtual
                 machine. It's the next step in Monkey's evolution.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Compilers and virtual machines \\
                 Hello bytecode! \\
                 Compiling expressions \\
                 Conditionals \\
                 Keeping track of names \\
                 String, array and hash \\
                 Functions \\
                 Built-in functions \\
                 Closures \\
                 Taking time",
  subject =      "Go (Computer program language); Compilers (Computer
                 programs); Computer programming; Compilers (Computer
                 programs); Computer programming; Go (Computer program
                 language)",
  tableofcontents = "Acknowledgments / 5 \\
                 Introduction / 6 \\
                 Evolving Monkey / 7 \\
                 The Past and Present / 7 \\
                 The Future / 11 \\
                 Use This Book / 11 \\
                 1 Compilers \& Virtual Machines / 13 \\
                 Compilers / 14 \\
                 Virtual and Real Machines / 18 \\
                 Real Machines / 19 \\
                 What Is a Virtual Machine? / 25 \\
                 Why Build One? / 28 \\
                 Bytecode / 30 \\
                 What We're Going to Do, or: the Duality of VM and
                 Compiler / 33 \\
                 2 Hello Bytecode! / 34 \\
                 First Instructions / 35 \\
                 Starting With Bytes / 36 \\
                 The Smallest Compiler / 42 \\
                 Bytecode, Disassemble! / 48 \\
                 Back to the Task at Hand / 53 \\
                 Powering On the Machine / 56 \\
                 Adding on the Stack / 64 \\
                 Hooking up the REPL / 70 \\
                 3 Compiling Expressions / 73 \\
                 Cleaning Up the Stack / 73 \\
                 Infix Expressions / 78 \\
                 Booleans / 83 \\
                 Comparison Operators / 88 \\
                 Prefix Expressions / 96 \\
                 4 Conditionals / 103 \\
                 Jumps / 106 \\
                 Compiling Conditionals / 109 \\
                 Executing Jumps / 125 \\
                 Welcome Back, Null! / 129 \\
                 5 Keeping Track of Names / 138 \\
                 The Plan / 139 \\
                 Compiling Bindings / 141 \\
                 Introducing: the Symbol Table / 144 \\
                 Using Symbols in the Compiler / 147 \\
                 Adding Globals to the VM / 150 \\
                 6 String, Array and Hash / 156 \\
                 String / 157 \\
                 Array / 162 \\
                 Hash / 168 \\
                 Adding the index operator / 175 \\
                 7 Functions / 182 \\
                 Dipping Our Toes: a Simple Function / 182 \\
                 Representing Functions / 183 \\
                 Opcodes to Execute Functions / 184 \\
                 Compiling Function Literals / 188 \\
                 Compiling Function Calls / 204 \\
                 Functions in the VM / 207 \\
                 A Little Bonus / 219 \\
                 Local Bindings / 220 \\
                 Opcodes for Local Bindings / 221 \\
                 Compiling Locals / 225 \\
                 Implementing Local Bindings in the VM / 239 \\
                 Arguments / 249 \\
                 Compiling Calls With Arguments / 250 \\
                 Resolving References to Arguments / 256 \\
                 Arguments in the VM / 259 \\
                 8 Built-in Functions / 269 \\
                 Making the Change Easy / 270 \\
                 Making the Change: the Plan / 277 \\
                 A New Scope for Built-in Functions / 277 \\
                 Executing built-in functions / 283 \\
                 9 Closures / 290 \\
                 The Problem / 291 \\
                 The Plan / 292 \\
                 Everything's a closure / 294 \\
                 Compiling and resolving free variables / 307 \\
                 Creating real closures at run time / 320 \\
                 Recursive Closures / 325 \\
                 10 Taking Time / 341 \\
                 Resources / 345 \\
                 Feedback / 348 \\
                 Changelog /349",
}


bibtype: book
filename: master.bib
label: Ballard:1982:CV
author: Dana H. Ballard and Christopher M. Brown
title: Computer Vision
publisher: pub-PH
address: pub-PH:adr
pages: xx + 523
year: 1982
ISBN: 0-13-165316-4 OR 0131653164
ISBN13: 978-0-13-165316-0 OR 9780131653160
LCCN: TA1632 .B34 1982
bibdate: Tue Dec 14 22:40:13 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:40:13 ???
acknowledgement: ack-nhfb
rawauthor: Dana H. Ballard and Christopher M. Brown
rawtitle: Computer Vision
entry:
@Book{Ballard:1982:CV,
  author =       "Dana H. Ballard and Christopher M. Brown",
  title =        "Computer Vision",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xx + 523",
  year =         "1982",
  ISBN =         "0-13-165316-4",
  ISBN-13 =      "978-0-13-165316-0",
  LCCN =         "TA1632 .B34 1982",
  bibdate =      "Tue Dec 14 22:40:13 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Ballhausen:1962:ILF
author: Carl J. Ballhausen
title: Introduction to Ligand Field Theory
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
pages: ix + 298
year: 1962
LCCN: QD475 .B3
bibdate: Sat Jul 25 13:55:27 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.07.25 13:55:27 ???
acknowledgement: ack-nhfb
rawauthor: Carl J. Ballhausen
rawtitle: Introduction to Ligand Field Theory
entry:
@Book{Ballhausen:1962:ILF,
  author =       "Carl J. Ballhausen",
  title =        "Introduction to Ligand Field Theory",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "ix + 298",
  year =         "1962",
  LCCN =         "QD475 .B3",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Banks:1999:SPR
author: Robert B. Banks
title: Slicing Pizzas, Racing Turtles, and Further Adventures in Applied Mathematics
publisher: pub-PRINCETON
address: pub-PRINCETON:adr
pages: xi + 286
year: 1999
ISBN: 0-691-05947-0 OR 0691059470
ISBN13: 978-0-691-05947-1 OR 9780691059471
LCCN: QA93 .B358 1999
bibdate: Mon Dec 06 15:45:23 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1999.12.06 15:45:23 ???
acknowledgement: ack-nhfb
rawauthor: Robert B. Banks
rawtitle: Slicing Pizzas, Racing Turtles, and Further Adventures in Applied Mathematics
abstract:
The author discloses the mathematics behind a host of problems, including gauging the length of the seam on a baseball, predicting the results of melting polar ice caps, and digging a hole to China.

TOC:
ch. 1: Broad stripes and bright stars 2: More stars, honeycombs, and snowflakes 3: Slicing things like pizzas and watermelons 4: Raindrops keep falling on my head and other goodies 5: Raindrops and other goodies revisited 6: Which major rivers flow uphill 7: A brief look at $pi $, $e$, and some other famous numbers 8: Another look at some famous numbers 9: Great number sequences: prime, Fibonacci, and hailstone 10: A fast way to escape 11: How to get anywhere in about forty-two minutes 12: How fast should you run in the rain 13: Great turtle races: pursuit curves 14: More great turtle races: logarithmic spirals 15: How many people have ever lived 16: The great explosion of 2023 17: How to make fairly nice valentines 18: Somewhere over the rainbow 19: Making mathematical mountains 20: How to make mountains out of molehills 21: Moving continents from here to there 22: Cartography: how to flatten spheres 23: Growth and spreading and mathematical analogies 24: How long is the seam on a baseball 25: Baseball seams, pipe connections, and world travels 26: Lengths, areas, and volumes of all kinds of shapes

rawabstract:
The author discloses the mathematics behind a host of problems, including gauging the length of the seam on a baseball, predicting the results of melting polar ice caps, and digging a hole to China.

rawTOC:
ch. 1: Broad stripes and bright stars \\ 2: More stars, honeycombs, and snowflakes \\ 3: Slicing things like pizzas and watermelons \\ 4: Raindrops keep falling on my head and other goodies \\ 5: Raindrops and other goodies revisited \\ 6: Which major rivers flow uphill \\ 7: A brief look at $\pi$, $e$, and some other famous numbers \\ 8: Another look at some famous numbers \\ 9: Great number sequences: prime, Fibonacci, and hailstone \\ 10: A fast way to escape \\ 11: How to get anywhere in about forty-two minutes \\ 12: How fast should you run in the rain \\ 13: Great turtle races: pursuit curves \\ 14: More great turtle races: logarithmic spirals \\ 15: How many people have ever lived \\ 16: The great explosion of 2023 \\ 17: How to make fairly nice valentines \\ 18: Somewhere over the rainbow \\ 19: Making mathematical mountains \\ 20: How to make mountains out of molehills \\ 21: Moving continents from here to there \\ 22: Cartography: how to flatten spheres \\ 23: Growth and spreading and mathematical analogies \\ 24: How long is the seam on a baseball \\ 25: Baseball seams, pipe connections, and world travels \\ 26: Lengths, areas, and volumes of all kinds of shapes

entry:
@Book{Banks:1999:SPR,
  author =       "Robert B. Banks",
  title =        "Slicing Pizzas, Racing Turtles, and Further Adventures
                 in Applied Mathematics",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xi + 286",
  year =         "1999",
  ISBN =         "0-691-05947-0",
  ISBN-13 =      "978-0-691-05947-1",
  LCCN =         "QA93 .B358 1999",
  bibdate =      "Mon Dec 06 15:45:23 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$24.95",
  abstract =     "The author discloses the mathematics behind a host of
                 problems, including gauging the length of the seam on a
                 baseball, predicting the results of melting polar ice
                 caps, and digging a hole to China.",
  acknowledgement = ack-nhfb,
  tableofcontents = "ch. 1: Broad stripes and bright stars \\
                 2: More stars, honeycombs, and snowflakes \\
                 3: Slicing things like pizzas and watermelons \\
                 4: Raindrops keep falling on my head and other goodies
                 \\
                 5: Raindrops and other goodies revisited \\
                 6: Which major rivers flow uphill \\
                 7: A brief look at $\pi$, $e$, and some other famous
                 numbers \\
                 8: Another look at some famous numbers \\
                 9: Great number sequences: prime, Fibonacci, and
                 hailstone \\
                 10: A fast way to escape \\
                 11: How to get anywhere in about forty-two minutes \\
                 12: How fast should you run in the rain \\
                 13: Great turtle races: pursuit curves \\
                 14: More great turtle races: logarithmic spirals \\
                 15: How many people have ever lived \\
                 16: The great explosion of 2023 \\
                 17: How to make fairly nice valentines \\
                 18: Somewhere over the rainbow \\
                 19: Making mathematical mountains \\
                 20: How to make mountains out of molehills \\
                 21: Moving continents from here to there \\
                 22: Cartography: how to flatten spheres \\
                 23: Growth and spreading and mathematical analogies \\
                 24: How long is the seam on a baseball \\
                 25: Baseball seams, pipe connections, and world travels
                 \\
                 26: Lengths, areas, and volumes of all kinds of
                 shapes",
}


bibtype: book
filename: master.bib
label: Bardi:2006:CWN
author: Jason Socrates Bardi
title: The Calculus Wars: Newton, Leibniz, and the Greatest Mathematical Clash of All Time
publisher: Thunder's Mouth Press
address: New York, NY, USA
pages: viii + 277
year: 2006
ISBN: 1-56025-992-2, 1-56025-706-7 OR 1560259922, 1560257067
ISBN13: 978-1-56025-992-3, 978-1-56025-706-6 OR 9781560259923, 9781560257066
LCCN: QA303 .B2896 2006
bibdate: Mon Aug 20 14:41:36 MDT 2007
bibsource: carmin.sudoc.abes.fr:210/ABES-Z39-PUBLIC; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2007.08.20 14:41:36 MDT
acknowledgement: ack-nhfb
rawauthor: Jason Socrates Bardi
rawtitle: The Calculus Wars: {Newton}, {Leibniz}, and the Greatest Mathematical Clash of All Time
abstract:
Now regarded as the bane of many college students' existence, calculus was one of the most important mathematical innovations of the seventeenth century. But a dispute over its discovery sowed the seeds of discontent between two of the greatest scientific giants of all time --- Sir Isaac Newton and Gottfried Wilhelm Leibniz. Today Newton and Leibniz are generally considered the twin independent inventors of calculus. They are both credited with giving mathematics its greatest push forward since the time of the Greeks. Had they known each other under different circumstances, they might have been friends. But in their own lifetimes, the joint glory of calculus was not enough for either and each declared war against the other, openly and in secret. This long and bitter dispute has been swept under the carpet by historians perhaps because it reveals Newton and Leibniz in their worst light --- but booktitle The Calculus Wars tells the full story in narrative form for the first time. This history ultimately exposes how these twin mathematical giants were brilliant, proud, at times mad, and in the end completely human.

TOC:
For once it's safe to dream in color, 1704 The children of the wars, 1642--1664 The trouble with Hooke, 1664--1672 The affair of the eyebrow, 1666--1673 Farewell and think kindly of me, 1673--1677 The beginning of the sublime geometry, 1678--1687 The beautiful and the damned, 1687--1691 The shortest possible descent, 1690--1696 Newton's apes, 1696--1708 The burden of proof, 1708--1712 The flaws of motion, 1713--1716 Purged of ambiguity, 1716--1728

rawabstract:
Now regarded as the bane of many college students' existence, calculus was one of the most important mathematical innovations of the seventeenth century. But a dispute over its discovery sowed the seeds of discontent between two of the greatest scientific giants of all time --- Sir Isaac Newton and Gottfried Wilhelm Leibniz. Today Newton and Leibniz are generally considered the twin independent inventors of calculus. They are both credited with giving mathematics its greatest push forward since the time of the Greeks. Had they known each other under different circumstances, they might have been friends. But in their own lifetimes, the joint glory of calculus was not enough for either and each declared war against the other, openly and in secret. This long and bitter dispute has been swept under the carpet by historians perhaps because it reveals Newton and Leibniz in their worst light --- but \booktitle{The Calculus Wars} tells the full story in narrative form for the first time. This history ultimately exposes how these twin mathematical giants were brilliant, proud, at times mad, and in the end completely human.

rawTOC:
For once it's safe to dream in color, 1704 \\ The children of the wars, 1642--1664 \\ The trouble with Hooke, 1664--1672 \\ The affair of the eyebrow, 1666--1673 \\ Farewell and think kindly of me, 1673--1677 \\ The beginning of the sublime geometry, 1678--1687 \\ The beautiful and the damned, 1687--1691 \\ The shortest possible descent, 1690--1696 \\ Newton's apes, 1696--1708 \\ The burden of proof, 1708--1712 \\ The flaws of motion, 1713--1716 \\ Purged of ambiguity, 1716--1728

entry:
@Book{Bardi:2006:CWN,
  author =       "Jason Socrates Bardi",
  title =        "The Calculus Wars: {Newton}, {Leibniz}, and the
                 Greatest Mathematical Clash of All Time",
  publisher =    "Thunder's Mouth Press",
  address =      "New York, NY, USA",
  pages =        "viii + 277",
  year =         "2006",
  ISBN =         "1-56025-992-2, 1-56025-706-7",
  ISBN-13 =      "978-1-56025-992-3, 978-1-56025-706-6",
  LCCN =         "QA303 .B2896 2006",
  bibdate =      "Mon Aug 20 14:41:36 MDT 2007",
  bibsource =    "carmin.sudoc.abes.fr:210/ABES-Z39-PUBLIC;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Now regarded as the bane of many college students'
                 existence, calculus was one of the most important
                 mathematical innovations of the seventeenth century.
                 But a dispute over its discovery sowed the seeds of
                 discontent between two of the greatest scientific
                 giants of all time --- Sir Isaac Newton and Gottfried
                 Wilhelm Leibniz. Today Newton and Leibniz are generally
                 considered the twin independent inventors of calculus.
                 They are both credited with giving mathematics its
                 greatest push forward since the time of the Greeks. Had
                 they known each other under different circumstances,
                 they might have been friends. But in their own
                 lifetimes, the joint glory of calculus was not enough
                 for either and each declared war against the other,
                 openly and in secret. This long and bitter dispute has
                 been swept under the carpet by historians perhaps
                 because it reveals Newton and Leibniz in their worst
                 light --- but \booktitle{The Calculus Wars} tells the
                 full story in narrative form for the first time. This
                 history ultimately exposes how these twin mathematical
                 giants were brilliant, proud, at times mad, and in the
                 end completely human.",
  acknowledgement = ack-nhfb,
  tableofcontents = "For once it's safe to dream in color, 1704 \\
                 The children of the wars, 1642--1664 \\
                 The trouble with Hooke, 1664--1672 \\
                 The affair of the eyebrow, 1666--1673 \\
                 Farewell and think kindly of me, 1673--1677 \\
                 The beginning of the sublime geometry, 1678--1687 \\
                 The beautiful and the damned, 1687--1691 \\
                 The shortest possible descent, 1690--1696 \\
                 Newton's apes, 1696--1708 \\
                 The burden of proof, 1708--1712 \\
                 The flaws of motion, 1713--1716 \\
                 Purged of ambiguity, 1716--1728",
}


bibtype: book
filename: master.bib
label: Barnsley:1988:FE
author: Michael Barnsley
title: Fractals Everywhere
publisher: pub-ACADEMIC
address: pub-ACADEMIC:adr
pages: xii + 394
year: 1988
ISBN: 0-12-079062-9 OR 0120790629
ISBN13: 978-0-12-079062-3 OR 9780120790623
LCCN: QA614.86 .B37 1988
MRclass: *58-01, 00A06, 11K55, 37B99, 37C70, 37D45, 37G15, 28A80, 54H20
bibdate: Tue Dec 14 22:40:15 1993
bibtimestamp: 1993.12.14 22:40:15 ???
ZMnumber: 0691.58001
acknowledgement: ack-nhfb
rawauthor: Michael Barnsley
rawtitle: Fractals Everywhere
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
This book is based on a course called `Fractal Geometry' which has been taught in the School of Mathematics at Georgia Institute of Technology for two years. booktitle Fractals Everywhere teaches the tools, methods, and theory of deterministic geometry. It is useful for describing specific objects and structures. Models are represented by succinct formulas.' Once the formula is known, the model can be reproduced. we do not consider statistical geometry. The latter aims at discovering general statistical laws which govern families of similar-looking structures, such as all cumulus clouds, all maple leaves, or all mountains. In deterministic geometry, structures are defined, communicated, and analysed, with the aid of elementary transformations such as affine transformations, scalings, rotations, and congruences. A fractal set generally contains infinitely many points whose organization is so complicated that it is not possible to describe the set by specifying directly where each point in it lies. Instead, the set may be define by `the relations between the pieces.' It is rather like describing the solar system by quoting the law of gravitation and stating the initial conditions. Everything follows from that. It appears always to be better to describe in terms of relationships.

TOC:
Introduction: Applications for Fractal Functions / 205 Fractal Interpolation Functions / 208 The Fractal Dimension of Fractal Interpolation Functions / 223 Hidden Variable Fractal Interpolation / 229 Space-Filling Curves / 238 Julia Sets / 246 The Escape Time Algorithm for Computing Pictures of IFS Attractors and Julia Sets / 246 Iterated Function Systems Whose Attractors Are Julia Sets / 266 The Application of Julia Set Theory to Newton's Method / 276 A Rich Source for Fractals: Invariant Sets of Continuous Open Mappings / 287 Parameter Spaces and Mandelbrot Sets / 294 The Idea of a Parameter Space: A Map of Fractals / 294 Mandelbrot Sets for Pairs of Transformations / 299 The Mandelbrot Set for Julia Sets / 309 How to Make Maps of Families of Fractals Using Escape Times / 317 Measures on Fractals / 330 Introduction to Invariant Measures on Fractals / 330 Fields and Sigma-Fields / 337 Measures / 341 Integration / 344 The Compact Metric Space (P (X), d) / 349 A Contraction Mapping on (P (X)) / 350 Elton's Theorem / 364 Application to Computer Graphics / 370 Recurrent Iterated Function Systems / 379 Fractal Systems / 379 Recurrent Iterated Function Systems / 383 Collage Theorem for Recurrent Iterated Function Systems / 392 Fractal Systems with Vectors of Measures as Their Attractors / 403 References / 409 References / 412 Selected Answers / 416 Index / 523 Credits for Figures and Color Plates / 533

rawabstract:
This book is based on a course called `Fractal Geometry' which has been taught in the School of Mathematics at Georgia Institute of Technology for two years. \booktitle{Fractals Everywhere} teaches the tools, methods, and theory of deterministic geometry. It is useful for describing specific objects and structures. Models are represented by succinct formulas.' Once the formula is known, the model can be reproduced. we do not consider statistical geometry. The latter aims at discovering general statistical laws which govern families of similar-looking structures, such as all cumulus clouds, all maple leaves, or all mountains. In deterministic geometry, structures are defined, communicated, and analysed, with the aid of elementary transformations such as affine transformations, scalings, rotations, and congruences. A fractal set generally contains infinitely many points whose organization is so complicated that it is not possible to describe the set by specifying directly where each point in it lies. Instead, the set may be define by `the relations between the pieces.' It is rather like describing the solar system by quoting the law of gravitation and stating the initial conditions. Everything follows from that. It appears always to be better to describe in terms of relationships.

rawTOC:
Introduction: Applications for Fractal Functions / 205 \\ Fractal Interpolation Functions / 208 \\ The Fractal Dimension of Fractal Interpolation Functions / 223 \\ Hidden Variable Fractal Interpolation / 229 \\ Space-Filling Curves / 238 \\ Julia Sets / 246 \\ The Escape Time Algorithm for Computing Pictures of IFS Attractors and Julia Sets / 246 \\ Iterated Function Systems Whose Attractors Are Julia Sets / 266 \\ The Application of Julia Set Theory to Newton's Method / 276 \\ A Rich Source for Fractals: Invariant Sets of Continuous Open Mappings / 287 \\ Parameter Spaces and Mandelbrot Sets / 294 \\ The Idea of a Parameter Space: A Map of Fractals / 294 \\ Mandelbrot Sets for Pairs of Transformations / 299 \\ The Mandelbrot Set for Julia Sets / 309 \\ How to Make Maps of Families of Fractals Using Escape Times / 317 \\ Measures on Fractals / 330 \\ Introduction to Invariant Measures on Fractals / 330 \\ Fields and Sigma-Fields / 337 \\ Measures / 341 \\ Integration / 344 \\ The Compact Metric Space (P (X), d) / 349 \\ A Contraction Mapping on (P (X)) / 350 \\ Elton's Theorem / 364 \\ Application to Computer Graphics / 370 \\ Recurrent Iterated Function Systems / 379 \\ Fractal Systems / 379 \\ Recurrent Iterated Function Systems / 383 \\ Collage Theorem for Recurrent Iterated Function Systems / 392 \\ Fractal Systems with Vectors of Measures as Their Attractors / 403 \\ References / 409 \\ References / 412 \\ Selected Answers / 416 \\ Index / 523 \\ Credits for Figures and Color Plates / 533

entry:
@Book{Barnsley:1988:FE,
  author =       "Michael Barnsley",
  title =        "Fractals Everywhere",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xii + 394",
  year =         "1988",
  ISBN =         "0-12-079062-9",
  ISBN-13 =      "978-0-12-079062-3",
  LCCN =         "QA614.86 .B37 1988",
  MRclass =      "*58-01, 00A06, 11K55, 37B99, 37C70, 37D45, 37G15,
                 28A80, 54H20",
  bibdate =      "Tue Dec 14 22:40:15 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  ZMnumber =     "0691.58001",
  abstract =     "This book is based on a course called `Fractal
                 Geometry' which has been taught in the School of
                 Mathematics at Georgia Institute of Technology for two
                 years. \booktitle{Fractals Everywhere} teaches the
                 tools, methods, and theory of deterministic geometry.
                 It is useful for describing specific objects and
                 structures. Models are represented by succinct
                 formulas.' Once the formula is known, the model can be
                 reproduced. we do not consider statistical geometry.
                 The latter aims at discovering general statistical laws
                 which govern families of similar-looking structures,
                 such as all cumulus clouds, all maple leaves, or all
                 mountains. In deterministic geometry, structures are
                 defined, communicated, and analysed, with the aid of
                 elementary transformations such as affine
                 transformations, scalings, rotations, and congruences.
                 A fractal set generally contains infinitely many points
                 whose organization is so complicated that it is not
                 possible to describe the set by specifying directly
                 where each point in it lies. Instead, the set may be
                 define by `the relations between the pieces.' It is
                 rather like describing the solar system by quoting the
                 law of gravitation and stating the initial conditions.
                 Everything follows from that. It appears always to be
                 better to describe in terms of relationships.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction: Applications for Fractal Functions /
                 205 \\
                 Fractal Interpolation Functions / 208 \\
                 The Fractal Dimension of Fractal Interpolation
                 Functions / 223 \\
                 Hidden Variable Fractal Interpolation / 229 \\
                 Space-Filling Curves / 238 \\
                 Julia Sets / 246 \\
                 The Escape Time Algorithm for Computing Pictures of IFS
                 Attractors and Julia Sets / 246 \\
                 Iterated Function Systems Whose Attractors Are Julia
                 Sets / 266 \\
                 The Application of Julia Set Theory to Newton's Method
                 / 276 \\
                 A Rich Source for Fractals: Invariant Sets of
                 Continuous Open Mappings / 287 \\
                 Parameter Spaces and Mandelbrot Sets / 294 \\
                 The Idea of a Parameter Space: A Map of Fractals / 294
                 \\
                 Mandelbrot Sets for Pairs of Transformations / 299 \\
                 The Mandelbrot Set for Julia Sets / 309 \\
                 How to Make Maps of Families of Fractals Using Escape
                 Times / 317 \\
                 Measures on Fractals / 330 \\
                 Introduction to Invariant Measures on Fractals / 330
                 \\
                 Fields and Sigma-Fields / 337 \\
                 Measures / 341 \\
                 Integration / 344 \\
                 The Compact Metric Space (P (X), d) / 349 \\
                 A Contraction Mapping on (P (X)) / 350 \\
                 Elton's Theorem / 364 \\
                 Application to Computer Graphics / 370 \\
                 Recurrent Iterated Function Systems / 379 \\
                 Fractal Systems / 379 \\
                 Recurrent Iterated Function Systems / 383 \\
                 Collage Theorem for Recurrent Iterated Function Systems
                 / 392 \\
                 Fractal Systems with Vectors of Measures as Their
                 Attractors / 403 \\
                 References / 409 \\
                 References / 412 \\
                 Selected Answers / 416 \\
                 Index / 523 \\
                 Credits for Figures and Color Plates / 533",
  xxtableofcontents = "Metric Spaces \\
                 Equivalent Spaces \\
                 Classification of Subsets \\
                 and the Space of Fractals \\
                 Spaces \\
                 Metric Spaces \\
                 Cauchy Sequences, Limit Points, Closed Sets, Perfect
                 Sets, and Complete Metric Spaces \\
                 Compact Sets, Bounded Sets, Open Sets, Interiors, and
                 Boundaries \\
                 Connected Sets, Disconnected Sets, and
                 Pathwise-Connected Sets \\
                 The Metric Space (H (X), h): The Place Where Fractals
                 Live \\
                 The Completeness of the Space of Fractals \\
                 Additional Theorems about Metric Spaces \\
                 Transformations on Metric Spaces \\
                 Contraction Mappings and the Construction of Fractals
                 \\
                 Transformations on the Real Line \\
                 Affine Transformations in the Euclidean Plane \\
                 Mobius Transformations on the Riemann Sphere \\
                 Analytic Transformations \\
                 How to Change Coordinates \\
                 The Contraction Mapping Theorem \\
                 Contraction Mappings on the Space of Fractals \\
                 Two Algorithms for Computing Fractals from Iterated
                 Function Systems \\
                 Condensation Sets \\
                 How to Make Fractal Models with the Help of the Collage
                 Theorem \\
                 Blowing in the Wind: The Continuous Dependence of
                 Fractals on Parameters \\
                 Chaotic Dynamics on Fractals \\
                 The Addresses of Points on Fractals \\
                 Continuous Transformations from Code Space to Fractals
                 \\
                 Introduction to Dynamical Systems \\
                 Dynamics on Fractals: Or How to Compute Orbits by
                 Looking at Pictures \\
                 Equivalent Dynamical Systems \\
                 The Shadow of Deterministic Dynamics \\
                 The Meaningfulness of Inaccurately Computed Orbits is
                 Established by Means of a Shadowing Theorem \\
                 Chaotic Dynamics on Fractals \\
                 Fractal Dimension",
}


bibtype: book
filename: master.bib
label: Barroso:2009:DCI
author: Luiz Andre Barroso and Urs Holzle
title: The datacenter as a computer: an introduction to the design of warehouse-scale machines
volume: 6
publisher: Morgan and Claypool
address: San Rafael, CA, USA
pages: xi + 107
year: 2009
DOI: https://doi.org/10.2200/S00193ED1V01Y200905CAC006
ISBN: 1-59829-556-X (paperback), 1-59829-557-8 (e-book) OR 159829556X (paperback), 1598295578 (ebook)
ISSN: 1932-3243 (??invalid checksum??) OR 19323243 (??invalid checksum??)
LCCN: TK5105.5 .B273 2009
bibdate: Wed Apr 21 17:03:46 MDT 2010
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; melvyl.cdlib.org:210/CDL90
bibtimestamp: 2010.04.21 17:03:46 MDT
series: Synthesis lectures on computer architecture
subject: Web servers; design; multiprocessors; computer organization; high performance computing
acknowledgement: ack-nhfb
rawauthor: Luiz Andr{\'e} Barroso and Urs H{\"o}lzle
rawtitle: The datacenter as a computer: an introduction to the design of warehouse-scale machines
ISBN13:
978-1-59829-556-6 (paperback), 978-1-59829-557-3 (e-book) OR 9781598295566 (paperback), 9781598295573 (ebook)

TOC:
Introduction Warehouse-scale computers Emphasis on cost efficiency Not just a collection of servers One datacenter vs. several datacenters Why WSCs might matter to you Architectural overview of WSCs Storage Networking fabric Storage hierarchy Quantifying latency, bandwidth, and capacity Power usage Handling failures Workloads and software infrastructure Datacenter vs. desktop Performance and availability toolbox Cluster-level infrastructure software Resource management Hardware abstraction and other basic services Deployment and maintenance Programming frameworks Application-level software Workload examples Online: web search Offline: scholar article similarity A monitoring infrastructure Service-level dashboards Performance debugging tools Platform-level monitoring Buy vs. build Further reading Hardware building blocks Cost-efficient hardware How about parallel application performance How low-end can you go Balanced designs Datacenter basics Datacenter tier classifications Datacenter power systems UPS systems Power distribution units Datacenter cooling systems CRAC units Free cooling Air flow considerations In-rack cooling Container-based datacenters Energy and power efficiency Datacenter energy efficiency Sources of efficiency losses in datacenters Improving the energy efficiency of datacenters Measuring the efficiency of computing Some useful benchmarks Load vs. efficiency Energy-proportional computing Dynamic power range of energy-proportional machines Causes of poor energy proportionality How to improve energy proportionality Relative effectiveness of low-power modes The role of software in energy proportionality Datacenter power provisioning Deployment and power management strategies Advantages of oversubscribing facility power Trends in server energy usage Conclusions Further reading Modeling costs Capital costs Operational costs Case studies Real-world datacenter costs Modeling a partially filled datacenter Dealing with failures and repairs Implications of software-based fault tolerance Categorizing faults Fault severity Causes of service-level faults Machine-level failures What causes machine crashes Predicting faults Repairs Tolerating faults, not hiding them Closing remarks Hardware Software Economics Key challenges Rapidly changing workloads Building balanced systems from imbalanced components Curbing energy usage Amdahl's cruel law Conclusions References.

rawTOC:
Introduction \\ Warehouse-scale computers \\ Emphasis on cost efficiency \\ Not just a collection of servers \\ One datacenter vs. several datacenters \\ Why WSCs might matter to you \\ Architectural overview of WSCs \\ Storage \\ Networking fabric \\ Storage hierarchy \\ Quantifying latency, bandwidth, and capacity \\ Power usage \\ Handling failures \\ Workloads and software infrastructure \\ Datacenter vs. desktop \\ Performance and availability toolbox \\ Cluster-level infrastructure software \\ Resource management \\ Hardware abstraction and other basic services \\ Deployment and maintenance \\ Programming frameworks \\ Application-level software \\ Workload examples \\ Online: web search \\ Offline: scholar article similarity \\ A monitoring infrastructure \\ Service-level dashboards \\ Performance debugging tools \\ Platform-level monitoring \\ Buy vs. build \\ Further reading \\ Hardware building blocks \\ Cost-efficient hardware \\ How about parallel application performance \\ How low-end can you go \\ Balanced designs \\ Datacenter basics \\ Datacenter tier classifications \\ Datacenter power systems \\ UPS systems \\ Power distribution units \\ Datacenter cooling systems \\ CRAC units \\ Free cooling \\ Air flow considerations \\ In-rack cooling \\ Container-based datacenters \\ Energy and power efficiency \\ Datacenter energy efficiency \\ Sources of efficiency losses in datacenters \\ Improving the energy efficiency of datacenters \\ Measuring the efficiency of computing \\ Some useful benchmarks \\ Load vs. efficiency \\ Energy-proportional computing \\ Dynamic power range of energy-proportional machines \\ Causes of poor energy proportionality \\ How to improve energy proportionality \\ Relative effectiveness of low-power modes \\ The role of software in energy proportionality \\ Datacenter power provisioning \\ Deployment and power management strategies \\ Advantages of oversubscribing facility power \\ Trends in server energy usage \\ Conclusions \\ Further reading \\ Modeling costs \\ Capital costs \\ Operational costs \\ Case studies \\ Real-world datacenter costs \\ Modeling a partially filled datacenter \\ Dealing with failures and repairs \\ Implications of software-based fault tolerance \\ Categorizing faults \\ Fault severity \\ Causes of service-level faults \\ Machine-level failures \\ What causes machine crashes \\ Predicting faults \\ Repairs \\ Tolerating faults, not hiding them \\ Closing remarks \\ Hardware \\ Software \\ Economics \\ Key challenges \\ Rapidly changing workloads \\ Building balanced systems from imbalanced components \\ Curbing energy usage \\ Amdahl's cruel law \\ Conclusions \\ References.

entry:
@Book{Barroso:2009:DCI,
  author =       "Luiz Andr{\'e} Barroso and Urs H{\"o}lzle",
  title =        "The datacenter as a computer: an introduction to the
                 design of warehouse-scale machines",
  volume =       "6",
  publisher =    "Morgan and Claypool",
  address =      "San Rafael, CA, USA",
  pages =        "xi + 107",
  year =         "2009",
  DOI =          "https://doi.org/10.2200/S00193ED1V01Y200905CAC006",
  ISBN =         "1-59829-556-X (paperback), 1-59829-557-8 (e-book)",
  ISBN-13 =      "978-1-59829-556-6 (paperback), 978-1-59829-557-3
                 (e-book)",
  ISSN =         "1932-3243 (??invalid checksum??)",
  LCCN =         "TK5105.5 .B273 2009",
  bibdate =      "Wed Apr 21 17:03:46 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  series =       "Synthesis lectures on computer architecture",
  acknowledgement = ack-nhfb,
  subject =      "Web servers; design; multiprocessors; computer
                 organization; high performance computing",
  tableofcontents = "Introduction \\
                 Warehouse-scale computers \\
                 Emphasis on cost efficiency \\
                 Not just a collection of servers \\
                 One datacenter vs. several datacenters \\
                 Why WSCs might matter to you \\
                 Architectural overview of WSCs \\
                 Storage \\
                 Networking fabric \\
                 Storage hierarchy \\
                 Quantifying latency, bandwidth, and capacity \\
                 Power usage \\
                 Handling failures \\
                 Workloads and software infrastructure \\
                 Datacenter vs. desktop \\
                 Performance and availability toolbox \\
                 Cluster-level infrastructure software \\
                 Resource management \\
                 Hardware abstraction and other basic services \\
                 Deployment and maintenance \\
                 Programming frameworks \\
                 Application-level software \\
                 Workload examples \\
                 Online: web search \\
                 Offline: scholar article similarity \\
                 A monitoring infrastructure \\
                 Service-level dashboards \\
                 Performance debugging tools \\
                 Platform-level monitoring \\
                 Buy vs. build \\
                 Further reading \\
                 Hardware building blocks \\
                 Cost-efficient hardware \\
                 How about parallel application performance \\
                 How low-end can you go \\
                 Balanced designs \\
                 Datacenter basics \\
                 Datacenter tier classifications \\
                 Datacenter power systems \\
                 UPS systems \\
                 Power distribution units \\
                 Datacenter cooling systems \\
                 CRAC units \\
                 Free cooling \\
                 Air flow considerations \\
                 In-rack cooling \\
                 Container-based datacenters \\
                 Energy and power efficiency \\
                 Datacenter energy efficiency \\
                 Sources of efficiency losses in datacenters \\
                 Improving the energy efficiency of datacenters \\
                 Measuring the efficiency of computing \\
                 Some useful benchmarks \\
                 Load vs. efficiency \\
                 Energy-proportional computing \\
                 Dynamic power range of energy-proportional machines \\
                 Causes of poor energy proportionality \\
                 How to improve energy proportionality \\
                 Relative effectiveness of low-power modes \\
                 The role of software in energy proportionality \\
                 Datacenter power provisioning \\
                 Deployment and power management strategies \\
                 Advantages of oversubscribing facility power \\
                 Trends in server energy usage \\
                 Conclusions \\
                 Further reading \\
                 Modeling costs \\
                 Capital costs \\
                 Operational costs \\
                 Case studies \\
                 Real-world datacenter costs \\
                 Modeling a partially filled datacenter \\
                 Dealing with failures and repairs \\
                 Implications of software-based fault tolerance \\
                 Categorizing faults \\
                 Fault severity \\
                 Causes of service-level faults \\
                 Machine-level failures \\
                 What causes machine crashes \\
                 Predicting faults \\
                 Repairs \\
                 Tolerating faults, not hiding them \\
                 Closing remarks \\
                 Hardware \\
                 Software \\
                 Economics \\
                 Key challenges \\
                 Rapidly changing workloads \\
                 Building balanced systems from imbalanced components
                 \\
                 Curbing energy usage \\
                 Amdahl's cruel law \\
                 Conclusions \\
                 References.",
}


bibtype: book
filename: master.bib
label: Barrow:1979:PC
author: Gordon M. Barrow
title: Physical Chemistry
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
edition: Fourth
pages: xvi + 832
year: 1979
LCCN: QD453.2.B37 1979
bibdate: Sat Jul 25 13:55:27 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.07.25 13:55:27 ???
acknowledgement: ack-nhfb
rawauthor: Gordon M. Barrow
rawtitle: Physical Chemistry
ISBN:
0-07-003825-2 (hardcover), 0-07-066170-7 (paperback) OR 0070038252 (hardcover), 0070661707 (paperback)

ISBN13:
978-0-07-003825-7 (hardcover), 978-0-07-066170-7 (paperback) OR 9780070038257 (hardcover), 9780070661707 (paperback)

TOC:
Preface The Physical Properties of Gases / 1 The Molecular Theory of Gases / 48 Energy of Chemical Systems: The First Law of Thermodynamics / 100 Entropy and the Second and Third Laws of Thermodynamics / 160 Free Energy and Chemical Equilibria / 213 Solutions / 274 Phase Equilibria / 313 Electrolytes in Solution / 360 Elements of Quantum Mechanics / 427 Electronic Structures of Atoms and Diatomic Molecules / 476 Symmetry and the Electronic States of Molecules / 530 Spectroscopy / 567 Diffraction / 647 Electrical and Magnetic Properties / 700 Rates and Mechanisms / 726 Elementary Reactions / 775 Macromolecules / 826 Appendix A Mathematics / 863 Appendix B Tables of Properties / 873 Appendix C Character Tables for a Selection of Point Tables / 891 Appendix D SI Units / 895 Index / 897

rawTOC:
Preface \\ The Physical Properties of Gases / 1 \\ The Molecular Theory of Gases / 48 \\ Energy of Chemical Systems: The First Law of Thermodynamics / 100 \\ Entropy and the Second and Third Laws of Thermodynamics / 160 \\ Free Energy and Chemical Equilibria / 213 \\ Solutions / 274 \\ Phase Equilibria / 313 \\ Electrolytes in Solution / 360 \\ Elements of Quantum Mechanics / 427 \\ Electronic Structures of Atoms and Diatomic Molecules / 476 \\ Symmetry and the Electronic States of Molecules / 530 \\ Spectroscopy / 567 \\ Diffraction / 647 \\ Electrical and Magnetic Properties / 700 \\ Rates and Mechanisms / 726 \\ Elementary Reactions / 775 \\ Macromolecules / 826 \\ Appendix A Mathematics / 863 \\ Appendix B Tables of Properties / 873 \\ Appendix C Character Tables for a Selection of Point Tables / 891 \\ Appendix D SI Units / 895 \\ Index / 897

entry:
@Book{Barrow:1979:PC,
  author =       "Gordon M. Barrow",
  title =        "Physical Chemistry",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Fourth",
  pages =        "xvi + 832",
  year =         "1979",
  ISBN =         "0-07-003825-2 (hardcover), 0-07-066170-7 (paperback)",
  ISBN-13 =      "978-0-07-003825-7 (hardcover), 978-0-07-066170-7
                 (paperback)",
  LCCN =         "QD453.2.B37 1979",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface \\
                 The Physical Properties of Gases / 1 \\
                 The Molecular Theory of Gases / 48 \\
                 Energy of Chemical Systems: The First Law of
                 Thermodynamics / 100 \\
                 Entropy and the Second and Third Laws of Thermodynamics
                 / 160 \\
                 Free Energy and Chemical Equilibria / 213 \\
                 Solutions / 274 \\
                 Phase Equilibria / 313 \\
                 Electrolytes in Solution / 360 \\
                 Elements of Quantum Mechanics / 427 \\
                 Electronic Structures of Atoms and Diatomic Molecules /
                 476 \\
                 Symmetry and the Electronic States of Molecules / 530
                 \\
                 Spectroscopy / 567 \\
                 Diffraction / 647 \\
                 Electrical and Magnetic Properties / 700 \\
                 Rates and Mechanisms / 726 \\
                 Elementary Reactions / 775 \\
                 Macromolecules / 826 \\
                 Appendix A Mathematics / 863 \\
                 Appendix B Tables of Properties / 873 \\
                 Appendix C Character Tables for a Selection of Point
                 Tables / 891 \\
                 Appendix D SI Units / 895 \\
                 Index / 897",
}


bibtype: book
filename: master.bib
label: Barrow:1992:PSC
author: John D. Barrow
title: Pi in the Sky: Counting, Thinking, and Being
publisher: pub-CLARENDON
address: pub-CLARENDON:adr
pages: ix + 317
year: 1992
ISBN: 0-19-853956-8 OR 0198539568
ISBN13: 978-0-19-853956-8 OR 9780198539568
LCCN: QA36 .B37 1992
bibdate: Sat Dec 17 14:44:47 MST 2005
bibtimestamp: 2005.12.17 14:44:47 MST
subject: Mathematics
acknowledgement: ack-nhfb
rawauthor: John D. Barrow
rawtitle: Pi in the Sky: Counting, Thinking, and Being
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/pi.bib; z3950.loc.gov:7090/Voyager

abstract:
John D. Barrow's booktitle Pi in the Sky is a profound --- and profoundly different --- exploration of the world of mathematics: where it comes from, what it is, and where it's going to take us if we follow it to the limit in our search for the ultimate meaning of the universe. Barrow begins by investigating whether math is a purely human invention inspired by our practical needs. Or is it something inherent in nature waiting to be discovered? In answering these questions, Barrow provides a bridge between the usually irreconcilable worlds of mathematics and theology. Along the way, he treats us to a history of counting all over the world, from Egyptian hieroglyphics to logical friction, from number mysticism to Marxist mathematics. And he introduces us to a host of peculiar individuals who have thought some of the deepest and strangest thoughts that human minds have ever thought, from Lao-Tse to Robert Pirsig, Charles Darwin, and Umberto Eco. Barrow thus provides the historical framework and the intellectual tools necessary to an understanding of some of today's weightiest mathematical concepts.

TOC:
1: From mystery to history A mystery within an enigma Illusions of certainty The secret society Non-Euclideanism Logics To Be or Not To Be The Rashomon effect The analogy that never breaks down? Tinkling symbols Thinking about thinking 2: The Counter Culture By the pricking of my thumbs The bare bones of history Creation or evolution The ordinals versus the cardinals Counting without counting Fingers and toes Baser methods Counting with base 2 The neo-2 system of counting Counting in fives What's so special about sixty? The spread of the decimal system The dance of the seven veils Ritual geometry The place-value system and the invention of zero A final accounting 3: With form but void Numerology The very opposite Hilbert's scheme Kurt Godel More surprises Thinking by numbers Bourbachique mathematique Arithmetic in chaos Science friction Mathematicians off form 4: The mothers of inventionism Mind from matter Shadowlands Trap-door functions Mathematical creation Marxist mathematics Complexity and simplicity Maths as psychology Pre-established mental harmony? Self-discovery 5: Intuitionism: the immaculate construction Mathematicians from outer space Ramanujan Intuitionism and three-valued logic A very peculiar practice A closer look at Brouwer What is `intuition'? The tragedy of Cantor and Kronecker Cantor and infinity The comedy of Hilbert and Brouwer The Four-Colour Conjecture Transhuman mathematics New-age mathematics Paradigms Computability, compressibility, and utility 6: Platonic heavens above and within The growth of abstraction Footsteps through Plato's footnotes The platonic world of mathematics Far away and long ago The presence of the past The unreasonable effectiveness of mathematics Difficulties with platonic relationships Seance or science? Revel without a cause A computer ontological argument A speculative anthropic interpretation of mathematics. Maths and mysticism Supernatural numbers?

rawabstract:
John D. Barrow's \booktitle{Pi in the Sky} is a profound --- and profoundly different --- exploration of the world of mathematics: where it comes from, what it is, and where it's going to take us if we follow it to the limit in our search for the ultimate meaning of the universe. Barrow begins by investigating whether math is a purely human invention inspired by our practical needs. Or is it something inherent in nature waiting to be discovered? In answering these questions, Barrow provides a bridge between the usually irreconcilable worlds of mathematics and theology. Along the way, he treats us to a history of counting all over the world, from Egyptian hieroglyphics to logical friction, from number mysticism to Marxist mathematics. And he introduces us to a host of peculiar individuals who have thought some of the deepest and strangest thoughts that human minds have ever thought, from Lao-Tse to Robert Pirsig, Charles Darwin, and Umberto Eco. Barrow thus provides the historical framework and the intellectual tools necessary to an understanding of some of today's weightiest mathematical concepts.

rawTOC:
1: From mystery to history \\ A mystery within an enigma \\ Illusions of certainty \\ The secret society \\ Non-Euclideanism \\ Logics \\ To Be or Not To Be \\ The Rashomon effect \\ The analogy that never breaks down? \\ Tinkling symbols \\ Thinking about thinking \\ 2: The Counter Culture \\ By the pricking of my thumbs \\ The bare bones of history \\ Creation or evolution \\ The ordinals versus the cardinals \\ Counting without counting \\ Fingers and toes \\ Baser methods \\ Counting with base 2 \\ The neo-2 system of counting \\ Counting in fives \\ What's so special about sixty? \\ The spread of the decimal system \\ The dance of the seven veils \\ Ritual geometry \\ The place-value system and the invention of zero \\ A final accounting \\ 3: With form but void \\ Numerology \\ The very opposite \\ Hilbert's scheme \\ Kurt G{\"o}del \\ More surprises \\ Thinking by numbers \\ Bourbachique math{\'e}matique \\ Arithmetic in chaos \\ Science friction \\ Mathematicians off form \\ 4: The mothers of inventionism \\ Mind from matter \\ Shadowlands \\ Trap-door functions \\ Mathematical creation \\ Marxist mathematics \\ Complexity and simplicity \\ Maths as psychology \\ Pre-established mental harmony? \\ Self-discovery \\ 5: Intuitionism: the immaculate construction \\ Mathematicians from outer space \\ Ramanujan \\ Intuitionism and three-valued logic \\ A very peculiar practice \\ A closer look at Brouwer \\ What is `intuition'? The tragedy of Cantor and Kronecker \\ Cantor and infinity \\ The comedy of Hilbert and Brouwer \\ The Four-Colour Conjecture \\ Transhuman mathematics \\ New-age mathematics \\ Paradigms \\ Computability, compressibility, and utility \\ 6: Platonic heavens above and within \\ The growth of abstraction \\ Footsteps through Plato's footnotes \\ The platonic world of mathematics \\ Far away and long ago \\ The presence of the past \\ The unreasonable effectiveness of mathematics \\ Difficulties with platonic relationships \\ Seance or science? \\ Revel without a cause \\ A computer ontological argument \\ A speculative anthropic interpretation of mathematics. \\ Maths and mysticism \\ Supernatural numbers?

entry:
@Book{Barrow:1992:PSC,
  author =       "John D. Barrow",
  title =        "Pi in the Sky: Counting, Thinking, and Being",
  publisher =    pub-CLARENDON,
  address =      pub-CLARENDON:adr,
  pages =        "ix + 317",
  year =         "1992",
  ISBN =         "0-19-853956-8",
  ISBN-13 =      "978-0-19-853956-8",
  LCCN =         "QA36 .B37 1992",
  bibdate =      "Sat Dec 17 14:44:47 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/pi.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$30.00 (Oxford Univ. Press)",
  abstract =     "John D. Barrow's \booktitle{Pi in the Sky} is a
                 profound --- and profoundly different --- exploration
                 of the world of mathematics: where it comes from, what
                 it is, and where it's going to take us if we follow it
                 to the limit in our search for the ultimate meaning of
                 the universe. Barrow begins by investigating whether
                 math is a purely human invention inspired by our
                 practical needs. Or is it something inherent in nature
                 waiting to be discovered? In answering these questions,
                 Barrow provides a bridge between the usually
                 irreconcilable worlds of mathematics and theology.
                 Along the way, he treats us to a history of counting
                 all over the world, from Egyptian hieroglyphics to
                 logical friction, from number mysticism to Marxist
                 mathematics. And he introduces us to a host of peculiar
                 individuals who have thought some of the deepest and
                 strangest thoughts that human minds have ever thought,
                 from Lao-Tse to Robert Pirsig, Charles Darwin, and
                 Umberto Eco. Barrow thus provides the historical
                 framework and the intellectual tools necessary to an
                 understanding of some of today's weightiest
                 mathematical concepts.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Mathematics",
  tableofcontents = "1: From mystery to history \\
                 A mystery within an enigma \\
                 Illusions of certainty \\
                 The secret society \\
                 Non-Euclideanism \\
                 Logics \\
                 To Be or Not To Be \\
                 The Rashomon effect \\
                 The analogy that never breaks down? \\
                 Tinkling symbols \\
                 Thinking about thinking \\
                 2: The Counter Culture \\
                 By the pricking of my thumbs \\
                 The bare bones of history \\
                 Creation or evolution \\
                 The ordinals versus the cardinals \\
                 Counting without counting \\
                 Fingers and toes \\
                 Baser methods \\
                 Counting with base 2 \\
                 The neo-2 system of counting \\
                 Counting in fives \\
                 What's so special about sixty? \\
                 The spread of the decimal system \\
                 The dance of the seven veils \\
                 Ritual geometry \\
                 The place-value system and the invention of zero \\
                 A final accounting \\
                 3: With form but void \\
                 Numerology \\
                 The very opposite \\
                 Hilbert's scheme \\
                 Kurt G{\"o}del \\
                 More surprises \\
                 Thinking by numbers \\
                 Bourbachique math{\'e}matique \\
                 Arithmetic in chaos \\
                 Science friction \\
                 Mathematicians off form \\
                 4: The mothers of inventionism \\
                 Mind from matter \\
                 Shadowlands \\
                 Trap-door functions \\
                 Mathematical creation \\
                 Marxist mathematics \\
                 Complexity and simplicity \\
                 Maths as psychology \\
                 Pre-established mental harmony? \\
                 Self-discovery \\
                 5: Intuitionism: the immaculate construction \\
                 Mathematicians from outer space \\
                 Ramanujan \\
                 Intuitionism and three-valued logic \\
                 A very peculiar practice \\
                 A closer look at Brouwer \\
                 What is `intuition'? The tragedy of Cantor and
                 Kronecker \\
                 Cantor and infinity \\
                 The comedy of Hilbert and Brouwer \\
                 The Four-Colour Conjecture \\
                 Transhuman mathematics \\
                 New-age mathematics \\
                 Paradigms \\
                 Computability, compressibility, and utility \\
                 6: Platonic heavens above and within \\
                 The growth of abstraction \\
                 Footsteps through Plato's footnotes \\
                 The platonic world of mathematics \\
                 Far away and long ago \\
                 The presence of the past \\
                 The unreasonable effectiveness of mathematics \\
                 Difficulties with platonic relationships \\
                 Seance or science? \\
                 Revel without a cause \\
                 A computer ontological argument \\
                 A speculative anthropic interpretation of mathematics.
                 \\
                 Maths and mysticism \\
                 Supernatural numbers?",
}


bibtype: book
filename: master.bib
label: Barrow:1996:PSC
author: John D. Barrow
title: Pi in the Sky: Counting, Thinking, and Being
publisher: pub-LITTLE-BROWN
address: pub-LITTLE-BROWN:adr
pages: ix + 317
year: 1996
ISBN: 0-316-08259-7 OR 0316082597
ISBN13: 978-0-316-08259-4 OR 9780316082594
LCCN: QA36 .B37 1994
bibdate: Sat Dec 17 14:44:47 MST 2005
bibtimestamp: 2005.12.17 14:44:47 MST
remark: Originally published: Cambridge: Oxford University, 1992.
subject: Mathematics
acknowledgement: ack-nhfb
rawauthor: John D. Barrow
rawtitle: Pi in the Sky: Counting, Thinking, and Being
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/pi.bib; z3950.loc.gov:7090/Voyager

abstract:
John D. Barrow's booktitle Pi in the Sky is a profound -- and profoundly different exploration of the world of mathematics: where it comes from, what it is, and where it's going to take us if we follow it to the limit in our search for the ultimate meaning of the universe. Barrow begins by investigating whether math is a purely human invention inspired by our practical needs. Or is it something inherent in nature waiting to be discovered? In answering these questions, Barrow provides a bridge between the usually irreconcilable worlds of mathematics and theology. Along the way, he treats us to a history of counting all over the world, from Egyptian hieroglyphics to logical friction, from number mysticism to Marxist mathematics. And he introduces us to a host of peculiar individuals who have thought some of the deepest and strangest thoughts that human minds have ever thought, from Lao-Tse to Robert Pirsig, Charles Darwin, and Umberto Eco. Barrow thus provides the historical framework and the intellectual tools necessary to an understanding of some of today's weightiest mathematical concepts.

TOC:
1: From mystery to history / 1 A mystery within an enigma / 1 Illusions of certainty / 2 The secret society / 6 Non-Euclideanism / 8 Logics --- To Be or Not To Be / 15 The Rashomon effect / 19 The analogy that never breaks down? / 21 Tinkling symbols / 23 Thinking about thinking / 24 2: The counter culture / 26 By the pricking of my thumbs / 26 The bare bones of history / 28 Creation or evolution / 33 The ordinals versus the cardinals / 36 Counting without counting / 41 Fingers and toes / 45 Baser methods / 49 Counting with base 2 / 51 The neo-2 system of counting / 56 Counting In fives / 60 What's so special about sixty? / 64 The spread of the decimal system / 68 The dance of the seven veils / 72 Ritual geometry / 73 The system and the Invention of zero / 81 A final accounting / 101 3: With form but void / 106 Numerology / 106 The very opposite / 108 Hubert's scheme / 112 Kurt Godel / 117 More surprises / 124 Thinking by numbers / 127 Bourbachique mathematique / 129 Arithmetic in chaos 1 / 34 Science friction / 137 Mathematics off form / 140 4: The mothers of inventionism / 147 Mind from matter / 147 Shadowlands / 149 Trap-door functions / 150 Mathematical creation / 154 Marxist mathematics / 156 Complexity and simplicity / 159 Maths as psychology / 165 Pre-established mental harmony? / 171 Sell-discovery / 176 5: Intuitionism: the immaculate construction / 178 Mathematicians from outer space / 178 Ramanujan / 181 Intuitionism and three-valued logic / 185 A very peculiar practice / 188 A closer look at Brouwer / 192 What Is `Intuition'? / 196 The tragedy of Cantor and Kronecker / 198 Cantor and infinity / 205 The comedy of Hubert and Brouwer / 216 The Four-Colour Conjecture / 227 Transhuman mathematics / 234 New-age mathematics / 236 Paradigms / 243 Computability, compressibility, and utility / 245 6: Platonic heavens above and within / 249 The growth of abstraction / 249 Footsteps through Plato's footnotes / 251 The platonic world of mathematics / 258 Far away and long ago / 265 The presence of the past / 268 The unreasonable effectiveness of mathematics / 270 Difficulties with platonic relationships / 272 Seance or science? / 273 Revel without a cause / 276 A computer ontological argument / 280 A speculative anthropic interpretation of mathematics / 284 Moths and mysticism / 292 Supernatural numbers? / 294 further reading / 298 Index / 311

rawabstract:
John D. Barrow's \booktitle{Pi in the Sky} is a profound -- and profoundly different exploration of the world of mathematics: where it comes from, what it is, and where it's going to take us if we follow it to the limit in our search for the ultimate meaning of the universe. Barrow begins by investigating whether math is a purely human invention inspired by our practical needs. Or is it something inherent in nature waiting to be discovered? In answering these questions, Barrow provides a bridge between the usually irreconcilable worlds of mathematics and theology. Along the way, he treats us to a history of counting all over the world, from Egyptian hieroglyphics to logical friction, from number mysticism to Marxist mathematics. And he introduces us to a host of peculiar individuals who have thought some of the deepest and strangest thoughts that human minds have ever thought, from Lao-Tse to Robert Pirsig, Charles Darwin, and Umberto Eco. Barrow thus provides the historical framework and the intellectual tools necessary to an understanding of some of today's weightiest mathematical concepts.

rawTOC:
1: From mystery to history / 1 \\ A mystery within an enigma / 1 \\ Illusions of certainty / 2 \\ The secret society / 6 \\ Non-Euclideanism / 8 \\ Logics --- To Be or Not To Be / 15 \\ The Rashomon effect / 19 \\ The analogy that never breaks down? / 21 \\ Tinkling symbols / 23 \\ Thinking about thinking / 24 \\ 2: The counter culture / 26 \\ By the pricking of my thumbs / 26 \\ The bare bones of history / 28 \\ Creation or evolution / 33 \\ The ordinals versus the cardinals / 36 \\ Counting without counting / 41 \\ Fingers and toes / 45 \\ Baser methods / 49 \\ Counting with base 2 / 51 \\ The neo-2 system of counting / 56 \\ Counting In fives / 60 \\ What's so special about sixty? / 64 \\ The spread of the decimal system / 68 \\ The dance of the seven veils / 72 \\ Ritual geometry / 73 \\ The system and the Invention of zero / 81 \\ A final accounting / 101 \\ 3: With form but void / 106 \\ Numerology / 106 \\ The very opposite / 108 \\ Hubert's scheme / 112 \\ Kurt G{\"o}del / 117 \\ More surprises / 124 \\ Thinking by numbers / 127 \\ Bourbachique math{\'e}matique / 129 \\ Arithmetic in chaos 1 / 34 \\ Science friction / 137 \\ Mathematics off form / 140 \\ 4: The mothers of inventionism / 147 \\ Mind from matter / 147 \\ Shadowlands / 149 \\ Trap-door functions / 150 \\ Mathematical creation / 154 \\ Marxist mathematics / 156 \\ Complexity and simplicity / 159 \\ Maths as psychology / 165 \\ Pre-established mental harmony? / 171 \\ Sell-discovery / 176 \\ 5: Intuitionism: the immaculate construction / 178 \\ Mathematicians from outer space / 178 \\ Ramanujan / 181 \\ Intuitionism and three-valued logic / 185 \\ A very peculiar practice / 188 \\ A closer look at Brouwer / 192 \\ What Is `Intuition'? / 196 \\ The tragedy of Cantor and Kronecker / 198 \\ Cantor and infinity / 205 \\ The comedy of Hubert and Brouwer / 216 \\ The Four-Colour Conjecture / 227 \\ Transhuman mathematics / 234 \\ New-age mathematics / 236 \\ Paradigms / 243 \\ Computability, compressibility, and utility / 245 \\ 6: Platonic heavens above and within / 249 \\ The growth of abstraction / 249 \\ Footsteps through Plato's footnotes / 251 \\ The platonic world of mathematics / 258 \\ Far away and long ago / 265 \\ The presence of the past / 268 \\ The unreasonable effectiveness of mathematics / 270 \\ Difficulties with platonic relationships / 272 \\ Seance or science? / 273 \\ Revel without a cause / 276 \\ A computer ontological argument / 280 \\ A speculative anthropic interpretation of mathematics / 284 \\ Moths and mysticism / 292 \\ Supernatural numbers? / 294 \\ further reading / 298 \\ Index / 311

entry:
@Book{Barrow:1996:PSC,
  author =       "John D. Barrow",
  title =        "Pi in the Sky: Counting, Thinking, and Being",
  publisher =    pub-LITTLE-BROWN,
  address =      pub-LITTLE-BROWN:adr,
  pages =        "ix + 317",
  year =         "1996",
  ISBN =         "0-316-08259-7",
  ISBN-13 =      "978-0-316-08259-4",
  LCCN =         "QA36 .B37 1994",
  bibdate =      "Sat Dec 17 14:44:47 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/pi.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "John D. Barrow's \booktitle{Pi in the Sky} is a
                 profound -- and profoundly different exploration of the
                 world of mathematics: where it comes from, what it is,
                 and where it's going to take us if we follow it to the
                 limit in our search for the ultimate meaning of the
                 universe. Barrow begins by investigating whether math
                 is a purely human invention inspired by our practical
                 needs. Or is it something inherent in nature waiting to
                 be discovered? In answering these questions, Barrow
                 provides a bridge between the usually irreconcilable
                 worlds of mathematics and theology. Along the way, he
                 treats us to a history of counting all over the world,
                 from Egyptian hieroglyphics to logical friction, from
                 number mysticism to Marxist mathematics. And he
                 introduces us to a host of peculiar individuals who
                 have thought some of the deepest and strangest thoughts
                 that human minds have ever thought, from Lao-Tse to
                 Robert Pirsig, Charles Darwin, and Umberto Eco. Barrow
                 thus provides the historical framework and the
                 intellectual tools necessary to an understanding of
                 some of today's weightiest mathematical concepts.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  remark =       "Originally published: Cambridge: Oxford University,
                 1992.",
  subject =      "Mathematics",
  tableofcontents = "1: From mystery to history / 1 \\
                 A mystery within an enigma / 1 \\
                 Illusions of certainty / 2 \\
                 The secret society / 6 \\
                 Non-Euclideanism / 8 \\
                 Logics --- To Be or Not To Be / 15 \\
                 The Rashomon effect / 19 \\
                 The analogy that never breaks down? / 21 \\
                 Tinkling symbols / 23 \\
                 Thinking about thinking / 24 \\
                 2: The counter culture / 26 \\
                 By the pricking of my thumbs / 26 \\
                 The bare bones of history / 28 \\
                 Creation or evolution / 33 \\
                 The ordinals versus the cardinals / 36 \\
                 Counting without counting / 41 \\
                 Fingers and toes / 45 \\
                 Baser methods / 49 \\
                 Counting with base 2 / 51 \\
                 The neo-2 system of counting / 56 \\
                 Counting In fives / 60 \\
                 What's so special about sixty? / 64 \\
                 The spread of the decimal system / 68 \\
                 The dance of the seven veils / 72 \\
                 Ritual geometry / 73 \\
                 The system and the Invention of zero / 81 \\
                 A final accounting / 101 \\
                 3: With form but void / 106 \\
                 Numerology / 106 \\
                 The very opposite / 108 \\
                 Hubert's scheme / 112 \\
                 Kurt G{\"o}del / 117 \\
                 More surprises / 124 \\
                 Thinking by numbers / 127 \\
                 Bourbachique math{\'e}matique / 129 \\
                 Arithmetic in chaos 1 / 34 \\
                 Science friction / 137 \\
                 Mathematics off form / 140 \\
                 4: The mothers of inventionism / 147 \\
                 Mind from matter / 147 \\
                 Shadowlands / 149 \\
                 Trap-door functions / 150 \\
                 Mathematical creation / 154 \\
                 Marxist mathematics / 156 \\
                 Complexity and simplicity / 159 \\
                 Maths as psychology / 165 \\
                 Pre-established mental harmony? / 171 \\
                 Sell-discovery / 176 \\
                 5: Intuitionism: the immaculate construction / 178 \\
                 Mathematicians from outer space / 178 \\
                 Ramanujan / 181 \\
                 Intuitionism and three-valued logic / 185 \\
                 A very peculiar practice / 188 \\
                 A closer look at Brouwer / 192 \\
                 What Is `Intuition'? / 196 \\
                 The tragedy of Cantor and Kronecker / 198 \\
                 Cantor and infinity / 205 \\
                 The comedy of Hubert and Brouwer / 216 \\
                 The Four-Colour Conjecture / 227 \\
                 Transhuman mathematics / 234 \\
                 New-age mathematics / 236 \\
                 Paradigms / 243 \\
                 Computability, compressibility, and utility / 245 \\
                 6: Platonic heavens above and within / 249 \\
                 The growth of abstraction / 249 \\
                 Footsteps through Plato's footnotes / 251 \\
                 The platonic world of mathematics / 258 \\
                 Far away and long ago / 265 \\
                 The presence of the past / 268 \\
                 The unreasonable effectiveness of mathematics / 270 \\
                 Difficulties with platonic relationships / 272 \\
                 Seance or science? / 273 \\
                 Revel without a cause / 276 \\
                 A computer ontological argument / 280 \\
                 A speculative anthropic interpretation of mathematics /
                 284 \\
                 Moths and mysticism / 292 \\
                 Supernatural numbers? / 294 \\
                 further reading / 298 \\
                 Index / 311",
}


bibtype: book
filename: master.bib
label: Barrow:1998:ILS
author: John D. Barrow
title: Impossibility: the limits of science and the science of limits
publisher: pub-OXFORD
address: pub-OXFORD:adr
pages: xiii + 279
year: 1998
ISBN: 0-19-851890-0 OR 0198518900
ISBN13: 978-0-19-851890-7 OR 9780198518907
LCCN: Q175 .B2245 1998
bibdate: Sat Dec 17 14:44:47 MST 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2005.12.17 14:44:47 MST
subject: Science; Philosophy; Limit (Logic); Godel's theorem
acknowledgement: ack-nhfb
rawauthor: John D. Barrow
rawtitle: Impossibility: the limits of science and the science of limits
entry:
@Book{Barrow:1998:ILS,
  author =       "John D. Barrow",
  title =        "Impossibility: the limits of science and the science
                 of limits",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xiii + 279",
  year =         "1998",
  ISBN =         "0-19-851890-0",
  ISBN-13 =      "978-0-19-851890-7",
  LCCN =         "Q175 .B2245 1998",
  bibdate =      "Sat Dec 17 14:44:47 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Science; Philosophy; Limit (Logic); G{\"o}del's
                 theorem",
}


bibtype: book
filename: master.bib
label: Barstow:1984:IPE
author: David R. Barstow and Howard E. Shrobe and Erik Sandewall
title: Interactive Programming Environments
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
pages: xii + 609
year: 1984
ISBN: 0-07-003885-6 OR 0070038856
ISBN13: 978-0-07-003885-1 OR 9780070038851
LCCN: QA76.6 .I5251 1984
bibdate: Tue Dec 14 22:40:18 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:40:18 ???
acknowledgement: ack-nhfb
rawauthor: David R. Barstow and Howard E. Shrobe and Erik Sandewall
rawtitle: Interactive Programming Environments
entry:
@Book{Barstow:1984:IPE,
  author =       "David R. Barstow and Howard E. Shrobe and Erik
                 Sandewall",
  title =        "Interactive Programming Environments",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xii + 609",
  year =         "1984",
  ISBN =         "0-07-003885-6",
  ISBN-13 =      "978-0-07-003885-1",
  LCCN =         "QA76.6 .I5251 1984",
  bibdate =      "Tue Dec 14 22:40:18 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$34.95",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Bartels:1987:ISU
author: Richard H. Bartels and John C. Beatty and Brian A. Barsky
title: An Introduction to Splines for Use in Computer Graphics and Geometric Modeling
publisher: pub-MORGAN-KAUFMANN
address: pub-MORGAN-KAUFMANN:adr
pages: xiv + 476
year: 1987
ISBN: 0-934613-27-3 OR 0934613273
ISBN13: 978-0-934613-27-9 OR 9780934613279
LCCN: T385 .B3651 1987
bibdate: Tue Dec 14 22:40:21 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:40:21 ???
acknowledgement: ack-nhfb
rawauthor: Richard H. Bartels and John C. Beatty and Brian A. Barsky
rawtitle: An Introduction to Splines for Use in Computer Graphics and Geometric Modeling
entry:
@Book{Bartels:1987:ISU,
  author =       "Richard H. Bartels and John C. Beatty and Brian A.
                 Barsky",
  title =        "An Introduction to Splines for Use in Computer
                 Graphics and Geometric Modeling",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  pages =        "xiv + 476",
  year =         "1987",
  ISBN =         "0-934613-27-3",
  ISBN-13 =      "978-0-934613-27-9",
  LCCN =         "T385 .B3651 1987",
  bibdate =      "Tue Dec 14 22:40:21 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$38.95",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Bartlett:1980:FQC
author: John Bartlett
publisher: pub-LITTLE-BROWN
address: pub-LITTLE-BROWN:adr
edition: Fifteenth
pages: lviii + 1540
year: 1980
ISBN: 0-316-08275-9 OR 0316082759
ISBN13: 978-0-316-08275-4 OR 9780316082754
LCCN: PN6081 .B3 1980
bibdate: Tue Dec 14 22:40:24 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:40:24 ???
keywords: Quotations, English
acknowledgement: ack-nhfb
rawauthor: John Bartlett
title:
Familiar Quotations: a collection of passages, phrases, and proverbs traced to their sources in ancient and modern literature

abstract:
Chronologically arranged entries supply quotations from 2,250 authors and major collective or anonymous works, with an alphabetical index of authors and an index to the text.

TOC:
Preface to the Fifteenth edition Historical note Guide to the use of Familiar Quotations Index of authors Familiar Quotations, from ancient Egypt and the Bible to the present Index

rawabstract:
Chronologically arranged entries supply quotations from 2,250 authors and major collective or anonymous works, with an alphabetical index of authors and an index to the text.

rawtitle:
Familiar Quotations: a collection of passages, phrases, and proverbs traced to their sources in ancient and modern literature

rawTOC:
Preface to the Fifteenth edition \\ Historical note \\ Guide to the use of Familiar Quotations \\ Index of authors \\ Familiar Quotations, from ancient Egypt and the Bible to the present \\ Index

entry:
@Book{Bartlett:1980:FQC,
  author =       "John Bartlett",
  title =        "Familiar Quotations: a collection of passages,
                 phrases, and proverbs traced to their sources in
                 ancient and modern literature",
  publisher =    pub-LITTLE-BROWN,
  address =      pub-LITTLE-BROWN:adr,
  edition =      "Fifteenth",
  pages =        "lviii + 1540",
  year =         "1980",
  ISBN =         "0-316-08275-9",
  ISBN-13 =      "978-0-316-08275-4",
  LCCN =         "PN6081 .B3 1980",
  bibdate =      "Tue Dec 14 22:40:24 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Chronologically arranged entries supply quotations
                 from 2,250 authors and major collective or anonymous
                 works, with an alphabetical index of authors and an
                 index to the text.",
  acknowledgement = ack-nhfb,
  DEWEY =        "808.88/2",
  idnumber =     "525",
  keywords =     "Quotations, English",
  tableofcontents = "Preface to the Fifteenth edition \\
                 Historical note \\
                 Guide to the use of Familiar Quotations \\
                 Index of authors \\
                 Familiar Quotations, from ancient Egypt and the Bible
                 to the present \\
                 Index",
}


bibtype: book
filename: master.bib
label: Bartosh:2005:EMX
author: Michael Bartosh and Ryan Faas
title: Essential Mac OS X Panther Server Administration
publisher: pub-ORA
address: pub-ORA:adr
pages: xxii + 822
year: 2005
ISBN: 0-596-00635-7 (paperback) OR 0596006357 (paperback)
ISBN13: 978-0-596-00635-8 (paperback) OR 9780596006358 (paperback)
LCCN: QA76.76.O63 B38 2005
bibdate: Thu Oct 6 07:22:51 MDT 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; melvyl.cdlib.org:210/CDL90
bibtimestamp: 2005.10.06 07:22:51 MDT
remark: Integrating Mac OS X server into heterogeneous networks---Cover.
subject: Mac OS; Operating systems (Computers); Macintosh (Computer); Web servers
acknowledgement: ack-nhfb
rawauthor: Michael Bartosh and Ryan Faas
rawtitle: Essential {Mac OS X Panther} Server Administration
TOC:
Part I: Server installation and management 1: Designing your server environment 2: Installing and configuring Mac OS X server 3: Server management tools 4: System administration 5: Troubleshooting Part II: Directory service 6: Open directory server 7: Identification and authorization in open directory server 8: Authentication in open directory server 9: Replication in open directory server Part III: IP services 10: Xinetd 11: DNS 12: DHCP 13: NAT Part IV: File services 14: File services overview 15: Apple filing protocol 16: Windows file services 17: FTP 18: Network file system 19: Print services Part V: Security services 20: Mac OS X server firewall 21: Virtual private networks Part VI: Internet services 22: Mail services 23: Web services 24: Application servers Part VII: Client management 25: Managing preferences for Mac OS X clients 26: Managing classic Mac OS workstations using Mac manager 27: Managing windows clients using Mac OS X server 28: Workstation deployment and maintenance 29: Apple remote desktop

rawTOC:
Part I: Server installation and management \\ 1: Designing your server environment \\ 2: Installing and configuring Mac OS X server \\ 3: Server management tools \\ 4: System administration \\ 5: Troubleshooting \\ Part II: Directory service \\ 6: Open directory server \\ 7: Identification and authorization in open directory server \\ 8: Authentication in open directory server \\ 9: Replication in open directory server \\ Part III: IP services \\ 10: Xinetd \\ 11: DNS \\ 12: DHCP \\ 13: NAT \\ Part IV: File services \\ 14: File services overview \\ 15: Apple filing protocol \\ 16: Windows file services \\ 17: FTP \\ 18: Network file system \\ 19: Print services \\ Part V: Security services \\ 20: Mac OS X server firewall \\ 21: Virtual private networks \\ Part VI: Internet services \\ 22: Mail services \\ 23: Web services \\ 24: Application servers \\ Part VII: Client management \\ 25: Managing preferences for Mac OS X clients \\ 26: Managing classic Mac OS workstations using Mac manager \\ 27: Managing windows clients using Mac OS X server \\ 28: Workstation deployment and maintenance \\ 29: Apple remote desktop

entry:
@Book{Bartosh:2005:EMX,
  author =       "Michael Bartosh and Ryan Faas",
  title =        "Essential {Mac OS X Panther} Server Administration",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxii + 822",
  year =         "2005",
  ISBN =         "0-596-00635-7 (paperback)",
  ISBN-13 =      "978-0-596-00635-8 (paperback)",
  LCCN =         "QA76.76.O63 B38 2005",
  bibdate =      "Thu Oct 6 07:22:51 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  acknowledgement = ack-nhfb,
  remark =       "Integrating Mac OS X server into heterogeneous
                 networks---Cover.",
  subject =      "Mac OS; Operating systems (Computers); Macintosh
                 (Computer); Web servers",
  tableofcontents = "Part I: Server installation and management \\
                 1: Designing your server environment \\
                 2: Installing and configuring Mac OS X server \\
                 3: Server management tools \\
                 4: System administration \\
                 5: Troubleshooting \\
                 Part II: Directory service \\
                 6: Open directory server \\
                 7: Identification and authorization in open directory
                 server \\
                 8: Authentication in open directory server \\
                 9: Replication in open directory server \\
                 Part III: IP services \\
                 10: Xinetd \\
                 11: DNS \\
                 12: DHCP \\
                 13: NAT \\
                 Part IV: File services \\
                 14: File services overview \\
                 15: Apple filing protocol \\
                 16: Windows file services \\
                 17: FTP \\
                 18: Network file system \\
                 19: Print services \\
                 Part V: Security services \\
                 20: Mac OS X server firewall \\
                 21: Virtual private networks \\
                 Part VI: Internet services \\
                 22: Mail services \\
                 23: Web services \\
                 24: Application servers \\
                 Part VII: Client management \\
                 25: Managing preferences for Mac OS X clients \\
                 26: Managing classic Mac OS workstations using Mac
                 manager \\
                 27: Managing windows clients using Mac OS X server \\
                 28: Workstation deployment and maintenance \\
                 29: Apple remote desktop",
}


bibtype: book
filename: master.bib
label: Bartusiak:2006:AUD
editor: Marcia Bartusiak
title: Archives of the universe: 100 discoveries that transformed our understanding of the cosmos
publisher: pub-VINTAGE
address: pub-VINTAGE:adr
pages: xvii + 695
year: 2006
ISBN: 0-375-71368-9 OR 0375713689
ISBN13: 978-0-375-71368-2 OR 9780375713682
LCCN: QB15 .A75 2006
bibdate: Tue Sep 1 16:31:05 MDT 2009
bibtimestamp: 2009.09.01 16:31:05 MDT
subject: Astronomy; History
acknowledgement: ack-nhfb
raweditor: Marcia Bartusiak
rawtitle: Archives of the universe: 100 discoveries that transformed our understanding of the cosmos
bibsource:
https://www.math.utah.edu/pub/tex/bib/einstein.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; www.iris.rutgers.edu:2200/Unicorn

TOC:
Preface I. The Ancient Sky 1 Mayan Venus Tables 2 Proof That the Earth Is a Sphere 3 Celestial Surveying 4 Measuring the Earth's Circumference 5 Precession of the Equinoxes 6 Ptolemy's Almagest II. Revolutions 7 Copernicus and the Sun-Centered Universe 8 Tycho Brahe and the Changing Heavens 9 Johannes Kepler and Planetary Motion 10 Galileo Initiates the Telescopic Era 11 Newton's Universal Law of Gravity 12 Halley's Comet 13 Binary Stars III. Taking Measure 14 The Speed of Light 15 The Solar System's Origin 16 Discovery of Uranus 17 Stars Moving and Changing 18 The First Asteroid 19 Distance to a Star 20 Discovery of Neptune 21 The Shape of the Milky Way 22 Spiraling Nebulae IV. Touching the Heavens 23 Spectral Lines 24 Deciphering the Solar Spectrum 25 Gaseous Nebulae 26 Doppler Shifts and Spectroscopic Binaries 27 Classification of the Stars 28 Giant Stars and Dwarf Stars 29 Hydrogen: The Prime Element 30 Stellar Mass, Luminosity, and Stability 31 Sunspot Cycle, Sun/Earth Connection, and Helium 32 Origin of Meteors and Shooting Stars 33 Cosmic Rays 34 Discovery of Pluto V. Einsteinian Cosmos 35 Special Relativity and $E = m c^2$ 36 General Relativity and the Solar Eclipse Test 37 Relativistic Models of the Universe 38 Big Bang Versus Steady State 39 White Dwarf Stars 40 Beyond the White Dwarf 41 Supernovae and Neutron Stars 42 Black Holes 43 Source of Stellar Power 44 Creating Elements in the Big Bang 45 Cosmic Microwave Background Predicted 46 Creating Elements in the Stars 47 A Star's Life Cycle VI. The Milky Way and Beyond 48 Cepheids: The Cosmic Standard Candles 49 Sun's Place in the Milky Way 50 Dark Nebulae and Interstellar Matter 51 Discovery of Other Galaxies 52 Expansion of the Universe 53 Stellar Populations and Resizing the Universe 54 Mapping the Milky Way's Spiral Arms 55 Source and Composition of Comets VII. New Eyes, New Universe 56 Radio Astronomy 57 Interstellar Hydrogen 58 Molecules in Space 59 Van Allen Radiation Belts 60 Geology of Mars 61 Extrasolar X-Ray Sources 62 Quasars 63 Evidence for the Big Bang 64 Pulsars 65 The Infrared Sky and the Galactic Center 66 Neutrino Astronomy 67 Gamma-Ray Bursts 68 Binary Pulsar and Gravity Waves VIII. Accelerating Outward 69 Dark Matter 70 Gravitational Lensing 71 Inflation 72 The Bubbly Universe 73 Galaxy Evolution and the Hubble Deep Field 74 Extrasolar Planets 75 The Accelerating Universe Notes Bibliography Acknowledgments Index

rawTOC:
Preface \\ \\ I. The Ancient Sky \\ 1 Mayan Venus Tables \\ 2 Proof That the Earth Is a Sphere \\ 3 Celestial Surveying \\ 4 Measuring the Earth's Circumference \\ 5 Precession of the Equinoxes \\ 6 Ptolemy's Almagest \\ \\ II. Revolutions \\ 7 Copernicus and the Sun-Centered Universe \\ 8 Tycho Brahe and the Changing Heavens \\ 9 Johannes Kepler and Planetary Motion \\ 10 Galileo Initiates the Telescopic Era \\ 11 Newton's Universal Law of Gravity \\ 12 Halley's Comet \\ 13 Binary Stars \\ \\ III. Taking Measure \\ 14 The Speed of Light \\ 15 The Solar System's Origin \\ 16 Discovery of Uranus \\ 17 Stars Moving and Changing \\ 18 The First Asteroid \\ 19 Distance to a Star \\ 20 Discovery of Neptune \\ 21 The Shape of the Milky Way \\ 22 Spiraling Nebulae \\ \\ IV. Touching the Heavens \\ 23 Spectral Lines \\ 24 Deciphering the Solar Spectrum \\ 25 Gaseous Nebulae \\ 26 Doppler Shifts and Spectroscopic Binaries \\ 27 Classification of the Stars \\ 28 Giant Stars and Dwarf Stars \\ 29 Hydrogen: The Prime Element \\ 30 Stellar Mass, Luminosity, and Stability \\ 31 Sunspot Cycle, Sun/Earth Connection, and Helium \\ 32 Origin of Meteors and Shooting Stars \\ 33 Cosmic Rays \\ 34 Discovery of Pluto \\ \\ V. Einsteinian Cosmos \\ 35 Special Relativity and $E = m c^2$ \\ 36 General Relativity and the Solar Eclipse Test \\ 37 Relativistic Models of the Universe \\ 38 Big Bang Versus Steady State \\ 39 White Dwarf Stars \\ 40 Beyond the White Dwarf \\ 41 Supernovae and Neutron Stars \\ 42 Black Holes \\ 43 Source of Stellar Power \\ 44 Creating Elements in the Big Bang \\ 45 Cosmic Microwave Background Predicted \\ 46 Creating Elements in the Stars \\ 47 A Star's Life Cycle \\ \\ VI. The Milky Way and Beyond \\ 48 Cepheids: The Cosmic Standard Candles \\ 49 Sun's Place in the Milky Way \\ 50 Dark Nebulae and Interstellar Matter \\ 51 Discovery of Other Galaxies \\ 52 Expansion of the Universe \\ 53 Stellar Populations and Resizing the Universe \\ 54 Mapping the Milky Way's Spiral Arms \\ 55 Source and Composition of Comets \\ \\ VII. New Eyes, New Universe \\ 56 Radio Astronomy \\ 57 Interstellar Hydrogen \\ 58 Molecules in Space \\ 59 Van Allen Radiation Belts \\ 60 Geology of Mars \\ 61 Extrasolar X-Ray Sources \\ 62 Quasars \\ 63 Evidence for the Big Bang \\ 64 Pulsars \\ 65 The Infrared Sky and the Galactic Center \\ 66 Neutrino Astronomy \\ 67 Gamma-Ray Bursts \\ 68 Binary Pulsar and Gravity Waves \\ \\ VIII. Accelerating Outward \\ 69 Dark Matter \\ 70 Gravitational Lensing \\ 71 Inflation \\ 72 The Bubbly Universe \\ 73 Galaxy Evolution and the Hubble Deep Field \\ 74 Extrasolar Planets \\ 75 The Accelerating Universe \\ \\ Notes \\ Bibliography \\ Acknowledgments \\ Index

entry:
@Book{Bartusiak:2006:AUD,
  editor =       "Marcia Bartusiak",
  title =        "Archives of the universe: 100 discoveries that
                 transformed our understanding of the cosmos",
  publisher =    pub-VINTAGE,
  address =      pub-VINTAGE:adr,
  pages =        "xvii + 695",
  year =         "2006",
  ISBN =         "0-375-71368-9",
  ISBN-13 =      "978-0-375-71368-2",
  LCCN =         "QB15 .A75 2006",
  bibdate =      "Tue Sep 1 16:31:05 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 www.iris.rutgers.edu:2200/Unicorn",
  price =        "US\$18.95",
  acknowledgement = ack-nhfb,
  subject =      "Astronomy; History",
  tableofcontents = "Preface \\
                 \\
                 I. The Ancient Sky \\
                 1 Mayan Venus Tables \\
                 2 Proof That the Earth Is a Sphere \\
                 3 Celestial Surveying \\
                 4 Measuring the Earth's Circumference \\
                 5 Precession of the Equinoxes \\
                 6 Ptolemy's Almagest \\
                 \\
                 II. Revolutions \\
                 7 Copernicus and the Sun-Centered Universe \\
                 8 Tycho Brahe and the Changing Heavens \\
                 9 Johannes Kepler and Planetary Motion \\
                 10 Galileo Initiates the Telescopic Era \\
                 11 Newton's Universal Law of Gravity \\
                 12 Halley's Comet \\
                 13 Binary Stars \\
                 \\
                 III. Taking Measure \\
                 14 The Speed of Light \\
                 15 The Solar System's Origin \\
                 16 Discovery of Uranus \\
                 17 Stars Moving and Changing \\
                 18 The First Asteroid \\
                 19 Distance to a Star \\
                 20 Discovery of Neptune \\
                 21 The Shape of the Milky Way \\
                 22 Spiraling Nebulae \\
                 \\
                 IV. Touching the Heavens \\
                 23 Spectral Lines \\
                 24 Deciphering the Solar Spectrum \\
                 25 Gaseous Nebulae \\
                 26 Doppler Shifts and Spectroscopic Binaries \\
                 27 Classification of the Stars \\
                 28 Giant Stars and Dwarf Stars \\
                 29 Hydrogen: The Prime Element \\
                 30 Stellar Mass, Luminosity, and Stability \\
                 31 Sunspot Cycle, Sun/Earth Connection, and Helium \\
                 32 Origin of Meteors and Shooting Stars \\
                 33 Cosmic Rays \\
                 34 Discovery of Pluto \\
                 \\
                 V. Einsteinian Cosmos \\
                 35 Special Relativity and $E = m c^2$ \\
                 36 General Relativity and the Solar Eclipse Test \\
                 37 Relativistic Models of the Universe \\
                 38 Big Bang Versus Steady State \\
                 39 White Dwarf Stars \\
                 40 Beyond the White Dwarf \\
                 41 Supernovae and Neutron Stars \\
                 42 Black Holes \\
                 43 Source of Stellar Power \\
                 44 Creating Elements in the Big Bang \\
                 45 Cosmic Microwave Background Predicted \\
                 46 Creating Elements in the Stars \\
                 47 A Star's Life Cycle \\
                 \\
                 VI. The Milky Way and Beyond \\
                 48 Cepheids: The Cosmic Standard Candles \\
                 49 Sun's Place in the Milky Way \\
                 50 Dark Nebulae and Interstellar Matter \\
                 51 Discovery of Other Galaxies \\
                 52 Expansion of the Universe \\
                 53 Stellar Populations and Resizing the Universe \\
                 54 Mapping the Milky Way's Spiral Arms \\
                 55 Source and Composition of Comets \\
                 \\
                 VII. New Eyes, New Universe \\
                 56 Radio Astronomy \\
                 57 Interstellar Hydrogen \\
                 58 Molecules in Space \\
                 59 Van Allen Radiation Belts \\
                 60 Geology of Mars \\
                 61 Extrasolar X-Ray Sources \\
                 62 Quasars \\
                 63 Evidence for the Big Bang \\
                 64 Pulsars \\
                 65 The Infrared Sky and the Galactic Center \\
                 66 Neutrino Astronomy \\
                 67 Gamma-Ray Bursts \\
                 68 Binary Pulsar and Gravity Waves \\
                 \\
                 VIII. Accelerating Outward \\
                 69 Dark Matter \\
                 70 Gravitational Lensing \\
                 71 Inflation \\
                 72 The Bubbly Universe \\
                 73 Galaxy Evolution and the Hubble Deep Field \\
                 74 Extrasolar Planets \\
                 75 The Accelerating Universe \\
                 \\
                 Notes \\
                 Bibliography \\
                 Acknowledgments \\
                 Index",
}


bibtype: book
filename: master.bib
label: Bartusiak:2009:DWF
author: Marcia Bartusiak
title: The Day We Found the Universe
publisher: pub-PANTHEON
address: pub-PANTHEON:adr
pages: xviii + 337
year: 2009
ISBN: 0-375-42429-6 OR 0375424296
ISBN13: 978-0-375-42429-8 OR 9780375424298
LCCN: QB15 .B37 2009
bibdate: Sat Jun 13 07:47:22 MDT 2009
bibtimestamp: 2009.06.13 07:47:22 MDT
subject: astronomy; history
acknowledgement: ack-nhfb
rawauthor: Marcia Bartusiak
rawtitle: The Day We Found the Universe
bibsource:
https://www.math.utah.edu/pub/tex/bib/einstein.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager

abstract:
From one of the most acclaimed science writers comes a dramatic narrative of the discovery of the true nature and startling size of the universe, delving into the decades of work --- by a select group of scientists --- that made it possible. On January 1, 1925, thirty-five-year-old Edwin Hubble announced the observation that ultimately established that our universe was a thousand trillion times larger than previously believed, filled with myriad galaxies like our own. This discovery dramatically reshaped how humans understood their place in the cosmos, and once and for all laid to rest the idea that the Milky Way galaxy was alone in the universe. Six years later, continuing research by Hubble and others forced Albert Einstein to renounce his own cosmic model and finally accept the astonishing fact that the universe was not immobile but instead expanding. The fascinating story of these interwoven discoveries includes battles of will, clever insights, and wrong turns made by the early investigators in this great twentieth-century pursuit. It is a story of science in the making that shows how these discoveries were not the work of a lone genius but the combined efforts of many talented scientists and researchers toiling away behind the scenes. The intriguing characters include Henrietta Leavitt, who discovered the means to measure the vast dimensions of the cosmos; Vesto Slipher, the first and unheralded discoverer of the universe's expansion; Georges Lemaitre, the Jesuit priest who correctly interpreted Einstein's theories in relation to the universe; Milton Humason, who, with only an eighth-grade education, became a world-renowned expert on galaxy motions; and Harlow Shapley, Hubble's nemesis, whose flawed vision of the universe delayed the discovery of its true nature and startling size for more than a decade. Here is a watershed moment in the history of astronomy, brought about by the exceptional combination of human curiosity, intelligence, and enterprise, and vividly told by acclaimed science writer Marcia Bartusiak.

keywords:
Albert Einstein; Edwin Hubble; Georges Lemaitre; Harlow Shapley; Henrietta Leavitt; James Lick (1796--1896); Milton Humason; Vesto Slipher

TOC:
Preface / January 1, 1925 Setting out 1: The little republic of science 2: A rather remarkable number of nebulae 3: Grander than the truth 4: Such is the progress of astronomy in the wild and wooly West 5: My regards to the squashes 6: It is worthy of notice Exploration 7: Empire builder 8: The solar system is off center and consequently man is too 9: He surely looks like the fourth dimension! 10: Go at each other ``hammer and tongs'' 11: Adonis 12: On the brink of a big discovery --- or maybe a big paradox Discovery 13: Countless whole worlds --- strewn all over the sky 14: Using the 100-inch telescope the way it should be used 15: Your calculations are correct, but your physical insight is abominable 16: Started off with a bang Whatever happened to ldots Notes Acknowledgments Bibliography Index

rawabstract:
From one of the most acclaimed science writers comes a dramatic narrative of the discovery of the true nature and startling size of the universe, delving into the decades of work --- by a select group of scientists --- that made it possible. On January 1, 1925, thirty-five-year-old Edwin Hubble announced the observation that ultimately established that our universe was a thousand trillion times larger than previously believed, filled with myriad galaxies like our own. This discovery dramatically reshaped how humans understood their place in the cosmos, and once and for all laid to rest the idea that the Milky Way galaxy was alone in the universe. Six years later, continuing research by Hubble and others forced Albert Einstein to renounce his own cosmic model and finally accept the astonishing fact that the universe was not immobile but instead expanding. The fascinating story of these interwoven discoveries includes battles of will, clever insights, and wrong turns made by the early investigators in this great twentieth-century pursuit. It is a story of science in the making that shows how these discoveries were not the work of a lone genius but the combined efforts of many talented scientists and researchers toiling away behind the scenes. The intriguing characters include Henrietta Leavitt, who discovered the means to measure the vast dimensions of the cosmos; Vesto Slipher, the first and unheralded discoverer of the universe's expansion; Georges Lema{\^\i}tre, the Jesuit priest who correctly interpreted Einstein's theories in relation to the universe; Milton Humason, who, with only an eighth-grade education, became a world-renowned expert on galaxy motions; and Harlow Shapley, Hubble's nemesis, whose flawed vision of the universe delayed the discovery of its true nature and startling size for more than a decade. Here is a watershed moment in the history of astronomy, brought about by the exceptional combination of human curiosity, intelligence, and enterprise, and vividly told by acclaimed science writer Marcia Bartusiak.

rawTOC:
Preface / January 1, 1925 \\ Setting out \\ 1: The little republic of science \\ 2: A rather remarkable number of nebulae \\ 3: Grander than the truth \\ 4: Such is the progress of astronomy in the wild and wooly West \\ 5: My regards to the squashes \\ 6: It is worthy of notice \\ Exploration \\ 7: Empire builder \\ 8: The solar system is off center and consequently man is too \\ 9: He surely looks like the fourth dimension! \\ 10: Go at each other ``hammer and tongs'' \\ 11: Adonis \\ 12: On the brink of a big discovery --- or maybe a big paradox \\ Discovery \\ 13: Countless whole worlds --- strewn all over the sky \\ 14: Using the 100-inch telescope the way it should be used \\ 15: Your calculations are correct, but your physical insight is abominable \\ 16: Started off with a bang \\ Whatever happened to \ldots{} \\ Notes \\ Acknowledgments \\ Bibliography \\ Index

entry:
@Book{Bartusiak:2009:DWF,
  author =       "Marcia Bartusiak",
  title =        "The Day We Found the Universe",
  publisher =    pub-PANTHEON,
  address =      pub-PANTHEON:adr,
  pages =        "xviii + 337",
  year =         "2009",
  ISBN =         "0-375-42429-6",
  ISBN-13 =      "978-0-375-42429-8",
  LCCN =         "QB15 .B37 2009",
  bibdate =      "Sat Jun 13 07:47:22 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "From one of the most acclaimed science writers comes a
                 dramatic narrative of the discovery of the true nature
                 and startling size of the universe, delving into the
                 decades of work --- by a select group of scientists ---
                 that made it possible. On January 1, 1925,
                 thirty-five-year-old Edwin Hubble announced the
                 observation that ultimately established that our
                 universe was a thousand trillion times larger than
                 previously believed, filled with myriad galaxies like
                 our own. This discovery dramatically reshaped how
                 humans understood their place in the cosmos, and once
                 and for all laid to rest the idea that the Milky Way
                 galaxy was alone in the universe. Six years later,
                 continuing research by Hubble and others forced Albert
                 Einstein to renounce his own cosmic model and finally
                 accept the astonishing fact that the universe was not
                 immobile but instead expanding. The fascinating story
                 of these interwoven discoveries includes battles of
                 will, clever insights, and wrong turns made by the
                 early investigators in this great twentieth-century
                 pursuit. It is a story of science in the making that
                 shows how these discoveries were not the work of a lone
                 genius but the combined efforts of many talented
                 scientists and researchers toiling away behind the
                 scenes. The intriguing characters include Henrietta
                 Leavitt, who discovered the means to measure the vast
                 dimensions of the cosmos; Vesto Slipher, the first and
                 unheralded discoverer of the universe's expansion;
                 Georges Lema{\^\i}tre, the Jesuit priest who correctly
                 interpreted Einstein's theories in relation to the
                 universe; Milton Humason, who, with only an
                 eighth-grade education, became a world-renowned expert
                 on galaxy motions; and Harlow Shapley, Hubble's
                 nemesis, whose flawed vision of the universe delayed
                 the discovery of its true nature and startling size for
                 more than a decade. Here is a watershed moment in the
                 history of astronomy, brought about by the exceptional
                 combination of human curiosity, intelligence, and
                 enterprise, and vividly told by acclaimed science
                 writer Marcia Bartusiak.",
  acknowledgement = ack-nhfb,
  keywords =     "Albert Einstein; Edwin Hubble; Georges Lema{\^\i}tre;
                 Harlow Shapley; Henrietta Leavitt; James Lick
                 (1796--1896); Milton Humason; Vesto Slipher",
  subject =      "astronomy; history",
  tableofcontents = "Preface / January 1, 1925 \\
                 Setting out \\
                 1: The little republic of science \\
                 2: A rather remarkable number of nebulae \\
                 3: Grander than the truth \\
                 4: Such is the progress of astronomy in the wild and
                 wooly West \\
                 5: My regards to the squashes \\
                 6: It is worthy of notice \\
                 Exploration \\
                 7: Empire builder \\
                 8: The solar system is off center and consequently man
                 is too \\
                 9: He surely looks like the fourth dimension! \\
                 10: Go at each other ``hammer and tongs'' \\
                 11: Adonis \\
                 12: On the brink of a big discovery --- or maybe a big
                 paradox \\
                 Discovery \\
                 13: Countless whole worlds --- strewn all over the sky
                 \\
                 14: Using the 100-inch telescope the way it should be
                 used \\
                 15: Your calculations are correct, but your physical
                 insight is abominable \\
                 16: Started off with a bang \\
                 Whatever happened to \ldots{} \\
                 Notes \\
                 Acknowledgments \\
                 Bibliography \\
                 Index",
}


bibtype: book
filename: master.bib
label: Batten:1988:RUC
author: Alan H. (Alan Henry) Batten
title: Resolute and Undertaking Characters: The Lives of Wilhelm and Otto Struve
volume: 139
publisher: pub-REIDEL
address: pub-REIDEL:adr
pages: xxv + 259
year: 1988
DOI: https://doi.org/10.1007/978-94-009-2883-1
ISBN: 90-277-2652-3 OR 9027726523
ISBN13: 978-90-277-2652-0 OR 9789027726520
LCCN: QB36.S75 B38 1988
bibdate: Tue Mar 28 08:28:15 MDT 2017
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2017.03.28 08:28:15 MDT
series: Astrophysics and space science library
acknowledgement: ack-nhfb
authordates: 1933--
subjectdates: Friedrich Georg Wilhelm Struve (1793--1864); Otto Struve (1819--1905)
rawauthor: Alan H. (Alan Henry) Batten
rawtitle: Resolute and Undertaking Characters: The Lives of {Wilhelm and Otto Struve}
URL:
http://www.loc.gov/catdir/enhancements/fy0902/87030386-d.html; http://www.loc.gov/catdir/enhancements/fy0902/87030386-t.html

subject:
Struve, F. G. W. (Friedrich Georg Wilhelm); Struve, Otto; Astronomy; Russia; History; 19th century; Soviet Union; 20th century; Astronomers; Biography; Germany

TOC:
Preface / xi General Note / xv Bibliographical Note / xix Acknowledgements / xxi Chronological Summary of the lives of Wilhelm and Otto Struve / xxiii 1: Family Origins and Wilhelm's Childhood / 1 2: Student Days at Dorpat University / 12 3: Astronomy at the Beginning of the Nineteenth Century / 22 4: Measuring the Earth / 30 5: The Great Refractor / 44 6: The Founding of Pulkovo / 66 7: The Astronomical Capital of the World / 88 8: Measuring the Sky / 113 9: The Early Pulkovo Years / 130 10: `Etudes d'astronomie stellaire' / 144 11: Wilhelm's Illness and Last Years / 156 12: The Transition / 168 13: The Companion of Procyon and the Transits of Venus / 181 14: The 30-inch Refractor / 196 15: Mapping the Sky / 209 16: Otto's Retirement and Last Years / 219 Epilogue: The Family Tradition / 235 Name Index / 245 Subject Index / 258

rawTOC:
Preface / xi \\ General Note / xv \\ Bibliographical Note / xix \\ Acknowledgements / xxi \\ Chronological Summary of the lives of Wilhelm and Otto Struve / xxiii \\ 1: Family Origins and Wilhelm's Childhood / 1 \\ 2: Student Days at Dorpat University / 12 \\ 3: Astronomy at the Beginning of the Nineteenth Century / 22 \\ 4: Measuring the Earth / 30 \\ 5: The Great Refractor / 44 \\ 6: The Founding of Pulkovo / 66 \\ 7: The Astronomical Capital of the World / 88 \\ 8: Measuring the Sky / 113 \\ 9: The Early Pulkovo Years / 130 \\ 10: `{\'E}tudes d'astronomie stellaire' / 144 \\ 11: Wilhelm's Illness and Last Years / 156 \\ 12: The Transition / 168 \\ 13: The Companion of Procyon and the Transits of Venus / 181 \\ 14: The 30-inch Refractor / 196 \\ 15: Mapping the Sky / 209 \\ 16: Otto's Retirement and Last Years / 219 \\ Epilogue: The Family Tradition / 235 \\ Name Index / 245 \\ Subject Index / 258

entry:
@Book{Batten:1988:RUC,
  author =       "Alan H. (Alan Henry) Batten",
  title =        "Resolute and Undertaking Characters: The Lives of
                 {Wilhelm and Otto Struve}",
  volume =       "139",
  publisher =    pub-REIDEL,
  address =      pub-REIDEL:adr,
  pages =        "xxv + 259",
  year =         "1988",
  DOI =          "https://doi.org/10.1007/978-94-009-2883-1",
  ISBN =         "90-277-2652-3",
  ISBN-13 =      "978-90-277-2652-0",
  LCCN =         "QB36.S75 B38 1988",
  bibdate =      "Tue Mar 28 08:28:15 MDT 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Astrophysics and space science library",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0902/87030386-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0902/87030386-t.html",
  acknowledgement = ack-nhfb,
  author-dates = "1933--",
  libnote =      "Not in my library.",
  subject =      "Struve, F. G. W. (Friedrich Georg Wilhelm); Struve,
                 Otto; Astronomy; Russia; History; 19th century; Soviet
                 Union; 20th century; Astronomers; Biography; Germany",
  subject-dates = "Friedrich Georg Wilhelm Struve (1793--1864); Otto
                 Struve (1819--1905)",
  tableofcontents = "Preface / xi \\
                 General Note / xv \\
                 Bibliographical Note / xix \\
                 Acknowledgements / xxi \\
                 Chronological Summary of the lives of Wilhelm and Otto
                 Struve / xxiii \\
                 1: Family Origins and Wilhelm's Childhood / 1 \\
                 2: Student Days at Dorpat University / 12 \\
                 3: Astronomy at the Beginning of the Nineteenth Century
                 / 22 \\
                 4: Measuring the Earth / 30 \\
                 5: The Great Refractor / 44 \\
                 6: The Founding of Pulkovo / 66 \\
                 7: The Astronomical Capital of the World / 88 \\
                 8: Measuring the Sky / 113 \\
                 9: The Early Pulkovo Years / 130 \\
                 10: `{\'E}tudes d'astronomie stellaire' / 144 \\
                 11: Wilhelm's Illness and Last Years / 156 \\
                 12: The Transition / 168 \\
                 13: The Companion of Procyon and the Transits of Venus
                 / 181 \\
                 14: The 30-inch Refractor / 196 \\
                 15: Mapping the Sky / 209 \\
                 16: Otto's Retirement and Last Years / 219 \\
                 Epilogue: The Family Tradition / 235 \\
                 Name Index / 245 \\
                 Subject Index / 258",
}


bibtype: book
filename: master.bib
label: Bauldry:1991:CLM
author: William C. Bauldry and Joseph R. Fiedler
title: Calculus Laboratories with Maple: a Tool, Not an Oracle
publisher: pub-BROOKS-COLE
address: pub-BROOKS-COLE:adr
pages: xii + 144
year: 1991
ISBN: 0-534-13788-1 OR 0534137881
ISBN13: 978-0-534-13788-5 OR 9780534137885
LCCN: MLCM 90/01887 (Q)
bibdate: Wed Dec 15 08:46:50 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 08:46:50 ???
acknowledgement: ack-nhfb
rawauthor: William C. Bauldry and Joseph R. Fiedler
rawtitle: Calculus Laboratories with {Maple}: a Tool, Not an Oracle
entry:
@Book{Bauldry:1991:CLM,
  author =       "William C. Bauldry and Joseph R. Fiedler",
  title =        "Calculus Laboratories with {Maple}: a Tool, Not an
                 Oracle",
  publisher =    pub-BROOKS-COLE,
  address =      pub-BROOKS-COLE:adr,
  pages =        "xii + 144",
  year =         "1991",
  ISBN =         "0-534-13788-1",
  ISBN-13 =      "978-0-534-13788-5",
  LCCN =         "MLCM 90/01887 (Q)",
  bibdate =      "Wed Dec 15 08:46:50 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}


bibtype: book
filename: master.bib
label: Be:1997:DGO
author: The Be Development Team
title: The Be Developer's Guide: The Official Documentation for the BeOS
publisher: pub-ORA
address: pub-ORA:adr
pages: xi + 934
year: 1997
ISBN: 1-56592-287-5 OR 1565922875
ISBN13: 978-1-56592-287-7 OR 9781565922877
LCCN: QA76.76.O63 B43 1997
bibdate: Wed May 05 15:55:16 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1999.05.05 15:55:16 ???
URL: http://www.ora.com/catalog/be/; http://www.oreilly.com/catalog/bedev
acknowledgement: ack-nhfb
rawauthor: {The Be Development Team}
rawtitle: The {Be} Developer's Guide: The Official Documentation for the {BeOS}
entry:
@Book{Be:1997:DGO,
  author =       "{The Be Development Team}",
  title =        "The {Be} Developer's Guide: The Official Documentation
                 for the {BeOS}",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xi + 934",
  year =         "1997",
  ISBN =         "1-56592-287-5",
  ISBN-13 =      "978-1-56592-287-7",
  LCCN =         "QA76.76.O63 B43 1997",
  bibdate =      "Wed May 05 15:55:16 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$49.95",
  URL =          "http://www.ora.com/catalog/be/;
                 http://www.oreilly.com/catalog/bedev",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Be:1998:AT
author: The Be Development Team
title: Be Advanced Topics: Official documentation for the BeOS
publisher: pub-ORA
address: pub-ORA:adr
pages: xi + 365
month: jul
monthnumber: 7
year: 1998
ISBN: 1-56592-396-0 OR 1565923960
ISBN13: 978-1-56592-396-6 OR 9781565923966
LCCN: QA76.76.O63 B4 1998
bibdate: Thu Feb 18 07:07:41 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1999.02.18 07:07:41 ???
note: Includes BeSpecific 5 CD-ROM.
URL: http://www.oreilly.com/catalog/beadv
acknowledgement: ack-nhfb
rawauthor: {The Be Development Team}
rawnote: Includes BeSpecific 5 CD-ROM.
rawtitle: {Be} Advanced Topics: Official documentation for the {BeOS}
entry:
@Book{Be:1998:AT,
  author =       "{The Be Development Team}",
  title =        "{Be} Advanced Topics: Official documentation for the
                 {BeOS}",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xi + 365",
  month =        jul,
  year =         "1998",
  ISBN =         "1-56592-396-0",
  ISBN-13 =      "978-1-56592-396-6",
  LCCN =         "QA76.76.O63 B4 1998",
  bibdate =      "Thu Feb 18 07:07:41 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Includes BeSpecific 5 CD-ROM.",
  price =        "US\$39.95",
  URL =          "http://www.oreilly.com/catalog/beadv",
  acknowledgement = ack-nhfb,
}


bibtype: manual
filename: master.bib
label: Becker:1981:LSD
author: Richard A. Becker and John M. Chambers
title: S: a Language and System for Data Analysis
organization: AT&T Bell Laboratories
address: Murray Hill, NJ, USA
pages: xi + 365
year: 1981
LCCN: QA76.7 .B43 1981
bibdate: Wed Aug 10 10:41:43 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.08.10 10:41:43 ???
acknowledgement: ack-nhfb
rawauthor: Richard A. Becker and John M. Chambers
rawtitle: {S}: a Language and System for Data Analysis
entry:
@Manual{Becker:1981:LSD,
  author =       "Richard A. Becker and John M. Chambers",
  title =        "{S}: a Language and System for Data Analysis",
  organization = "AT\&T Bell Laboratories",
  address =      "Murray Hill, NJ, USA",
  year =         "1981",
  LCCN =         "QA76.7 .B43 1981",
  bibdate =      "Wed Aug 10 10:41:43 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}


bibtype: book
filename: master.bib
label: Becker:1984:IED
author: Richard A. Becker and John M. Chambers
title: S: An Interactive Environment for Data Analysis and Graphics
publisher: pub-WADSWORTH
address: pub-WADSWORTH:adr
pages: xii + 550
year: 1984
ISBN: 0-534-03313-X OR 053403313X
ISBN13: 978-0-534-03313-2 OR 9780534033132
LCCN: QA76.73.S15 B44 1984
bibdate: Wed Aug 10 18:17:59 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.08.10 18:17:59 ???
acknowledgement: ack-nhfb
rawauthor: Richard A. Becker and John M. Chambers
rawtitle: {S}: An Interactive Environment for Data Analysis and Graphics
entry:
@Book{Becker:1984:IED,
  author =       "Richard A. Becker and John M. Chambers",
  title =        "{S}: An Interactive Environment for Data Analysis and
                 Graphics",
  publisher =    pub-WADSWORTH,
  address =      pub-WADSWORTH:adr,
  pages =        "xii + 550",
  year =         "1984",
  ISBN =         "0-534-03313-X",
  ISBN-13 =      "978-0-534-03313-2",
  LCCN =         "QA76.73.S15 B44 1984",
  bibdate =      "Wed Aug 10 18:17:59 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}


bibtype: book
filename: master.bib
label: Becker:1985:ES
author: Richard A. Becker and John M. Chambers
title: Extending the S System
publisher: pub-WADSWORTH
address: pub-WADSWORTH:adr
pages: viii + 166
year: 1985
ISBN: 0-534-05016-6 OR 0534050166
ISBN13: 978-0-534-05016-0 OR 9780534050160
LCCN: QA276.4 .B4241 1985
bibdate: Wed Aug 10 10:38:24 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.08.10 10:38:24 ???
acknowledgement: ack-nhfb
rawauthor: Richard A. Becker and John M. Chambers
rawtitle: Extending the {S} System
entry:
@Book{Becker:1985:ES,
  author =       "Richard A. Becker and John M. Chambers",
  title =        "Extending the {S} System",
  publisher =    pub-WADSWORTH,
  address =      pub-WADSWORTH:adr,
  pages =        "viii + 166",
  year =         "1985",
  ISBN =         "0-534-05016-6",
  ISBN-13 =      "978-0-534-05016-0",
  LCCN =         "QA276.4 .B4241 1985",
  bibdate =      "Wed Aug 10 10:38:24 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}


bibtype: book
filename: master.bib
label: Becker:1988:NPL
author: Richard A. Becker and John M. Chambers and Allan R. Wilks
title: The New S Programming Language
publisher: pub-WADSWORTH
address: pub-WADSWORTH:adr
pages: xvii + 702
year: 1988
ISBN: 0-534-09192-X, 0-534-09193-8 OR 053409192X, 0534091938
ISBN13: 978-0-534-09192-7, 978-0-534-09193-4 OR 9780534091927, 9780534091934
LCCN: QA76.73.S15 B43 1988
MRclass: 68-01, 62-04, 62-07, 68P05, 68U99
bibdate: Wed Aug 10 17:37:02 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/s-plus.bib
bibtimestamp: 1994.08.10 17:37:02 ???
ZMnumber: 0642.68003
acknowledgement: ack-nhfb
rawauthor: Richard A. Becker and John M. Chambers and Allan R. Wilks
rawtitle: The New {S} Programming Language
entry:
@Book{Becker:1988:NPL,
  author =       "Richard A. Becker and John M. Chambers and Allan R.
                 Wilks",
  title =        "The New {S} Programming Language",
  publisher =    pub-WADSWORTH # " and " # pub-BROOKS-COLE,
  address =      pub-WADSWORTH:adr # " and " # pub-BROOKS-COLE:adr,
  pages =        "xvii + 702",
  year =         "1988",
  ISBN =         "0-534-09192-X, 0-534-09193-8",
  ISBN-13 =      "978-0-534-09192-7, 978-0-534-09193-4",
  LCCN =         "QA76.73.S15 B43 1988",
  MRclass =      "68-01, 62-04, 62-07, 68P05, 68U99",
  bibdate =      "Wed Aug 10 17:37:02 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/s-plus.bib",
  ZMnumber =     "0642.68003",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Beckmann:1993:HP
author: Petr Beckmann
title: A history of $ pi $
publisher: pub-BARNES-NOBLE
address: pub-BARNES-NOBLE:adr
pages: 200
year: 1993
ISBN: 0-88029-418-3 OR 0880294183
ISBN13: 978-0-88029-418-8 OR 9780880294188
LCCN: QA484 .B4 1971
bibdate: Mon Mar 06 08:52:46 2000
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/pi.bib
bibtimestamp: 2000.03.06 08:52:46 ???
note: Reprint of the third edition of 1971.
acknowledgement: ack-nhfb
rawauthor: Petr Beckmann
rawnote: Reprint of the third edition of 1971.
rawtitle: A history of $ \pi $
abstract:
Documents the calculation, numerical value, and use of the ratio from 2000 B.C. to the modern computer age, detailing social conditions in eras when progress was made.

TOC:
Dawn The Belt The Early Greeks Euclid The Roman pest Archimedes of Syracuse Dusk Night Awakening The Digit hunters The Last Archimedians Prelude to breakthrough Newton Euler The Monte Carlo method The Transcendence of [pi] The Modern circle squares The Computer age Chronological table

rawabstract:
Documents the calculation, numerical value, and use of the ratio from 2000 B.C. to the modern computer age, detailing social conditions in eras when progress was made.

rawTOC:
Dawn \\ The Belt \\ The Early Greeks \\ Euclid \\ The Roman pest \\ Archimedes of Syracuse \\ Dusk \\ Night \\ Awakening \\ The Digit hunters \\ The Last Archimedians \\ Prelude to breakthrough \\ Newton \\ Euler \\ The Monte Carlo method \\ The Transcendence of [pi] \\ The Modern circle squares \\ The Computer age \\ Chronological table

entry:
@Book{Beckmann:1993:HP,
  author =       "Petr Beckmann",
  title =        "A history of $ \pi $",
  publisher =    pub-BARNES-NOBLE,
  address =      pub-BARNES-NOBLE:adr,
  pages =        "200",
  year =         "1993",
  ISBN =         "0-88029-418-3",
  ISBN-13 =      "978-0-88029-418-8",
  LCCN =         "QA484 .B4 1971",
  bibdate =      "Mon Mar 06 08:52:46 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/pi.bib",
  note =         "Reprint of the third edition of 1971.",
  price =        "US\$6.98",
  abstract =     "Documents the calculation, numerical value, and use of
                 the ratio from 2000 B.C. to the modern computer age,
                 detailing social conditions in eras when progress was
                 made.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Dawn \\
                 The Belt \\
                 The Early Greeks \\
                 Euclid \\
                 The Roman pest \\
                 Archimedes of Syracuse \\
                 Dusk \\
                 Night \\
                 Awakening \\
                 The Digit hunters \\
                 The Last Archimedians \\
                 Prelude to breakthrough \\
                 Newton \\
                 Euler \\
                 The Monte Carlo method \\
                 The Transcendence of [pi] \\
                 The Modern circle squares \\
                 The Computer age \\
                 Chronological table",
  xxnote =       "Fourth edition, 1977, Golem Press, Boulder, CO, ISBN
                 0-911762-18-3, LCCN QA484 .B4 1977, also available.",
}


bibtype: book
filename: master.bib
label: Beebe:2017:MFC
author: Nelson H. F. Beebe
publisher: pub-SV
address: pub-SV:adr
pages: xxxvi + 1114
year: 2017
DOI: https://doi.org/10.1007/978-3-319-64110-2
ISBN: 3-319-64109-3 (hardcover), 3-319-64110-7 (e-book) OR 3319641093 (hardcover), 3319641107 (ebook)
LCCN: QA75.5-76.95
bibdate: Sat Jul 15 19:34:43 MDT 2017
bibtimestamp: 2017.07.15 19:34:43 MDT
URL: http://www.springer.com/us/book/9783319641096
acknowledgement: ack-nhfb
rawauthor: Nelson H. F. Beebe
ORCID: Beebe, Nelson H. F./0000-0001-7281-4263
title:
The Mathematical-Function Computation Handbook: Programming Using the MathCW Portable Software Library

ISBN13:
978-3-319-64109-6 (hardcover), 978-3-319-64110-2 (e-book) OR 9783319641096 (hardcover), 9783319641102 (ebook)

bibsource:
fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib; https://www.math.utah.edu/pub/tex/bib/axiom.bib; https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; https://www.math.utah.edu/pub/tex/bib/elefunt.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/maple-extract.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/mathematica.bib; https://www.math.utah.edu/pub/tex/bib/matlab.bib; https://www.math.utah.edu/pub/tex/bib/mupad.bib; https://www.math.utah.edu/pub/tex/bib/numana2010.bib; https://www.math.utah.edu/pub/tex/bib/prng.bib; https://www.math.utah.edu/pub/tex/bib/redbooks.bib; https://www.math.utah.edu/pub/tex/bib/utah-math-dept-books.bib

TOC:
List of figures / xxv List of tables / xxxi Quick start / xxxv 1: Introduction / 1 1.1: Programming conventions / 2 1.2: Naming conventions / 4 1.3: Library contributions and coverage / 5 1.4: Summary / 6 2: Iterative solutions and other tools / 7 2.1: Polynomials and Taylor series / 7 2.2: First-order Taylor series approximation / 8 2.3: Second-order Taylor series approximation / 9 2.4: Another second-order Taylor series approximation / 9 2.5: Convergence of second-order methods / 10 2.6: Taylor series for elementary functions / 10 2.7: Continued fractions / 12 2.8: Summation of continued fractions / 17 2.9: Asymptotic expansions / 19 2.10: Series inversion / 20 2.11: Summary / 22 3: Polynomial approximations / 23 3.1: Computation of odd series / 23 3.2: Computation of even series / 25 3.3: Computation of general series / 25 3.4: Limitations of Cody / Waite polynomials / 28 3.5: Polynomial fits with Maple / 32 3.6: Polynomial fits with Mathematica / 33 3.7: Exact polynomial coefficients / 42 3.8: Cody / Waite rational polynomials / 43 3.9: Chebyshev polynomial economization / 43 3.10: Evaluating Chebyshev polynomials / 48 3.11: Error compensation in Chebyshev fits / 50 3.12: Improving Chebyshev fits / 51 3.13: Chebyshev fits in rational form / 52 3.14: Chebyshev fits with Mathematica / 56 3.15: Chebyshev fits for function representation / 57 3.16: Extending the library / 57 3.17: Summary and further reading / 58 4: Implementation issues / 61 4.1: Error magnification / 61 4.2: Machine representation and machine epsilon / 62 4.3: IEEE 754 arithmetic / 63 4.4: Evaluation order in C / 64 4.5: The tt volatile type qualifier / 65 4.6: Rounding in floating-point arithmetic / 66 4.7: Signed zero / 69 4.8: Floating-point zero divide / 70 4.9: Floating-point overflow / 71 4.10: Integer overflow / 72 4.11: Floating-point underflow / 77 4.12: Subnormal numbers / 78 4.13: Floating-point inexact operation / 79 4.14: Floating-point invalid operation / 79 4.15: Remarks on NaN tests / 80 4.16: Ulps --- units in the last place / 81 4.17: Fused multiply-add / 85 4.18: Fused multiply-add and polynomials / 88 4.19: Significance loss / 89 4.20: Error handling and reporting / 89 4.21: Interpreting error codes / 93 4.22: C99 changes to error reporting / 94 4.23: Error reporting with threads / 95 4.24: Comments on error reporting / 95 4.25: Testing function implementations / 96 4.26: Extended data types on Hewlett--Packard HP-UX IA-64 / 100 4.27: Extensions for decimal arithmetic / 101 4.28: Further reading / 103 4.29: Summary / 104 5: The floating-point environment / 105 5.1: IEEE 754 and programming languages / 105 5.2: IEEE 754 and the mathcw library / 106 5.3: Exceptions and traps / 106 5.4: Access to exception flags and rounding control / 107 5.5: The environment access pragma / 110 5.6: Implementation of exception-flag and rounding-control access / 110 5.7: Using exception flags: simple cases / 112 5.8: Using rounding control / 115 5.9: Additional exception flag access / 116 5.10: Using exception flags: complex case / 120 5.11: Access to precision control / 123 5.12: Using precision control / 126 5.13: Summary / 127 6: Converting floating-point values to integers / 129 6.1: Integer conversion in programming languages / 129 6.2: Programming issues for conversions to integers / 130 6.3: Hardware out-of-range conversions / 131 6.4: Rounding modes and integer conversions / 132 6.5: Extracting integral and fractional parts / 132 6.6: Truncation functions / 135 6.7: Ceiling and floor functions / 136 6.8: Floating-point rounding functions with fixed rounding / 137 6.9: Floating-point rounding functions: current rounding / 138 6.10: Floating-point rounding functions without em inexact exception / 139 6.11: Integer rounding functions with fixed rounding / 140 6.12: Integer rounding functions with current rounding / 142 6.13: Remainder / 143 6.14: Why the remainder functions are hard / 144 6.15: Computing tt fmod / 146 6.16: Computing tt remainder / 148 6.17: Computing tt remquo / 150 6.18: Computing one remainder from the other / 152 6.19: Computing the remainder in nonbinary bases / 155 6.20: Summary / 156 7: Random numbers / 157 7.1: Guidelines for random-number software / 157 7.2: Creating generator seeds / 158 7.3: Random floating-point values / 160 7.4: Random integers from floating-point generator / 165 7.5: Random integers from an integer generator / 166 7.6: Random integers in ascending order / 168 7.7: How random numbers are generated / 169 7.8: Removing generator bias / 178 7.9: Improving a poor random number generator / 178 7.10: Why long periods matter / 179 7.11: Inversive congruential generators / 180 7.12: Inversive congruential generators, revisited / 189 7.13: Distributions of random numbers / 189 7.14: Other distributions / 195 7.15: Testing random-number generators / 196 7.16: Applications of random numbers / 202 7.17: The textsf mathcw random number routines / 208 7.18: Summary, advice, and further reading / 214 8: Roots / 215 8.1: Square root / 215 8.2: Hypotenuse and vector norms / 222 8.3: Hypotenuse by iteration / 227 8.4: Reciprocal square root / 233 8.5: Cube root / 237 8.6: Roots in hardware / 240 8.7: Summary / 242 9: Argument reduction / 243 9.1: Simple argument reduction / 243 9.2: Exact argument reduction / 250 9.3: Implementing exact argument reduction / 253 9.4: Testing argument reduction / 265 9.5: Retrospective on argument reduction / 265 10: Exponential and logarithm / 267 10.1: Exponential functions / 267 10.2: Exponential near zero / 273 10.3: Logarithm functions / 282 10.4: Logarithm near one / 290 10.5: Exponential and logarithm in hardware / 292 10.6: Compound interest and annuities / 294 10.7: Summary / 298 11: Trigonometric functions / 299 11.1: Sine and cosine properties / 299 11.2: Tangent properties / 302 11.3: Argument conventions and units / 304 11.4: Computing the cosine and sine / 306 11.5: Computing the tangent / 310 11.6: Trigonometric functions in degrees / 313 11.7: Trigonometric functions in units of $ pi $ / 315 11.8: Computing the cosine and sine together / 320 11.9: Inverse sine and cosine / 323 11.10: Inverse tangent / 331 11.11: Inverse tangent, take two / 336 11.12: Trigonometric functions in hardware / 338 11.13: Testing trigonometric functions / 339 11.14: Retrospective on trigonometric functions / 340 12: Hyperbolic functions / 341 12.1: Hyperbolic functions / 341 12.2: Improving the hyperbolic functions / 345 12.3: Computing the hyperbolic functions together / 348 12.4: Inverse hyperbolic functions / 348 12.5: Hyperbolic functions in hardware / 350 12.6: Summary / 352 13: Pair-precision arithmetic / 353 13.1: Limitations of pair-precision arithmetic / 354 13.2: Design of the pair-precision software interface / 355 13.3: Pair-precision initialization / 356 13.4: Pair-precision evaluation / 357 13.5: Pair-precision high part / 357 13.6: Pair-precision low part / 357 13.7: Pair-precision copy / 357 13.8: Pair-precision negation / 358 13.9: Pair-precision absolute value / 358 13.10: Pair-precision sum / 358 13.11: Splitting numbers into pair sums / 359 13.12: Premature overflow in splitting / 362 13.13: Pair-precision addition / 365 13.14: Pair-precision subtraction / 367 13.15: Pair-precision comparison / 368 13.16: Pair-precision multiplication / 368 13.17: Pair-precision division / 371 13.18: Pair-precision square root / 373 13.19: Pair-precision cube root / 377 13.20: Accuracy of pair-precision arithmetic / 379 13.21: Pair-precision vector sum / 384 13.22: Exact vector sums / 385 13.23: Pair-precision dot product / 385 13.24: Pair-precision product sum / 386 13.25: Pair-precision decimal arithmetic / 387 13.26: Fused multiply-add with pair precision / 388 13.27: Higher intermediate precision and the FMA / 393 13.28: Fused multiply-add without pair precision / 395 13.29: Fused multiply-add with multiple precision / 401 13.30: Fused multiply-add, Boldo/penalty exhyphenpenalty Melquiond style / 403 13.31: Error correction in fused multiply-add / 406 13.32: Retrospective on pair-precision arithmetic / 407 14: Power function / 411 14.1: Why the power function is hard to compute / 411 14.2: Special cases for the power function / 412 14.3: Integer powers / 414 14.4: Integer powers, revisited / 420 14.5: Outline of the power-function algorithm / 421 14.6: Finding $a$ and $p$ / 423 14.7: Table searching / 424 14.8: Computing $log _n(g/a)$ / 426 14.9: Accuracy required for $log _n(g/a)$ / 429 14.10: Exact products / 430 14.11: Computing $w$, $w_1$ and $w_2$ / 433 14.12: Computing $n^w_2$ / 437 14.13: The choice of $q$ / 438 14.14: Testing the power function / 438 14.15: Retrospective on the power function / 440 15: Complex arithmetic primitives / 441 15.1: Support macros and type definitions / 442 15.2: Complex absolute value / 443 15.3: Complex addition / 445 15.4: Complex argument / 445 15.5: Complex conjugate / 446 15.6: Complex conjugation symmetry / 446 15.7: Complex conversion / 448 15.8: Complex copy / 448 15.9: Complex division: C99 style / 449 15.10: Complex division: Smith style / 451 15.11: Complex division: Stewart style / 452 15.12: Complex division: Priest style / 453 15.13: Complex division: avoiding subtraction loss / 455 15.14: Complex imaginary part / 456 15.15: Complex multiplication / 456 15.16: Complex multiplication: error analysis / 458 15.17: Complex negation / 459 15.18: Complex projection / 460 15.19: Complex real part / 460 15.20: Complex subtraction / 461 15.21: Complex infinity test / 462 15.22: Complex NaN test / 462 15.23: Summary / 463 16: Quadratic equations / 465 16.1: Solving quadratic equations / 465 16.2: Root sensitivity / 471 16.3: Testing a quadratic-equation solver / 472 16.4: Summary / 474 17: Elementary functions in complex arithmetic / 475 17.1: Research on complex elementary functions / 475 17.2: Principal values / 476 17.3: Branch cuts / 476 17.4: Software problems with negative zeros / 478 17.5: Complex elementary function tree / 479 17.6: Series for complex functions / 479 17.7: Complex square root / 480 17.8: Complex cube root / 485 17.9: Complex exponential / 487 17.10: Complex exponential near zero / 492 17.11: Complex logarithm / 495 17.12: Complex logarithm near one / 497 17.13: Complex power / 500 17.14: Complex trigonometric functions / 502 17.15: Complex inverse trigonometric functions / 504 17.16: Complex hyperbolic functions / 509 17.17: Complex inverse hyperbolic functions / 514 17.18: Summary / 520 18: The Greek functions: gamma, psi, and zeta / 521 18.1: Gamma and log-gamma functions / 521 18.2: The tt psi and tt psiln functions / 536 18.3: Polygamma functions / 547 18.4: Incomplete gamma functions / 560 18.5: A Swiss diversion: Bernoulli and Euler / 568 18.6: An Italian excursion: Fibonacci numbers / 575 18.7: A German gem: the Riemann zeta function / 579 18.8: Further reading / 590 18.9: Summary / 591 19: Error and probability functions / 593 19.1: Error functions / 593 19.2: Scaled complementary error function / 598 19.3: Inverse error functions / 600 19.4: Normal distribution functions and inverses / 610 19.5: Summary / 617 20: Elliptic integral functions / 619 20.1: The arithmetic-geometric mean / 619 20.2: Elliptic integral functions of the first kind / 624 20.3: Elliptic integral functions of the second kind / 627 20.4: Elliptic integral functions of the third kind / 630 20.5: Computing $K(m)$ and $K'(m)$ / 631 20.6: Computing $E(m)$ and $E'(m)$ / 637 20.7: Historical algorithms for elliptic integrals / 643 20.8: Auxiliary functions for elliptic integrals / 645 20.9: Computing the elliptic auxiliary functions / 648 20.10: Historical elliptic functions / 650 20.11: Elliptic functions in software / 652 20.12: Applications of elliptic auxiliary functions / 653 20.13: Elementary functions from elliptic auxiliary functions / 654 20.14: Computing elementary functions via $R_C(x,y)$ / 655 20.15: Jacobian elliptic functions / 657 20.16: Inverses of Jacobian elliptic functions / 664 20.17: The modulus and the nome / 668 20.18: Jacobian theta functions / 673 20.19: Logarithmic derivatives of the Jacobian theta functions / 675 20.20: Neville theta functions / 678 20.21: Jacobian Eta, Theta, and Zeta functions / 679 20.22: Weierstrass elliptic functions / 682 20.23: Weierstrass functions by duplication / 689 20.24: Complete elliptic functions, revisited / 690 20.25: Summary / 691 21: Bessel functions / 693 21.1: Cylindrical Bessel functions / 694 21.2: Behavior of $J_n(x)$ and $Y_n(x)$ / 695 21.3: Properties of $J_n(z)$ and $Y_n(z)$ / 697 21.4: Experiments with recurrences for $J_0(x)$ / 705 21.5: Computing $J_0(x)$ and $J_1(x)$ / 707 21.6: Computing $J_n(x)$ / 710 21.7: Computing $Y_0(x)$ and $Y_1(x)$ / 713 21.8: Computing $Y_n(x)$ / 715 21.9: Improving Bessel code near zeros / 716 21.10: Properties of $I_n(z)$ and $K_n(z)$ / 718 21.11: Computing $I_0(x)$ and $I_1(x)$ / 724 21.12: Computing $K_0(x)$ and $K_1(x)$ / 726 21.13: Computing $I_n(x)$ and $K_n(x)$ / 728 21.14: Properties of spherical Bessel functions / 731 21.15: Computing $j_n(x)$ and $y_n(x)$ / 735 21.16: Improving $j_1(x)$ and $y_1(x)$ / 740 21.17: Modified spherical Bessel functions / 743 21.18: Software for Bessel-function sequences / 755 21.19: Retrospective on Bessel functions / 761 22: Testing the library / 763 22.1: Testing tt tgamma and tt lgamma / 765 22.2: Testing tt psi and tt psiln / 768 22.3: Testing tt erf and tt erfc / 768 22.4: Testing cylindrical Bessel functions / 769 22.5: Testing exponent/penalty exhyphenpenalty significand manipulation / 769 22.6: Testing inline assembly code / 769 22.7: Testing with Maple / 770 22.8: Testing floating-point arithmetic / 773 22.9: The Berkeley Elementary Functions Test Suite / 774 22.10: The AT&T floating-point test package / 775 22.11: The Antwerp test suite / 776 22.12: Summary / 776 23: Pair-precision elementary functions / 777 23.1: Pair-precision integer power / 777 23.2: Pair-precision machine epsilon / 779 23.3: Pair-precision exponential / 780 23.4: Pair-precision logarithm / 787 23.5: Pair-precision logarithm near one / 793 23.6: Pair-precision exponential near zero / 793 23.7: Pair-precision base-$n$ exponentials / 795 23.8: Pair-precision trigonometric functions / 796 23.9: Pair-precision inverse trigonometric functions / 801 23.10: Pair-precision hyperbolic functions / 804 23.11: Pair-precision inverse hyperbolic functions / 808 23.12: Summary / 808 24: Accuracy of the Cody / Waite algorithms / 811 25: Improving upon the Cody / Waite algorithms / 823 25.1: The Bell Labs libraries / 823 25.2: The Cephes library / 823 25.3: The Sun libraries / 824 25.4: Mathematical functions on EPIC / 824 25.5: The GNU libraries / 825 25.6: The French libraries / 825 25.7: The NIST effort / 826 25.8: Commercial mathematical libraries / 826 25.9: Mathematical libraries for decimal arithmetic / 826 25.10: Mathematical library research publications / 826 25.11: Books on computing mathematical functions / 827 25.12: Summary / 828 26: Floating-point output / 829 26.1: Output character string design issues / 830 26.2: Exact output conversion / 831 26.3: Hexadecimal floating-point output / 832 26.4: Octal floating-point output / 850 26.5: Binary floating-point output / 851 26.6: Decimal floating-point output / 851 26.7: Accuracy of output conversion / 865 26.8: Output conversion to a general base / 865 26.9: Output conversion of Infinity / 866 26.10: Output conversion of NaN / 866 26.11: Number-to-string conversion / 867 26.12: The tt printf family / 867 26.13: Summary / 878 27: Floating-point input / 879 27.1: Binary floating-point input / 879 27.2: Octal floating-point input / 894 27.3: Hexadecimal floating-point input / 895 27.4: Decimal floating-point input / 895 27.5: Based-number input / 899 27.6: General floating-point input / 900 27.7: The tt scanf family / 901 27.8: Summary / 910 A: Ada interface / 911 A.1: Building the Ada interface / 911 A.2: Programming the Ada interface / 912 A.3: Using the Ada interface / 915 B: C# interface / 917 B.1: C# on the CLI virtual machine / 917 B.2: Building the C# interface / 918 B.3: Programming the C# interface / 920 B.4: Using the C# interface / 922 C: C++ interface / 923 C.1: Building the C++ interface / 923 C.2: Programming the C++ interface / 924 C.3: Using the C++ interface / 925 D: Decimal arithmetic / 927 D.1: Why we need decimal floating-point arithmetic / 927 D.2: Decimal floating-point arithmetic design issues / 928 D.3: How decimal and binary arithmetic differ / 931 D.4: Initialization of decimal floating-point storage / 935 D.5: The tt <decfloat.h> header file / 936 D.6: Rounding in decimal arithmetic / 936 D.7: Exact scaling in decimal arithmetic / 937 E: Errata in the Cody / Waite book / 939 F: Fortran interface / 941 F.1: Building the Fortran interface / 943 F.2: Programming the Fortran interface / 944 F.3: Using the Fortran interface / 945 H: Historical floating-point architectures / 947 H.1: CDC family / 949 H.2: Cray family / 952 H.3: DEC PDP-10 / 953 H.4: DEC PDP-11 and VAX / 956 H.5: General Electric 600 series / 958 H.6: IBM family / 959 H.7: Lawrence Livermore S-1 Mark IIA / 965 H.8: Unusual floating-point systems / 966 H.9: Historical retrospective / 967 I: Integer arithmetic / 969 I.1: Memory addressing and integers / 971 I.2: Representations of signed integers / 971 I.3: Parity testing / 975 I.4: Sign testing / 975 I.5: Arithmetic exceptions / 975 I.6: Notations for binary numbers / 977 I.7: Summary / 978 J: Java interface / 979 J.1: Building the Java interface / 979 J.2: Programming the Java MathCW class / 980 J.3: Programming the Java C interface / 982 J.4: Using the Java interface / 985 L: Letter notation / 987 P: Pascal interface / 989 P.1: Building the Pascal interface / 989 P.2: Programming the Pascal MathCW module / 990 P.3: Using the Pascal module interface / 993 P.4: Pascal and numeric programming / 994 Bibliography / 995 Author/editor index / 1039 Function and macro index / 1049 Subject index / 1065 Colophon / 1115

rawtitle:
The Mathematical-Function Computation Handbook: Programming Using the {MathCW} Portable Software Library

rawTOC:
List of figures / xxv \\ List of tables / xxxi \\ Quick start / xxxv \\ 1: Introduction / 1 \\ 1.1: Programming conventions / 2 \\ 1.2: Naming conventions / 4 \\ 1.3: Library contributions and coverage / 5 \\ 1.4: Summary / 6 \\ 2: Iterative solutions and other tools / 7 \\ 2.1: Polynomials and Taylor series / 7 \\ 2.2: First-order Taylor series approximation / 8 \\ 2.3: Second-order Taylor series approximation / 9 \\ 2.4: Another second-order Taylor series approximation / 9 \\ 2.5: Convergence of second-order methods / 10 \\ 2.6: Taylor series for elementary functions / 10 \\ 2.7: Continued fractions / 12 \\ 2.8: Summation of continued fractions / 17 \\ 2.9: Asymptotic expansions / 19 \\ 2.10: Series inversion / 20 \\ 2.11: Summary / 22 \\ 3: Polynomial approximations / 23 \\ 3.1: Computation of odd series / 23 \\ 3.2: Computation of even series / 25 \\ 3.3: Computation of general series / 25 \\ 3.4: Limitations of Cody\slash Waite polynomials / 28 \\ 3.5: Polynomial fits with Maple / 32 \\ 3.6: Polynomial fits with Mathematica / 33 \\ 3.7: Exact polynomial coefficients / 42 \\ 3.8: Cody\slash Waite rational polynomials / 43 \\ 3.9: Chebyshev polynomial economization / 43 \\ 3.10: Evaluating Chebyshev polynomials / 48 \\ 3.11: Error compensation in Chebyshev fits / 50 \\ 3.12: Improving Chebyshev fits / 51 \\ 3.13: Chebyshev fits in rational form / 52 \\ 3.14: Chebyshev fits with Mathematica / 56 \\ 3.15: Chebyshev fits for function representation / 57 \\ 3.16: Extending the library / 57 \\ 3.17: Summary and further reading / 58 \\ 4: Implementation issues / 61 \\ 4.1: Error magnification / 61 \\ 4.2: Machine representation and machine epsilon / 62 \\ 4.3: IEEE 754 arithmetic / 63 \\ 4.4: Evaluation order in C / 64 \\ 4.5: The {\tt volatile} type qualifier / 65 \\ 4.6: Rounding in floating-point arithmetic / 66 \\ 4.7: Signed zero / 69 \\ 4.8: Floating-point zero divide / 70 \\ 4.9: Floating-point overflow / 71 \\ 4.10: Integer overflow / 72 \\ 4.11: Floating-point underflow / 77 \\ 4.12: Subnormal numbers / 78 \\ 4.13: Floating-point inexact operation / 79 \\ 4.14: Floating-point invalid operation / 79 \\ 4.15: Remarks on NaN tests / 80 \\ 4.16: Ulps --- units in the last place / 81 \\ 4.17: Fused multiply-add / 85 \\ 4.18: Fused multiply-add and polynomials / 88 \\ 4.19: Significance loss / 89 \\ 4.20: Error handling and reporting / 89 \\ 4.21: Interpreting error codes / 93 \\ 4.22: C99 changes to error reporting / 94 \\ 4.23: Error reporting with threads / 95 \\ 4.24: Comments on error reporting / 95 \\ 4.25: Testing function implementations / 96 \\ 4.26: Extended data types on Hewlett--Packard HP-UX IA-64 / 100 \\ 4.27: Extensions for decimal arithmetic / 101 \\ 4.28: Further reading / 103 \\ 4.29: Summary / 104 \\ 5: The floating-point environment / 105 \\ 5.1: IEEE 754 and programming languages / 105 \\ 5.2: IEEE 754 and the mathcw library / 106 \\ 5.3: Exceptions and traps / 106 \\ 5.4: Access to exception flags and rounding control / 107 \\ 5.5: The environment access pragma / 110 \\ 5.6: Implementation of exception-flag and rounding-control access / 110 \\ 5.7: Using exception flags: simple cases / 112 \\ 5.8: Using rounding control / 115 \\ 5.9: Additional exception flag access / 116 \\ 5.10: Using exception flags: complex case / 120 \\ 5.11: Access to precision control / 123 \\ 5.12: Using precision control / 126 \\ 5.13: Summary / 127 \\ 6: Converting floating-point values to integers / 129 \\ 6.1: Integer conversion in programming languages / 129 \\ 6.2: Programming issues for conversions to integers / 130 \\ 6.3: Hardware out-of-range conversions / 131 \\ 6.4: Rounding modes and integer conversions / 132 \\ 6.5: Extracting integral and fractional parts / 132 \\ 6.6: Truncation functions / 135 \\ 6.7: Ceiling and floor functions / 136 \\ 6.8: Floating-point rounding functions with fixed rounding / 137 \\ 6.9: Floating-point rounding functions: current rounding / 138 \\ 6.10: Floating-point rounding functions without {\em inexact\/} exception / 139 \\ 6.11: Integer rounding functions with fixed rounding / 140 \\ 6.12: Integer rounding functions with current rounding / 142 \\ 6.13: Remainder / 143 \\ 6.14: Why the remainder functions are hard / 144 \\ 6.15: Computing {\tt fmod} / 146 \\ 6.16: Computing {\tt remainder} / 148 \\ 6.17: Computing {\tt remquo} / 150 \\ 6.18: Computing one remainder from the other / 152 \\ 6.19: Computing the remainder in nonbinary bases / 155 \\ 6.20: Summary / 156 \\ 7: Random numbers / 157 \\ 7.1: Guidelines for random-number software / 157 \\ 7.2: Creating generator seeds / 158 \\ 7.3: Random floating-point values / 160 \\ 7.4: Random integers from floating-point generator / 165 \\ 7.5: Random integers from an integer generator / 166 \\ 7.6: Random integers in ascending order / 168 \\ 7.7: How random numbers are generated / 169 \\ 7.8: Removing generator bias / 178 \\ 7.9: Improving a poor random number generator / 178 \\ 7.10: Why long periods matter / 179 \\ 7.11: Inversive congruential generators / 180 \\ 7.12: Inversive congruential generators, revisited / 189 \\ 7.13: Distributions of random numbers / 189 \\ 7.14: Other distributions / 195 \\ 7.15: Testing random-number generators / 196 \\ 7.16: Applications of random numbers / 202 \\ 7.17: The \textsf {mathcw} random number routines / 208 \\ 7.18: Summary, advice, and further reading / 214 \\ 8: Roots / 215 \\ 8.1: Square root / 215 \\ 8.2: Hypotenuse and vector norms / 222 \\ 8.3: Hypotenuse by iteration / 227 \\ 8.4: Reciprocal square root / 233 \\ 8.5: Cube root / 237 \\ 8.6: Roots in hardware / 240 \\ 8.7: Summary / 242 \\ 9: Argument reduction / 243 \\ 9.1: Simple argument reduction / 243 \\ 9.2: Exact argument reduction / 250 \\ 9.3: Implementing exact argument reduction / 253 \\ 9.4: Testing argument reduction / 265 \\ 9.5: Retrospective on argument reduction / 265 \\ 10: Exponential and logarithm / 267 \\ 10.1: Exponential functions / 267 \\ 10.2: Exponential near zero / 273 \\ 10.3: Logarithm functions / 282 \\ 10.4: Logarithm near one / 290 \\ 10.5: Exponential and logarithm in hardware / 292 \\ 10.6: Compound interest and annuities / 294 \\ 10.7: Summary / 298 \\ 11: Trigonometric functions / 299 \\ 11.1: Sine and cosine properties / 299 \\ 11.2: Tangent properties / 302 \\ 11.3: Argument conventions and units / 304 \\ 11.4: Computing the cosine and sine / 306 \\ 11.5: Computing the tangent / 310 \\ 11.6: Trigonometric functions in degrees / 313 \\ 11.7: Trigonometric functions in units of $ \pi $ / 315 \\ 11.8: Computing the cosine and sine together / 320 \\ 11.9: Inverse sine and cosine / 323 \\ 11.10: Inverse tangent / 331 \\ 11.11: Inverse tangent, take two / 336 \\ 11.12: Trigonometric functions in hardware / 338 \\ 11.13: Testing trigonometric functions / 339 \\ 11.14: Retrospective on trigonometric functions / 340 \\ 12: Hyperbolic functions / 341 \\ 12.1: Hyperbolic functions / 341 \\ 12.2: Improving the hyperbolic functions / 345 \\ 12.3: Computing the hyperbolic functions together / 348 \\ 12.4: Inverse hyperbolic functions / 348 \\ 12.5: Hyperbolic functions in hardware / 350 \\ 12.6: Summary / 352 \\ 13: Pair-precision arithmetic / 353 \\ 13.1: Limitations of pair-precision arithmetic / 354 \\ 13.2: Design of the pair-precision software interface / 355 \\ 13.3: Pair-precision initialization / 356 \\ 13.4: Pair-precision evaluation / 357 \\ 13.5: Pair-precision high part / 357 \\ 13.6: Pair-precision low part / 357 \\ 13.7: Pair-precision copy / 357 \\ 13.8: Pair-precision negation / 358 \\ 13.9: Pair-precision absolute value / 358 \\ 13.10: Pair-precision sum / 358 \\ 13.11: Splitting numbers into pair sums / 359 \\ 13.12: Premature overflow in splitting / 362 \\ 13.13: Pair-precision addition / 365 \\ 13.14: Pair-precision subtraction / 367 \\ 13.15: Pair-precision comparison / 368 \\ 13.16: Pair-precision multiplication / 368 \\ 13.17: Pair-precision division / 371 \\ 13.18: Pair-precision square root / 373 \\ 13.19: Pair-precision cube root / 377 \\ 13.20: Accuracy of pair-precision arithmetic / 379 \\ 13.21: Pair-precision vector sum / 384 \\ 13.22: Exact vector sums / 385 \\ 13.23: Pair-precision dot product / 385 \\ 13.24: Pair-precision product sum / 386 \\ 13.25: Pair-precision decimal arithmetic / 387 \\ 13.26: Fused multiply-add with pair precision / 388 \\ 13.27: Higher intermediate precision and the FMA / 393 \\ 13.28: Fused multiply-add without pair precision / 395 \\ 13.29: Fused multiply-add with multiple precision / 401 \\ 13.30: Fused multiply-add, Boldo/\penalty \exhyphenpenalty Melquiond style / 403 \\ 13.31: Error correction in fused multiply-add / 406 \\ 13.32: Retrospective on pair-precision arithmetic / 407 \\ 14: Power function / 411 \\ 14.1: Why the power function is hard to compute / 411 \\ 14.2: Special cases for the power function / 412 \\ 14.3: Integer powers / 414 \\ 14.4: Integer powers, revisited / 420 \\ 14.5: Outline of the power-function algorithm / 421 \\ 14.6: Finding $a$ and $p$ / 423 \\ 14.7: Table searching / 424 \\ 14.8: Computing $\log_n(g/a)$ / 426 \\ 14.9: Accuracy required for $\log_n(g/a)$ / 429 \\ 14.10: Exact products / 430 \\ 14.11: Computing $w$, $w_1$ and $w_2$ / 433 \\ 14.12: Computing $n^{w_2}$ / 437 \\ 14.13: The choice of $q$ / 438 \\ 14.14: Testing the power function / 438 \\ 14.15: Retrospective on the power function / 440 \\ 15: Complex arithmetic primitives / 441 \\ 15.1: Support macros and type definitions / 442 \\ 15.2: Complex absolute value / 443 \\ 15.3: Complex addition / 445 \\ 15.4: Complex argument / 445 \\ 15.5: Complex conjugate / 446 \\ 15.6: Complex conjugation symmetry / 446 \\ 15.7: Complex conversion / 448 \\ 15.8: Complex copy / 448 \\ 15.9: Complex division: C99 style / 449 \\ 15.10: Complex division: Smith style / 451 \\ 15.11: Complex division: Stewart style / 452 \\ 15.12: Complex division: Priest style / 453 \\ 15.13: Complex division: avoiding subtraction loss / 455 \\ 15.14: Complex imaginary part / 456 \\ 15.15: Complex multiplication / 456 \\ 15.16: Complex multiplication: error analysis / 458 \\ 15.17: Complex negation / 459 \\ 15.18: Complex projection / 460 \\ 15.19: Complex real part / 460 \\ 15.20: Complex subtraction / 461 \\ 15.21: Complex infinity test / 462 \\ 15.22: Complex NaN test / 462 \\ 15.23: Summary / 463 \\ 16: Quadratic equations / 465 \\ 16.1: Solving quadratic equations / 465 \\ 16.2: Root sensitivity / 471 \\ 16.3: Testing a quadratic-equation solver / 472 \\ 16.4: Summary / 474 \\ 17: Elementary functions in complex arithmetic / 475 \\ 17.1: Research on complex elementary functions / 475 \\ 17.2: Principal values / 476 \\ 17.3: Branch cuts / 476 \\ 17.4: Software problems with negative zeros / 478 \\ 17.5: Complex elementary function tree / 479 \\ 17.6: Series for complex functions / 479 \\ 17.7: Complex square root / 480 \\ 17.8: Complex cube root / 485 \\ 17.9: Complex exponential / 487 \\ 17.10: Complex exponential near zero / 492 \\ 17.11: Complex logarithm / 495 \\ 17.12: Complex logarithm near one / 497 \\ 17.13: Complex power / 500 \\ 17.14: Complex trigonometric functions / 502 \\ 17.15: Complex inverse trigonometric functions / 504 \\ 17.16: Complex hyperbolic functions / 509 \\ 17.17: Complex inverse hyperbolic functions / 514 \\ 17.18: Summary / 520 \\ 18: The Greek functions: gamma, psi, and zeta / 521 \\ 18.1: Gamma and log-gamma functions / 521 \\ 18.2: The {\tt psi} and {\tt psiln} functions / 536 \\ 18.3: Polygamma functions / 547 \\ 18.4: Incomplete gamma functions / 560 \\ 18.5: A Swiss diversion: Bernoulli and Euler / 568 \\ 18.6: An Italian excursion: Fibonacci numbers / 575 \\ 18.7: A German gem: the Riemann zeta function / 579 \\ 18.8: Further reading / 590 \\ 18.9: Summary / 591 \\ 19: Error and probability functions / 593 \\ 19.1: Error functions / 593 \\ 19.2: Scaled complementary error function / 598 \\ 19.3: Inverse error functions / 600 \\ 19.4: Normal distribution functions and inverses / 610 \\ 19.5: Summary / 617 \\ 20: Elliptic integral functions / 619 \\ 20.1: The arithmetic-geometric mean / 619 \\ 20.2: Elliptic integral functions of the first kind / 624 \\ 20.3: Elliptic integral functions of the second kind / 627 \\ 20.4: Elliptic integral functions of the third kind / 630 \\ 20.5: Computing $K(m)$ and $K'(m)$ / 631 \\ 20.6: Computing $E(m)$ and $E'(m)$ / 637 \\ 20.7: Historical algorithms for elliptic integrals / 643 \\ 20.8: Auxiliary functions for elliptic integrals / 645 \\ 20.9: Computing the elliptic auxiliary functions / 648 \\ 20.10: Historical elliptic functions / 650 \\ 20.11: Elliptic functions in software / 652 \\ 20.12: Applications of elliptic auxiliary functions / 653 \\ 20.13: Elementary functions from elliptic auxiliary functions / 654 \\ 20.14: Computing elementary functions via $R_C(x,y)$ / 655 \\ 20.15: Jacobian elliptic functions / 657 \\ 20.16: Inverses of Jacobian elliptic functions / 664 \\ 20.17: The modulus and the nome / 668 \\ 20.18: Jacobian theta functions / 673 \\ 20.19: Logarithmic derivatives of the Jacobian theta functions / 675 \\ 20.20: Neville theta functions / 678 \\ 20.21: Jacobian Eta, Theta, and Zeta functions / 679 \\ 20.22: Weierstrass elliptic functions / 682 \\ 20.23: Weierstrass functions by duplication / 689 \\ 20.24: Complete elliptic functions, revisited / 690 \\ 20.25: Summary / 691 \\ 21: Bessel functions / 693 \\ 21.1: Cylindrical Bessel functions / 694 \\ 21.2: Behavior of $J_n(x)$ and $Y_n(x)$ / 695 \\ 21.3: Properties of $J_n(z)$ and $Y_n(z)$ / 697 \\ 21.4: Experiments with recurrences for $J_0(x)$ / 705 \\ 21.5: Computing $J_0(x)$ and $J_1(x)$ / 707 \\ 21.6: Computing $J_n(x)$ / 710 \\ 21.7: Computing $Y_0(x)$ and $Y_1(x)$ / 713 \\ 21.8: Computing $Y_n(x)$ / 715 \\ 21.9: Improving Bessel code near zeros / 716 \\ 21.10: Properties of $I_n(z)$ and $K_n(z)$ / 718 \\ 21.11: Computing $I_0(x)$ and $I_1(x)$ / 724 \\ 21.12: Computing $K_0(x)$ and $K_1(x)$ / 726 \\ 21.13: Computing $I_n(x)$ and $K_n(x)$ / 728 \\ 21.14: Properties of spherical Bessel functions / 731 \\ 21.15: Computing $j_n(x)$ and $y_n(x)$ / 735 \\ 21.16: Improving $j_1(x)$ and $y_1(x)$ / 740 \\ 21.17: Modified spherical Bessel functions / 743 \\ 21.18: Software for Bessel-function sequences / 755 \\ 21.19: Retrospective on Bessel functions / 761 \\ 22: Testing the library / 763 \\ 22.1: Testing {\tt tgamma} and {\tt lgamma} / 765 \\ 22.2: Testing {\tt psi} and {\tt psiln} / 768 \\ 22.3: Testing {\tt erf} and {\tt erfc} / 768 \\ 22.4: Testing cylindrical Bessel functions / 769 \\ 22.5: Testing exponent/\penalty \exhyphenpenalty significand manipulation / 769 \\ 22.6: Testing inline assembly code / 769 \\ 22.7: Testing with Maple / 770 \\ 22.8: Testing floating-point arithmetic / 773 \\ 22.9: The Berkeley Elementary Functions Test Suite / 774 \\ 22.10: The AT\&T floating-point test package / 775 \\ 22.11: The Antwerp test suite / 776 \\ 22.12: Summary / 776 \\ 23: Pair-precision elementary functions / 777 \\ 23.1: Pair-precision integer power / 777 \\ 23.2: Pair-precision machine epsilon / 779 \\ 23.3: Pair-precision exponential / 780 \\ 23.4: Pair-precision logarithm / 787 \\ 23.5: Pair-precision logarithm near one / 793 \\ 23.6: Pair-precision exponential near zero / 793 \\ 23.7: Pair-precision base-$n$ exponentials / 795 \\ 23.8: Pair-precision trigonometric functions / 796 \\ 23.9: Pair-precision inverse trigonometric functions / 801 \\ 23.10: Pair-precision hyperbolic functions / 804 \\ 23.11: Pair-precision inverse hyperbolic functions / 808 \\ 23.12: Summary / 808 \\ 24: Accuracy of the Cody\slash Waite algorithms / 811 \\ 25: Improving upon the Cody\slash Waite algorithms / 823 \\ 25.1: The Bell Labs libraries / 823 \\ 25.2: The {Cephes} library / 823 \\ 25.3: The {Sun} libraries / 824 \\ 25.4: Mathematical functions on EPIC / 824 \\ 25.5: The GNU libraries / 825 \\ 25.6: The French libraries / 825 \\ 25.7: The NIST effort / 826 \\ 25.8: Commercial mathematical libraries / 826 \\ 25.9: Mathematical libraries for decimal arithmetic / 826 \\ 25.10: Mathematical library research publications / 826 \\ 25.11: Books on computing mathematical functions / 827 \\ 25.12: Summary / 828 \\ 26: Floating-point output / 829 \\ 26.1: Output character string design issues / 830 \\ 26.2: Exact output conversion / 831 \\ 26.3: Hexadecimal floating-point output / 832 \\ 26.4: Octal floating-point output / 850 \\ 26.5: Binary floating-point output / 851 \\ 26.6: Decimal floating-point output / 851 \\ 26.7: Accuracy of output conversion / 865 \\ 26.8: Output conversion to a general base / 865 \\ 26.9: Output conversion of Infinity / 866 \\ 26.10: Output conversion of NaN / 866 \\ 26.11: Number-to-string conversion / 867 \\ 26.12: The {\tt printf} family / 867 \\ 26.13: Summary / 878 \\ 27: Floating-point input / 879 \\ 27.1: Binary floating-point input / 879 \\ 27.2: Octal floating-point input / 894 \\ 27.3: Hexadecimal floating-point input / 895 \\ 27.4: Decimal floating-point input / 895 \\ 27.5: Based-number input / 899 \\ 27.6: General floating-point input / 900 \\ 27.7: The {\tt scanf} family / 901 \\ 27.8: Summary / 910 \\ A: Ada interface / 911 \\ A.1: Building the Ada interface / 911 \\ A.2: Programming the Ada interface / 912 \\ A.3: Using the Ada interface / 915 \\ B: C\# interface / 917 \\ B.1: C\# on the CLI virtual machine / 917 \\ B.2: Building the C\# interface / 918 \\ B.3: Programming the C\# interface / 920 \\ B.4: Using the C\# interface / 922 \\ C: C++ interface / 923 \\ C.1: Building the C++ interface / 923 \\ C.2: Programming the C++ interface / 924 \\ C.3: Using the C++ interface / 925 \\ D: Decimal arithmetic / 927 \\ D.1: Why we need decimal floating-point arithmetic / 927 \\ D.2: Decimal floating-point arithmetic design issues / 928 \\ D.3: How decimal and binary arithmetic differ / 931 \\ D.4: Initialization of decimal floating-point storage / 935 \\ D.5: The {\tt <decfloat.h>} header file / 936 \\ D.6: Rounding in decimal arithmetic / 936 \\ D.7: Exact scaling in decimal arithmetic / 937 \\ E: Errata in the Cody\slash Waite book / 939 \\ F: Fortran interface / 941 \\ F.1: Building the Fortran interface / 943 \\ F.2: Programming the Fortran interface / 944 \\ F.3: Using the Fortran interface / 945 \\ H: Historical floating-point architectures / 947 \\ H.1: CDC family / 949 \\ H.2: Cray family / 952 \\ H.3: DEC PDP-10 / 953 \\ H.4: DEC PDP-11 and VAX / 956 \\ H.5: General Electric 600 series / 958 \\ H.6: IBM family / 959 \\ H.7: Lawrence Livermore S-1 Mark IIA / 965 \\ H.8: Unusual floating-point systems / 966 \\ H.9: Historical retrospective / 967 \\ I: Integer arithmetic / 969 \\ I.1: Memory addressing and integers / 971 \\ I.2: Representations of signed integers / 971 \\ I.3: Parity testing / 975 \\ I.4: Sign testing / 975 \\ I.5: Arithmetic exceptions / 975 \\ I.6: Notations for binary numbers / 977 \\ I.7: Summary / 978 \\ J: Java interface / 979 \\ J.1: Building the Java interface / 979 \\ J.2: Programming the Java MathCW class / 980 \\ J.3: Programming the Java C interface / 982 \\ J.4: Using the Java interface / 985 \\ L: Letter notation / 987 \\ P: Pascal interface / 989 \\ P.1: Building the Pascal interface / 989 \\ P.2: Programming the Pascal MathCW module / 990 \\ P.3: Using the Pascal module interface / 993 \\ P.4: Pascal and numeric programming / 994 \\ Bibliography / 995 \\ Author/editor index / 1039 \\ Function and macro index / 1049 \\ Subject index / 1065 \\ Colophon / 1115

entry:
@Book{Beebe:2017:MFC,
  author =       "Nelson H. F. Beebe",
  title =        "The Mathematical-Function Computation Handbook:
                 Programming Using the {MathCW} Portable Software
                 Library",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxxvi + 1114",
  year =         "2017",
  DOI =          "https://doi.org/10.1007/978-3-319-64110-2",
  ISBN =         "3-319-64109-3 (hardcover), 3-319-64110-7 (e-book)",
  ISBN-13 =      "978-3-319-64109-6 (hardcover), 978-3-319-64110-2
                 (e-book)",
  LCCN =         "QA75.5-76.95",
  bibdate =      "Sat Jul 15 19:34:43 MDT 2017",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib;
                 https://www.math.utah.edu/pub/tex/bib/axiom.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathematica.bib;
                 https://www.math.utah.edu/pub/tex/bib/matlab.bib;
                 https://www.math.utah.edu/pub/tex/bib/mupad.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/redbooks.bib;
                 https://www.math.utah.edu/pub/tex/bib/utah-math-dept-books.bib",
  URL =          "http://www.springer.com/us/book/9783319641096",
  acknowledgement = ack-nhfb,
  ORCID-numbers = "Beebe, Nelson H. F./0000-0001-7281-4263",
  tableofcontents = "List of figures / xxv \\
                 List of tables / xxxi \\
                 Quick start / xxxv \\
                 1: Introduction / 1 \\
                 1.1: Programming conventions / 2 \\
                 1.2: Naming conventions / 4 \\
                 1.3: Library contributions and coverage / 5 \\
                 1.4: Summary / 6 \\
                 2: Iterative solutions and other tools / 7 \\
                 2.1: Polynomials and Taylor series / 7 \\
                 2.2: First-order Taylor series approximation / 8 \\
                 2.3: Second-order Taylor series approximation / 9 \\
                 2.4: Another second-order Taylor series approximation /
                 9 \\
                 2.5: Convergence of second-order methods / 10 \\
                 2.6: Taylor series for elementary functions / 10 \\
                 2.7: Continued fractions / 12 \\
                 2.8: Summation of continued fractions / 17 \\
                 2.9: Asymptotic expansions / 19 \\
                 2.10: Series inversion / 20 \\
                 2.11: Summary / 22 \\
                 3: Polynomial approximations / 23 \\
                 3.1: Computation of odd series / 23 \\
                 3.2: Computation of even series / 25 \\
                 3.3: Computation of general series / 25 \\
                 3.4: Limitations of Cody\slash Waite polynomials / 28
                 \\
                 3.5: Polynomial fits with Maple / 32 \\
                 3.6: Polynomial fits with Mathematica / 33 \\
                 3.7: Exact polynomial coefficients / 42 \\
                 3.8: Cody\slash Waite rational polynomials / 43 \\
                 3.9: Chebyshev polynomial economization / 43 \\
                 3.10: Evaluating Chebyshev polynomials / 48 \\
                 3.11: Error compensation in Chebyshev fits / 50 \\
                 3.12: Improving Chebyshev fits / 51 \\
                 3.13: Chebyshev fits in rational form / 52 \\
                 3.14: Chebyshev fits with Mathematica / 56 \\
                 3.15: Chebyshev fits for function representation / 57
                 \\
                 3.16: Extending the library / 57 \\
                 3.17: Summary and further reading / 58 \\
                 4: Implementation issues / 61 \\
                 4.1: Error magnification / 61 \\
                 4.2: Machine representation and machine epsilon / 62
                 \\
                 4.3: IEEE 754 arithmetic / 63 \\
                 4.4: Evaluation order in C / 64 \\
                 4.5: The {\tt volatile} type qualifier / 65 \\
                 4.6: Rounding in floating-point arithmetic / 66 \\
                 4.7: Signed zero / 69 \\
                 4.8: Floating-point zero divide / 70 \\
                 4.9: Floating-point overflow / 71 \\
                 4.10: Integer overflow / 72 \\
                 4.11: Floating-point underflow / 77 \\
                 4.12: Subnormal numbers / 78 \\
                 4.13: Floating-point inexact operation / 79 \\
                 4.14: Floating-point invalid operation / 79 \\
                 4.15: Remarks on NaN tests / 80 \\
                 4.16: Ulps --- units in the last place / 81 \\
                 4.17: Fused multiply-add / 85 \\
                 4.18: Fused multiply-add and polynomials / 88 \\
                 4.19: Significance loss / 89 \\
                 4.20: Error handling and reporting / 89 \\
                 4.21: Interpreting error codes / 93 \\
                 4.22: C99 changes to error reporting / 94 \\
                 4.23: Error reporting with threads / 95 \\
                 4.24: Comments on error reporting / 95 \\
                 4.25: Testing function implementations / 96 \\
                 4.26: Extended data types on Hewlett--Packard HP-UX
                 IA-64 / 100 \\
                 4.27: Extensions for decimal arithmetic / 101 \\
                 4.28: Further reading / 103 \\
                 4.29: Summary / 104 \\
                 5: The floating-point environment / 105 \\
                 5.1: IEEE 754 and programming languages / 105 \\
                 5.2: IEEE 754 and the mathcw library / 106 \\
                 5.3: Exceptions and traps / 106 \\
                 5.4: Access to exception flags and rounding control /
                 107 \\
                 5.5: The environment access pragma / 110 \\
                 5.6: Implementation of exception-flag and
                 rounding-control access / 110 \\
                 5.7: Using exception flags: simple cases / 112 \\
                 5.8: Using rounding control / 115 \\
                 5.9: Additional exception flag access / 116 \\
                 5.10: Using exception flags: complex case / 120 \\
                 5.11: Access to precision control / 123 \\
                 5.12: Using precision control / 126 \\
                 5.13: Summary / 127 \\
                 6: Converting floating-point values to integers / 129
                 \\
                 6.1: Integer conversion in programming languages / 129
                 \\
                 6.2: Programming issues for conversions to integers /
                 130 \\
                 6.3: Hardware out-of-range conversions / 131 \\
                 6.4: Rounding modes and integer conversions / 132 \\
                 6.5: Extracting integral and fractional parts / 132 \\
                 6.6: Truncation functions / 135 \\
                 6.7: Ceiling and floor functions / 136 \\
                 6.8: Floating-point rounding functions with fixed
                 rounding / 137 \\
                 6.9: Floating-point rounding functions: current
                 rounding / 138 \\
                 6.10: Floating-point rounding functions without {\em
                 inexact\/} exception / 139 \\
                 6.11: Integer rounding functions with fixed rounding /
                 140 \\
                 6.12: Integer rounding functions with current rounding
                 / 142 \\
                 6.13: Remainder / 143 \\
                 6.14: Why the remainder functions are hard / 144 \\
                 6.15: Computing {\tt fmod} / 146 \\
                 6.16: Computing {\tt remainder} / 148 \\
                 6.17: Computing {\tt remquo} / 150 \\
                 6.18: Computing one remainder from the other / 152 \\
                 6.19: Computing the remainder in nonbinary bases / 155
                 \\
                 6.20: Summary / 156 \\
                 7: Random numbers / 157 \\
                 7.1: Guidelines for random-number software / 157 \\
                 7.2: Creating generator seeds / 158 \\
                 7.3: Random floating-point values / 160 \\
                 7.4: Random integers from floating-point generator /
                 165 \\
                 7.5: Random integers from an integer generator / 166
                 \\
                 7.6: Random integers in ascending order / 168 \\
                 7.7: How random numbers are generated / 169 \\
                 7.8: Removing generator bias / 178 \\
                 7.9: Improving a poor random number generator / 178 \\
                 7.10: Why long periods matter / 179 \\
                 7.11: Inversive congruential generators / 180 \\
                 7.12: Inversive congruential generators, revisited /
                 189 \\
                 7.13: Distributions of random numbers / 189 \\
                 7.14: Other distributions / 195 \\
                 7.15: Testing random-number generators / 196 \\
                 7.16: Applications of random numbers / 202 \\
                 7.17: The \textsf {mathcw} random number routines / 208
                 \\
                 7.18: Summary, advice, and further reading / 214 \\
                 8: Roots / 215 \\
                 8.1: Square root / 215 \\
                 8.2: Hypotenuse and vector norms / 222 \\
                 8.3: Hypotenuse by iteration / 227 \\
                 8.4: Reciprocal square root / 233 \\
                 8.5: Cube root / 237 \\
                 8.6: Roots in hardware / 240 \\
                 8.7: Summary / 242 \\
                 9: Argument reduction / 243 \\
                 9.1: Simple argument reduction / 243 \\
                 9.2: Exact argument reduction / 250 \\
                 9.3: Implementing exact argument reduction / 253 \\
                 9.4: Testing argument reduction / 265 \\
                 9.5: Retrospective on argument reduction / 265 \\
                 10: Exponential and logarithm / 267 \\
                 10.1: Exponential functions / 267 \\
                 10.2: Exponential near zero / 273 \\
                 10.3: Logarithm functions / 282 \\
                 10.4: Logarithm near one / 290 \\
                 10.5: Exponential and logarithm in hardware / 292 \\
                 10.6: Compound interest and annuities / 294 \\
                 10.7: Summary / 298 \\
                 11: Trigonometric functions / 299 \\
                 11.1: Sine and cosine properties / 299 \\
                 11.2: Tangent properties / 302 \\
                 11.3: Argument conventions and units / 304 \\
                 11.4: Computing the cosine and sine / 306 \\
                 11.5: Computing the tangent / 310 \\
                 11.6: Trigonometric functions in degrees / 313 \\
                 11.7: Trigonometric functions in units of $ \pi $ / 315
                 \\
                 11.8: Computing the cosine and sine together / 320 \\
                 11.9: Inverse sine and cosine / 323 \\
                 11.10: Inverse tangent / 331 \\
                 11.11: Inverse tangent, take two / 336 \\
                 11.12: Trigonometric functions in hardware / 338 \\
                 11.13: Testing trigonometric functions / 339 \\
                 11.14: Retrospective on trigonometric functions / 340
                 \\
                 12: Hyperbolic functions / 341 \\
                 12.1: Hyperbolic functions / 341 \\
                 12.2: Improving the hyperbolic functions / 345 \\
                 12.3: Computing the hyperbolic functions together / 348
                 \\
                 12.4: Inverse hyperbolic functions / 348 \\
                 12.5: Hyperbolic functions in hardware / 350 \\
                 12.6: Summary / 352 \\
                 13: Pair-precision arithmetic / 353 \\
                 13.1: Limitations of pair-precision arithmetic / 354
                 \\
                 13.2: Design of the pair-precision software interface /
                 355 \\
                 13.3: Pair-precision initialization / 356 \\
                 13.4: Pair-precision evaluation / 357 \\
                 13.5: Pair-precision high part / 357 \\
                 13.6: Pair-precision low part / 357 \\
                 13.7: Pair-precision copy / 357 \\
                 13.8: Pair-precision negation / 358 \\
                 13.9: Pair-precision absolute value / 358 \\
                 13.10: Pair-precision sum / 358 \\
                 13.11: Splitting numbers into pair sums / 359 \\
                 13.12: Premature overflow in splitting / 362 \\
                 13.13: Pair-precision addition / 365 \\
                 13.14: Pair-precision subtraction / 367 \\
                 13.15: Pair-precision comparison / 368 \\
                 13.16: Pair-precision multiplication / 368 \\
                 13.17: Pair-precision division / 371 \\
                 13.18: Pair-precision square root / 373 \\
                 13.19: Pair-precision cube root / 377 \\
                 13.20: Accuracy of pair-precision arithmetic / 379 \\
                 13.21: Pair-precision vector sum / 384 \\
                 13.22: Exact vector sums / 385 \\
                 13.23: Pair-precision dot product / 385 \\
                 13.24: Pair-precision product sum / 386 \\
                 13.25: Pair-precision decimal arithmetic / 387 \\
                 13.26: Fused multiply-add with pair precision / 388 \\
                 13.27: Higher intermediate precision and the FMA / 393
                 \\
                 13.28: Fused multiply-add without pair precision / 395
                 \\
                 13.29: Fused multiply-add with multiple precision / 401
                 \\
                 13.30: Fused multiply-add, Boldo/\penalty
                 \exhyphenpenalty Melquiond style / 403 \\
                 13.31: Error correction in fused multiply-add / 406 \\
                 13.32: Retrospective on pair-precision arithmetic / 407
                 \\
                 14: Power function / 411 \\
                 14.1: Why the power function is hard to compute / 411
                 \\
                 14.2: Special cases for the power function / 412 \\
                 14.3: Integer powers / 414 \\
                 14.4: Integer powers, revisited / 420 \\
                 14.5: Outline of the power-function algorithm / 421 \\
                 14.6: Finding $a$ and $p$ / 423 \\
                 14.7: Table searching / 424 \\
                 14.8: Computing $\log_n(g/a)$ / 426 \\
                 14.9: Accuracy required for $\log_n(g/a)$ / 429 \\
                 14.10: Exact products / 430 \\
                 14.11: Computing $w$, $w_1$ and $w_2$ / 433 \\
                 14.12: Computing $n^{w_2}$ / 437 \\
                 14.13: The choice of $q$ / 438 \\
                 14.14: Testing the power function / 438 \\
                 14.15: Retrospective on the power function / 440 \\
                 15: Complex arithmetic primitives / 441 \\
                 15.1: Support macros and type definitions / 442 \\
                 15.2: Complex absolute value / 443 \\
                 15.3: Complex addition / 445 \\
                 15.4: Complex argument / 445 \\
                 15.5: Complex conjugate / 446 \\
                 15.6: Complex conjugation symmetry / 446 \\
                 15.7: Complex conversion / 448 \\
                 15.8: Complex copy / 448 \\
                 15.9: Complex division: C99 style / 449 \\
                 15.10: Complex division: Smith style / 451 \\
                 15.11: Complex division: Stewart style / 452 \\
                 15.12: Complex division: Priest style / 453 \\
                 15.13: Complex division: avoiding subtraction loss /
                 455 \\
                 15.14: Complex imaginary part / 456 \\
                 15.15: Complex multiplication / 456 \\
                 15.16: Complex multiplication: error analysis / 458 \\
                 15.17: Complex negation / 459 \\
                 15.18: Complex projection / 460 \\
                 15.19: Complex real part / 460 \\
                 15.20: Complex subtraction / 461 \\
                 15.21: Complex infinity test / 462 \\
                 15.22: Complex NaN test / 462 \\
                 15.23: Summary / 463 \\
                 16: Quadratic equations / 465 \\
                 16.1: Solving quadratic equations / 465 \\
                 16.2: Root sensitivity / 471 \\
                 16.3: Testing a quadratic-equation solver / 472 \\
                 16.4: Summary / 474 \\
                 17: Elementary functions in complex arithmetic / 475
                 \\
                 17.1: Research on complex elementary functions / 475
                 \\
                 17.2: Principal values / 476 \\
                 17.3: Branch cuts / 476 \\
                 17.4: Software problems with negative zeros / 478 \\
                 17.5: Complex elementary function tree / 479 \\
                 17.6: Series for complex functions / 479 \\
                 17.7: Complex square root / 480 \\
                 17.8: Complex cube root / 485 \\
                 17.9: Complex exponential / 487 \\
                 17.10: Complex exponential near zero / 492 \\
                 17.11: Complex logarithm / 495 \\
                 17.12: Complex logarithm near one / 497 \\
                 17.13: Complex power / 500 \\
                 17.14: Complex trigonometric functions / 502 \\
                 17.15: Complex inverse trigonometric functions / 504
                 \\
                 17.16: Complex hyperbolic functions / 509 \\
                 17.17: Complex inverse hyperbolic functions / 514 \\
                 17.18: Summary / 520 \\
                 18: The Greek functions: gamma, psi, and zeta / 521 \\
                 18.1: Gamma and log-gamma functions / 521 \\
                 18.2: The {\tt psi} and {\tt psiln} functions / 536 \\
                 18.3: Polygamma functions / 547 \\
                 18.4: Incomplete gamma functions / 560 \\
                 18.5: A Swiss diversion: Bernoulli and Euler / 568 \\
                 18.6: An Italian excursion: Fibonacci numbers / 575 \\
                 18.7: A German gem: the Riemann zeta function / 579 \\
                 18.8: Further reading / 590 \\
                 18.9: Summary / 591 \\
                 19: Error and probability functions / 593 \\
                 19.1: Error functions / 593 \\
                 19.2: Scaled complementary error function / 598 \\
                 19.3: Inverse error functions / 600 \\
                 19.4: Normal distribution functions and inverses / 610
                 \\
                 19.5: Summary / 617 \\
                 20: Elliptic integral functions / 619 \\
                 20.1: The arithmetic-geometric mean / 619 \\
                 20.2: Elliptic integral functions of the first kind /
                 624 \\
                 20.3: Elliptic integral functions of the second kind /
                 627 \\
                 20.4: Elliptic integral functions of the third kind /
                 630 \\
                 20.5: Computing $K(m)$ and $K'(m)$ / 631 \\
                 20.6: Computing $E(m)$ and $E'(m)$ / 637 \\
                 20.7: Historical algorithms for elliptic integrals /
                 643 \\
                 20.8: Auxiliary functions for elliptic integrals / 645
                 \\
                 20.9: Computing the elliptic auxiliary functions / 648
                 \\
                 20.10: Historical elliptic functions / 650 \\
                 20.11: Elliptic functions in software / 652 \\
                 20.12: Applications of elliptic auxiliary functions /
                 653 \\
                 20.13: Elementary functions from elliptic auxiliary
                 functions / 654 \\
                 20.14: Computing elementary functions via $R_C(x,y)$ /
                 655 \\
                 20.15: Jacobian elliptic functions / 657 \\
                 20.16: Inverses of Jacobian elliptic functions / 664
                 \\
                 20.17: The modulus and the nome / 668 \\
                 20.18: Jacobian theta functions / 673 \\
                 20.19: Logarithmic derivatives of the Jacobian theta
                 functions / 675 \\
                 20.20: Neville theta functions / 678 \\
                 20.21: Jacobian Eta, Theta, and Zeta functions / 679
                 \\
                 20.22: Weierstrass elliptic functions / 682 \\
                 20.23: Weierstrass functions by duplication / 689 \\
                 20.24: Complete elliptic functions, revisited / 690 \\
                 20.25: Summary / 691 \\
                 21: Bessel functions / 693 \\
                 21.1: Cylindrical Bessel functions / 694 \\
                 21.2: Behavior of $J_n(x)$ and $Y_n(x)$ / 695 \\
                 21.3: Properties of $J_n(z)$ and $Y_n(z)$ / 697 \\
                 21.4: Experiments with recurrences for $J_0(x)$ / 705
                 \\
                 21.5: Computing $J_0(x)$ and $J_1(x)$ / 707 \\
                 21.6: Computing $J_n(x)$ / 710 \\
                 21.7: Computing $Y_0(x)$ and $Y_1(x)$ / 713 \\
                 21.8: Computing $Y_n(x)$ / 715 \\
                 21.9: Improving Bessel code near zeros / 716 \\
                 21.10: Properties of $I_n(z)$ and $K_n(z)$ / 718 \\
                 21.11: Computing $I_0(x)$ and $I_1(x)$ / 724 \\
                 21.12: Computing $K_0(x)$ and $K_1(x)$ / 726 \\
                 21.13: Computing $I_n(x)$ and $K_n(x)$ / 728 \\
                 21.14: Properties of spherical Bessel functions / 731
                 \\
                 21.15: Computing $j_n(x)$ and $y_n(x)$ / 735 \\
                 21.16: Improving $j_1(x)$ and $y_1(x)$ / 740 \\
                 21.17: Modified spherical Bessel functions / 743 \\
                 21.18: Software for Bessel-function sequences / 755 \\
                 21.19: Retrospective on Bessel functions / 761 \\
                 22: Testing the library / 763 \\
                 22.1: Testing {\tt tgamma} and {\tt lgamma} / 765 \\
                 22.2: Testing {\tt psi} and {\tt psiln} / 768 \\
                 22.3: Testing {\tt erf} and {\tt erfc} / 768 \\
                 22.4: Testing cylindrical Bessel functions / 769 \\
                 22.5: Testing exponent/\penalty \exhyphenpenalty
                 significand manipulation / 769 \\
                 22.6: Testing inline assembly code / 769 \\
                 22.7: Testing with Maple / 770 \\
                 22.8: Testing floating-point arithmetic / 773 \\
                 22.9: The Berkeley Elementary Functions Test Suite /
                 774 \\
                 22.10: The AT\&T floating-point test package / 775 \\
                 22.11: The Antwerp test suite / 776 \\
                 22.12: Summary / 776 \\
                 23: Pair-precision elementary functions / 777 \\
                 23.1: Pair-precision integer power / 777 \\
                 23.2: Pair-precision machine epsilon / 779 \\
                 23.3: Pair-precision exponential / 780 \\
                 23.4: Pair-precision logarithm / 787 \\
                 23.5: Pair-precision logarithm near one / 793 \\
                 23.6: Pair-precision exponential near zero / 793 \\
                 23.7: Pair-precision base-$n$ exponentials / 795 \\
                 23.8: Pair-precision trigonometric functions / 796 \\
                 23.9: Pair-precision inverse trigonometric functions /
                 801 \\
                 23.10: Pair-precision hyperbolic functions / 804 \\
                 23.11: Pair-precision inverse hyperbolic functions /
                 808 \\
                 23.12: Summary / 808 \\
                 24: Accuracy of the Cody\slash Waite algorithms / 811
                 \\
                 25: Improving upon the Cody\slash Waite algorithms /
                 823 \\
                 25.1: The Bell Labs libraries / 823 \\
                 25.2: The {Cephes} library / 823 \\
                 25.3: The {Sun} libraries / 824 \\
                 25.4: Mathematical functions on EPIC / 824 \\
                 25.5: The GNU libraries / 825 \\
                 25.6: The French libraries / 825 \\
                 25.7: The NIST effort / 826 \\
                 25.8: Commercial mathematical libraries / 826 \\
                 25.9: Mathematical libraries for decimal arithmetic /
                 826 \\
                 25.10: Mathematical library research publications / 826
                 \\
                 25.11: Books on computing mathematical functions / 827
                 \\
                 25.12: Summary / 828 \\
                 26: Floating-point output / 829 \\
                 26.1: Output character string design issues / 830 \\
                 26.2: Exact output conversion / 831 \\
                 26.3: Hexadecimal floating-point output / 832 \\
                 26.4: Octal floating-point output / 850 \\
                 26.5: Binary floating-point output / 851 \\
                 26.6: Decimal floating-point output / 851 \\
                 26.7: Accuracy of output conversion / 865 \\
                 26.8: Output conversion to a general base / 865 \\
                 26.9: Output conversion of Infinity / 866 \\
                 26.10: Output conversion of NaN / 866 \\
                 26.11: Number-to-string conversion / 867 \\
                 26.12: The {\tt printf} family / 867 \\
                 26.13: Summary / 878 \\
                 27: Floating-point input / 879 \\
                 27.1: Binary floating-point input / 879 \\
                 27.2: Octal floating-point input / 894 \\
                 27.3: Hexadecimal floating-point input / 895 \\
                 27.4: Decimal floating-point input / 895 \\
                 27.5: Based-number input / 899 \\
                 27.6: General floating-point input / 900 \\
                 27.7: The {\tt scanf} family / 901 \\
                 27.8: Summary / 910 \\
                 A: Ada interface / 911 \\
                 A.1: Building the Ada interface / 911 \\
                 A.2: Programming the Ada interface / 912 \\
                 A.3: Using the Ada interface / 915 \\
                 B: C\# interface / 917 \\
                 B.1: C\# on the CLI virtual machine / 917 \\
                 B.2: Building the C\# interface / 918 \\
                 B.3: Programming the C\# interface / 920 \\
                 B.4: Using the C\# interface / 922 \\
                 C: C++ interface / 923 \\
                 C.1: Building the C++ interface / 923 \\
                 C.2: Programming the C++ interface / 924 \\
                 C.3: Using the C++ interface / 925 \\
                 D: Decimal arithmetic / 927 \\
                 D.1: Why we need decimal floating-point arithmetic /
                 927 \\
                 D.2: Decimal floating-point arithmetic design issues /
                 928 \\
                 D.3: How decimal and binary arithmetic differ / 931 \\
                 D.4: Initialization of decimal floating-point storage /
                 935 \\
                 D.5: The {\tt <decfloat.h>} header file / 936 \\
                 D.6: Rounding in decimal arithmetic / 936 \\
                 D.7: Exact scaling in decimal arithmetic / 937 \\
                 E: Errata in the Cody\slash Waite book / 939 \\
                 F: Fortran interface / 941 \\
                 F.1: Building the Fortran interface / 943 \\
                 F.2: Programming the Fortran interface / 944 \\
                 F.3: Using the Fortran interface / 945 \\
                 H: Historical floating-point architectures / 947 \\
                 H.1: CDC family / 949 \\
                 H.2: Cray family / 952 \\
                 H.3: DEC PDP-10 / 953 \\
                 H.4: DEC PDP-11 and VAX / 956 \\
                 H.5: General Electric 600 series / 958 \\
                 H.6: IBM family / 959 \\
                 H.7: Lawrence Livermore S-1 Mark IIA / 965 \\
                 H.8: Unusual floating-point systems / 966 \\
                 H.9: Historical retrospective / 967 \\
                 I: Integer arithmetic / 969 \\
                 I.1: Memory addressing and integers / 971 \\
                 I.2: Representations of signed integers / 971 \\
                 I.3: Parity testing / 975 \\
                 I.4: Sign testing / 975 \\
                 I.5: Arithmetic exceptions / 975 \\
                 I.6: Notations for binary numbers / 977 \\
                 I.7: Summary / 978 \\
                 J: Java interface / 979 \\
                 J.1: Building the Java interface / 979 \\
                 J.2: Programming the Java MathCW class / 980 \\
                 J.3: Programming the Java C interface / 982 \\
                 J.4: Using the Java interface / 985 \\
                 L: Letter notation / 987 \\
                 P: Pascal interface / 989 \\
                 P.1: Building the Pascal interface / 989 \\
                 P.2: Programming the Pascal MathCW module / 990 \\
                 P.3: Using the Pascal module interface / 993 \\
                 P.4: Pascal and numeric programming / 994 \\
                 Bibliography / 995 \\
                 Author/editor index / 1039 \\
                 Function and macro index / 1049 \\
                 Subject index / 1065 \\
                 Colophon / 1115",
}


bibtype: article
filename: master.bib
label: Beebe:dvi-drivers
author: Nelson H. F. Beebe
title: A TeX DVI Driver Family
journal: j-TEXNIQUES
volume: 5
pages: 71--114
month: aug
monthnumber: 8
year: 1987
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
note: Proceedings of the Eighth Annual Meeting of the TeX Users Group
acknowledgement: ack-nhfb
rawauthor: Nelson H. F. Beebe
rawnote: Proceedings of the Eighth Annual Meeting of the \TeX{} Users Group
rawtitle: A {{\TeX DVI}} Driver Family
ORCID: Beebe, Nelson H. F./0000-0001-7281-4263
entry:
@Article{Beebe:dvi-drivers,
  author =       "Nelson H. F. Beebe",
  title =        "A {{\TeX DVI}} Driver Family",
  journal =      j-TEXNIQUES,
  volume =       "5",
  pages =        "71--114",
  month =        aug,
  year =         "1987",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Proceedings of the Eighth Annual Meeting of the \TeX{}
                 Users Group",
  acknowledgement = ack-nhfb,
  ORCID-numbers = "Beebe, Nelson H. F./0000-0001-7281-4263",
}


bibtype: techreport
filename: master.bib
label: Beebe:plot79
author: Nelson H. F. Beebe
title: A User's Guide to PLOT
institution: University of Utah
pages: 71--114
year: 1980
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: Nelson H. F. Beebe
rawtitle: A User's Guide to {\PLOT}
ORCID: Beebe, Nelson H. F./0000-0001-7281-4263
entry:
@TechReport{Beebe:plot79,
  author =       "Nelson H. F. Beebe",
  title =        "A User's Guide to {\PLOT}",
  institution =  "University of Utah",
  year =         "1980",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  ORCID-numbers = "Beebe, Nelson H. F./0000-0001-7281-4263",
}


bibtype: article
filename: master.bib
label: Beebe:plot79-biomed
author: Nelson H. F. Beebe and R. P. C. Rodgers
journal: j-CBM
volume: 19
number: 6
pages: 385--402
year: 1989
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: Nelson H. F. Beebe and R. P. C. Rodgers
ORCID: Beebe, Nelson H. F./0000-0001-7281-4263
title:
PLOT : a comprehensive portable Fortran scientific line graphics system, as applied to biomedical research

rawtitle:
{\PLOT}: a comprehensive portable {Fortran} scientific line graphics system, as applied to biomedical research

entry:
@Article{Beebe:plot79-biomed,
  author =       "Nelson H. F. Beebe and R. P. C. Rodgers",
  title =        "{\PLOT}: a comprehensive portable {Fortran} scientific
                 line graphics system, as applied to biomedical
                 research",
  journal =      j-CBM,
  volume =       "19",
  number =       "6",
  pages =        "385--402",
  year =         "1989",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  ORCID-numbers = "Beebe, Nelson H. F./0000-0001-7281-4263",
}


bibtype: manual
filename: master.bib
label: Beebe:sf3-installation
author: Nelson H. F. Beebe
title: SFTRAN 3 Installation Guide
organization: pub-CLSC
address: pub-CLSC:adr
pages: 385--402
month: jul
monthnumber: 7
year: 1979
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: Nelson H. F. Beebe
rawtitle: {SFTRAN} 3 Installation Guide
ORCID: Beebe, Nelson H. F./0000-0001-7281-4263
entry:
@Manual{Beebe:sf3-installation,
  author =       "Nelson H. F. Beebe",
  title =        "{SFTRAN} 3 Installation Guide",
  organization = pub-CLSC,
  address =      pub-CLSC:adr,
  month =        jul,
  year =         "1979",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  ORCID-numbers = "Beebe, Nelson H. F./0000-0001-7281-4263",
}


bibtype: article
filename: master.bib
label: Beebe:tex-graphics
author: Nelson H. F. Beebe
title: TeX and Graphics: The State of the Problem
journal: j-GUTENBERG
volume: 2
pages: 13--53
year: 1989
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
note: Presented to: Congres GUTenberg, Paris, France, 16--17 May 1989
acknowledgement: ack-nhfb
rawauthor: Nelson H. F. Beebe
rawnote: Presented to: Congr{\`e}s GUTenberg, Paris, France, 16--17 May 1989
rawtitle: {\TeX{}} and Graphics: The State of the Problem
ORCID: Beebe, Nelson H. F./0000-0001-7281-4263
entry:
@Article{Beebe:tex-graphics,
  author =       "Nelson H. F. Beebe",
  title =        "{\TeX{}} and Graphics: The State of the Problem",
  journal =      j-GUTENBERG,
  volume =       "2",
  pages =        "13--53",
  year =         "1989",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Presented to: Congr{\`e}s GUTenberg, Paris, France,
                 16--17 May 1989",
  acknowledgement = ack-nhfb,
  ORCID-numbers = "Beebe, Nelson H. F./0000-0001-7281-4263",
}


bibtype: book
filename: master.bib
label: Belcher:1960:QIA
author: Ronald Belcher and A. J. Nutten
title: Quantitative Inorganic Analysis
publisher: Butterworths Scientific Publications
address: London, England
edition: Second
pages: x + 390
year: 1960
LCCN: QD45 .B45 1960
bibdate: Sat Jul 25 13:55:27 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.07.25 13:55:27 ???
acknowledgement: ack-nhfb
rawauthor: Ronald Belcher and A. J. Nutten
rawtitle: Quantitative Inorganic Analysis
entry:
@Book{Belcher:1960:QIA,
  author =       "Ronald Belcher and A. J. Nutten",
  title =        "Quantitative Inorganic Analysis",
  publisher =    "Butterworths Scientific Publications",
  address =      "London, England",
  edition =      "Second",
  pages =        "x + 390",
  year =         "1960",
  LCCN =         "QD45 .B45 1960",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Bell:1937:MML
author: Eric Temple Bell
title: Men of mathematics: The Lives and Achievements of the Great Mathematicians from Zeno to Poincare
publisher: pub-SIMON-SCHUSTER
address: pub-SIMON-SCHUSTER:adr
pages: xxi + 592
year: 1937
ISBN: 0-671-62818-6 OR 0671628186
ISBN13: 978-0-671-62818-5 OR 9780671628185
LCCN: QA28 .B4
bibdate: Mon Mar 06 08:47:02 2000
bibtimestamp: 2000.03.06 08:47:02 ???
acknowledgement: ack-nhfb
rawauthor: Eric Temple Bell
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/i/infeld-leopold.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

TOC:
1. Introduction / 3 For the reader's comfort. The beginning of modern mathematics. Are mathematicians human? Witless parodies. Illimitable scope of mathematical evolution. Pioneers and scouts. A clue through the maze. Continuity and discreteness. Remarkable rarity of common sense. Vivid mathematics or vague mysticism? Four great ages of mathematics. Our own the Golden Age. 2. Modern Minds in Ancient Bodies / 19 Zeno (fifth century B.C.), Eudoxus (408--355 B.C.), Archimedes (287?--212 B.C.) Modern ancients and ancient moderns. Pythagoras, great mystic, greater mathematician. Proof or intuition? The taproot of modern analysis. A bumpkin upsets the philosophers. Zeno's unresolved riddles. Plato's needy young friend. Inexhaustible exhaustion. The useful conics. Archimedes, aristocrat, greatest scientist of antiquity. Legends of his life and personality. His discoveries and claim to modernity. A sturdy Roman. Defeat of Archimedes and triumph of Rome. 3. Gentleman, Soldier, and Mathematician / 35 Descartes (1596--1650) The good old days. A child philosopher but no prig. Inestimable advantages of lying in bed. Invigorating doubts. Peace in war. Converted by a nightmare. Revelation of analytic geometry. More butchering. Circuses, professional jealousy, swashbuckling, accommodating lady friends. Distaste for hell-fire and respect for the Church. Saved by a brace of cardinals. A Pope brains himself. Twenty years a recluse. The Method. Betrayed by fame. Doting Elisabeth. What Descartes really thought of her. Conceited Christine. What she did to Descartes. Creative simplicity of Ms geometry. 4. The Prince of Amateurs / 56 Fermat (1601--1665) Greatest mathematician of the seventeenth century. Fermat's busy, practical life. Mathematics his hobby. His flick to the calculus. His profound physical principle. Analytic geometry again. Arithmetica and logistica. Fermat's supremacy in arithmetic. An unsolved problem on primes. Why are some theorems ``important''? An intelligence test. ``Infinite descent.'' Fermat's unanswered challenge to posterity. 5. ``Greatness and Misery of Man'' / 73 Pascal (1625--1662) An infant prodigy buries his talent. At seventeen a great geometer. Pascal's wonderful theorem. Vile health and religious inebriety. The first calculating Frankenstein. Pascal's brilliance in physics. Holy sister Jacqueline, soul-saver. Wine and women? ``Get thee to a nunnery.!'' Converted on a spree. Literature prostituted to bigotry. The Helen of Geometry. A celestial toothache. What the post-mortem revealed. A gambler makes mathematical history. Scope of the theory of probability. Pascal creates the theory with Fermat. Folly of betting against God or the Devil. 6. On the Seashore / 90 Newton (1642--1727) Newton's estimate of himself. An uncertified youthful genius. Chaos of his times. On the shoulders of giants. His one attachment. Cambridge days. Young Newton masters futility of suffering fools gladly. The Great Plague a greater blessing. Immortal at twenty four (or less). The calculus. Newton unsurpassed in pure mathematics, supreme in natural philosophy. Gnats, hornets, and exasperation. The Principia. Samuel Pepys and other fussers. The flattest anticlimax in history. Controversy, theology, chronology, alchemy, public office, death. 7. Master of All Trades / 117 Leibniz (1646--1716) Two superb contributions. A politician's offspring. Genius at fifteen. Seduced by the law. The ``universal characteristic.'' Symbolic reasoning. Sold out to ambition. A master diplomat. Diplomacy being what it is, the diplomatic exploits of the master are left to the historians. Fox into historian, statesman into mathematician. Applied ethics. Existence of God. Optimism. Forty years of futility. Discarded like a dirty rag. 8. Nature or Nurture? / 131 The Bernoullis (seventeenth-and eighteenth centuries) Eight mathematicians in three generations. Clinical evidence for heredity. The calculus of variations. 9. Analysis Incarnate / 139 Euler (1707--1783) The most prolific mathematician in history. Snatched from theology. Rulers foot the bills. Practicality of the unpractical. Celestial mechanics and naval warfare. A mathematician by chance and foreordination. Trapped in St. Petersburg. The virtues of silence. Half blind in his morning. Flight to liberal Prussia. Generosity and boorishness of Frederick the Great. Return to hospitable Russia. Generosity and graciousness of Catherine the Great. Total blindness at noon. Master and inspirer of masters for a century. 10. A Lofty Pyramid / 153 Lagrange (1736--1813) Greatest and most modest mathematician of the eighteenth century. Financial ruin his opportunity. Conceives his masterpiece at nineteen. Magnanimity of Euler. Turin, to Paris, to Berlin: a grateful bastard aids a genius. Conquests in celestial mechanics. Frederick the Great condescends. Absent-minded marriage. Work as a vice. A classic in arithmetic. The Mecanique analytique a living masterpiece. A landmark in the theory of equations. Welcomed in Paris by Marie Antoinette. Nervous exhaustion, melancholia, and universal disgust in middle life. Reawakened by the French Revolution and a young girl. What Lagrange thought of the Revolution. The metric system. What the revolutionists thought of Lagrange. How a philosopher dies. 11. From Peasant to Snob / 172 Laplace (1749--1827) Humble as Lincoln, proud as Lucifer. A chilly reception and a warm welcome. Laplace grandiosely attacks the solar system. The Mecanique celeste. His estimate of himself. What others have thought of him. The ``potential'' fundamental in physics. Laplace in the French Revolution. Intimacy with Napoleon. Laplace's political realism superior to Napoleon's. 12. Friends of an Emperor / 183 Monge (1746--1818), Fourier (1768--1830) A knife grinder's son and a tailor's boy help Napoleon to upset the aristocrats' applecart. Comic opera in Egypt. Monge's descriptive geometry and the Machine Age. Fourier's analysis and modern physics. Imbecility of trusting in princes or proletarians. Boring to death and bored to death. 13. The Day of Glory / 206 Poncelet (1788--1867) Resurrected from a Napoleonic shambles. The path of glory leads to jail. Wintering in Russia in 1812. What genius does in prison. Two years of geometry in hell. The rewards of genius: stupidities of routine. Poncelet's projective geometry. Principles of continuity and duality. 14. The Prince of Mathematicians / 218 Gauss (1777--1855) Gauss the mathematical peer of Archimedes and Newton. Humble origin. Paternal brutality. Unequalled intellectual precocity. His chance, at ten. By twelve he dreams revolutionary discoveries, by eighteen achieves them. The Disquisitiones Arithmeticae. Other epochal works summarized. The Ceres disaster. Napoleon, indirectly robbing Gauss, takes second best. Fundamental advances in all branches of mathematics due to Gauss too numerous for citation: see the account given. A sage of sages. Unwelcome death. 15. Mathematics and Windmills / 270 Cauchy (1789--1857) Change in nature of mathematics with nineteenth century. Childhood in the French Revolution. Cauchy's early miseducation. Lagrange's prophecy. The young Christian engineer. Prophetic acuteness of Malus. The theory of groups. In the front rank at twenty seven. One of Fermat's enigmas solved. The pious hippopotamus. Butted by Charles the Goat. Memoirs on astronomy and mathematical physics. Sweetness and obstinacy invincible. The French Government makes a fool of itself. Cauchy's place in mathematics. Drawbacks of an irreproachable character. 16. The Copernicus of Geometry / 294 Lobatchewsky (1793--1856) The widow's mite. Kazan. Appointed professor and spy. Universal ability. Lobatchewsky as an administrator. Reason and incense combat the cholera. Russian gratitude. Humiliated in his prime. Blind as Milton, Lobatchewsky dictates his masterpiece. His advance beyond Euclid. Non--Euclidean geometry. A Copernicus of the intellect. 17. Genius and Poverty / 307 Abel ( 1802--1829) Norway in 1802. Smothered by clerical fecundity. Abel's awakening. Generosity of a teacher. A pupil of the masters. His lucky blunder. Abel and the quintic. The Government to the rescue. Abel's grand tour of mathematical Europe not so grand. French civility and German cordiality. Crelle and his Journal. Cauchy's unpardonable sin. ``Abel's Theorem.'' Something to keep mathematicians 500 years. Crowning a corpse. 18. The Great Algorist / 327 Jacobi (1804--1851) Galvanoplastics versus mathematics. Born rich. Jacobi's philological ability. Dedicates himself to mathematics. Early work. Cleaned out. A goose among foxes. Hard times. Elliptic functions. Their place in the general development. Inversion. Work in arithmetic, dynamics, algebra, and Abelian functions. Fourier's pontification. Jacobi's retort. 19. An Irish Tragedy / 340 Hamilton (1805--1865) Ireland's greatest. Elaborate miseducation. Discoveries at seventeen. A unique university career. Disappointed in love. Hamilton and the poets. Appointed at Dunsink. Systems of rays. The Principia of optics. Prediction of conical refraction. Marriage and alcohol. Fields. Complex numbers. The commutative law repealed. Quaternions. Mountains of paper. 20. Genius and Stupidity / 3662 Galois (1811--1832) An all-time world record in stupidity. Galois' childhood. The pedagogues surpass themselves, At sixteen Galois repeats Abel's mistake. Politics and education. Examinations as arbiters of genius. Hounded to death by a priest. More academic ineptitude. Absent-minded Cauchy again. Driven to rebellion. A master mathematician at nineteen. ``A carcase to stir up the people.'' The foulest sewer in Paris. Patriots rush to the field of honor. Galois' last night. The riddle of equations solved. Buried like a dog. 21. Invariant Twins / 378 Sylvester (1814--1807); Cayley (1821--1895) Cayley's contributions. Early life. Cambridge. Recreations. Called to the Bar. Fourteen years in the law. Cayley meets his collaborator. Sylvester's stormier life. Hamstrung by religion. Cayley and Sylvester contrasted. Sylvester's mission to the Virginians. Further false steps. The theory of invariants. Called to Johns Hopkins University. Inextinguishable vitality. ``Rosalind.'' Cayley's unification of geometry. Space of $n$ dimensions. Matrices. Oxford endorses Sylvester. Respectable at last. 22. Master and Pupil / 406 Weierstrass (1815--1897); Sonja Kowalewski (1850--1891) The father of modern analysis. Relations of Weierstrass to his contemporaries. The penalties of brilliance. Forced into law, forces himself out. Beer and broadswords. A fresh start. Debt to Gudermann. Fifteen years in the mud. Miraculous extrication. Weierstrass' life problem. Too much success. Sonja storms the master. His favorite pupil. Their friendship. A woman's gratitude. Repenting, Sonja wins Paris prize. Weierstrass universally honored. Power series. Arithmetization of analysis. Doubts. 23. Complete Independence / 433 Boole (1815--1864) British mathematics. Damned at birth by snobbery. Boole's struggle for education. False diagnoses. Providence intervenes. Discovery of invariants. What is algebra? A philosopher attacks a mathematician. Frightful carnage. Boole's chance. ``The Laws of Thought.'' Symbolic logic. Its mathematical significance. Boolean algebra. Dead in his prime. 24. The Man, Not the Method / 448 Hermite (1822--1901) Old problems and new methods. Hermite's masterful mother. His detestation of examinations. Instructs himself. Higher mathematics sometimes easier than elementary. Educational disasters. Letters to Jacobi. A master at twenty one. Revenge on his examiners. Abelian functions. Pestered by Cauchy. Hermite's mysticism. Solution of the general quintic. Transcendental numbers. A hint to circle-squarers. Hermite's internationalism. 25. The Doubter / 466 Kronecker (1823--1891) Legend of an American saint. Lucky Kronecker. School triumphs. Great gifts. Algebraic numbers. Battles with Weierstrass. Kronecker's business career. Returns rich to mathematics. The Galois theory. Kronecker's lectures. His skepticism his most original contribution. 26. Anima Candida / 484 Riemann (1826--1866) Poor but happy. Riemann's chronic shyness. Destined for the church. Saved. A famous hypothesis. Career at Gottingen. ``A new mathematic.'' Physical researches. Application of topology to analysis. Epoch-making essay on foundations of geometry. Gauss enthusiastic. The. blessings of poverty. A root of tensor analysis. Quest for health. Under a fig tree. Riemann's landmark in geometry. Curvature of space. Pathbreaking for relativity. 27. Arithmetic the Second / 510 Kummer (1810--1893), Dedekind (1831--1916) Aged in the wood. Napoleonic warp to Kummer's geniality. Equally gifted in the abstract and the concrete. What Fermat's Last Theorem started. Theory of ideal numbers. Kummer's invention comparable to Lobatchewsky's. Wave surface in four dimensions. Big of body, mind, and heart. Dedekind, last pupil of Gauss. First expositor of Galois. Early interest in science. Turns to mathematics. Dedekind's work on continuity. His creation of the theory of ideals. 28. The Last Universalist / 526 Poincare (1854--1912) Poincare's universality and methods. Childhood setbacks. Seized by mathematics. Keeps his sanity in Franco--Prussian war. Starts as mining engineer. First great work. Automorphic functions. ``The keys of the algebraic cosmos.'' The problem of n bodies. Is Finland civilized? Poincare's new methods in celestial mechanics. Cosmogony. How mathematical discoveries are made. Poincare's account. Forebodings and premature death. 29. Paradise Lost? / 555 Cantor (1845--1918) Old foes with new faces. Rotting creeds. Cantor's artistic inheritance and father-fixation. Escape, but too late. His revolutionary work gets him nowhere. Academic pettiness. Disastrous consequences of ``safety first.'' An epochal result. Paradox or truth? Infinite existence of transcendentals. Aggressiveness advances, timidity retires. Further spectacular claims. Two types of mathematicians. Insane? counter-revolution. The battle grows fiercer. Cursing the enemy. Universal loss of temper. Where stands mathematics today? And where will it stand tomorrow? Invictus. Index / 581

rawtitle:
Men of mathematics: The Lives and Achievements of the Great Mathematicians from {Zeno} to {Poincar{\'e}}

rawTOC:
1. Introduction / 3 \\ For the reader's comfort. The beginning of modern mathematics. Are mathematicians human? Witless parodies. Illimitable scope of mathematical evolution. Pioneers and scouts. A clue through the maze. Continuity and discreteness. Remarkable rarity of common sense. Vivid mathematics or vague mysticism? Four great ages of mathematics. Our own the Golden Age. \\ \\ 2. Modern Minds in Ancient Bodies / 19 \\ Zeno (fifth century B.C.), Eudoxus (408--355 B.C.), Archimedes (287?--212 B.C.) \\ Modern ancients and ancient moderns. Pythagoras, great mystic, greater mathematician. Proof or intuition? The taproot of modern analysis. A bumpkin upsets the philosophers. Zeno's unresolved riddles. Plato's needy young friend. Inexhaustible exhaustion. The useful conics. Archimedes, aristocrat, greatest scientist of antiquity. Legends of his life and personality. His discoveries and claim to modernity. A sturdy Roman. Defeat of Archimedes and triumph of Rome. \\ \\ 3. Gentleman, Soldier, and Mathematician / 35 \\ Descartes (1596--1650) \\ The good old days. A child philosopher but no prig. Inestimable advantages of lying in bed. Invigorating doubts. Peace in war. Converted by a nightmare. Revelation of analytic geometry. More butchering. Circuses, professional jealousy, swashbuckling, accommodating lady friends. Distaste for hell-fire and respect for the Church. Saved by a brace of cardinals. A Pope brains himself. Twenty years a recluse. The Method. Betrayed by fame. Doting Elisabeth. What Descartes really thought of her. Conceited Christine. What she did to Descartes. Creative simplicity of Ms geometry. \\ \\ 4. The Prince of Amateurs / 56 \\ Fermat (1601--1665) \\ Greatest mathematician of the seventeenth century. Fermat's busy, practical life. Mathematics his hobby. His flick to the calculus. His profound physical principle. Analytic geometry again. Arithmetica and logistica. Fermat's supremacy in arithmetic. An unsolved problem on primes. Why are some theorems ``important''? An intelligence test. ``Infinite descent.'' Fermat's unanswered challenge to posterity. \\ \\ 5. ``Greatness and Misery of Man'' / 73 \\ Pascal (1625--1662) \\ An infant prodigy buries his talent. At seventeen a great geometer. Pascal's wonderful theorem. Vile health and religious inebriety. The first calculating Frankenstein. Pascal's brilliance in physics. Holy sister Jacqueline, soul-saver. Wine and women? ``Get thee to a nunnery.!'' Converted on a spree. Literature prostituted to bigotry. The Helen of Geometry. A celestial toothache. What the post-mortem revealed. A gambler makes mathematical history. Scope of the theory of probability. Pascal creates the theory with Fermat. Folly of betting against God or the Devil. \\ \\ 6. On the Seashore / 90 \\ Newton (1642--1727) \\ Newton's estimate of himself. An uncertified youthful genius. Chaos of his times. On the shoulders of giants. His one attachment. Cambridge days. Young Newton masters futility of suffering fools gladly. The Great Plague a greater blessing. Immortal at twenty four (or less). The calculus. Newton unsurpassed in pure mathematics, supreme in natural philosophy. Gnats, hornets, and exasperation. The Principia. Samuel Pepys and other fussers. The flattest anticlimax in history. Controversy, theology, chronology, alchemy, public office, death. \\ \\ 7. Master of All Trades / 117 \\ Leibniz (1646--1716) \\ Two superb contributions. A politician's offspring. Genius at fifteen. Seduced by the law. The ``universal characteristic.'' Symbolic reasoning. Sold out to ambition. A master diplomat. Diplomacy being what it is, the diplomatic exploits of the master are left to the historians. Fox into historian, statesman into mathematician. Applied ethics. Existence of God. Optimism. Forty years of futility. Discarded like a dirty rag. \\ \\ 8. Nature or Nurture? / 131 \\ The Bernoullis (seventeenth-and eighteenth centuries) \\ Eight mathematicians in three generations. Clinical evidence for heredity. The calculus of variations. \\ \\ 9. Analysis Incarnate / 139 \\ Euler (1707--1783) \\ The most prolific mathematician in history. Snatched from theology. Rulers foot the bills. Practicality of the unpractical. Celestial mechanics and naval warfare. A mathematician by chance and foreordination. Trapped in St. Petersburg. The virtues of silence. Half blind in his morning. Flight to liberal Prussia. Generosity and boorishness of Frederick the Great. Return to hospitable Russia. Generosity and graciousness of Catherine the Great. Total blindness at noon. Master and inspirer of masters for a century. \\ \\ 10. A Lofty Pyramid / 153 \\ Lagrange (1736--1813) \\ Greatest and most modest mathematician of the eighteenth century. Financial ruin his opportunity. Conceives his masterpiece at nineteen. Magnanimity of Euler. Turin, to Paris, to Berlin: a grateful bastard aids a genius. Conquests in celestial mechanics. Frederick the Great condescends. Absent-minded marriage. Work as a vice. A classic in arithmetic. The M{\'e}canique analytique a living masterpiece. A landmark in the theory of equations. Welcomed in Paris by Marie Antoinette. Nervous exhaustion, melancholia, and universal disgust in middle life. Reawakened by the French Revolution and a young girl. What Lagrange thought of the Revolution. The metric system. What the revolutionists thought of Lagrange. How a philosopher dies. \\ \\ 11. From Peasant to Snob / 172 \\ Laplace (1749--1827) \\ Humble as Lincoln, proud as Lucifer. A chilly reception and a warm welcome. Laplace grandiosely attacks the solar system. The M{\'e}canique c{\'e}leste. His estimate of himself. What others have thought of him. The ``potential'' fundamental in physics. Laplace in the French Revolution. Intimacy with Napoleon. Laplace's political realism superior to Napoleon's. \\ \\ 12. Friends of an Emperor / 183 \\ Monge (1746--1818), Fourier (1768--1830) \\ A knife grinder's son and a tailor's boy help Napoleon to upset the aristocrats' applecart. Comic opera in Egypt. Monge's descriptive geometry and the Machine Age. Fourier's analysis and modern physics. Imbecility of trusting in princes or proletarians. Boring to death and bored to death. \\ \\ 13. The Day of Glory / 206 \\ Poncelet (1788--1867) \\ Resurrected from a Napoleonic shambles. The path of glory leads to jail. Wintering in Russia in 1812. What genius does in prison. Two years of geometry in hell. The rewards of genius: stupidities of routine. Poncelet's projective geometry. Principles of continuity and duality. \\ \\ 14. The Prince of Mathematicians / 218 \\ Gauss (1777--1855) \\ Gauss the mathematical peer of Archimedes and Newton. Humble origin. Paternal brutality. Unequalled intellectual precocity. His chance, at ten. By twelve he dreams revolutionary discoveries, by eighteen achieves them. The Disquisitiones Arithmeticae. Other epochal works summarized. The Ceres disaster. Napoleon, indirectly robbing Gauss, takes second best. Fundamental advances in all branches of mathematics due to Gauss too numerous for citation: see the account given. A sage of sages. Unwelcome death. \\ \\ 15. Mathematics and Windmills / 270 \\ Cauchy (1789--1857) \\ Change in nature of mathematics with nineteenth century. Childhood in the French Revolution. Cauchy's early miseducation. Lagrange's prophecy. The young Christian engineer. Prophetic acuteness of Malus. The theory of groups. In the front rank at twenty seven. One of Fermat's enigmas solved. The pious hippopotamus. Butted by Charles the Goat. Memoirs on astronomy and mathematical physics. Sweetness and obstinacy invincible. The French Government makes a fool of itself. Cauchy's place in mathematics. Drawbacks of an irreproachable character. \\ \\ 16. The Copernicus of Geometry / 294 \\ Lobatchewsky (1793--1856) \\ The widow's mite. Kazan. Appointed professor and spy. Universal ability. Lobatchewsky as an administrator. Reason and incense combat the cholera. Russian gratitude. Humiliated in his prime. Blind as Milton, Lobatchewsky dictates his masterpiece. His advance beyond Euclid. Non--Euclidean geometry. A Copernicus of the intellect. \\ \\ 17. Genius and Poverty / 307 \\ Abel ( 1802--1829) \\ Norway in 1802. Smothered by clerical fecundity. Abel's awakening. Generosity of a teacher. A pupil of the masters. His lucky blunder. Abel and the quintic. The Government to the rescue. Abel's grand tour of mathematical Europe not so grand. French civility and German cordiality. Crelle and his Journal. Cauchy's unpardonable sin. ``Abel's Theorem.'' Something to keep mathematicians 500 years. Crowning a corpse. \\ \\ 18. The Great Algorist / 327 \\ Jacobi (1804--1851) \\ Galvanoplastics versus mathematics. Born rich. Jacobi's philological ability. Dedicates himself to mathematics. Early work. Cleaned out. A goose among foxes. Hard times. Elliptic functions. Their place in the general development. Inversion. Work in arithmetic, dynamics, algebra, and Abelian functions. Fourier's pontification. Jacobi's retort. \\ \\ 19. An Irish Tragedy / 340 \\ Hamilton (1805--1865) \\ Ireland's greatest. Elaborate miseducation. Discoveries at seventeen. A unique university career. Disappointed in love. Hamilton and the poets. Appointed at Dunsink. Systems of rays. The Principia of optics. Prediction of conical refraction. Marriage and alcohol. Fields. Complex numbers. The commutative law repealed. Quaternions. Mountains of paper. \\ \\ 20. Genius and Stupidity / 3662 \\ Galois (1811--1832) \\ An all-time world record in stupidity. Galois' childhood. The pedagogues surpass themselves, At sixteen Galois repeats Abel's mistake. Politics and education. Examinations as arbiters of genius. Hounded to death by a priest. More academic ineptitude. Absent-minded Cauchy again. Driven to rebellion. A master mathematician at nineteen. ``A carcase to stir up the people.'' The foulest sewer in Paris. Patriots rush to the field of honor. Galois' last night. The riddle of equations solved. Buried like a dog. \\ \\ 21. Invariant Twins / 378 \\ Sylvester (1814--1807); Cayley (1821--1895) \\ Cayley's contributions. Early life. Cambridge. Recreations. Called to the Bar. Fourteen years in the law. Cayley meets his collaborator. Sylvester's stormier life. Hamstrung by religion. Cayley and Sylvester contrasted. Sylvester's mission to the Virginians. Further false steps. The theory of invariants. Called to Johns Hopkins University. Inextinguishable vitality. ``Rosalind.'' Cayley's unification of geometry. Space of $n$ dimensions. Matrices. Oxford endorses Sylvester. Respectable at last. \\ \\ 22. Master and Pupil / 406 \\ Weierstrass (1815--1897); Sonja Kowalewski (1850--1891) \\ The father of modern analysis. Relations of Weierstrass to his contemporaries. The penalties of brilliance. Forced into law, forces himself out. Beer and broadswords. A fresh start. Debt to Gudermann. Fifteen years in the mud. Miraculous extrication. Weierstrass' life problem. Too much success. Sonja storms the master. His favorite pupil. Their friendship. A woman's gratitude. Repenting, Sonja wins Paris prize. Weierstrass universally honored. Power series. Arithmetization of analysis. Doubts. \\ \\ 23. Complete Independence / 433 \\ Boole (1815--1864) \\ British mathematics. Damned at birth by snobbery. Boole's struggle for education. False diagnoses. Providence intervenes. Discovery of invariants. What is algebra? A philosopher attacks a mathematician. Frightful carnage. Boole's chance. ``The Laws of Thought.'' Symbolic logic. Its mathematical significance. Boolean algebra. Dead in his prime. \\ \\ 24. The Man, Not the Method / 448 \\ Hermite (1822--1901) \\ Old problems and new methods. Hermite's masterful mother. His detestation of examinations. Instructs himself. Higher mathematics sometimes easier than elementary. Educational disasters. Letters to Jacobi. A master at twenty one. Revenge on his examiners. Abelian functions. Pestered by Cauchy. Hermite's mysticism. Solution of the general quintic. Transcendental numbers. A hint to circle-squarers. Hermite's internationalism. \\ \\ 25. The Doubter / 466 \\ Kronecker (1823--1891) \\ Legend of an American saint. Lucky Kronecker. School triumphs. Great gifts. Algebraic numbers. Battles with Weierstrass. Kronecker's business career. Returns rich to mathematics. The Galois theory. Kronecker's lectures. His skepticism his most original contribution. \\ \\ 26. Anima Candida / 484 \\ Riemann (1826--1866) \\ Poor but happy. Riemann's chronic shyness. Destined for the church. Saved. A famous hypothesis. Career at G{\"o}ttingen. ``A new mathematic.'' Physical researches. Application of topology to analysis. Epoch-making essay on foundations of geometry. Gauss enthusiastic. The. blessings of poverty. A root of tensor analysis. Quest for health. Under a fig tree. Riemann's landmark in geometry. Curvature of space. Pathbreaking for relativity. \\ \\ 27. Arithmetic the Second / 510 \\ Kummer (1810--1893), Dedekind (1831--1916) \\ Aged in the wood. Napoleonic warp to Kummer's geniality. Equally gifted in the abstract and the concrete. What Fermat's Last Theorem started. Theory of ideal numbers. Kummer's invention comparable to Lobatchewsky's. Wave surface in four dimensions. Big of body, mind, and heart. Dedekind, last pupil of Gauss. First expositor of Galois. Early interest in science. Turns to mathematics. Dedekind's work on continuity. His creation of the theory of ideals. \\ \\ 28. The Last Universalist / 526 \\ Poincar{\'e} (1854--1912) \\ Poincar{\'e}'s universality and methods. Childhood setbacks. Seized by mathematics. Keeps his sanity in Franco--Prussian war. Starts as mining engineer. First great work. Automorphic functions. ``The keys of the algebraic cosmos.'' The problem of n bodies. Is Finland civilized? Poincar{\'e}'s new methods in celestial mechanics. Cosmogony. How mathematical discoveries are made. Poincar{\'e}'s account. Forebodings and premature death. \\ \\ 29. Paradise Lost? / 555 \\ Cantor (1845--1918) \\ Old foes with new faces. Rotting creeds. Cantor's artistic inheritance and father-fixation. Escape, but too late. His revolutionary work gets him nowhere. Academic pettiness. Disastrous consequences of ``safety first.'' An epochal result. Paradox or truth? Infinite existence of transcendentals. Aggressiveness advances, timidity retires. Further spectacular claims. Two types of mathematicians. Insane? counter-revolution. The battle grows fiercer. Cursing the enemy. Universal loss of temper. Where stands mathematics today? And where will it stand tomorrow? Invictus. \\ \\ Index / 581

entry:
@Book{Bell:1937:MML,
  author =       "Eric Temple Bell",
  title =        "Men of mathematics: The Lives and Achievements of the
                 Great Mathematicians from {Zeno} to {Poincar{\'e}}",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "xxi + 592",
  year =         "1937",
  ISBN =         "0-671-62818-6",
  ISBN-13 =      "978-0-671-62818-5",
  LCCN =         "QA28 .B4",
  bibdate =      "Mon Mar 06 08:47:02 2000",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/i/infeld-leopold.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$17.00",
  acknowledgement = ack-nhfb,
  tableofcontents = "1. Introduction / 3 \\
                 For the reader's comfort. The beginning of modern
                 mathematics. Are mathematicians human? Witless
                 parodies. Illimitable scope of mathematical evolution.
                 Pioneers and scouts. A clue through the maze.
                 Continuity and discreteness. Remarkable rarity of
                 common sense. Vivid mathematics or vague mysticism?
                 Four great ages of mathematics. Our own the Golden Age.
                 \\
                 \\
                 2. Modern Minds in Ancient Bodies / 19 \\
                 Zeno (fifth century B.C.), Eudoxus (408--355 B.C.),
                 Archimedes (287?--212 B.C.) \\
                 Modern ancients and ancient moderns. Pythagoras, great
                 mystic, greater mathematician. Proof or intuition? The
                 taproot of modern analysis. A bumpkin upsets the
                 philosophers. Zeno's unresolved riddles. Plato's needy
                 young friend. Inexhaustible exhaustion. The useful
                 conics. Archimedes, aristocrat, greatest scientist of
                 antiquity. Legends of his life and personality. His
                 discoveries and claim to modernity. A sturdy Roman.
                 Defeat of Archimedes and triumph of Rome. \\
                 \\
                 3. Gentleman, Soldier, and Mathematician / 35 \\
                 Descartes (1596--1650) \\
                 The good old days. A child philosopher but no prig.
                 Inestimable advantages of lying in bed. Invigorating
                 doubts. Peace in war. Converted by a nightmare.
                 Revelation of analytic geometry. More butchering.
                 Circuses, professional jealousy, swashbuckling,
                 accommodating lady friends. Distaste for hell-fire and
                 respect for the Church. Saved by a brace of cardinals.
                 A Pope brains himself. Twenty years a recluse. The
                 Method. Betrayed by fame. Doting Elisabeth. What
                 Descartes really thought of her. Conceited Christine.
                 What she did to Descartes. Creative simplicity of Ms
                 geometry. \\
                 \\
                 4. The Prince of Amateurs / 56 \\
                 Fermat (1601--1665) \\
                 Greatest mathematician of the seventeenth century.
                 Fermat's busy, practical life. Mathematics his hobby.
                 His flick to the calculus. His profound physical
                 principle. Analytic geometry again. Arithmetica and
                 logistica. Fermat's supremacy in arithmetic. An
                 unsolved problem on primes. Why are some theorems
                 ``important''? An intelligence test. ``Infinite
                 descent.'' Fermat's unanswered challenge to posterity.
                 \\
                 \\
                 5. ``Greatness and Misery of Man'' / 73 \\
                 Pascal (1625--1662) \\
                 An infant prodigy buries his talent. At seventeen a
                 great geometer. Pascal's wonderful theorem. Vile health
                 and religious inebriety. The first calculating
                 Frankenstein. Pascal's brilliance in physics. Holy
                 sister Jacqueline, soul-saver. Wine and women? ``Get
                 thee to a nunnery.!'' Converted on a spree. Literature
                 prostituted to bigotry. The Helen of Geometry. A
                 celestial toothache. What the post-mortem revealed. A
                 gambler makes mathematical history. Scope of the theory
                 of probability. Pascal creates the theory with Fermat.
                 Folly of betting against God or the Devil. \\
                 \\
                 6. On the Seashore / 90 \\
                 Newton (1642--1727) \\
                 Newton's estimate of himself. An uncertified youthful
                 genius. Chaos of his times. On the shoulders of giants.
                 His one attachment. Cambridge days. Young Newton
                 masters futility of suffering fools gladly. The Great
                 Plague a greater blessing. Immortal at twenty four (or
                 less). The calculus. Newton unsurpassed in pure
                 mathematics, supreme in natural philosophy. Gnats,
                 hornets, and exasperation. The Principia. Samuel Pepys
                 and other fussers. The flattest anticlimax in history.
                 Controversy, theology, chronology, alchemy, public
                 office, death. \\
                 \\
                 7. Master of All Trades / 117 \\
                 Leibniz (1646--1716) \\
                 Two superb contributions. A politician's offspring.
                 Genius at fifteen. Seduced by the law. The ``universal
                 characteristic.'' Symbolic reasoning. Sold out to
                 ambition. A master diplomat. Diplomacy being what it
                 is, the diplomatic exploits of the master are left to
                 the historians. Fox into historian, statesman into
                 mathematician. Applied ethics. Existence of God.
                 Optimism. Forty years of futility. Discarded like a
                 dirty rag. \\
                 \\
                 8. Nature or Nurture? / 131 \\
                 The Bernoullis (seventeenth-and eighteenth centuries)
                 \\
                 Eight mathematicians in three generations. Clinical
                 evidence for heredity. The calculus of variations. \\
                 \\
                 9. Analysis Incarnate / 139 \\
                 Euler (1707--1783) \\
                 The most prolific mathematician in history. Snatched
                 from theology. Rulers foot the bills. Practicality of
                 the unpractical. Celestial mechanics and naval warfare.
                 A mathematician by chance and foreordination. Trapped
                 in St. Petersburg. The virtues of silence. Half blind
                 in his morning. Flight to liberal Prussia. Generosity
                 and boorishness of Frederick the Great. Return to
                 hospitable Russia. Generosity and graciousness of
                 Catherine the Great. Total blindness at noon. Master
                 and inspirer of masters for a century. \\
                 \\
                 10. A Lofty Pyramid / 153 \\
                 Lagrange (1736--1813) \\
                 Greatest and most modest mathematician of the
                 eighteenth century. Financial ruin his opportunity.
                 Conceives his masterpiece at nineteen. Magnanimity of
                 Euler. Turin, to Paris, to Berlin: a grateful bastard
                 aids a genius. Conquests in celestial mechanics.
                 Frederick the Great condescends. Absent-minded
                 marriage. Work as a vice. A classic in arithmetic. The
                 M{\'e}canique analytique a living masterpiece. A
                 landmark in the theory of equations. Welcomed in Paris
                 by Marie Antoinette. Nervous exhaustion, melancholia,
                 and universal disgust in middle life. Reawakened by the
                 French Revolution and a young girl. What Lagrange
                 thought of the Revolution. The metric system. What the
                 revolutionists thought of Lagrange. How a philosopher
                 dies. \\
                 \\
                 11. From Peasant to Snob / 172 \\
                 Laplace (1749--1827) \\
                 Humble as Lincoln, proud as Lucifer. A chilly reception
                 and a warm welcome. Laplace grandiosely attacks the
                 solar system. The M{\'e}canique c{\'e}leste. His
                 estimate of himself. What others have thought of him.
                 The ``potential'' fundamental in physics. Laplace in
                 the French Revolution. Intimacy with Napoleon.
                 Laplace's political realism superior to Napoleon's. \\
                 \\
                 12. Friends of an Emperor / 183 \\
                 Monge (1746--1818), Fourier (1768--1830) \\
                 A knife grinder's son and a tailor's boy help Napoleon
                 to upset the aristocrats' applecart. Comic opera in
                 Egypt. Monge's descriptive geometry and the Machine
                 Age. Fourier's analysis and modern physics. Imbecility
                 of trusting in princes or proletarians. Boring to death
                 and bored to death. \\
                 \\
                 13. The Day of Glory / 206 \\
                 Poncelet (1788--1867) \\
                 Resurrected from a Napoleonic shambles. The path of
                 glory leads to jail. Wintering in Russia in 1812. What
                 genius does in prison. Two years of geometry in hell.
                 The rewards of genius: stupidities of routine.
                 Poncelet's projective geometry. Principles of
                 continuity and duality. \\
                 \\
                 14. The Prince of Mathematicians / 218 \\
                 Gauss (1777--1855) \\
                 Gauss the mathematical peer of Archimedes and Newton.
                 Humble origin. Paternal brutality. Unequalled
                 intellectual precocity. His chance, at ten. By twelve
                 he dreams revolutionary discoveries, by eighteen
                 achieves them. The Disquisitiones Arithmeticae. Other
                 epochal works summarized. The Ceres disaster. Napoleon,
                 indirectly robbing Gauss, takes second best.
                 Fundamental advances in all branches of mathematics due
                 to Gauss too numerous for citation: see the account
                 given. A sage of sages. Unwelcome death. \\
                 \\
                 15. Mathematics and Windmills / 270 \\
                 Cauchy (1789--1857) \\
                 Change in nature of mathematics with nineteenth
                 century. Childhood in the French Revolution. Cauchy's
                 early miseducation. Lagrange's prophecy. The young
                 Christian engineer. Prophetic acuteness of Malus. The
                 theory of groups. In the front rank at twenty seven.
                 One of Fermat's enigmas solved. The pious hippopotamus.
                 Butted by Charles the Goat. Memoirs on astronomy and
                 mathematical physics. Sweetness and obstinacy
                 invincible. The French Government makes a fool of
                 itself. Cauchy's place in mathematics. Drawbacks of an
                 irreproachable character. \\
                 \\
                 16. The Copernicus of Geometry / 294 \\
                 Lobatchewsky (1793--1856) \\
                 The widow's mite. Kazan. Appointed professor and spy.
                 Universal ability. Lobatchewsky as an administrator.
                 Reason and incense combat the cholera. Russian
                 gratitude. Humiliated in his prime. Blind as Milton,
                 Lobatchewsky dictates his masterpiece. His advance
                 beyond Euclid. Non--Euclidean geometry. A Copernicus of
                 the intellect. \\
                 \\
                 17. Genius and Poverty / 307 \\
                 Abel ( 1802--1829) \\
                 Norway in 1802. Smothered by clerical fecundity. Abel's
                 awakening. Generosity of a teacher. A pupil of the
                 masters. His lucky blunder. Abel and the quintic. The
                 Government to the rescue. Abel's grand tour of
                 mathematical Europe not so grand. French civility and
                 German cordiality. Crelle and his Journal. Cauchy's
                 unpardonable sin. ``Abel's Theorem.'' Something to keep
                 mathematicians 500 years. Crowning a corpse. \\
                 \\
                 18. The Great Algorist / 327 \\
                 Jacobi (1804--1851) \\
                 Galvanoplastics versus mathematics. Born rich. Jacobi's
                 philological ability. Dedicates himself to mathematics.
                 Early work. Cleaned out. A goose among foxes. Hard
                 times. Elliptic functions. Their place in the general
                 development. Inversion. Work in arithmetic, dynamics,
                 algebra, and Abelian functions. Fourier's
                 pontification. Jacobi's retort. \\
                 \\
                 19. An Irish Tragedy / 340 \\
                 Hamilton (1805--1865) \\
                 Ireland's greatest. Elaborate miseducation. Discoveries
                 at seventeen. A unique university career. Disappointed
                 in love. Hamilton and the poets. Appointed at Dunsink.
                 Systems of rays. The Principia of optics. Prediction of
                 conical refraction. Marriage and alcohol. Fields.
                 Complex numbers. The commutative law repealed.
                 Quaternions. Mountains of paper. \\
                 \\
                 20. Genius and Stupidity / 3662 \\
                 Galois (1811--1832) \\
                 An all-time world record in stupidity. Galois'
                 childhood. The pedagogues surpass themselves, At
                 sixteen Galois repeats Abel's mistake. Politics and
                 education. Examinations as arbiters of genius. Hounded
                 to death by a priest. More academic ineptitude.
                 Absent-minded Cauchy again. Driven to rebellion. A
                 master mathematician at nineteen. ``A carcase to stir
                 up the people.'' The foulest sewer in Paris. Patriots
                 rush to the field of honor. Galois' last night. The
                 riddle of equations solved. Buried like a dog. \\
                 \\
                 21. Invariant Twins / 378 \\
                 Sylvester (1814--1807); Cayley (1821--1895) \\
                 Cayley's contributions. Early life. Cambridge.
                 Recreations. Called to the Bar. Fourteen years in the
                 law. Cayley meets his collaborator. Sylvester's
                 stormier life. Hamstrung by religion. Cayley and
                 Sylvester contrasted. Sylvester's mission to the
                 Virginians. Further false steps. The theory of
                 invariants. Called to Johns Hopkins University.
                 Inextinguishable vitality. ``Rosalind.'' Cayley's
                 unification of geometry. Space of $n$ dimensions.
                 Matrices. Oxford endorses Sylvester. Respectable at
                 last. \\
                 \\
                 22. Master and Pupil / 406 \\
                 Weierstrass (1815--1897); Sonja Kowalewski (1850--1891)
                 \\
                 The father of modern analysis. Relations of Weierstrass
                 to his contemporaries. The penalties of brilliance.
                 Forced into law, forces himself out. Beer and
                 broadswords. A fresh start. Debt to Gudermann. Fifteen
                 years in the mud. Miraculous extrication. Weierstrass'
                 life problem. Too much success. Sonja storms the
                 master. His favorite pupil. Their friendship. A woman's
                 gratitude. Repenting, Sonja wins Paris prize.
                 Weierstrass universally honored. Power series.
                 Arithmetization of analysis. Doubts. \\
                 \\
                 23. Complete Independence / 433 \\
                 Boole (1815--1864) \\
                 British mathematics. Damned at birth by snobbery.
                 Boole's struggle for education. False diagnoses.
                 Providence intervenes. Discovery of invariants. What is
                 algebra? A philosopher attacks a mathematician.
                 Frightful carnage. Boole's chance. ``The Laws of
                 Thought.'' Symbolic logic. Its mathematical
                 significance. Boolean algebra. Dead in his prime. \\
                 \\
                 24. The Man, Not the Method / 448 \\
                 Hermite (1822--1901) \\
                 Old problems and new methods. Hermite's masterful
                 mother. His detestation of examinations. Instructs
                 himself. Higher mathematics sometimes easier than
                 elementary. Educational disasters. Letters to Jacobi. A
                 master at twenty one. Revenge on his examiners. Abelian
                 functions. Pestered by Cauchy. Hermite's mysticism.
                 Solution of the general quintic. Transcendental
                 numbers. A hint to circle-squarers. Hermite's
                 internationalism. \\
                 \\
                 25. The Doubter / 466 \\
                 Kronecker (1823--1891) \\
                 Legend of an American saint. Lucky Kronecker. School
                 triumphs. Great gifts. Algebraic numbers. Battles with
                 Weierstrass. Kronecker's business career. Returns rich
                 to mathematics. The Galois theory. Kronecker's
                 lectures. His skepticism his most original
                 contribution. \\
                 \\
                 26. Anima Candida / 484 \\
                 Riemann (1826--1866) \\
                 Poor but happy. Riemann's chronic shyness. Destined for
                 the church. Saved. A famous hypothesis. Career at
                 G{\"o}ttingen. ``A new mathematic.'' Physical
                 researches. Application of topology to analysis.
                 Epoch-making essay on foundations of geometry. Gauss
                 enthusiastic. The. blessings of poverty. A root of
                 tensor analysis. Quest for health. Under a fig tree.
                 Riemann's landmark in geometry. Curvature of space.
                 Pathbreaking for relativity. \\
                 \\
                 27. Arithmetic the Second / 510 \\
                 Kummer (1810--1893), Dedekind (1831--1916) \\
                 Aged in the wood. Napoleonic warp to Kummer's
                 geniality. Equally gifted in the abstract and the
                 concrete. What Fermat's Last Theorem started. Theory of
                 ideal numbers. Kummer's invention comparable to
                 Lobatchewsky's. Wave surface in four dimensions. Big of
                 body, mind, and heart. Dedekind, last pupil of Gauss.
                 First expositor of Galois. Early interest in science.
                 Turns to mathematics. Dedekind's work on continuity.
                 His creation of the theory of ideals. \\
                 \\
                 28. The Last Universalist / 526 \\
                 Poincar{\'e} (1854--1912) \\
                 Poincar{\'e}'s universality and methods. Childhood
                 setbacks. Seized by mathematics. Keeps his sanity in
                 Franco--Prussian war. Starts as mining engineer. First
                 great work. Automorphic functions. ``The keys of the
                 algebraic cosmos.'' The problem of n bodies. Is Finland
                 civilized? Poincar{\'e}'s new methods in celestial
                 mechanics. Cosmogony. How mathematical discoveries are
                 made. Poincar{\'e}'s account. Forebodings and premature
                 death. \\
                 \\
                 29. Paradise Lost? / 555 \\
                 Cantor (1845--1918) \\
                 Old foes with new faces. Rotting creeds. Cantor's
                 artistic inheritance and father-fixation. Escape, but
                 too late. His revolutionary work gets him nowhere.
                 Academic pettiness. Disastrous consequences of ``safety
                 first.'' An epochal result. Paradox or truth? Infinite
                 existence of transcendentals. Aggressiveness advances,
                 timidity retires. Further spectacular claims. Two types
                 of mathematicians. Insane? counter-revolution. The
                 battle grows fiercer. Cursing the enemy. Universal loss
                 of temper. Where stands mathematics today? And where
                 will it stand tomorrow? Invictus. \\
                 \\
                 Index / 581",
}


bibtype: book
filename: master.bib
label: Bell:1963:MAI
author: C. F. (Colin Frank) Bell and K. A. K. (Kenneth Alan Keeler) Lott
publisher: Butterworths
address: London, England
pages: xi + 295
year: 1963
LCCN: QD33 .B38 1963
bibdate: Sat Jul 25 13:55:27 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.07.25 13:55:27 ???
acknowledgement: ack-nhfb
rawauthor: C. F. (Colin Frank) Bell and K. A. K. (Kenneth Alan Keeler) Lott
title:
Modern Approach to Inorganic Chemistry: a textbook for higher national certificate and general degree students

rawtitle:
Modern Approach to Inorganic Chemistry: a textbook for higher national certificate and general degree students

entry:
@Book{Bell:1963:MAI,
  author =       "C. F. (Colin Frank) Bell and K. A. K. (Kenneth Alan
                 Keeler) Lott",
  title =        "Modern Approach to Inorganic Chemistry: a textbook for
                 higher national certificate and general degree
                 students",
  publisher =    "Butterworths",
  address =      "London, England",
  pages =        "xi + 295",
  year =         "1963",
  LCCN =         "QD33 .B38 1963",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Bell:1971:CSR
editor: C. Gordon Bell and Allen Newell
booktitle: Computer Structures: Readings and Examples
title: Computer Structures: Readings and Examples
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
pages: xix + 668
year: 1971
ISBN: 0-07-004357-4 OR 0070043574
ISBN13: 978-0-07-004357-2 OR 9780070043572
LCCN: TK7888.3 .B4
bibdate: Tue Aug 15 18:20:34 MDT 1995
bibtimestamp: 1995.08.15 18:20:34 MDT
acknowledgement: ack-nhfb
rawbooktitle: Computer Structures: Readings and Examples
raweditor: C. Gordon Bell and Allen Newell
rawtitle: Computer Structures: Readings and Examples
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib; https://www.math.utah.edu/pub/bibnet/authors/w/wilkes-maurice-v.bib; https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

TOC:
[NB: Bracketed chapter entries are subject cross references] Preface / v Contributors / xiii Acknowledgments / x Part 1 The Structure of Computers Chapter 1 Introduction / 3 Chapter 2 The PMS and ISP Descriptive Systems / 15 Chapter 3 The Computer Space / 37 Part 2 The Instruction-set Processor: Main-line computers Section 1 Processors with One Address per Instruction / 89 Chapter 4 Preliminary Discussion of the Logical Design of an Electronic Computing Instrument --- Arthur W. Burks, Herman H. Goldstine, and John von Neumann / 92 Chapter 5 The DEC PDP-8 / 120 Chapter 6 The Whirlwind I Computer --- R. R. Everett / 137 [Chapter 33 The IBM 1800] Chapter 7 Some Aspects of the Logical Design of a Control Computer: A Case Study --- R. L. Alonso, H. Blair-Smith, and A. L. Hopkins / 146 [Chapter 42 The SDS 910-9300 Series] [Chapter 16 The LGP-30 and LGP-21] [Chapter 17 IBM 650 Instruction Logic ---John W. Carr III] [Chapter 41 The IBM 7094 I, II] Chapter 8 The UNIVAC System --- J. Presper Eckert, Jr, James B. Weiner, H. Frazer Welsh, and Herbert F. Mitchell / 157 [Chapter 23 One-level Storage System --- T. Kilburn, D. B. G. Edwards, M. J. Lanigan, and F. H. Summer] [Chapter 34 The Engineering Design of the Stretch Computer --- Erich Bloch] Section 2 Processors with a General-Register State Chapter 9 The Design Philosophy of Pegasus, A Quantity-production Computer --- W. S. Elliott, C. E. Owen, C. H. Devonald, and B. G. Maudsley / 171 [Chapter 43 The Structure of System/360, Part I --- Outline of the Logical Structure --- G. A. Blaauw and F. P. Brooks, Jr.] Chapter 10 An 8-bit-character Computer / 184 [Chapter 39 Parallel Operation in the Control Data 6600 --- James E. Thornton] Part 3 The Instruction-Set Processor Level: Variations in the Processor Section 1 Processors with Greater than One Address per Instruction / 191 Chapter 11 The Pilot ACE --- J. H. Wilkinson / 193 Chapter 12 ZEBRA, A Simple Binary Computer --- W. L. van der Poel / 200 Chapter 13 UNIVAC Scientific (1103A) Instruction Logic --- John W. Carr III / 205 [Chapter 38 The RW-400: A New Polymorphic Data System --- R. E. Porter] Chapter 14 Instruction Logic of the MIDAC --- John W. Carr III / 209 Chapter 15 Instruction Logic of the Soviet Strela (Arrow) ---John W. Carr III / 213 Section 2 Processors Constrained by a Cyclic, Primary Memory / 216 [Chapter 19 The OLIVETTI Programma 101 Desk Calculator] [Chapter 12 ZEBRA, A Simple Binary Computer --- W. L. van der Poel] Chapter 16 The LGP-30 and LGP-21 / 217 [Chapter 11 The Pilot ACE --- J. H. Wilkinson] [Chapter 8 The UNIVAC System --- J. Presper Eckert, Jr., James R. Weiner, H. Frazer Welsh, and Herbert F. Mitchell] [Chapter 9 The Design Philosophy of Pegasus, A Quantity-production Computer --- W. S. Elliott, C. E. Owen, C. H. Devonald, and B. G. Maudsley] Chapter 17 IBM 650 Instruction Logic --- John W. Carr III / 220 [Chapter 26 NOVA: A List-oriented Computer --- Joseph E. Wirsching] Section 3 Processors for Variable-length-string Data / 224 Chapter 18 The IBM 1401 / 228 [Chapter 10 An 8-bit-character Computer] Section 4 Desk Calculator Computers: Keyboard Programmable Processors with Small Memories / 235 Chapter 19 The OLIVETTI Programma 101 Desk Calculator / 237 Chapter 20 The HP Model 9100A Computing Calculator --- Richard E. Monnier, Thomas E. Osborne, and David S. Cochran / 243 Section 5 Processors with Stack Memories (Zero Addresses per Instruction) / 257 Chapter 21 Design of an Arithmetic Unit Incorporating a Nesting Store --- R. H. Allmark and J. R. Lucking / 262 Chapter 22 Design of the B 5000 System --- William Lonergan and Paul King / 267 [Chapter 36 D825 --- A Multiple-computer System for Command and Control --- James P. Anderson, Samuel A. Hoffman, Joseph Shifman, and Robert J. Williams] [Chapter 30 A Command Structure for Complex Information Processing --- J. C. Shaw, A. Newell, H. A. Simon, T. O. Ellis] [Chapter 32 Microprogrammed Implementation of EULER on IBM System/360 Model 30 --- Helmut Weber] Section 6 Processors with Multiprogramming Ability / 274 Chapter 23 One-level Storage System --- T. Kilburn, D. B. G. Edwards, M. J. Lanigan, and F. H. Sumner / 276 [Chapter 21 Design of the B 5000 System --- William Lonergan and Paul King] Chapter 24 A User Machine in a Time-sharing System --- B. W. Lampson, W. W. Lichtenberger, and M. W. Pirtle / 291 Part 4 The Instruction-set Processor Level: Special-function Processors Section 1 Processors to Control Terminals and Secondary Memories (Input-output Processors) / 303 [Chapter 41 The IBM 7094 I, II] [Chapter 43 The Structure of System/360, Part I --- Outline of the Logical Structure ---- G. A. Blaauw and F. P. Brooks, Jr.] [Chapter 33 The IBM 1800] Chapter 25 The DEC 338 Display Processor / 305 Section 2 Processors for Array Data / 315 Chapter 26 NOVA: A List-oriented Computer --- Joseph E. Wirsching / 316 Chapter 27 The ILLIAC IV Computer --- George H. Barnes, Richard M. Brown, Maso Kato, David J. Kuck, Daniel L. Slotnick, and Richard E. Stokes / 320 Section 3 Processors Defined by a Microprogram / 334 Chapter 28 Microprogramming and the Design of the Control Circuits in an Electronic Computer --- M. V. Wilkes and J. B. Stringer / 335 Chapter 29 The Design of a General-Purpose Microprogram-controlled Computer with Elementary Structure --- Thomas W. Kampe / 341 [Chapter 20 The HP Model 9100A Computing Calculator ---Richard E. Monnier, Thomas E. Osborne, and David S. Cochran] [Chapter 32 A Microprogrammed Implementation of EULER on IBM System/360 Model 30 --- Helmut Weber] Section 4 Processors Based on a Programming Language / 348 Chapter 30 A Command Structure for Complex Information Processing --- J. C. Shaw, A.Newell, H. A. Simon, and T. O. Ellis / 349 Chapter 31 System Design of a FORTRAN Machine --- Theodore R. Bashkow, Azra Sasson, and Arnold Kronfeld / 363 Chapter 32 A Microprogrammed Implementation of EULER on IBM System/360 Model 30 --- Helmut Weber / 382 Part 5 The PMS Level Section 1 Computers with One Central Processor / 395 [Chapter 6 The Whirlwind I Computer --- R. R. Everett] [Chapter 42 The SDS 910-9300 Series] Section 2 Computers with One Central Processor and Multiple Input/Output Processors / 396 [Chapter 5 The DEC PDP-8] Chapter 33 The IBM 1800 / 399 [Chapter 41 The IBM 7094 I, II] [Chapter 43 The Structure of System/360, Part I --- Outline of the Logical Structure -- G. A. Blaauw and F. P. Brooks, Jr.] Chapter 34 The Engineering Design of the Stretch Computer -- Erich Bloch / 421 Chapter 35 PILOT, The NBS Multicomputer System --- A. L. Leiner, W. A. Notz, J. L. Smith, and A. Weinberger / 440 Section 3 Computers for Multiprocessing and Parallel Processing / 446 Chapter 36 D825 --- A Multiple-computer System for Command and Control --- James P. Anderson, Samuel A. Hoffman, Joseph Shifman, and Robert J. Williams / 447 [Chapter 22 Design of the B 5000 System ---- William Lonergan and Paul King] Chapter 37 A Survey of Problems and Preliminary Results Concerning Parallel Processing and Parallel Processors --- M. Lehman / 456 Section 4 Network Computers and Computer Networks / 470 Chapter 38 The RW-400: A New Polymorphic Data System --- R. E. Porter / 477 Chapter 39 Parallel Operation in the Control Data 6600 --- James E. Thornton / 489 Chapter 40 Computer Network Examples / 504 Part 6 Computer Families Section 1 The IBM 701--7094 II Sequence, a Family by Evolution / 515 Chapter 41 The IBM 7094 I, 11 / 517 Section 2 The SDS 910--9300 Series, a Planned Family / 542 Chapter 42 The SDS 910-9300 Series / 543 Section 3 The IBM System/360 --- A Series of Planned Machines Which Span a Wide Performance Range / 561 Chapter 43 The Structure of System/360, Part I --- Outline of the Logical Structure --- G. A. Blaauw and F. P. Brooks, Jr. / 588 Chapter 44 The Structure of System/360, Part II --- System Implementations --- W. Y. Stevens / 602 Appendix PMS and ISP Notations / 607 General Conventions / 607 1 Basic Semantics / 608 2 Metanotation / 608 3 Basic Syntax / 609 4 Commands: Assignments, Abbreviation, Variables, Forms / 609 5 Indefinite Expressions / 610 6 Lists and Sets / 611 7 Definite Expressions / 611 8 Attributes / 612 9 Null Symbol and Optional Expression / 613 10 Names / 613 11 Numbers / 614 12 Quantities, Dimensions, and Units / 615 13 Boolean and Relations / 615 PMS Conventions / 615 1 Dimensions / 616 2 General Units / 616 3 Information Units / 616 4 Component / 617 5 Link (L) / 619 6 Memory (M) / 620 7 Switch (S) / 623 8 Control (K) / 624 9 Transducer (T) / 625 10 Data-operations (D) / 626 11 Processor (P) / 626 12 Computer (C) / 628 ISP Conventions / 628 1 Data-types / 629 2 Instruction / 631 3 Operations / 632 4 Processors / 635 Bibliography / 638 Name Index / 653 Machine and Organization Index / 656 Subject Index / 661

subjectdates:
John von Neumann (28 December 1903--8 February 1957); James H. Wilkinson (27 September 1919--5 October 1986); Sir Maurice Vincent Wilkes (26 June 1913--29 November 2010)

shortTOC:
Part 1 The Structure of Computers Chapter 1 Introduction Chapter 2 The PMS and ISP Descriptive Systems Chapter 3 The Computer Space Part 2 The Instruction-set Processor: Main-line computers Section 1 Processors with One Address per Instruction Chapter 4 Preliminary Discussion of the Logical Design of an Electronic Computing Instrument Chapter 5 The DEC PDP-8 Chapter 6 The Whirlwind I Computer Chapter 7 Some Aspects of the Logical Design of a Control Computer: A Case Study Chapter 8 The UNIVAC System Section 2 Processors with a General-Register State Chapter 9 The Design Philosophy of Pegasus, A Quantity-production Computer Chapter 10 An 8-bit-character Computer Part 3 The Instruction-Set Processor Level: Variations in the Processor Section 1 Processors with Greater than One Address per Instruction Chapter 11 The Pilot ACE Chapter 12 ZEBRA, A Simple Binary Computer Chapter 13 UNIVAC Scientific (1103A) Instruction Logic Chapter 14 Instruction Logic of the MIDAC Chapter 15 Instruction Logic of the Soviet Strela (Arrow) Section 2 Processors Constrained by a Cyclic, Primary Memory Chapter 16 The LGP-30 and LGP-21 Chapter 17 IBM 650 Instruction Logic Section 3 Processors for Variable-length-string Data Chapter 18 The IBM 1401 Section 4 Desk Calculator Computers: Keyboard Programmable Processors with Small Memories Chapter 19 The OLIVETTI Programma 101 Desk Calculator Chapter 20 The HP Model 9100A Computing Calculator Section 5 Processors with Stack Memories (Zero Addresses per Instruction) Chapter 21 Design of an Arithmetic Unit Incorporating a Nesting Store Chapter 22 Design of the B 5000 System Section 6 Processors with Multiprogramming Ability Chapter 23 One-level Storage System Chapter 24 A User Machine in a Time-sharing System Part 4 The Instruction-set Processor Level: Special-function Processors Section 1 Processors to Control Terminals and Secondary Memories (Input-output Processors) Chapter 25 The DEC 338 Display Processor Section 2 Processors for Array Data Chapter 26 NOVA: A List-oriented Computer Chapter 27 The ILLIAC IV Computer Section 3 Processors Defined by a Microprogram Chapter 28 Microprogramming and the Design of the Control Circuits in an Electronic Computer Chapter 29 The Design of a General-Purpose Microprogram-controlled Computer with Elementary Structure Section 4 Processors Based on a Programming Language Chapter 30 A Command Structure for Complex Information Processing Chapter 31 System Design of a FORTRAN Machine Chapter 32 A Microprogrammed Implementation of EULER on IBM System/360 Model 30 Part 5 The PMS Level Section 1 Computers with One Central Processor Section 2 Computers with One Central Processor and Multiple Input/Output Processors Chapter 33 The IBM 1800 Chapter 34 The Engineering Design of the Stretch Computer Chapter 35 PILOT, The NBS Multicomputer System Section 3 Computers for Multiprocessing and Parallel Processing Chapter 36 D825 --- A Multiple-computer System for Command and Control Chapter 37 A Survey of Problems and Preliminary Results Concerning Parallel Processing and Parallel Processors Section 4 Network Computers and Computer Networks Chapter 38 The RW-400: A New Polymorphic Data System Chapter 39 Parallel Operation in the Control Data 6600 Chapter 40 Computer Network Examples / 504 Part 6 Computer Families Section 1 The IBM 701--7094 II Sequence, a Family by Evolution Chapter 41 The IBM 7094 I, 11 / 517 Section 2 The SDS 910--9300 Series, a Planned Family Chapter 42 The SDS 910-9300 Series Section 3 The IBM System/360 --- A Series of Planned Machines Which Span a Wide Performance Range Chapter 43 The Structure of System/360, Part I --- Outline of the Logical Structure System Implementations Chapter 44 The Structure of System/360, Part II --- System Implementations Appendix PMS and ISP Notations

rawshortTOC:
Part 1 The Structure of Computers \\ Chapter 1 Introduction \\ Chapter 2 The PMS and ISP Descriptive Systems \\ Chapter 3 The Computer Space \\ Part 2 The Instruction-set Processor: Main-line computers \\ Section 1 Processors with One Address per Instruction \\ Chapter 4 Preliminary Discussion of the Logical Design of an Electronic Computing Instrument \\ Chapter 5 The DEC PDP-8 \\ Chapter 6 The Whirlwind I Computer \\ Chapter 7 Some Aspects of the Logical Design of a Control Computer: A Case Study \\ Chapter 8 The UNIVAC System \\ Section 2 Processors with a General-Register State \\ Chapter 9 The Design Philosophy of Pegasus, A Quantity-production Computer \\ Chapter 10 An 8-bit-character Computer \\ Part 3 The Instruction-Set Processor Level: Variations in the Processor \\ Section 1 Processors with Greater than One Address per Instruction \\ Chapter 11 The Pilot ACE \\ Chapter 12 ZEBRA, A Simple Binary Computer \\ Chapter 13 UNIVAC Scientific (1103A) Instruction Logic \\ Chapter 14 Instruction Logic of the MIDAC \\ Chapter 15 Instruction Logic of the Soviet Strela (Arrow) \\ Section 2 Processors Constrained by a Cyclic, Primary Memory \\ Chapter 16 The LGP-30 and LGP-21 \\ Chapter 17 IBM 650 Instruction Logic \\ Section 3 Processors for Variable-length-string Data \\ Chapter 18 The IBM 1401 \\ Section 4 Desk Calculator Computers: Keyboard Programmable Processors with Small Memories \\ Chapter 19 The OLIVETTI Programma 101 Desk Calculator \\ Chapter 20 The HP Model 9100A Computing Calculator \\ Section 5 Processors with Stack Memories (Zero Addresses per Instruction) \\ Chapter 21 Design of an Arithmetic Unit Incorporating a Nesting Store \\ Chapter 22 Design of the B 5000 System \\ Section 6 Processors with Multiprogramming Ability \\ Chapter 23 One-level Storage System \\ Chapter 24 A User Machine in a Time-sharing System \\ Part 4 The Instruction-set Processor Level: Special-function Processors \\ Section 1 Processors to Control Terminals and Secondary Memories (Input-output Processors) \\ Chapter 25 The DEC 338 Display Processor \\ Section 2 Processors for Array Data \\ Chapter 26 NOVA: A List-oriented Computer \\ Chapter 27 The ILLIAC IV Computer \\ Section 3 Processors Defined by a Microprogram \\ Chapter 28 Microprogramming and the Design of the Control Circuits in an Electronic Computer \\ Chapter 29 The Design of a General-Purpose Microprogram-controlled Computer with Elementary Structure \\ Section 4 Processors Based on a Programming Language \\ Chapter 30 A Command Structure for Complex Information Processing \\ Chapter 31 System Design of a FORTRAN Machine \\ Chapter 32 A Microprogrammed Implementation of EULER on IBM System/360 Model 30 \\ Part 5 The PMS Level \\ Section 1 Computers with One Central Processor \\ Section 2 Computers with One Central Processor and Multiple Input/Output Processors \\ Chapter 33 The IBM 1800 \\ Chapter 34 The Engineering Design of the Stretch Computer \\ Chapter 35 PILOT, The NBS Multicomputer System \\ Section 3 Computers for Multiprocessing and Parallel Processing \\ Chapter 36 D825 --- A Multiple-computer System for Command and Control \\ Chapter 37 A Survey of Problems and Preliminary Results Concerning Parallel Processing and Parallel Processors \\ Section 4 Network Computers and Computer Networks \\ Chapter 38 The RW-400: A New Polymorphic Data System \\ Chapter 39 Parallel Operation in the Control Data 6600 \\ Chapter 40 Computer Network Examples / 504 \\ Part 6 Computer Families \\ Section 1 The IBM 701--7094 II Sequence, a Family by Evolution \\ Chapter 41 The IBM 7094 I, 11 / 517 \\ Section 2 The SDS 910--9300 Series, a Planned Family\\ Chapter 42 The SDS 910-9300 Series \\ Section 3 The IBM System/360 --- A Series of Planned Machines Which Span a Wide Performance Range \\ Chapter 43 The Structure of System/360, Part I --- Outline of the Logical Structure System Implementations \\ Chapter 44 The Structure of System/360, Part II --- System Implementations \\ Appendix PMS and ISP Notations

rawTOC:
[NB: Bracketed chapter entries are subject cross references] \\ Preface / v \\ Contributors / xiii \\ Acknowledgments / x \\ \\ Part 1 The Structure of Computers \\ \\ Chapter 1 Introduction / 3 \\ Chapter 2 The PMS and ISP Descriptive Systems / 15 \\ Chapter 3 The Computer Space / 37 \\ \\ Part 2 The Instruction-set Processor: Main-line computers \\ \\ Section 1 Processors with One Address per Instruction / 89 \\ \\ Chapter 4 Preliminary Discussion of the Logical Design of an Electronic Computing Instrument --- Arthur W. Burks, Herman H. Goldstine, and John von Neumann / 92 \\ Chapter 5 The DEC PDP-8 / 120 \\ Chapter 6 The Whirlwind I Computer --- R. R. Everett / 137 \\ [Chapter 33 The IBM 1800] \\ Chapter 7 Some Aspects of the Logical Design of a Control Computer: A Case Study --- R. L. Alonso, H. Blair-Smith, and A. L. Hopkins / 146 \\ [Chapter 42 The SDS 910-9300 Series] \\ [Chapter 16 The LGP-30 and LGP-21] \\ [Chapter 17 IBM 650 Instruction Logic ---John W. Carr III] \\ [Chapter 41 The IBM 7094 I, II] \\ Chapter 8 The UNIVAC System --- J. Presper Eckert, Jr, James B. Weiner, H. Frazer Welsh, and Herbert F. Mitchell / 157 \\ [Chapter 23 One-level Storage System --- T. Kilburn, D. B. G. Edwards, M. J. Lanigan, and F. H. Summer] \\ [Chapter 34 The Engineering Design of the Stretch Computer --- Erich Bloch] \\ \\ Section 2 Processors with a General-Register State \\ \\ Chapter 9 The Design Philosophy of Pegasus, A Quantity-production Computer --- W. S. Elliott, C. E. Owen, C. H. Devonald, and B. G. Maudsley / 171 \\ [Chapter 43 The Structure of System/360, Part I --- Outline of the Logical Structure --- G. A. Blaauw and F. P. Brooks, Jr.] \\ Chapter 10 An 8-bit-character Computer / 184 \\ [Chapter 39 Parallel Operation in the Control Data 6600 --- James E. Thornton] \\ \\ Part 3 The Instruction-Set Processor Level: Variations in the Processor \\ \\ Section 1 Processors with Greater than One Address per Instruction / 191 \\ \\ Chapter 11 The Pilot ACE --- J. H. Wilkinson / 193 \\ Chapter 12 ZEBRA, A Simple Binary Computer --- W. L. van der Poel / 200 \\ Chapter 13 UNIVAC Scientific (1103A) Instruction Logic --- John W. Carr III / 205 \\ [Chapter 38 The RW-400: A New Polymorphic Data System --- R. E. Porter] \\ Chapter 14 Instruction Logic of the MIDAC --- John W. Carr III / 209 \\ Chapter 15 Instruction Logic of the Soviet Strela (Arrow) ---John W. Carr III / 213 \\ \\ Section 2 Processors Constrained by a Cyclic, Primary Memory / 216 \\ \\ [Chapter 19 The OLIVETTI Programma 101 Desk Calculator] \\ [Chapter 12 ZEBRA, A Simple Binary Computer --- W. L. van der Poel] \\ Chapter 16 The LGP-30 and LGP-21 / 217 \\ [Chapter 11 The Pilot ACE --- J. H. Wilkinson] \\ [Chapter 8 The UNIVAC System --- J. Presper Eckert, Jr., James R. Weiner, H. Frazer Welsh, and Herbert F. Mitchell] \\ [Chapter 9 The Design Philosophy of Pegasus, A Quantity-production Computer --- W. S. Elliott, C. E. Owen, C. H. Devonald, and B. G. Maudsley] \\ Chapter 17 IBM 650 Instruction Logic --- John W. Carr III / 220 \\ [Chapter 26 NOVA: A List-oriented Computer --- Joseph E. Wirsching] \\ \\ Section 3 Processors for Variable-length-string Data / 224 \\ \\ Chapter 18 The IBM 1401 / 228 \\ [Chapter 10 An 8-bit-character Computer] \\ \\ Section 4 Desk Calculator Computers: Keyboard Programmable Processors with Small Memories / 235 \\ \\ Chapter 19 The OLIVETTI Programma 101 Desk Calculator / 237 \\ Chapter 20 The HP Model 9100A Computing Calculator --- Richard E. Monnier, Thomas E. Osborne, and David S. Cochran / 243 \\ \\ Section 5 Processors with Stack Memories (Zero Addresses per Instruction) / 257 \\ \\ Chapter 21 Design of an Arithmetic Unit Incorporating a Nesting Store --- R. H. Allmark and J. R. Lucking / 262 \\ Chapter 22 Design of the B 5000 System --- William Lonergan and Paul King / 267 \\ [Chapter 36 D825 --- A Multiple-computer System for Command and Control --- James P. Anderson, Samuel A. Hoffman, Joseph Shifman, and Robert J. Williams] \\ [Chapter 30 A Command Structure for Complex Information Processing --- J. C. Shaw, A. Newell, H. A. Simon, T. O. Ellis] \\ [Chapter 32 Microprogrammed Implementation of EULER on IBM System/360 Model 30 --- Helmut Weber] \\ \\ Section 6 Processors with Multiprogramming Ability / 274 \\ \\ Chapter 23 One-level Storage System --- T. Kilburn, D. B. G. Edwards, M. J. Lanigan, and F. H. Sumner / 276 \\ [Chapter 21 Design of the B 5000 System --- William Lonergan and Paul King] \\ Chapter 24 A User Machine in a Time-sharing System --- B. W. Lampson, W. W. Lichtenberger, and M. W. Pirtle / 291 \\ \\ Part 4 The Instruction-set Processor Level: Special-function Processors \\ \\ Section 1 Processors to Control Terminals and Secondary Memories (Input-output Processors) / 303 \\ \\ [Chapter 41 The IBM 7094 I, II] \\ [Chapter 43 The Structure of System/360, Part I --- Outline of the Logical Structure ---- G. A. Blaauw and F. P. Brooks, Jr.] \\ [Chapter 33 The IBM 1800] \\ Chapter 25 The DEC 338 Display Processor / 305 \\ \\ Section 2 Processors for Array Data / 315 \\ \\ Chapter 26 NOVA: A List-oriented Computer --- Joseph E. Wirsching / 316 \\ Chapter 27 The ILLIAC IV Computer --- George H. Barnes, Richard M. Brown, Maso Kato, David J. Kuck, Daniel L. Slotnick, and Richard E. Stokes / 320 \\ \\ Section 3 Processors Defined by a Microprogram / 334 \\ \\ Chapter 28 Microprogramming and the Design of the Control Circuits in an Electronic Computer --- M. V. Wilkes and J. B. Stringer / 335 \\ Chapter 29 The Design of a General-Purpose Microprogram-controlled Computer with Elementary Structure --- Thomas W. Kampe / 341 \\ [Chapter 20 The HP Model 9100A Computing Calculator ---Richard E. Monnier, Thomas E. Osborne, and David S. Cochran] \\ [Chapter 32 A Microprogrammed Implementation of EULER on IBM System/360 Model 30 --- Helmut Weber] \\ \\ Section 4 Processors Based on a Programming Language / 348 \\ \\ Chapter 30 A Command Structure for Complex Information Processing --- J. C. Shaw, A.Newell, H. A. Simon, and T. O. Ellis / 349 \\ \\ Chapter 31 System Design of a FORTRAN Machine --- Theodore R. Bashkow, Azra Sasson, and Arnold Kronfeld / 363 \\ Chapter 32 A Microprogrammed Implementation of EULER on IBM System/360 Model 30 --- Helmut Weber / 382 \\ \\ Part 5 The PMS Level \\ \\ Section 1 Computers with One Central Processor / 395 \\ \\ [Chapter 6 The Whirlwind I Computer --- R. R. Everett] \\ [Chapter 42 The SDS 910-9300 Series] \\ \\ Section 2 Computers with One Central Processor and Multiple Input/Output Processors / 396 \\ \\ [Chapter 5 The DEC PDP-8] \\ Chapter 33 The IBM 1800 / 399 \\ [Chapter 41 The IBM 7094 I, II] \\ [Chapter 43 The Structure of System/360, Part I --- Outline of the Logical Structure -- G. A. Blaauw and F. P. Brooks, Jr.] \\ Chapter 34 The Engineering Design of the Stretch Computer -- Erich Bloch / 421 \\ Chapter 35 PILOT, The NBS Multicomputer System --- A. L. Leiner, W. A. Notz, J. L. Smith, and A. Weinberger / 440 \\ \\ Section 3 Computers for Multiprocessing and Parallel Processing / 446 \\ \\ Chapter 36 D825 --- A Multiple-computer System for Command and Control --- James P. Anderson, Samuel A. Hoffman, Joseph Shifman, and Robert J. Williams / 447 \\ [Chapter 22 Design of the B 5000 System ---- William Lonergan and Paul King] \\ Chapter 37 A Survey of Problems and Preliminary Results Concerning Parallel Processing and Parallel Processors --- M. Lehman / 456 \\ \\ Section 4 Network Computers and Computer Networks / 470 \\ \\ Chapter 38 The RW-400: A New Polymorphic Data System --- R. E. Porter / 477 \\ Chapter 39 Parallel Operation in the Control Data 6600 --- James E. Thornton / 489 \\ Chapter 40 Computer Network Examples / 504 \\ \\ Part 6 Computer Families \\ \\ Section 1 The IBM 701--7094 II Sequence, a Family by Evolution / 515 \\ \\ Chapter 41 The IBM 7094 I, 11 / 517 \\ \\ Section 2 The SDS 910--9300 Series, a Planned Family / 542 \\ \\ Chapter 42 The SDS 910-9300 Series / 543 \\ \\ Section 3 The IBM System/360 --- A Series of Planned Machines Which Span a Wide Performance Range / 561 \\ \\ Chapter 43 The Structure of System/360, Part I --- Outline of the Logical Structure --- G. A. Blaauw and F. P. Brooks, Jr. / 588 \\ Chapter 44 The Structure of System/360, Part II --- System Implementations --- W. Y. Stevens / 602 \\ \\ Appendix PMS and ISP Notations / 607 \\ \\ General Conventions / 607 \\ \\ 1 Basic Semantics / 608 \\ 2 Metanotation / 608 \\ 3 Basic Syntax / 609 \\ 4 Commands: Assignments, Abbreviation, Variables, Forms / 609 \\ 5 Indefinite Expressions / 610 \\ 6 Lists and Sets / 611 \\ 7 Definite Expressions / 611 \\ 8 Attributes / 612 \\ 9 Null Symbol and Optional Expression / 613 \\ 10 Names / 613 \\ 11 Numbers / 614 \\ 12 Quantities, Dimensions, and Units / 615 \\ 13 Boolean and Relations / 615 \\ \\ PMS Conventions / 615 \\ \\ 1 Dimensions / 616 \\ 2 General Units / 616 \\ 3 Information Units / 616 \\ 4 Component / 617 \\ 5 Link (L) / 619 \\ 6 Memory (M) / 620 \\ 7 Switch (S) / 623 \\ 8 Control (K) / 624 \\ 9 Transducer (T) / 625 \\ 10 Data-operations (D) / 626 \\ 11 Processor (P) / 626 \\ 12 Computer (C) / 628 \\ \\ ISP Conventions / 628 \\ \\ 1 Data-types / 629 \\ 2 Instruction / 631 \\ 3 Operations / 632 \\ 4 Processors / 635 \\ \\ Bibliography / 638 \\ Name Index / 653 \\ Machine and Organization Index / 656 \\ Subject Index / 661

entry:
@Book{Bell:1971:CSR,
  editor =       "C. Gordon Bell and Allen Newell",
  booktitle =    "Computer Structures: Readings and Examples",
  title =        "Computer Structures: Readings and Examples",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xix + 668",
  year =         "1971",
  ISBN =         "0-07-004357-4",
  ISBN-13 =      "978-0-07-004357-2",
  LCCN =         "TK7888.3 .B4",
  bibdate =      "Tue Aug 15 18:20:34 MDT 1995",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/w/wilkes-maurice-v.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Part 1 The Structure of Computers \\
                 Chapter 1 Introduction \\
                 Chapter 2 The PMS and ISP Descriptive Systems \\
                 Chapter 3 The Computer Space \\
                 Part 2 The Instruction-set Processor: Main-line
                 computers \\
                 Section 1 Processors with One Address per Instruction
                 \\
                 Chapter 4 Preliminary Discussion of the Logical Design
                 of an Electronic Computing Instrument \\
                 Chapter 5 The DEC PDP-8 \\
                 Chapter 6 The Whirlwind I Computer \\
                 Chapter 7 Some Aspects of the Logical Design of a
                 Control Computer: A Case Study \\
                 Chapter 8 The UNIVAC System \\
                 Section 2 Processors with a General-Register State \\
                 Chapter 9 The Design Philosophy of Pegasus, A
                 Quantity-production Computer \\
                 Chapter 10 An 8-bit-character Computer \\
                 Part 3 The Instruction-Set Processor Level: Variations
                 in the Processor \\
                 Section 1 Processors with Greater than One Address per
                 Instruction \\
                 Chapter 11 The Pilot ACE \\
                 Chapter 12 ZEBRA, A Simple Binary Computer \\
                 Chapter 13 UNIVAC Scientific (1103A) Instruction Logic
                 \\
                 Chapter 14 Instruction Logic of the MIDAC \\
                 Chapter 15 Instruction Logic of the Soviet Strela
                 (Arrow) \\
                 Section 2 Processors Constrained by a Cyclic, Primary
                 Memory \\
                 Chapter 16 The LGP-30 and LGP-21 \\
                 Chapter 17 IBM 650 Instruction Logic \\
                 Section 3 Processors for Variable-length-string Data
                 \\
                 Chapter 18 The IBM 1401 \\
                 Section 4 Desk Calculator Computers: Keyboard
                 Programmable Processors with Small Memories \\
                 Chapter 19 The OLIVETTI Programma 101 Desk Calculator
                 \\
                 Chapter 20 The HP Model 9100A Computing Calculator \\
                 Section 5 Processors with Stack Memories (Zero
                 Addresses per Instruction) \\
                 Chapter 21 Design of an Arithmetic Unit Incorporating a
                 Nesting Store \\
                 Chapter 22 Design of the B 5000 System \\
                 Section 6 Processors with Multiprogramming Ability \\
                 Chapter 23 One-level Storage System \\
                 Chapter 24 A User Machine in a Time-sharing System \\
                 Part 4 The Instruction-set Processor Level:
                 Special-function Processors \\
                 Section 1 Processors to Control Terminals and Secondary
                 Memories (Input-output Processors) \\
                 Chapter 25 The DEC 338 Display Processor \\
                 Section 2 Processors for Array Data \\
                 Chapter 26 NOVA: A List-oriented Computer \\
                 Chapter 27 The ILLIAC IV Computer \\
                 Section 3 Processors Defined by a Microprogram \\
                 Chapter 28 Microprogramming and the Design of the
                 Control Circuits in an Electronic Computer \\
                 Chapter 29 The Design of a General-Purpose
                 Microprogram-controlled Computer with Elementary
                 Structure \\
                 Section 4 Processors Based on a Programming Language
                 \\
                 Chapter 30 A Command Structure for Complex Information
                 Processing \\
                 Chapter 31 System Design of a FORTRAN Machine \\
                 Chapter 32 A Microprogrammed Implementation of EULER on
                 IBM System/360 Model 30 \\
                 Part 5 The PMS Level \\
                 Section 1 Computers with One Central Processor \\
                 Section 2 Computers with One Central Processor and
                 Multiple Input/Output Processors \\
                 Chapter 33 The IBM 1800 \\
                 Chapter 34 The Engineering Design of the Stretch
                 Computer \\
                 Chapter 35 PILOT, The NBS Multicomputer System \\
                 Section 3 Computers for Multiprocessing and Parallel
                 Processing \\
                 Chapter 36 D825 --- A Multiple-computer System for
                 Command and Control \\
                 Chapter 37 A Survey of Problems and Preliminary Results
                 Concerning Parallel Processing and Parallel Processors
                 \\
                 Section 4 Network Computers and Computer Networks \\
                 Chapter 38 The RW-400: A New Polymorphic Data System
                 \\
                 Chapter 39 Parallel Operation in the Control Data 6600
                 \\
                 Chapter 40 Computer Network Examples / 504 \\
                 Part 6 Computer Families \\
                 Section 1 The IBM 701--7094 II Sequence, a Family by
                 Evolution \\
                 Chapter 41 The IBM 7094 I, 11 / 517 \\
                 Section 2 The SDS 910--9300 Series, a Planned Family\\
                 Chapter 42 The SDS 910-9300 Series \\
                 Section 3 The IBM System/360 --- A Series of Planned
                 Machines Which Span a Wide Performance Range \\
                 Chapter 43 The Structure of System/360, Part I ---
                 Outline of the Logical Structure System Implementations
                 \\
                 Chapter 44 The Structure of System/360, Part II ---
                 System Implementations \\
                 Appendix PMS and ISP Notations",
  subject-dates = "John von Neumann (28 December 1903--8 February 1957);
                 James H. Wilkinson (27 September 1919--5 October 1986);
                 Sir Maurice Vincent Wilkes (26 June 1913--29 November
                 2010)",
  tableofcontents = "[NB: Bracketed chapter entries are subject cross
                 references] \\
                 Preface / v \\
                 Contributors / xiii \\
                 Acknowledgments / x \\
                 \\
                 Part 1 The Structure of Computers \\
                 \\
                 Chapter 1 Introduction / 3 \\
                 Chapter 2 The PMS and ISP Descriptive Systems / 15 \\
                 Chapter 3 The Computer Space / 37 \\
                 \\
                 Part 2 The Instruction-set Processor: Main-line
                 computers \\
                 \\
                 Section 1 Processors with One Address per Instruction /
                 89 \\
                 \\
                 Chapter 4 Preliminary Discussion of the Logical Design
                 of an Electronic Computing Instrument --- Arthur W.
                 Burks, Herman H. Goldstine, and John von Neumann / 92
                 \\
                 Chapter 5 The DEC PDP-8 / 120 \\
                 Chapter 6 The Whirlwind I Computer --- R. R. Everett /
                 137 \\
                 [Chapter 33 The IBM 1800] \\
                 Chapter 7 Some Aspects of the Logical Design of a
                 Control Computer: A Case Study --- R. L. Alonso, H.
                 Blair-Smith, and A. L. Hopkins / 146 \\
                 [Chapter 42 The SDS 910-9300 Series] \\
                 [Chapter 16 The LGP-30 and LGP-21] \\
                 [Chapter 17 IBM 650 Instruction Logic ---John W. Carr
                 III] \\
                 [Chapter 41 The IBM 7094 I, II] \\
                 Chapter 8 The UNIVAC System --- J. Presper Eckert, Jr,
                 James B. Weiner, H. Frazer Welsh, and Herbert F.
                 Mitchell / 157 \\
                 [Chapter 23 One-level Storage System --- T. Kilburn, D.
                 B. G. Edwards, M. J. Lanigan, and F. H. Summer] \\
                 [Chapter 34 The Engineering Design of the Stretch
                 Computer --- Erich Bloch] \\
                 \\
                 Section 2 Processors with a General-Register State \\
                 \\
                 Chapter 9 The Design Philosophy of Pegasus, A
                 Quantity-production Computer --- W. S. Elliott, C. E.
                 Owen, C. H. Devonald, and B. G. Maudsley / 171 \\
                 [Chapter 43 The Structure of System/360, Part I ---
                 Outline of the Logical Structure --- G. A. Blaauw and
                 F. P. Brooks, Jr.] \\
                 Chapter 10 An 8-bit-character Computer / 184 \\
                 [Chapter 39 Parallel Operation in the Control Data 6600
                 --- James E. Thornton] \\
                 \\
                 Part 3 The Instruction-Set Processor Level: Variations
                 in the Processor \\
                 \\
                 Section 1 Processors with Greater than One Address per
                 Instruction / 191 \\
                 \\
                 Chapter 11 The Pilot ACE --- J. H. Wilkinson / 193 \\
                 Chapter 12 ZEBRA, A Simple Binary Computer --- W. L.
                 van der Poel / 200 \\
                 Chapter 13 UNIVAC Scientific (1103A) Instruction Logic
                 --- John W. Carr III / 205 \\
                 [Chapter 38 The RW-400: A New Polymorphic Data System
                 --- R. E. Porter] \\
                 Chapter 14 Instruction Logic of the MIDAC --- John W.
                 Carr III / 209 \\
                 Chapter 15 Instruction Logic of the Soviet Strela
                 (Arrow) ---John W. Carr III / 213 \\
                 \\
                 Section 2 Processors Constrained by a Cyclic, Primary
                 Memory / 216 \\
                 \\
                 [Chapter 19 The OLIVETTI Programma 101 Desk Calculator]
                 \\
                 [Chapter 12 ZEBRA, A Simple Binary Computer --- W. L.
                 van der Poel] \\
                 Chapter 16 The LGP-30 and LGP-21 / 217 \\
                 [Chapter 11 The Pilot ACE --- J. H. Wilkinson] \\
                 [Chapter 8 The UNIVAC System --- J. Presper Eckert,
                 Jr., James R. Weiner, H. Frazer Welsh, and Herbert F.
                 Mitchell] \\
                 [Chapter 9 The Design Philosophy of Pegasus, A
                 Quantity-production Computer --- W. S. Elliott, C. E.
                 Owen, C. H. Devonald, and B. G. Maudsley] \\
                 Chapter 17 IBM 650 Instruction Logic --- John W. Carr
                 III / 220 \\
                 [Chapter 26 NOVA: A List-oriented Computer --- Joseph
                 E. Wirsching] \\
                 \\
                 Section 3 Processors for Variable-length-string Data /
                 224 \\
                 \\
                 Chapter 18 The IBM 1401 / 228 \\
                 [Chapter 10 An 8-bit-character Computer] \\
                 \\
                 Section 4 Desk Calculator Computers: Keyboard
                 Programmable Processors with Small Memories / 235 \\
                 \\
                 Chapter 19 The OLIVETTI Programma 101 Desk Calculator /
                 237 \\
                 Chapter 20 The HP Model 9100A Computing Calculator ---
                 Richard E. Monnier, Thomas E. Osborne, and David S.
                 Cochran / 243 \\
                 \\
                 Section 5 Processors with Stack Memories (Zero
                 Addresses per Instruction) / 257 \\
                 \\
                 Chapter 21 Design of an Arithmetic Unit Incorporating a
                 Nesting Store --- R. H. Allmark and J. R. Lucking / 262
                 \\
                 Chapter 22 Design of the B 5000 System --- William
                 Lonergan and Paul King / 267 \\
                 [Chapter 36 D825 --- A Multiple-computer System for
                 Command and Control --- James P. Anderson, Samuel A.
                 Hoffman, Joseph Shifman, and Robert J. Williams] \\
                 [Chapter 30 A Command Structure for Complex Information
                 Processing --- J. C. Shaw, A. Newell, H. A. Simon, T.
                 O. Ellis] \\
                 [Chapter 32 Microprogrammed Implementation of EULER on
                 IBM System/360 Model 30 --- Helmut Weber] \\
                 \\
                 Section 6 Processors with Multiprogramming Ability /
                 274 \\
                 \\
                 Chapter 23 One-level Storage System --- T. Kilburn, D.
                 B. G. Edwards, M. J. Lanigan, and F. H. Sumner / 276
                 \\
                 [Chapter 21 Design of the B 5000 System --- William
                 Lonergan and Paul King] \\
                 Chapter 24 A User Machine in a Time-sharing System ---
                 B. W. Lampson, W. W. Lichtenberger, and M. W. Pirtle /
                 291 \\
                 \\
                 Part 4 The Instruction-set Processor Level:
                 Special-function Processors \\
                 \\
                 Section 1 Processors to Control Terminals and Secondary
                 Memories (Input-output Processors) / 303 \\
                 \\
                 [Chapter 41 The IBM 7094 I, II] \\
                 [Chapter 43 The Structure of System/360, Part I ---
                 Outline of the Logical Structure ---- G. A. Blaauw and
                 F. P. Brooks, Jr.] \\
                 [Chapter 33 The IBM 1800] \\
                 Chapter 25 The DEC 338 Display Processor / 305 \\
                 \\
                 Section 2 Processors for Array Data / 315 \\
                 \\
                 Chapter 26 NOVA: A List-oriented Computer --- Joseph E.
                 Wirsching / 316 \\
                 Chapter 27 The ILLIAC IV Computer --- George H. Barnes,
                 Richard M. Brown, Maso Kato, David J. Kuck, Daniel L.
                 Slotnick, and Richard E. Stokes / 320 \\
                 \\
                 Section 3 Processors Defined by a Microprogram / 334
                 \\
                 \\
                 Chapter 28 Microprogramming and the Design of the
                 Control Circuits in an Electronic Computer --- M. V.
                 Wilkes and J. B. Stringer / 335 \\
                 Chapter 29 The Design of a General-Purpose
                 Microprogram-controlled Computer with Elementary
                 Structure --- Thomas W. Kampe / 341 \\
                 [Chapter 20 The HP Model 9100A Computing Calculator
                 ---Richard E. Monnier, Thomas E. Osborne, and David S.
                 Cochran] \\
                 [Chapter 32 A Microprogrammed Implementation of EULER
                 on IBM System/360 Model 30 --- Helmut Weber] \\
                 \\
                 Section 4 Processors Based on a Programming Language /
                 348 \\
                 \\
                 Chapter 30 A Command Structure for Complex Information
                 Processing --- J. C. Shaw, A.Newell, H. A. Simon, and
                 T. O. Ellis / 349 \\
                 \\
                 Chapter 31 System Design of a FORTRAN Machine ---
                 Theodore R. Bashkow, Azra Sasson, and Arnold Kronfeld /
                 363 \\
                 Chapter 32 A Microprogrammed Implementation of EULER on
                 IBM System/360 Model 30 --- Helmut Weber / 382 \\
                 \\
                 Part 5 The PMS Level \\
                 \\
                 Section 1 Computers with One Central Processor / 395
                 \\
                 \\
                 [Chapter 6 The Whirlwind I Computer --- R. R. Everett]
                 \\
                 [Chapter 42 The SDS 910-9300 Series] \\
                 \\
                 Section 2 Computers with One Central Processor and
                 Multiple Input/Output Processors / 396 \\
                 \\
                 [Chapter 5 The DEC PDP-8] \\
                 Chapter 33 The IBM 1800 / 399 \\
                 [Chapter 41 The IBM 7094 I, II] \\
                 [Chapter 43 The Structure of System/360, Part I ---
                 Outline of the Logical Structure -- G. A. Blaauw and F.
                 P. Brooks, Jr.] \\
                 Chapter 34 The Engineering Design of the Stretch
                 Computer -- Erich Bloch / 421 \\
                 Chapter 35 PILOT, The NBS Multicomputer System --- A.
                 L. Leiner, W. A. Notz, J. L. Smith, and A. Weinberger /
                 440 \\
                 \\
                 Section 3 Computers for Multiprocessing and Parallel
                 Processing / 446 \\
                 \\
                 Chapter 36 D825 --- A Multiple-computer System for
                 Command and Control --- James P. Anderson, Samuel A.
                 Hoffman, Joseph Shifman, and Robert J. Williams / 447
                 \\
                 [Chapter 22 Design of the B 5000 System ---- William
                 Lonergan and Paul King] \\
                 Chapter 37 A Survey of Problems and Preliminary Results
                 Concerning Parallel Processing and Parallel Processors
                 --- M. Lehman / 456 \\
                 \\
                 Section 4 Network Computers and Computer Networks / 470
                 \\
                 \\
                 Chapter 38 The RW-400: A New Polymorphic Data System
                 --- R. E. Porter / 477 \\
                 Chapter 39 Parallel Operation in the Control Data 6600
                 --- James E. Thornton / 489 \\
                 Chapter 40 Computer Network Examples / 504 \\
                 \\
                 Part 6 Computer Families \\
                 \\
                 Section 1 The IBM 701--7094 II Sequence, a Family by
                 Evolution / 515 \\
                 \\
                 Chapter 41 The IBM 7094 I, 11 / 517 \\
                 \\
                 Section 2 The SDS 910--9300 Series, a Planned Family /
                 542 \\
                 \\
                 Chapter 42 The SDS 910-9300 Series / 543 \\
                 \\
                 Section 3 The IBM System/360 --- A Series of Planned
                 Machines Which Span a Wide Performance Range / 561 \\
                 \\
                 Chapter 43 The Structure of System/360, Part I ---
                 Outline of the Logical Structure --- G. A. Blaauw and
                 F. P. Brooks, Jr. / 588 \\
                 Chapter 44 The Structure of System/360, Part II ---
                 System Implementations --- W. Y. Stevens / 602 \\
                 \\
                 Appendix PMS and ISP Notations / 607 \\
                 \\
                 General Conventions / 607 \\
                 \\
                 1 Basic Semantics / 608 \\
                 2 Metanotation / 608 \\
                 3 Basic Syntax / 609 \\
                 4 Commands: Assignments, Abbreviation, Variables, Forms
                 / 609 \\
                 5 Indefinite Expressions / 610 \\
                 6 Lists and Sets / 611 \\
                 7 Definite Expressions / 611 \\
                 8 Attributes / 612 \\
                 9 Null Symbol and Optional Expression / 613 \\
                 10 Names / 613 \\
                 11 Numbers / 614 \\
                 12 Quantities, Dimensions, and Units / 615 \\
                 13 Boolean and Relations / 615 \\
                 \\
                 PMS Conventions / 615 \\
                 \\
                 1 Dimensions / 616 \\
                 2 General Units / 616 \\
                 3 Information Units / 616 \\
                 4 Component / 617 \\
                 5 Link (L) / 619 \\
                 6 Memory (M) / 620 \\
                 7 Switch (S) / 623 \\
                 8 Control (K) / 624 \\
                 9 Transducer (T) / 625 \\
                 10 Data-operations (D) / 626 \\
                 11 Processor (P) / 626 \\
                 12 Computer (C) / 628 \\
                 \\
                 ISP Conventions / 628 \\
                 \\
                 1 Data-types / 629 \\
                 2 Instruction / 631 \\
                 3 Operations / 632 \\
                 4 Processors / 635 \\
                 \\
                 Bibliography / 638 \\
                 Name Index / 653 \\
                 Machine and Organization Index / 656 \\
                 Subject Index / 661",
}


bibtype: book
filename: master.bib
label: Bell:1978:CED
editor: C. Gordon Bell and J. Craig Mudge and John E. McNamara
booktitle: Computer Engineering: a DEC View of Hardware System Design
title: Computer Engineering: a DEC View of Hardware System Design
publisher: pub-DP
address: pub-DP:adr
pages: xxii + 585
year: 1978
DOI: https://doi.org/10.1016/C2013-0-07693-1
ISBN: 0-932376-00-2 OR 0932376002
ISBN13: 978-0-932376-00-8 OR 9780932376008
LCCN: TK7885B36 1978
bibdate: Wed Mar 13 11:36:34 MDT 2024
bibtimestamp: 2024.03.13 11:36:34 MDT
keywords: DEC (Digital Equipment Corporation)
acknowledgement: ack-nhfb
rawbooktitle: Computer Engineering: a {DEC} View of Hardware System Design
raweditor: C. Gordon Bell and J. Craig Mudge and John E. McNamara
rawtitle: Computer Engineering: a {DEC} View of Hardware System Design
bibsource:
fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/fortran1.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

TOC:
Forword / Kenneth H. Olsen / v--v Preface / / vii--xii Acknowledgements / / xv--xviii 1; Seven Views of Computer Systems / / 1--26 2; Technology Progress in Logic and Memories / / 27--62 3; Packaging and Manufacturing / / 63--91 Part I: In the Beginning / 93--95 4: Transistor Circuitry in the Lincoln TX-2 / Kenneth H. Olsen / 97--102 5: Digital Modules, The Basis for Computers / Richard L. Best, Russell C. Doane, John E. McNamara / 103--118 Part II: Introduction to Beginning of the Minicomputer / / 119--121 6: The PDP-1 and Other 18-Bit Computers / C. Gordon Bell, Gerald Butler, Robert Gray, John E. McNamara, Donald Vonada, Ronald Wilson / 123--174 7: The PDP-8 and Other 12-Bit Computers / C. Gordon Bell, John E. McNamara / 175--208 8: Structural Levels of the PDP-8 / C. Gordon Bell, Allen Newell, Daniel P. Siewiorek / 209--228 Part III: Introduction to the PDP-11 Family / C. Gordon Bell, J. Craig Mudge, John E. McNamara / 231--239 9: A New Architecture for Minicomputers --- The DEC PDP-11 / C. Gordon Bell, Roger Cady, Harold McFarland, Bruce A. Delagi, James F. O'Loughlin, Ronald Noonan, William A. Wulf / 241--262 10: Cache Memories for PDP-11 Family Computers / William D. Strecker / 263--267 11: Buses, The Skeleton of Computer Structures / John V. Levy / 269--299 12: A Minicomputer-Compatible Microcomputer System: The DEC LSI-11 / Mark J. Sebern / 301--313 13: Design Decisions for the PDP-11/60 Mid-Range Minicomputer / J. Craig Mudge / 315--326 14: Impact of Implementation Design Tradeoffs on Performance: The PDP-11, A Case Study / Edward A. Snow, Daniel P. Siewiorek / 327--364 15: Turning Cousins into Sisters: An Example of Software Smoothing of Hardware Differences / Ronald F. Brender / 365--378 16: The Evolution of the PDP-11 / C. Gordon Bell, J. Craig Mudge / 379--408 17: VAX-11/780: A Virtual Address Extension to the DEC PDP-11 Family / William D. Strecker / 409--428 Part IV: Introduction to Evolution of Computer Building Blocks / C. Gordon Bell, J. Craig Mudge, John E. McNamara / 431--440 18: The Description and Use of Register Transfer Modules (RTMs) / C. Gordon Bell, John Eggert, John Grason, Peter Williams / 441--448 19: Using LSI Processor Bit-Slices to Build a PDP-11 --- A Case Study in Microcomputer Design / Thomas A. McWilliams, Samuel H. Fuller, William H. Sherwood / 449--462 20: Multi-Microprocessors: An Overview and Working Example / Samuel H. Fuller, John K. Ousterhout, Levy Raskin, Paul I. Rubinfeld, Pradeep S. Sindhu, Richard J. Swan / 463--484 Part V: Introduction to the PDP-10 Family / C. Gordon Bell, J. Craig Mudge, John E. McNamara / 485, 487--488 21: The Evolution of the DECsystem-10 / C. Gordon Bell, Alan Kotok, Thomas N. Hastings, Richard Hill / 489--518 Appendix 1: An ISPS Primer for the Instruction Set Processor Notation / Mario Barbacci / 519--535 Appendix 2: The PMS Notation / J. Craig Mudge / 537--539 Appendix 3: Performance / C. Gordon Bell, J. Craig Mudge, John E. McNamara / 541--552 Bibliography / / 553--561 Index / / 563--585

rawTOC:
Forword / Kenneth H. Olsen / v--v \\ Preface / / vii--xii \\ Acknowledgements / / xv--xviii \\ 1; Seven Views of Computer Systems / / 1--26 \\ 2; Technology Progress in Logic and Memories / / 27--62 \\ 3; Packaging and Manufacturing / / 63--91 \\ Part I: In the Beginning / 93--95 \\ 4: Transistor Circuitry in the Lincoln TX-2 / Kenneth H. Olsen / 97--102 \\ 5: Digital Modules, The Basis for Computers / Richard L. Best, Russell C. Doane, John E. McNamara / 103--118 \\ Part II: Introduction to Beginning of the Minicomputer / / 119--121 \\ 6: The PDP-1 and Other 18-Bit Computers / C. Gordon Bell, Gerald Butler, Robert Gray, John E. McNamara, Donald Vonada, Ronald Wilson / 123--174 \\ 7: The PDP-8 and Other 12-Bit Computers / C. Gordon Bell, John E. McNamara / 175--208 \\ 8: Structural Levels of the PDP-8 / C. Gordon Bell, Allen Newell, Daniel P. Siewiorek / 209--228 \\ Part III: Introduction to the PDP-11 Family / C. Gordon Bell, J. Craig Mudge, John E. McNamara / 231--239 \\ 9: A New Architecture for Minicomputers --- The DEC PDP-11 / C. Gordon Bell, Roger Cady, Harold McFarland, Bruce A. Delagi, James F. O'Loughlin, Ronald Noonan, William A. Wulf / 241--262 \\ 10: Cache Memories for PDP-11 Family Computers / William D. Strecker / 263--267 \\ 11: Buses, The Skeleton of Computer Structures / John V. Levy / 269--299 \\ 12: A Minicomputer-Compatible Microcomputer System: The DEC LSI-11 / Mark J. Sebern / 301--313 \\ 13: Design Decisions for the PDP-11/60 Mid-Range Minicomputer / J. Craig Mudge / 315--326 \\ 14: Impact of Implementation Design Tradeoffs on Performance: The PDP-11, A Case Study / Edward A. Snow, Daniel P. Siewiorek / 327--364 \\ 15: Turning Cousins into Sisters: An Example of Software Smoothing of Hardware Differences / Ronald F. Brender / 365--378 \\ 16: The Evolution of the PDP-11 / C. Gordon Bell, J. Craig Mudge / 379--408 \\ 17: VAX-11/780: A Virtual Address Extension to the DEC PDP-11 Family / William D. Strecker / 409--428 \\ Part IV: Introduction to Evolution of Computer Building Blocks / C. Gordon Bell, J. Craig Mudge, John E. McNamara / 431--440 \\ 18: The Description and Use of Register Transfer Modules (RTMs) / C. Gordon Bell, John Eggert, John Grason, Peter Williams / 441--448 \\ 19: Using LSI Processor Bit-Slices to Build a PDP-11 --- A Case Study in Microcomputer Design / Thomas A. McWilliams, Samuel H. Fuller, William H. Sherwood / 449--462 \\ 20: Multi-Microprocessors: An Overview and Working Example / Samuel H. Fuller, John K. Ousterhout, Levy Raskin, Paul I. Rubinfeld, Pradeep S. Sindhu, Richard J. Swan / 463--484 \\ Part V: Introduction to the PDP-10 Family / C. Gordon Bell, J. Craig Mudge, John E. McNamara / 485, 487--488 \\ 21: The Evolution of the DECsystem-10 / C. Gordon Bell, Alan Kotok, Thomas N. Hastings, Richard Hill / 489--518 \\ Appendix 1: An ISPS Primer for the Instruction Set Processor Notation / Mario Barbacci / 519--535 \\ Appendix 2: The PMS Notation / J. Craig Mudge / 537--539 \\ Appendix 3: Performance / C. Gordon Bell, J. Craig Mudge, John E. McNamara / 541--552 \\ Bibliography / / 553--561 \\ Index / / 563--585

entry:
@Book{Bell:1978:CED,
  editor =       "C. Gordon Bell and J. Craig Mudge and John E.
                 McNamara",
  booktitle =    "Computer Engineering: a {DEC} View of Hardware System
                 Design",
  title =        "Computer Engineering: a {DEC} View of Hardware System
                 Design",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  pages =        "xxii + 585",
  year =         "1978",
  DOI =          "https://doi.org/10.1016/C2013-0-07693-1",
  ISBN =         "0-932376-00-2",
  ISBN-13 =      "978-0-932376-00-8",
  LCCN =         "TK7885B36 1978",
  bibdate =      "Wed Mar 13 11:36:34 MDT 2024",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  keywords =     "DEC (Digital Equipment Corporation)",
  tableofcontents = "Forword / Kenneth H. Olsen / v--v \\
                 Preface / / vii--xii \\
                 Acknowledgements / / xv--xviii \\
                 1; Seven Views of Computer Systems / / 1--26 \\
                 2; Technology Progress in Logic and Memories / / 27--62
                 \\
                 3; Packaging and Manufacturing / / 63--91 \\
                 Part I: In the Beginning / 93--95 \\
                 4: Transistor Circuitry in the Lincoln TX-2 / Kenneth
                 H. Olsen / 97--102 \\
                 5: Digital Modules, The Basis for Computers / Richard
                 L. Best, Russell C. Doane, John E. McNamara / 103--118
                 \\
                 Part II: Introduction to Beginning of the Minicomputer
                 / / 119--121 \\
                 6: The PDP-1 and Other 18-Bit Computers / C. Gordon
                 Bell, Gerald Butler, Robert Gray, John E. McNamara,
                 Donald Vonada, Ronald Wilson / 123--174 \\
                 7: The PDP-8 and Other 12-Bit Computers / C. Gordon
                 Bell, John E. McNamara / 175--208 \\
                 8: Structural Levels of the PDP-8 / C. Gordon Bell,
                 Allen Newell, Daniel P. Siewiorek / 209--228 \\
                 Part III: Introduction to the PDP-11 Family / C. Gordon
                 Bell, J. Craig Mudge, John E. McNamara / 231--239 \\
                 9: A New Architecture for Minicomputers --- The DEC
                 PDP-11 / C. Gordon Bell, Roger Cady, Harold McFarland,
                 Bruce A. Delagi, James F. O'Loughlin, Ronald Noonan,
                 William A. Wulf / 241--262 \\
                 10: Cache Memories for PDP-11 Family Computers /
                 William D. Strecker / 263--267 \\
                 11: Buses, The Skeleton of Computer Structures / John
                 V. Levy / 269--299 \\
                 12: A Minicomputer-Compatible Microcomputer System: The
                 DEC LSI-11 / Mark J. Sebern / 301--313 \\
                 13: Design Decisions for the PDP-11/60 Mid-Range
                 Minicomputer / J. Craig Mudge / 315--326 \\
                 14: Impact of Implementation Design Tradeoffs on
                 Performance: The PDP-11, A Case Study / Edward A. Snow,
                 Daniel P. Siewiorek / 327--364 \\
                 15: Turning Cousins into Sisters: An Example of
                 Software Smoothing of Hardware Differences / Ronald F.
                 Brender / 365--378 \\
                 16: The Evolution of the PDP-11 / C. Gordon Bell, J.
                 Craig Mudge / 379--408 \\
                 17: VAX-11/780: A Virtual Address Extension to the DEC
                 PDP-11 Family / William D. Strecker / 409--428 \\
                 Part IV: Introduction to Evolution of Computer Building
                 Blocks / C. Gordon Bell, J. Craig Mudge, John E.
                 McNamara / 431--440 \\
                 18: The Description and Use of Register Transfer
                 Modules (RTMs) / C. Gordon Bell, John Eggert, John
                 Grason, Peter Williams / 441--448 \\
                 19: Using LSI Processor Bit-Slices to Build a PDP-11
                 --- A Case Study in Microcomputer Design / Thomas A.
                 McWilliams, Samuel H. Fuller, William H. Sherwood /
                 449--462 \\
                 20: Multi-Microprocessors: An Overview and Working
                 Example / Samuel H. Fuller, John K. Ousterhout, Levy
                 Raskin, Paul I. Rubinfeld, Pradeep S. Sindhu, Richard
                 J. Swan / 463--484 \\
                 Part V: Introduction to the PDP-10 Family / C. Gordon
                 Bell, J. Craig Mudge, John E. McNamara / 485, 487--488
                 \\
                 21: The Evolution of the DECsystem-10 / C. Gordon Bell,
                 Alan Kotok, Thomas N. Hastings, Richard Hill / 489--518
                 \\
                 Appendix 1: An ISPS Primer for the Instruction Set
                 Processor Notation / Mario Barbacci / 519--535 \\
                 Appendix 2: The PMS Notation / J. Craig Mudge /
                 537--539 \\
                 Appendix 3: Performance / C. Gordon Bell, J. Craig
                 Mudge, John E. McNamara / 541--552 \\
                 Bibliography / / 553--561 \\
                 Index / / 563--585",
}


