# bibtab

bibtype: book
filename: master.bib
label: Doxiadis:2000:UPG
author: Apostolos K. Doxiadis
title: Uncle Petros and Goldbach's Conjecture
publisher: pub-FABER-FABER
address: pub-FABER-FABER:adr
pages: 209
year: 2000
ISBN: 0-571-20203-9 (paperback), 0-571-29569-X (e-book) OR 0571202039 (paperback), 057129569X (ebook)
LCCN: PA5615.O87 T4813 2000b
bibdate: Mon Oct 1 16:07:44 MDT 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; library.ox.ac.uk:210/ADVANCE
bibtimestamp: 2007.10.01 16:07:44 MDT
subject: Uncles; Greece; Fiction; Mathematics; Mathematicians
acknowledgement: ack-nhfb
rawauthor: Apostolos K. Doxiadis
rawtitle: {Uncle Petros} and {Goldbach's Conjecture}
ISBN13:
978-0-571-20203-4 (paperback), 978-0-571-29569-2 (e-book) OR 9780571202034 (paperback), 9780571295692 (ebook)

remark:
Translated from the Greek. Available in 25+ languages. This book is claimed on one Web site to be the first work of mathematical fiction: the conjecture is real, but the mathematician in the book is not a real person. First published in 1992 in Greek as em O Theios Petros kai i Eikasia tou Goldbach.

entry:
@Book{Doxiadis:2000:UPG,
  author =       "Apostolos K. Doxiadis",
  title =        "{Uncle Petros} and {Goldbach's Conjecture}",
  publisher =    pub-FABER-FABER,
  address =      pub-FABER-FABER:adr,
  pages =        "209",
  year =         "2000",
  ISBN =         "0-571-20203-9 (paperback), 0-571-29569-X (e-book)",
  ISBN-13 =      "978-0-571-20203-4 (paperback), 978-0-571-29569-2
                 (e-book)",
  LCCN =         "PA5615.O87 T4813 2000b",
  bibdate =      "Mon Oct 1 16:07:44 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.ox.ac.uk:210/ADVANCE",
  acknowledgement = ack-nhfb,
  remark =       "Translated from the Greek. Available in 25+ languages.
                 This book is claimed on one Web site to be the first
                 work of mathematical fiction: the conjecture is real,
                 but the mathematician in the book is not a real person.
                 First published in 1992 in Greek as {\em O Theios
                 Petros kai i Eikasia tou Goldbach}.",
  subject =      "Uncles; Greece; Fiction; Mathematics; Mathematicians",
}


bibtype: book
filename: master.bib
label: Dray:2012:GSR
author: Tevian Dray
title: The Geometry of Special Relativity
publisher: pub-TAYLOR-FRANCIS
address: pub-TAYLOR-FRANCIS:adr
pages: xvii + 131
year: 2012
ISBN: 1-4665-1047-1 OR 1466510471
ISBN13: 978-1-4665-1047-0 OR 9781466510470
LCCN: QC173.65 .D73 2012
bibdate: Fri Oct 26 09:31:57 MDT 2012
bibtimestamp: 2012.10.26 09:31:57 MDT
acknowledgement: ack-nhfb
rawauthor: Tevian Dray
rawtitle: The Geometry of {Special Relativity}
abstract:
The booktitle Geometry of Special Relativity provides an introduction to special relativity that encourages readers to see beyond the formulas to the deeper geometric structure. The text treats the geometry of hyperbolas as the key to understanding special relativity. This approach replaces the ubiquitous $ Gamma $ symbol of most standard treatments with the appropriate hyperbolic trigonometric functions. In most cases, this not only simplifies the appearance of the formulas, but also emphasizes their geometric content in such a way as to make them almost obvious. Furthermore, many important relations, including the famous relativistic addition formula for velocities, follow directly from the appropriate trigonometric addition formulas. The book first describes the basic physics of special relativity to set the stage for the geometric treatment that follows. It then reviews properties of ordinary two-dimensional Euclidean space, expressed in terms of the usual circular trigonometric functions, before presenting a similar treatment of two-dimensional Minkowski space, expressed in terms of hyperbolic trigonometric functions. After covering special relativity again from the geometric point of view, the text discusses standard paradoxes, applications to relativistic mechanics, the relativistic unification of electricity and magnetism, and further steps leading to Einstein's general theory of relativity. The book also briefly describes the further steps leading to Einstein's general theory of relativity and then explores applications of hyperbola geometry to non-Euclidean geometry and calculus, including a geometric construction of the derivatives of trigonometric functions and the exponential function.

remark:
A reviewer's comment says that this book makes Special Relativity accessible to anyone familiar with trigonometric functions and elementary calculus.

subject:
Space and time -- Mathematical models; Science; Physics; Special relativity (Physics); Space and time; Mathematical models; SCIENCE / Physics / Relativity

TOC:
Front Cover Contents List of Figures and Tables Preface Acknowledgments 1. Introduction 2. The Physics of Special Relativity 3. Circle Geometry 4. Hyperbola Geometry 5. The Geometry of Special Relativity 6. Applications 7. Problems I 8. Paradoxes 9. Relativistic Mechanics 10. Problems II 11. Relativistic Electromagnetism 12. Problems III 13. Beyond Special Relativity 14. Hyperbolic Geometry 15. Calculus Bibliography

rawabstract:
The \booktitle{Geometry of Special Relativity} provides an introduction to special relativity that encourages readers to see beyond the formulas to the deeper geometric structure. The text treats the geometry of hyperbolas as the key to understanding special relativity. This approach replaces the ubiquitous $ \Gamma $ symbol of most standard treatments with the appropriate hyperbolic trigonometric functions. In most cases, this not only simplifies the appearance of the formulas, but also emphasizes their geometric content in such a way as to make them almost obvious. Furthermore, many important relations, including the famous relativistic addition formula for velocities, follow directly from the appropriate trigonometric addition formulas. The book first describes the basic physics of special relativity to set the stage for the geometric treatment that follows. It then reviews properties of ordinary two-dimensional Euclidean space, expressed in terms of the usual circular trigonometric functions, before presenting a similar treatment of two-dimensional Minkowski space, expressed in terms of hyperbolic trigonometric functions. After covering special relativity again from the geometric point of view, the text discusses standard paradoxes, applications to relativistic mechanics, the relativistic unification of electricity and magnetism, and further steps leading to Einstein's general theory of relativity. The book also briefly describes the further steps leading to Einstein's general theory of relativity and then explores applications of hyperbola geometry to non-Euclidean geometry and calculus, including a geometric construction of the derivatives of trigonometric functions and the exponential function.

rawTOC:
Front Cover \\ Contents \\ List of Figures and Tables \\ Preface \\ Acknowledgments \\ 1. Introduction \\ 2. The Physics of Special Relativity \\ 3. Circle Geometry \\ 4. Hyperbola Geometry \\ 5. The Geometry of Special Relativity \\ 6. Applications \\ 7. Problems I \\ 8. Paradoxes \\ 9. Relativistic Mechanics \\ 10. Problems II \\ 11. Relativistic Electromagnetism \\ 12. Problems III \\ 13. Beyond Special Relativity \\ 14. Hyperbolic Geometry \\ 15. Calculus \\ Bibliography

entry:
@Book{Dray:2012:GSR,
  author =       "Tevian Dray",
  title =        "The Geometry of {Special Relativity}",
  publisher =    pub-TAYLOR-FRANCIS,
  address =      pub-TAYLOR-FRANCIS:adr,
  pages =        "xvii + 131",
  year =         "2012",
  ISBN =         "1-4665-1047-1",
  ISBN-13 =      "978-1-4665-1047-0",
  LCCN =         "QC173.65 .D73 2012",
  bibdate =      "Fri Oct 26 09:31:57 MDT 2012",
  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 =     "The \booktitle{Geometry of Special Relativity}
                 provides an introduction to special relativity that
                 encourages readers to see beyond the formulas to the
                 deeper geometric structure. The text treats the
                 geometry of hyperbolas as the key to understanding
                 special relativity. This approach replaces the
                 ubiquitous $ \Gamma $ symbol of most standard
                 treatments with the appropriate hyperbolic
                 trigonometric functions. In most cases, this not only
                 simplifies the appearance of the formulas, but also
                 emphasizes their geometric content in such a way as to
                 make them almost obvious. Furthermore, many important
                 relations, including the famous relativistic addition
                 formula for velocities, follow directly from the
                 appropriate trigonometric addition formulas. The book
                 first describes the basic physics of special relativity
                 to set the stage for the geometric treatment that
                 follows. It then reviews properties of ordinary
                 two-dimensional Euclidean space, expressed in terms of
                 the usual circular trigonometric functions, before
                 presenting a similar treatment of two-dimensional
                 Minkowski space, expressed in terms of hyperbolic
                 trigonometric functions. After covering special
                 relativity again from the geometric point of view, the
                 text discusses standard paradoxes, applications to
                 relativistic mechanics, the relativistic unification of
                 electricity and magnetism, and further steps leading to
                 Einstein's general theory of relativity. The book also
                 briefly describes the further steps leading to
                 Einstein's general theory of relativity and then
                 explores applications of hyperbola geometry to
                 non-Euclidean geometry and calculus, including a
                 geometric construction of the derivatives of
                 trigonometric functions and the exponential function.",
  acknowledgement = ack-nhfb,
  remark =       "A reviewer's comment says that this book makes Special
                 Relativity accessible to anyone familiar with
                 trigonometric functions and elementary calculus.",
  subject =      "Special relativity (Physics); Space and time;
                 Mathematical models",
  subject =      "Space and time -- Mathematical models; Science;
                 Physics; Special relativity (Physics); Space and time;
                 Mathematical models; SCIENCE / Physics / Relativity",
  tableofcontents = "Front Cover \\
                 Contents \\
                 List of Figures and Tables \\
                 Preface \\
                 Acknowledgments \\
                 1. Introduction \\
                 2. The Physics of Special Relativity \\
                 3. Circle Geometry \\
                 4. Hyperbola Geometry \\
                 5. The Geometry of Special Relativity \\
                 6. Applications \\
                 7. Problems I \\
                 8. Paradoxes \\
                 9. Relativistic Mechanics \\
                 10. Problems II \\
                 11. Relativistic Electromagnetism \\
                 12. Problems III \\
                 13. Beyond Special Relativity \\
                 14. Hyperbolic Geometry \\
                 15. Calculus \\
                 Bibliography",
}


bibtype: techreport
filename: master.bib
label: Dreyer:1946:REM
author: H.-J. Dreyer and A. Walther
type: Bericht
number: A3
institution: Institut fur Praktische Mathematik, Technische Hochschule
address: Darmstadt, West Germany
pages: xvii + 131
day: 19
month: aug
monthnumber: 8
year: 1946
bibdate: Wed Oct 13 11:20:15 2010
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2010.10.13 11:20:15 ???
note: Reprinted in cite [ 3.3]Randell:1982:ODC. Translated by Mr. and Mrs. P. Jones
language: German
acknowledgement: ack-nhfb
rawauthor: H.-J. Dreyer and A. Walther
rawnote: Reprinted in \cite[\S 3.3]{Randell:1982:ODC}. Translated by Mr. and Mrs. P. Jones
title:
Der Rechenautomat Ipm. Entwicklung Mathematischer Instrumente in Deutschland 1939 bis 1945. (German) [The Ipm Calculator. The development of mathematical instruments in Germany 1939--1945]

rawtitle:
{Der Rechenautomat Ipm. Entwicklung Mathematischer Instrumente in Deutschland 1939 bis 1945}. ({German}) [{The} {Ipm} Calculator. {The} development of mathematical instruments in {Germany} 1939--1945]

entry:
@TechReport{Dreyer:1946:REM,
  author =       "H.-J. Dreyer and A. Walther",
  title =        "{Der Rechenautomat Ipm. Entwicklung Mathematischer
                 Instrumente in Deutschland 1939 bis 1945}. ({German})
                 [{The} {Ipm} Calculator. {The} development of
                 mathematical instruments in {Germany} 1939--1945]",
  type =         "{Bericht}",
  number =       "A3",
  institution =  "Institut f{\"u}r Praktische Mathematik, Technische
                 Hochschule",
  address =      "Darmstadt, West Germany",
  day =          "19",
  month =        aug,
  year =         "1946",
  bibdate =      "Wed Oct 13 11:20:15 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 3.3]{Randell:1982:ODC}.
                 Translated by Mr. and Mrs. P. Jones",
  acknowledgement = ack-nhfb,
  language =     "German",
}


bibtype: book
filename: master.bib
label: Dry:2014:NPS
author: Sarah Dry
title: The Newton Papers: the Strange and True Odyssey of Isaac Newton's Manuscripts
publisher: pub-OXFORD
address: pub-OXFORD:adr
pages: xi + 238
year: 2014
ISBN: 0-19-995104-7 (hardcover) OR 0199951047 (hardcover)
ISBN13: 978-0-19-995104-8 (hardcover) OR 9780199951048 (hardcover)
LCCN: QC16.N7 D79 2014
bibdate: Thu Mar 5 05:42:19 MST 2015
bibtimestamp: 2015.03.05 05:42:19 MST
acknowledgement: ack-nhfb
authordates: 1974--
subjectdates: 1642--1727
rawauthor: Sarah Dry
rawtitle: The {Newton} Papers: the Strange and True Odyssey of {Isaac Newton}'s Manuscripts
bibsource:
https://www.math.utah.edu/pub/tex/bib/einstein.bib; https://www.math.utah.edu/pub/tex/bib/histmath.bib; https://www.math.utah.edu/pub/tex/bib/isis2010.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager

abstract:
When Isaac Newton died at 85 without a will on March 20, 1727, he left a mass of disorganized papers --- upwards of 8 million words --- that presented an immediate challenge to his heirs. Most of these writings, on subjects ranging from secret alchemical formulas to impassioned rejections of the Holy Trinity to notes and calculations on his core discoveries in calculus, universal gravitation, and optics, were summarily dismissed by his heirs as ``not fit to be printed.'' Rabidly heretical, alchemically obsessed, and possibly even mad, the Newton presented in these papers threatened to undermine not just his personal reputation but the status of science itself. As a result, the private papers of the world's greatest scientist remained hidden to all but a select few for over two hundred years. In booktitle The Newton Papers, Sarah Dry divulges the story of how this secret archive finally came to light --- and the complex and contradictory man it revealed. Covering a broad swath of history, Dry explores who controlled Newton's legacy, who helped uncover him, and what, finally, we know about him today, nearly three hundred years after his death. booktitle The Newton Papers presents the eclectic group of collectors, scholars, and scientists who were motivated to track down and collect Newton's private thoughts and obsessions, many of whom led extraordinary lives themselves --- from economist John Maynard Keynes to Abraham Yahuda, a friend of Albert Einstein and key figure in the founding of Israel. The 300-year history of the disappearance, dispersal and eventual rediscovery of Newton's papers exposes how Newton has been made, and re-made, at the hands of unique and idiosyncratic individuals, reflecting the changing status of science over the centuries.

subject:
Newton, Isaac; Manuscripts; Psychology; Science; History; HISTORY / Europe / Great Britain; SCIENCE / History.

TOC:
Acknowledgments / ix Prologue: Keynes at the sale / 3 The death of Newton / 5 The inheritors / 10 Petrifying Newton / 22 The madness of Newton / 33 The meanness of Newton / 45 Getting to know the knowers / 59 Wrangling with Newton / 80 Newton divided / 101 English books, American buyers / 112 The dealers / 131 The Sotheby sale / 142 The revealed Newton / 161 The Newton industry / 176 The search for unity / 199 Epilogue: The ultimate value / 204 Notes / 213 Index / 229

rawabstract:
When Isaac Newton died at 85 without a will on March 20, 1727, he left a mass of disorganized papers --- upwards of 8 million words --- that presented an immediate challenge to his heirs. Most of these writings, on subjects ranging from secret alchemical formulas to impassioned rejections of the Holy Trinity to notes and calculations on his core discoveries in calculus, universal gravitation, and optics, were summarily dismissed by his heirs as ``not fit to be printed.'' Rabidly heretical, alchemically obsessed, and possibly even mad, the Newton presented in these papers threatened to undermine not just his personal reputation but the status of science itself. As a result, the private papers of the world's greatest scientist remained hidden to all but a select few for over two hundred years. In \booktitle{The Newton Papers}, Sarah Dry divulges the story of how this secret archive finally came to light --- and the complex and contradictory man it revealed. Covering a broad swath of history, Dry explores who controlled Newton's legacy, who helped uncover him, and what, finally, we know about him today, nearly three hundred years after his death. \booktitle{The Newton Papers} presents the eclectic group of collectors, scholars, and scientists who were motivated to track down and collect Newton's private thoughts and obsessions, many of whom led extraordinary lives themselves --- from economist John Maynard Keynes to Abraham Yahuda, a friend of Albert Einstein and key figure in the founding of Israel. The 300-year history of the disappearance, dispersal and eventual rediscovery of Newton's papers exposes how Newton has been made, and re-made, at the hands of unique and idiosyncratic individuals, reflecting the changing status of science over the centuries.

rawTOC:
Acknowledgments / ix \\ Prologue: Keynes at the sale / 3 \\ The death of Newton / 5 \\ The inheritors / 10 \\ Petrifying Newton / 22 \\ The madness of Newton / 33 \\ The meanness of Newton / 45 \\ Getting to know the knowers / 59 \\ Wrangling with Newton / 80 \\ Newton divided / 101 \\ English books, American buyers / 112 \\ The dealers / 131 \\ The Sotheby sale / 142 \\ The revealed Newton / 161 \\ The Newton industry / 176 \\ The search for unity / 199 \\ Epilogue: The ultimate value / 204 \\ Notes / 213 \\ Index / 229

entry:
@Book{Dry:2014:NPS,
  author =       "Sarah Dry",
  title =        "The {Newton} Papers: the Strange and True Odyssey of
                 {Isaac Newton}'s Manuscripts",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xi + 238",
  year =         "2014",
  ISBN =         "0-19-995104-7 (hardcover)",
  ISBN-13 =      "978-0-19-995104-8 (hardcover)",
  LCCN =         "QC16.N7 D79 2014",
  bibdate =      "Thu Mar 5 05:42:19 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/histmath.bib;
                 https://www.math.utah.edu/pub/tex/bib/isis2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "When Isaac Newton died at 85 without a will on March
                 20, 1727, he left a mass of disorganized papers ---
                 upwards of 8 million words --- that presented an
                 immediate challenge to his heirs. Most of these
                 writings, on subjects ranging from secret alchemical
                 formulas to impassioned rejections of the Holy Trinity
                 to notes and calculations on his core discoveries in
                 calculus, universal gravitation, and optics, were
                 summarily dismissed by his heirs as ``not fit to be
                 printed.'' Rabidly heretical, alchemically obsessed,
                 and possibly even mad, the Newton presented in these
                 papers threatened to undermine not just his personal
                 reputation but the status of science itself. As a
                 result, the private papers of the world's greatest
                 scientist remained hidden to all but a select few for
                 over two hundred years. In \booktitle{The Newton
                 Papers}, Sarah Dry divulges the story of how this
                 secret archive finally came to light --- and the
                 complex and contradictory man it revealed. Covering a
                 broad swath of history, Dry explores who controlled
                 Newton's legacy, who helped uncover him, and what,
                 finally, we know about him today, nearly three hundred
                 years after his death. \booktitle{The Newton Papers}
                 presents the eclectic group of collectors, scholars,
                 and scientists who were motivated to track down and
                 collect Newton's private thoughts and obsessions, many
                 of whom led extraordinary lives themselves --- from
                 economist John Maynard Keynes to Abraham Yahuda, a
                 friend of Albert Einstein and key figure in the
                 founding of Israel. The 300-year history of the
                 disappearance, dispersal and eventual rediscovery of
                 Newton's papers exposes how Newton has been made, and
                 re-made, at the hands of unique and idiosyncratic
                 individuals, reflecting the changing status of science
                 over the centuries.",
  acknowledgement = ack-nhfb,
  author-dates = "1974--",
  subject =      "Newton, Isaac; Manuscripts; Psychology; Science;
                 History; HISTORY / Europe / Great Britain; SCIENCE /
                 History.",
  subject-dates = "1642--1727",
  tableofcontents = "Acknowledgments / ix \\
                 Prologue: Keynes at the sale / 3 \\
                 The death of Newton / 5 \\
                 The inheritors / 10 \\
                 Petrifying Newton / 22 \\
                 The madness of Newton / 33 \\
                 The meanness of Newton / 45 \\
                 Getting to know the knowers / 59 \\
                 Wrangling with Newton / 80 \\
                 Newton divided / 101 \\
                 English books, American buyers / 112 \\
                 The dealers / 131 \\
                 The Sotheby sale / 142 \\
                 The revealed Newton / 161 \\
                 The Newton industry / 176 \\
                 The search for unity / 199 \\
                 Epilogue: The ultimate value / 204 \\
                 Notes / 213 \\
                 Index / 229",
}


bibtype: book
filename: master.bib
label: DuBois:1999:M
author: Paul DuBois
title: MySQL
publisher: pub-NRP
address: pub-NRP:adr
pages: xxix + 756
year: 1999
ISBN: 0-7357-0921-1 OR 0735709211
ISBN13: 978-0-7357-0921-8 OR 9780735709218
LCCN: QA76.73.S67 D83 2000
bibdate: Thu Mar 23 10:12:26 2000
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2000.03.23 10:12:26 ???
URL: http://www.mysql.com/Contrib/; http://www2.newriders.com/cfm/prod_book.cfm?RecordID=584
acknowledgement: ack-nhfb
rawauthor: Paul DuBois
rawtitle: {MySQL}
abstract:
Instead of merely giving you a general overview of MySQL, Paul teaches you how to make the most of its capabilities. Through two sample database applications that run throughout the book, he gives you solutions to problems you're sure to face. He helps you integrate MySQL efficiently with third-party tools, such as PHP and Perl, enabling you to generate dynamic Web pages through database queries. He teaches you to write programs that access MySQL databases, and also provides a comprehensive set of references to column types, operators, functions, SQL syntax, MySQL programming, C API, Perl DBI, and PHP API.

TOC:
I: General MySQL Use 1: Introduction to MySQL and SQL 2: Working with Data in MySQL 3: MySQL SQL Syntax and Use 4: Query Optimization II: Using MySQL Programming Interfaces 5: Introduction to MySQL Programming 6: MySQL C API 7: Perl DBI API 8: PHP API III: MySQL Administration 9: Introduction to MySQL Administration 10: MySQL Data Directory 11: General MySQL Administration 12: Security 13: Database Maintenance and Repair. A: Obtaining and Installing Software B: Column Type Reference C: Operator and Function Reference D: SQL Syntax Reference E: MySQL Program Reference F: C API Reference G: Perl DBI API Reference H: PHP API Reference I: Useful Third-Party Tools J: Internet Service Providers

rawabstract:
Instead of merely giving you a general overview of MySQL, Paul teaches you how to make the most of its capabilities. Through two sample database applications that run throughout the book, he gives you solutions to problems you're sure to face. He helps you integrate MySQL efficiently with third-party tools, such as PHP and Perl, enabling you to generate dynamic Web pages through database queries. He teaches you to write programs that access MySQL databases, and also provides a comprehensive set of references to column types, operators, functions, SQL syntax, MySQL programming, C API, Perl DBI, and PHP API.

rawTOC:
I: General MySQL Use \\ 1: Introduction to MySQL and SQL \\ 2: Working with Data in MySQL \\ 3: MySQL SQL Syntax and Use \\ 4: Query Optimization \\ II: Using MySQL Programming Interfaces \\ 5: Introduction to MySQL Programming \\ 6: MySQL C API \\ 7: Perl DBI API \\ 8: PHP API \\ III: MySQL Administration \\ 9: Introduction to MySQL Administration \\ 10: MySQL Data Directory \\ 11: General MySQL Administration \\ 12: Security \\ 13: Database Maintenance and Repair. A: Obtaining and Installing Software \\ B: Column Type Reference \\ C: Operator and Function Reference \\ D: SQL Syntax Reference \\ E: MySQL Program Reference \\ F: C API Reference \\ G: Perl DBI API Reference \\ H: PHP API Reference \\ I: Useful Third-Party Tools \\ J: Internet Service Providers

entry:
@Book{DuBois:1999:M,
  author =       "Paul DuBois",
  title =        "{MySQL}",
  publisher =    pub-NRP,
  address =      pub-NRP:adr,
  pages =        "xxix + 756",
  year =         "1999",
  ISBN =         "0-7357-0921-1",
  ISBN-13 =      "978-0-7357-0921-8",
  LCCN =         "QA76.73.S67 D83 2000",
  bibdate =      "Thu Mar 23 10:12:26 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$49.99",
  URL =          "http://www.mysql.com/Contrib/;
                 http://www2.newriders.com/cfm/prod_book.cfm?RecordID=584",
  abstract =     "Instead of merely giving you a general overview of
                 MySQL, Paul teaches you how to make the most of its
                 capabilities. Through two sample database applications
                 that run throughout the book, he gives you solutions to
                 problems you're sure to face. He helps you integrate
                 MySQL efficiently with third-party tools, such as PHP
                 and Perl, enabling you to generate dynamic Web pages
                 through database queries. He teaches you to write
                 programs that access MySQL databases, and also provides
                 a comprehensive set of references to column types,
                 operators, functions, SQL syntax, MySQL programming, C
                 API, Perl DBI, and PHP API.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "I: General MySQL Use \\
                 1: Introduction to MySQL and SQL \\
                 2: Working with Data in MySQL \\
                 3: MySQL SQL Syntax and Use \\
                 4: Query Optimization \\
                 II: Using MySQL Programming Interfaces \\
                 5: Introduction to MySQL Programming \\
                 6: MySQL C API \\
                 7: Perl DBI API \\
                 8: PHP API \\
                 III: MySQL Administration \\
                 9: Introduction to MySQL Administration \\
                 10: MySQL Data Directory \\
                 11: General MySQL Administration \\
                 12: Security \\
                 13: Database Maintenance and Repair. A: Obtaining and
                 Installing Software \\
                 B: Column Type Reference \\
                 C: Operator and Function Reference \\
                 D: SQL Syntax Reference \\
                 E: MySQL Program Reference \\
                 F: C API Reference \\
                 G: Perl DBI API Reference \\
                 H: PHP API Reference \\
                 I: Useful Third-Party Tools \\
                 J: Internet Service Providers",
}


bibtype: book
filename: master.bib
label: Duckworth:1960:EM
author: Henry E. Duckworth
title: Electricity and Magnetism
publisher: pub-HRW
address: pub-HRW:adr
pages: xv + 424
year: 1960
LCCN: QC519 .D8
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: Henry E. Duckworth
rawtitle: Electricity and Magnetism
entry:
@Book{Duckworth:1960:EM,
  author =       "Henry E. Duckworth",
  title =        "Electricity and Magnetism",
  publisher =    pub-HRW,
  address =      pub-HRW:adr,
  pages =        "xv + 424",
  year =         "1960",
  LCCN =         "QC519 .D8",
  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: Duff:1986:DMS
author: I. S. Duff and A. M. Erisman and J. K. Reid
title: Direct Methods for Sparse Matrices
publisher: pub-CLARENDON
address: pub-CLARENDON:adr
pages: xiii + 341
year: 1986
LCCN: QA188 .D841 1986
bibdate: Tue Dec 14 22:47:43 1993
bibtimestamp: 1993.12.14 22:47:43 ???
acknowledgement: ack-nhfb
rawauthor: I. S. Duff and A. M. Erisman and J. K. Reid
rawtitle: Direct Methods for Sparse Matrices
ISBN:
0-19-853408-6 (hardcover), 0-19-853421-3 (paperback) OR 0198534086 (hardcover), 0198534213 (paperback)

ISBN13:
978-0-19-853408-2 (hardcover), 978-0-19-853421-1 (paperback) OR 9780198534082 (hardcover), 9780198534211 (paperback)

bibsource:
https://www.math.utah.edu/pub/bibnet/authors/d/duff-iain-s.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

TOC:
1: Introduction 1.1 Introduction / 1 1.2 Graph theory / 2 1.3 Example / 4 1.4 Advanced Computer architectures / 9 1.5 Problem formulation / 11 1.6 A sparse matrix test collection / 14 2: Sparse matrices: storage schemes and simple Operations 2.1 Introduction / 19 2.2 Sparse vector storage / 19 2.3 Inner product of two packed vectors / 20 2.4 Adding packed vectors / 21 2.5 Use of full-sized arrays / 22 2.6 Coordinate scheme for storing sparse matrices / 23 2.7 Sparse matrix as a collection of sparse vectors / 24 2.8 Linked lists / 25 2.9 Sparse matrix in row-linked list / 28 2.10 Generating collections of sparse vectors / 30 2.11 Access by rows and columns / 31 2.12 Matrix by vector products / 32 2.13 Matrix by matrix products / 33 2.14 Permutation matrices / 34 2.15 Clique (or finite-element) storage / 36 2.16 Comparisons between sparse matrix structures / 37 3: Gaussian elimination for dense matrices: the algebraic problem 3.1 Introduction / 41 3.2 Solution of triangular Systems / 41 3.3 Gaussian elimination / 43 3.4 Required row interchanges / 45 3.5 Relationship with $L U$ factorization / 46 3.6 Equivalent factorization methods, including Doolittle and Crout / 49 3.7 Computational sequences / 51 3.8 Symmetric matrices / 53 3.9 Gauss--Jordan elimination / 55 3.10 Multiple right-hand sides and inverses / 56 3.11 Computational cost / 57 3.12 Block factorization / 59 4: Gaussian elimination for dense matrices: numerical considerations 4.1 Introduction / 65 4.2 Computer arithmetic error / 66 4.3 Algorithm instability / 67 4.4 Controlling algorithm stability / 69 4.5 Monitoring the stability / 72 4.6 Special stability considerations / 76 4.7 Solving indefinite symmetric systems / 77 4.8 Ill-conditioning: introduction / 78 4.9 Ill-conditioning: theoretical discussion / 79 4.10 Ill-conditioning: automatic detection / 81 4.11 Iterative refinement / 85 4.12 Scaling / 86 4.13 Prevention of ill-conditioning / 88 4.14 Overall error bound / 89 5: Gaussian elimination for sparse matrices: an introduction 5.1 Introduction / 93 5.2 Features of a sparse matrix code / 94 5.3 Orderings / 96 5.4 Numerical stability in sparse computation / 98 5.5 Estimating condition numbers in sparse computation / 100 5.6 The ANALYSE phase / 101 5.7 The FACTORIZE and SOLVE phases / 102 5.8 Writing compared with using sparse matrix Software / 103 6: Reduction to block triangular form 6.1 Introduction / 105 6.2 Background for finding a transversal / 107 6.3 A depth-first search algorithm for transversal extension / 109 6.4 Analysis of the depth-first search transversal algorithm / 111 6.5 Implementation of the transversal algorithm / 112 6.6 Symmetric permutations to block triangular form / 113 6.7 The algorithm of Sargent and Westerberg / 114 6.8 Tarjan's algorithm / 117 6.9 Implementation of Tarjan's algorithm / 120 6.10 Essential uniqueness of the block triangular form / 121 6.11 Experience with block triangular forms / 122 6.12 Maximum transversals / 124 7: Local pivotal strategies for sparse matrices 7.1 Introduction / 127 7.2 The Markowitz criterion / 128 7.3 Minimum degree (Tinney scheme 2) / 129 7.4 Simpler strategies / 130 7.5 Local minimum fill-in / 133 7.6 Other local strategies / 135 7.7 The effect of tie-breaking on the minimum degree algorithm / 136 7.8 Numerical pivoting / 139 7.9 Sparsity in the right-hand side and partial Solution / 140 7.10 Variability-type ordering / 143 7.11 The Symmetric indefinite case / 145 7.12 Solution methods based on orthogonalization / 145 8: Ordering sparse matrices to special forms 8.1 Introduction / 149 8.2 Desirable forms / 149 8.3 Band and variable-band matrices / 151 8.4 Ordering for small bandwidth / 153 8.5 Refined quotient trees / 157 8.6 One-way dissection / 161 8.7 Nested dissection / 163 8.8 The Boeing version of the Hellerman--Rarick algorithm / 168 8.9 The Hellerman--Rarick ordering / 172 9: Implementing Gaussian elimination: ANALYSE with numerical values 9.1 Introduction / 177 9.2 Markowitz ANALYSE / 178 9.3 FACTORIZE / 183 9.4 SOLVE / 186 9.5 Switching to full form / 188 9.6 Loop-free code / 191 9.7 Interpretative code / 192 9.8 A posteriori ordering for stability / 193 9.9 The use of drop tolerances to preserve sparsity / 195 10: Implementing Gaussian elimination with symbolic ANALYSE 10.1 Introduction / 199 10.2 Band methods / 200 10.3 Variable-band (profile) methods / 204 10.4 Special methods for banded Systems / 205 10.5 Frontal methods for finite-element problems / 210 10.6 Frontal methods for non-element problems / 216 10.7 Multifrontal (substructuring) methods for finite-element problems / 218 10.8 Multifrontal methods for non-element problems / 222 10.9 Minimum degree ordering / 226 10.10 Generating static data structures for FACTORIZE / 229 10.11 Numerical FACTORIZE and SOLVE using static data structures / 232 10.12 Accommodating numerical pivoting within static data structures / 233 10.13 Nested dissection, refined quotient tree, and one-way dissection / 234 10.14 Effects of Computer architecture / 234 11: Partitioning, matrix modification, and tearing 11.1 Introduction / 239 11.2 Exploiting the partitioned form / 240 11.3 Using partitioning to handle low-rank perturbations / 242 11.4 The matrix modification formula / 243 11.5 Low-rank modifications / 244 11.6 Use of the modification formula to solve equations / 245 11.7 Perturbations that are full-rank submatrices / 247 11.8 The equivalence of modification and partitioning / 249 11.9 Modifications that change the matrix Order / 250 11.10 Artificial perturbations / 251 11.11 Branch tearing / 252 11.12 Node tearing / 254 11.13 Implementation of node and branch tearing / 255 11.14 Manual choice of partitions and tear sets / 255 11.15 Automatic choice of partitions and tear sets / 257 11.16 Nonlinear tearing / 259 11.17 Conclusions / 260 12: Other sparsity-oriented issues 12.1 Introduction / 265 12.2 Sparsity in nonlinear computations / 266 12.3 Estimating a sparse Jacobian matrix / 267 12.4 Updating a sparse Hessian matrix / 269 12.5 Approximating a sparse matrix by a positive-definite one / 270 12.6 The inverse of a sparse matrix / 271 12.7 Computing entries of the inverse of a sparse matrix / 273 12.8 Sparsity constrained backward error analysis / 275 12.9 Assembling large finite-element matrices to band form / 277 12.10 Hypermatrices / 278 Appendix A: Matrix and vector norms / 281 Appendix B: The LINPACK condition number estimate / 285 Appendix C: Fortran Conventions / 287 Appendix D: Pictures of sparse matrices / 289 Solutions to selected exercises / 297 References / 313 Author index / 327 Subject index / 331

shortTOC:
1: Introduction 2: Sparse matrices: storage schemes and simple Operations 3: Gaussian elimination for dense matrices: the algebraic problem 4: Gaussian elimination for dense matrices: numerical considerations 5: Gaussian elimination for sparse matrices: an introduction 6: Reduction to block triangular form 7: Local pivotal strategies for sparse matrices 8: Ordering sparse matrices to special forms 9: Implementing Gaussian elimination: ANALYSE with numerical values 10: Implementing Gaussian elimination with symbolic ANALYSE 11: Partitioning, matrix modification, and tearing 12: Other sparsity-oriented issues Appendix A: Matrix and vector norms / 281 Appendix B: The LINPACK condition number estimate / 285 Appendix C: Fortran Conventions / 287 Appendix D: Pictures of sparse matrices / 289 Solutions to selected exercises / 297 References / 313 Author index / 327 Subject index / 331

rawshortTOC:
1: Introduction \\ 2: Sparse matrices: storage schemes and simple Operations \\ 3: Gaussian elimination for dense matrices: the algebraic problem \\ 4: Gaussian elimination for dense matrices: numerical considerations \\ 5: Gaussian elimination for sparse matrices: an introduction \\ 6: Reduction to block triangular form \\ 7: Local pivotal strategies for sparse matrices \\ 8: Ordering sparse matrices to special forms \\ 9: Implementing Gaussian elimination: ANALYSE with numerical values \\ 10: Implementing Gaussian elimination with symbolic ANALYSE \\ 11: Partitioning, matrix modification, and tearing \\ 12: Other sparsity-oriented issues \\ Appendix A: Matrix and vector norms / 281 \\ Appendix B: The LINPACK condition number estimate / 285 \\ Appendix C: Fortran Conventions / 287 \\ Appendix D: Pictures of sparse matrices / 289 \\ Solutions to selected exercises / 297 \\ References / 313 \\ Author index / 327 \\ Subject index / 331

rawTOC:
1: Introduction \\ 1.1 Introduction / 1 \\ 1.2 Graph theory / 2 \\ 1.3 Example / 4 \\ 1.4 Advanced Computer architectures / 9 \\ 1.5 Problem formulation / 11 \\ 1.6 A sparse matrix test collection / 14 \\ 2: Sparse matrices: storage schemes and simple Operations \\ 2.1 Introduction / 19 \\ 2.2 Sparse vector storage / 19 \\ 2.3 Inner product of two packed vectors / 20 \\ 2.4 Adding packed vectors / 21 \\ 2.5 Use of full-sized arrays / 22 \\ 2.6 Coordinate scheme for storing sparse matrices / 23 \\ 2.7 Sparse matrix as a collection of sparse vectors / 24 \\ 2.8 Linked lists / 25 \\ 2.9 Sparse matrix in row-linked list / 28 \\ 2.10 Generating collections of sparse vectors / 30 \\ 2.11 Access by rows and columns / 31 \\ 2.12 Matrix by vector products / 32 \\ 2.13 Matrix by matrix products / 33 \\ 2.14 Permutation matrices / 34 \\ 2.15 Clique (or finite-element) storage / 36 \\ 2.16 Comparisons between sparse matrix structures / 37 \\ 3: Gaussian elimination for dense matrices: the algebraic problem \\ 3.1 Introduction / 41 \\ 3.2 Solution of triangular Systems / 41 \\ 3.3 Gaussian elimination / 43 \\ 3.4 Required row interchanges / 45 \\ 3.5 Relationship with $L U$ factorization / 46 \\ 3.6 Equivalent factorization methods, including Doolittle and Crout / 49 \\ 3.7 Computational sequences / 51 \\ 3.8 Symmetric matrices / 53 \\ 3.9 Gauss--Jordan elimination / 55 \\ 3.10 Multiple right-hand sides and inverses / 56 \\ 3.11 Computational cost / 57 \\ 3.12 Block factorization / 59 \\ 4: Gaussian elimination for dense matrices: numerical considerations \\ 4.1 Introduction / 65 \\ 4.2 Computer arithmetic error / 66 \\ 4.3 Algorithm instability / 67 \\ 4.4 Controlling algorithm stability / 69 \\ 4.5 Monitoring the stability / 72 \\ 4.6 Special stability considerations / 76 \\ 4.7 Solving indefinite symmetric systems / 77 \\ 4.8 Ill-conditioning: introduction / 78 \\ 4.9 Ill-conditioning: theoretical discussion / 79 \\ 4.10 Ill-conditioning: automatic detection / 81 \\ 4.11 Iterative refinement / 85 \\ 4.12 Scaling / 86 \\ 4.13 Prevention of ill-conditioning / 88 \\ 4.14 Overall error bound / 89 \\ 5: Gaussian elimination for sparse matrices: an introduction \\ 5.1 Introduction / 93 \\ 5.2 Features of a sparse matrix code / 94 \\ 5.3 Orderings / 96 \\ 5.4 Numerical stability in sparse computation / 98 \\ 5.5 Estimating condition numbers in sparse computation / 100 \\ 5.6 The ANALYSE phase / 101 \\ 5.7 The FACTORIZE and SOLVE phases / 102 \\ 5.8 Writing compared with using sparse matrix Software / 103 \\ 6: Reduction to block triangular form \\ 6.1 Introduction / 105 \\ 6.2 Background for finding a transversal / 107 \\ 6.3 A depth-first search algorithm for transversal extension / 109 \\ 6.4 Analysis of the depth-first search transversal algorithm / 111 \\ 6.5 Implementation of the transversal algorithm / 112 \\ 6.6 Symmetric permutations to block triangular form / 113 \\ 6.7 The algorithm of Sargent and Westerberg / 114 \\ 6.8 Tarjan's algorithm / 117 \\ 6.9 Implementation of Tarjan's algorithm / 120 \\ 6.10 Essential uniqueness of the block triangular form / 121 \\ 6.11 Experience with block triangular forms / 122 \\ 6.12 Maximum transversals / 124 \\ 7: Local pivotal strategies for sparse matrices \\ 7.1 Introduction / 127 \\ 7.2 The Markowitz criterion / 128 \\ 7.3 Minimum degree (Tinney scheme 2) / 129 \\ 7.4 Simpler strategies / 130 \\ 7.5 Local minimum fill-in / 133 \\ 7.6 Other local strategies / 135 \\ 7.7 The effect of tie-breaking on the minimum degree algorithm / 136 \\ 7.8 Numerical pivoting / 139 \\ 7.9 Sparsity in the right-hand side and partial Solution / 140 \\ 7.10 Variability-type ordering / 143 \\ 7.11 The Symmetric indefinite case / 145 \\ 7.12 Solution methods based on orthogonalization / 145 \\ 8: Ordering sparse matrices to special forms \\ 8.1 Introduction / 149 \\ 8.2 Desirable forms / 149 \\ 8.3 Band and variable-band matrices / 151 \\ 8.4 Ordering for small bandwidth / 153 \\ 8.5 Refined quotient trees / 157 \\ 8.6 One-way dissection / 161 \\ 8.7 Nested dissection / 163 \\ 8.8 The Boeing version of the Hellerman--Rarick algorithm / 168 \\ 8.9 The Hellerman--Rarick ordering / 172 \\ 9: Implementing Gaussian elimination: ANALYSE with numerical values \\ 9.1 Introduction / 177 \\ 9.2 Markowitz ANALYSE / 178 \\ 9.3 FACTORIZE / 183 \\ 9.4 SOLVE / 186 \\ 9.5 Switching to full form / 188 \\ 9.6 Loop-free code / 191 \\ 9.7 Interpretative code / 192 \\ 9.8 A posteriori ordering for stability / 193 \\ 9.9 The use of drop tolerances to preserve sparsity / 195 \\ 10: Implementing Gaussian elimination with symbolic ANALYSE 10.1 Introduction / 199 \\ 10.2 Band methods / 200 \\ 10.3 Variable-band (profile) methods / 204 \\ 10.4 Special methods for banded Systems / 205 \\ 10.5 Frontal methods for finite-element problems / 210 \\ 10.6 Frontal methods for non-element problems / 216 \\ 10.7 Multifrontal (substructuring) methods for finite-element problems / 218 \\ 10.8 Multifrontal methods for non-element problems / 222 \\ 10.9 Minimum degree ordering / 226 \\ 10.10 Generating static data structures for FACTORIZE / 229 \\ 10.11 Numerical FACTORIZE and SOLVE using static data structures / 232 \\ 10.12 Accommodating numerical pivoting within static data structures / 233 \\ 10.13 Nested dissection, refined quotient tree, and one-way dissection / 234 \\ 10.14 Effects of Computer architecture / 234 \\ 11: Partitioning, matrix modification, and tearing \\ 11.1 Introduction / 239 \\ 11.2 Exploiting the partitioned form / 240 \\ 11.3 Using partitioning to handle low-rank perturbations / 242 \\ 11.4 The matrix modification formula / 243 \\ 11.5 Low-rank modifications / 244 \\ 11.6 Use of the modification formula to solve equations / 245 \\ 11.7 Perturbations that are full-rank submatrices / 247 \\ 11.8 The equivalence of modification and partitioning / 249 \\ 11.9 Modifications that change the matrix Order / 250 \\ 11.10 Artificial perturbations / 251 \\ 11.11 Branch tearing / 252 \\ 11.12 Node tearing / 254 \\ 11.13 Implementation of node and branch tearing / 255 \\ 11.14 Manual choice of partitions and tear sets / 255 \\ 11.15 Automatic choice of partitions and tear sets / 257 \\ 11.16 Nonlinear tearing / 259 \\ 11.17 Conclusions / 260 \\ 12: Other sparsity-oriented issues \\ 12.1 Introduction / 265 \\ 12.2 Sparsity in nonlinear computations / 266 \\ 12.3 Estimating a sparse Jacobian matrix / 267 \\ 12.4 Updating a sparse Hessian matrix / 269 \\ 12.5 Approximating a sparse matrix by a positive-definite one / 270 \\ 12.6 The inverse of a sparse matrix / 271 \\ 12.7 Computing entries of the inverse of a sparse matrix / 273 \\ 12.8 Sparsity constrained backward error analysis / 275 \\ 12.9 Assembling large finite-element matrices to band form / 277 \\ 12.10 Hypermatrices / 278 \\ Appendix A: Matrix and vector norms / 281 \\ Appendix B: The LINPACK condition number estimate / 285 \\ Appendix C: Fortran Conventions / 287 \\ Appendix D: Pictures of sparse matrices / 289 \\ Solutions to selected exercises / 297 \\ References / 313 \\ Author index / 327 \\ Subject index / 331

entry:
@Book{Duff:1986:DMS,
  author =       "I. S. Duff and A. M. Erisman and J. K. Reid",
  title =        "Direct Methods for Sparse Matrices",
  publisher =    pub-CLARENDON,
  address =      pub-CLARENDON:adr,
  pages =        "xiii + 341",
  year =         "1986",
  ISBN =         "0-19-853408-6 (hardcover), 0-19-853421-3 (paperback)",
  ISBN-13 =      "978-0-19-853408-2 (hardcover), 978-0-19-853421-1
                 (paperback)",
  LCCN =         "QA188 .D841 1986",
  bibdate =      "Tue Dec 14 22:47:43 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/duff-iain-s.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$37.50",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1: Introduction \\
                 2: Sparse matrices: storage schemes and simple
                 Operations \\
                 3: Gaussian elimination for dense matrices: the
                 algebraic problem \\
                 4: Gaussian elimination for dense matrices: numerical
                 considerations \\
                 5: Gaussian elimination for sparse matrices: an
                 introduction \\
                 6: Reduction to block triangular form \\
                 7: Local pivotal strategies for sparse matrices \\
                 8: Ordering sparse matrices to special forms \\
                 9: Implementing Gaussian elimination: ANALYSE with
                 numerical values \\
                 10: Implementing Gaussian elimination with symbolic
                 ANALYSE \\
                 11: Partitioning, matrix modification, and tearing \\
                 12: Other sparsity-oriented issues \\
                 Appendix A: Matrix and vector norms / 281 \\
                 Appendix B: The LINPACK condition number estimate / 285
                 \\
                 Appendix C: Fortran Conventions / 287 \\
                 Appendix D: Pictures of sparse matrices / 289 \\
                 Solutions to selected exercises / 297 \\
                 References / 313 \\
                 Author index / 327 \\
                 Subject index / 331",
  tableofcontents = "1: Introduction \\
                 1.1 Introduction / 1 \\
                 1.2 Graph theory / 2 \\
                 1.3 Example / 4 \\
                 1.4 Advanced Computer architectures / 9 \\
                 1.5 Problem formulation / 11 \\
                 1.6 A sparse matrix test collection / 14 \\
                 2: Sparse matrices: storage schemes and simple
                 Operations \\
                 2.1 Introduction / 19 \\
                 2.2 Sparse vector storage / 19 \\
                 2.3 Inner product of two packed vectors / 20 \\
                 2.4 Adding packed vectors / 21 \\
                 2.5 Use of full-sized arrays / 22 \\
                 2.6 Coordinate scheme for storing sparse matrices / 23
                 \\
                 2.7 Sparse matrix as a collection of sparse vectors /
                 24 \\
                 2.8 Linked lists / 25 \\
                 2.9 Sparse matrix in row-linked list / 28 \\
                 2.10 Generating collections of sparse vectors / 30 \\
                 2.11 Access by rows and columns / 31 \\
                 2.12 Matrix by vector products / 32 \\
                 2.13 Matrix by matrix products / 33 \\
                 2.14 Permutation matrices / 34 \\
                 2.15 Clique (or finite-element) storage / 36 \\
                 2.16 Comparisons between sparse matrix structures / 37
                 \\
                 3: Gaussian elimination for dense matrices: the
                 algebraic problem \\
                 3.1 Introduction / 41 \\
                 3.2 Solution of triangular Systems / 41 \\
                 3.3 Gaussian elimination / 43 \\
                 3.4 Required row interchanges / 45 \\
                 3.5 Relationship with $L U$ factorization / 46 \\
                 3.6 Equivalent factorization methods, including
                 Doolittle and Crout / 49 \\
                 3.7 Computational sequences / 51 \\
                 3.8 Symmetric matrices / 53 \\
                 3.9 Gauss--Jordan elimination / 55 \\
                 3.10 Multiple right-hand sides and inverses / 56 \\
                 3.11 Computational cost / 57 \\
                 3.12 Block factorization / 59 \\
                 4: Gaussian elimination for dense matrices: numerical
                 considerations \\
                 4.1 Introduction / 65 \\
                 4.2 Computer arithmetic error / 66 \\
                 4.3 Algorithm instability / 67 \\
                 4.4 Controlling algorithm stability / 69 \\
                 4.5 Monitoring the stability / 72 \\
                 4.6 Special stability considerations / 76 \\
                 4.7 Solving indefinite symmetric systems / 77 \\
                 4.8 Ill-conditioning: introduction / 78 \\
                 4.9 Ill-conditioning: theoretical discussion / 79 \\
                 4.10 Ill-conditioning: automatic detection / 81 \\
                 4.11 Iterative refinement / 85 \\
                 4.12 Scaling / 86 \\
                 4.13 Prevention of ill-conditioning / 88 \\
                 4.14 Overall error bound / 89 \\
                 5: Gaussian elimination for sparse matrices: an
                 introduction \\
                 5.1 Introduction / 93 \\
                 5.2 Features of a sparse matrix code / 94 \\
                 5.3 Orderings / 96 \\
                 5.4 Numerical stability in sparse computation / 98 \\
                 5.5 Estimating condition numbers in sparse computation
                 / 100 \\
                 5.6 The ANALYSE phase / 101 \\
                 5.7 The FACTORIZE and SOLVE phases / 102 \\
                 5.8 Writing compared with using sparse matrix Software
                 / 103 \\
                 6: Reduction to block triangular form \\
                 6.1 Introduction / 105 \\
                 6.2 Background for finding a transversal / 107 \\
                 6.3 A depth-first search algorithm for transversal
                 extension / 109 \\
                 6.4 Analysis of the depth-first search transversal
                 algorithm / 111 \\
                 6.5 Implementation of the transversal algorithm / 112
                 \\
                 6.6 Symmetric permutations to block triangular form /
                 113 \\
                 6.7 The algorithm of Sargent and Westerberg / 114 \\
                 6.8 Tarjan's algorithm / 117 \\
                 6.9 Implementation of Tarjan's algorithm / 120 \\
                 6.10 Essential uniqueness of the block triangular form
                 / 121 \\
                 6.11 Experience with block triangular forms / 122 \\
                 6.12 Maximum transversals / 124 \\
                 7: Local pivotal strategies for sparse matrices \\
                 7.1 Introduction / 127 \\
                 7.2 The Markowitz criterion / 128 \\
                 7.3 Minimum degree (Tinney scheme 2) / 129 \\
                 7.4 Simpler strategies / 130 \\
                 7.5 Local minimum fill-in / 133 \\
                 7.6 Other local strategies / 135 \\
                 7.7 The effect of tie-breaking on the minimum degree
                 algorithm / 136 \\
                 7.8 Numerical pivoting / 139 \\
                 7.9 Sparsity in the right-hand side and partial
                 Solution / 140 \\
                 7.10 Variability-type ordering / 143 \\
                 7.11 The Symmetric indefinite case / 145 \\
                 7.12 Solution methods based on orthogonalization / 145
                 \\
                 8: Ordering sparse matrices to special forms \\
                 8.1 Introduction / 149 \\
                 8.2 Desirable forms / 149 \\
                 8.3 Band and variable-band matrices / 151 \\
                 8.4 Ordering for small bandwidth / 153 \\
                 8.5 Refined quotient trees / 157 \\
                 8.6 One-way dissection / 161 \\
                 8.7 Nested dissection / 163 \\
                 8.8 The Boeing version of the Hellerman--Rarick
                 algorithm / 168 \\
                 8.9 The Hellerman--Rarick ordering / 172 \\
                 9: Implementing Gaussian elimination: ANALYSE with
                 numerical values \\
                 9.1 Introduction / 177 \\
                 9.2 Markowitz ANALYSE / 178 \\
                 9.3 FACTORIZE / 183 \\
                 9.4 SOLVE / 186 \\
                 9.5 Switching to full form / 188 \\
                 9.6 Loop-free code / 191 \\
                 9.7 Interpretative code / 192 \\
                 9.8 A posteriori ordering for stability / 193 \\
                 9.9 The use of drop tolerances to preserve sparsity /
                 195 \\
                 10: Implementing Gaussian elimination with symbolic
                 ANALYSE 10.1 Introduction / 199 \\
                 10.2 Band methods / 200 \\
                 10.3 Variable-band (profile) methods / 204 \\
                 10.4 Special methods for banded Systems / 205 \\
                 10.5 Frontal methods for finite-element problems / 210
                 \\
                 10.6 Frontal methods for non-element problems / 216 \\
                 10.7 Multifrontal (substructuring) methods for
                 finite-element problems / 218 \\
                 10.8 Multifrontal methods for non-element problems /
                 222 \\
                 10.9 Minimum degree ordering / 226 \\
                 10.10 Generating static data structures for FACTORIZE /
                 229 \\
                 10.11 Numerical FACTORIZE and SOLVE using static data
                 structures / 232 \\
                 10.12 Accommodating numerical pivoting within static
                 data structures / 233 \\
                 10.13 Nested dissection, refined quotient tree, and
                 one-way dissection / 234 \\
                 10.14 Effects of Computer architecture / 234 \\
                 11: Partitioning, matrix modification, and tearing \\
                 11.1 Introduction / 239 \\
                 11.2 Exploiting the partitioned form / 240 \\
                 11.3 Using partitioning to handle low-rank
                 perturbations / 242 \\
                 11.4 The matrix modification formula / 243 \\
                 11.5 Low-rank modifications / 244 \\
                 11.6 Use of the modification formula to solve equations
                 / 245 \\
                 11.7 Perturbations that are full-rank submatrices / 247
                 \\
                 11.8 The equivalence of modification and partitioning /
                 249 \\
                 11.9 Modifications that change the matrix Order / 250
                 \\
                 11.10 Artificial perturbations / 251 \\
                 11.11 Branch tearing / 252 \\
                 11.12 Node tearing / 254 \\
                 11.13 Implementation of node and branch tearing / 255
                 \\
                 11.14 Manual choice of partitions and tear sets / 255
                 \\
                 11.15 Automatic choice of partitions and tear sets /
                 257 \\
                 11.16 Nonlinear tearing / 259 \\
                 11.17 Conclusions / 260 \\
                 12: Other sparsity-oriented issues \\
                 12.1 Introduction / 265 \\
                 12.2 Sparsity in nonlinear computations / 266 \\
                 12.3 Estimating a sparse Jacobian matrix / 267 \\
                 12.4 Updating a sparse Hessian matrix / 269 \\
                 12.5 Approximating a sparse matrix by a
                 positive-definite one / 270 \\
                 12.6 The inverse of a sparse matrix / 271 \\
                 12.7 Computing entries of the inverse of a sparse
                 matrix / 273 \\
                 12.8 Sparsity constrained backward error analysis / 275
                 \\
                 12.9 Assembling large finite-element matrices to band
                 form / 277 \\
                 12.10 Hypermatrices / 278 \\
                 Appendix A: Matrix and vector norms / 281 \\
                 Appendix B: The LINPACK condition number estimate / 285
                 \\
                 Appendix C: Fortran Conventions / 287 \\
                 Appendix D: Pictures of sparse matrices / 289 \\
                 Solutions to selected exercises / 297 \\
                 References / 313 \\
                 Author index / 327 \\
                 Subject index / 331",
}


bibtype: book
filename: master.bib
label: Dupre:1995:BW
author: Lyn Dupre
title: Bugs in Writing
publisher: pub-AW
address: pub-AW:adr
pages: xxxiii + 649
year: 1995
ISBN: 0-201-60019-6 (paperback) OR 0201600196 (paperback)
ISBN13: 978-0-201-60019-3 (paperback) OR 9780201600193 (paperback)
LCCN: PEI 408.D85 1995
bibdate: Tue May 12 08:12:28 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.05.12 08:12:28 ???
acknowledgement: ack-nhfb
rawauthor: Lyn Dupr{\'e}
rawtitle: Bugs in Writing
TOC:
1: Required Reading 2: Passive or Missing Agents 3: You and Your Reader 4: So, So That, Such That 5: Two or More 6: Only 7: Redundant Erms 8: Pronouns 9: Undefined this 10: Motivate 11: Oxymorons 12: Shall Versus Proved 13: Everyone, Someone, No one, None 14: Color 15: Effort 16: Which Versus That 17: Spread-Out Phrases 18: While 19: Repeated prepositions 20: Abbreviations and Acronyms 21: Verbize 22: Commas 23: Number Spelling 24: Impact 25: Lists 26: Like Versus Such as 27: Either and Both 28: Hyphens 29: Full Versus Incomplete Infinities 30: Titles 31: Contractions 32: Per 33: Number Styles 34: Quotations 35: Fuzzy Words 36: Parentheses 37: Split Infinitives 38: Is Due to 39: Center on 40: Quotation Marks 41: Remarks Inserted After That 42: Picture Captions 43: Data 44: Ensure, Assure, Insure 45: Foreword Versus Forward 46: Blocks: Theorems, Proofs, Lemmas 47: Above and Below 48: En Dashes 49: As to Whether 50: Who Versus That 51: Though 52: References to Parts 53: Dates and Times of Day 54: Reason is Because 55: With Terms 56: Equals 57: Placement of Adverbs 58: U.S. Versus British Spelling 59: Placement of Prepositions 60: Different from 61: Callouts 62: Exclamation Point 63: Deduce Versus Infer 64: Citations 65: The Fact that 66: Cross References 67: Proposals 68: Better, Best, Worst 69: Missing Words 70: Aggravate 71: Upon 72: Whether Versus If 73: Sections and Heads 74: Comprise 75: In Order to 76: Em Dashes 77: Eminent, Emanate, Imminent, Immanent 78: Expected but Nonarriving Agents 79: Its and It's 80: Adverbs Versus Adjectives 81: Persons Versus People 82: Cap /LC 83: Feel Versus Think 84: Parallelism 85: Points of Ellipsis 86: Last 87: Focus On 88: Latin, Greek, and Other Troublesome Plurals 89: Around 90: Nose 91: Literal and Virtual 92: Semicolon 93: Colon 94: Comparatives 95: Tables 96: Tense 97: Abstracts 98: Neither Nor 99: Will Likely Be 100: Importantly 101: Since 102: References 103: Cannot Can Not 104: Also 105: Nonwords 106: Missing That 107: All of 108: Utilize 109: Dissertations 110: Issue 111: Terms for Describing Human-Computer Interaction 112: So Called 113: Note that Versus Notice that 114: A Lot of 115: Indices Versus Indexes 116: Solids 117: Equations 118: Half 119: Media 120: Not Versus Rather than 121: Visual Aids for Presentations 122: Plural Acronyms 123: Style Sheets and Spell Checkers 124: Maybe Versus May Be 125: Figures 126: General-Specific Words 127: Continuous Versus Continual 128: Fewer Versus Less 129: Italic Type 130: Truncated Words 131: Percent 132: Object, Modifier, Activity 133: Rewords 134: Further Versus Farther 135: Pronouns for Recipients 136: Authorship on Research Articles 137: Respectively 138: Possessives 139: Cliches, Jargon, and Euphemisms 140: Design Elements 141: Word Match 142: Sex Versus Gender 143: Awhile 144: Footnotes 145: Mouth 146: Boxes 147: Exercises, Examples, and Questions 148: Writer's Block

rawTOC:
1: Required Reading \\ 2: Passive or Missing Agents \\ 3: You and Your Reader \\ 4: So, So That, Such That \\ 5: Two or More \\ 6: Only \\ 7: Redundant Erms \\ 8: Pronouns \\ 9: Undefined this \\ 10: Motivate \\ 11: Oxymorons \\ 12: Shall Versus Proved \\ 13: Everyone, Someone, No one, None \\ 14: Color \\ 15: Effort \\ 16: Which Versus That \\ 17: Spread-Out Phrases \\ 18: While \\ 19: Repeated prepositions \\ 20: Abbreviations and Acronyms \\ 21: Verbize \\ 22: Commas \\ 23: Number Spelling \\ 24: Impact \\ 25: Lists \\ 26: Like Versus Such as \\ 27: Either and Both \\ 28: Hyphens \\ 29: Full Versus Incomplete Infinities \\ 30: Titles \\ 31: Contractions \\ 32: Per \\ 33: Number Styles \\ 34: Quotations \\ 35: Fuzzy Words \\ 36: Parentheses \\ 37: Split Infinitives \\ 38: Is Due to \\ 39: Center on \\ 40: Quotation Marks \\ 41: Remarks Inserted After That \\ 42: Picture Captions \\ 43: Data \\ 44: Ensure, Assure, Insure \\ 45: Foreword Versus Forward \\ 46: Blocks: Theorems, Proofs, Lemmas \\ 47: Above and Below \\ 48: En Dashes \\ 49: As to Whether \\ 50: Who Versus That \\ 51: Though \\ 52: References to Parts \\ 53: Dates and Times of Day \\ 54: Reason is Because \\ 55: With Terms \\ 56: Equals \\ 57: Placement of Adverbs \\ 58: U.S. Versus British Spelling \\ 59: Placement of Prepositions \\ 60: Different from \\ 61: Callouts \\ 62: Exclamation Point \\ 63: Deduce Versus Infer \\ 64: Citations \\ 65: The Fact that \\ 66: Cross References \\ 67: Proposals \\ 68: Better, Best, Worst \\ 69: Missing Words \\ 70: Aggravate \\ 71: Upon \\ 72: Whether Versus If \\ 73: Sections and Heads \\ 74: Comprise \\ 75: In Order to \\ 76: Em Dashes \\ 77: Eminent, Emanate, Imminent, Immanent \\ 78: Expected but Nonarriving Agents \\ 79: Its and It's \\ 80: Adverbs Versus Adjectives \\ 81: Persons Versus People \\ 82: Cap /LC \\ 83: Feel Versus Think \\ 84: Parallelism \\ 85: Points of Ellipsis \\ 86: Last \\ 87: Focus On \\ 88: Latin, Greek, and Other Troublesome Plurals \\ 89: Around \\ 90: Nose \\ 91: Literal and Virtual \\ 92: Semicolon \\ 93: Colon \\ 94: Comparatives \\ 95: Tables \\ 96: Tense \\ 97: Abstracts \\ 98: Neither Nor \\ 99: Will Likely Be \\ 100: Importantly \\ 101: Since \\ 102: References \\ 103: Cannot Can Not \\ 104: Also \\ 105: Nonwords \\ 106: Missing That \\ 107: All of \\ 108: Utilize \\ 109: Dissertations \\ 110: Issue \\ 111: Terms for Describing Human-Computer Interaction \\ 112: So Called \\ 113: Note that Versus Notice that \\ 114: A Lot of \\ 115: Indices Versus Indexes \\ 116: Solids \\ 117: Equations \\ 118: Half \\ 119: Media \\ 120: Not Versus Rather than \\ 121: Visual Aids for Presentations \\ 122: Plural Acronyms \\ 123: Style Sheets and Spell Checkers \\ 124: Maybe Versus May Be \\ 125: Figures \\ 126: General-Specific Words \\ 127: Continuous Versus Continual \\ 128: Fewer Versus Less \\ 129: Italic Type \\ 130: Truncated Words \\ 131: Percent \\ 132: Object, Modifier, Activity \\ 133: Rewords \\ 134: Further Versus Farther \\ 135: Pronouns for Recipients \\ 136: Authorship on Research Articles \\ 137: Respectively \\ 138: Possessives \\ 139: Cliches, Jargon, and Euphemisms \\ 140: Design Elements \\ 141: Word Match \\ 142: Sex Versus Gender \\ 143: Awhile \\ 144: Footnotes \\ 145: Mouth \\ 146: Boxes \\ 147: Exercises, Examples, and Questions \\ 148: Writer's Block

entry:
@Book{Dupre:1995:BW,
  author =       "Lyn Dupr{\'e}",
  title =        "Bugs in Writing",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxxiii + 649",
  year =         "1995",
  ISBN =         "0-201-60019-6 (paperback)",
  ISBN-13 =      "978-0-201-60019-3 (paperback)",
  LCCN =         "PEI 408.D85 1995",
  bibdate =      "Tue May 12 08:12:28 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$19.95, CDN\$25.95",
  acknowledgement = ack-nhfb,
  DEWEY =        "808/.042 20",
  idnumber =     "524",
  tableofcontents = "1: Required Reading \\
                 2: Passive or Missing Agents \\
                 3: You and Your Reader \\
                 4: So, So That, Such That \\
                 5: Two or More \\
                 6: Only \\
                 7: Redundant Erms \\
                 8: Pronouns \\
                 9: Undefined this \\
                 10: Motivate \\
                 11: Oxymorons \\
                 12: Shall Versus Proved \\
                 13: Everyone, Someone, No one, None \\
                 14: Color \\
                 15: Effort \\
                 16: Which Versus That \\
                 17: Spread-Out Phrases \\
                 18: While \\
                 19: Repeated prepositions \\
                 20: Abbreviations and Acronyms \\
                 21: Verbize \\
                 22: Commas \\
                 23: Number Spelling \\
                 24: Impact \\
                 25: Lists \\
                 26: Like Versus Such as \\
                 27: Either and Both \\
                 28: Hyphens \\
                 29: Full Versus Incomplete Infinities \\
                 30: Titles \\
                 31: Contractions \\
                 32: Per \\
                 33: Number Styles \\
                 34: Quotations \\
                 35: Fuzzy Words \\
                 36: Parentheses \\
                 37: Split Infinitives \\
                 38: Is Due to \\
                 39: Center on \\
                 40: Quotation Marks \\
                 41: Remarks Inserted After That \\
                 42: Picture Captions \\
                 43: Data \\
                 44: Ensure, Assure, Insure \\
                 45: Foreword Versus Forward \\
                 46: Blocks: Theorems, Proofs, Lemmas \\
                 47: Above and Below \\
                 48: En Dashes \\
                 49: As to Whether \\
                 50: Who Versus That \\
                 51: Though \\
                 52: References to Parts \\
                 53: Dates and Times of Day \\
                 54: Reason is Because \\
                 55: With Terms \\
                 56: Equals \\
                 57: Placement of Adverbs \\
                 58: U.S. Versus British Spelling \\
                 59: Placement of Prepositions \\
                 60: Different from \\
                 61: Callouts \\
                 62: Exclamation Point \\
                 63: Deduce Versus Infer \\
                 64: Citations \\
                 65: The Fact that \\
                 66: Cross References \\
                 67: Proposals \\
                 68: Better, Best, Worst \\
                 69: Missing Words \\
                 70: Aggravate \\
                 71: Upon \\
                 72: Whether Versus If \\
                 73: Sections and Heads \\
                 74: Comprise \\
                 75: In Order to \\
                 76: Em Dashes \\
                 77: Eminent, Emanate, Imminent, Immanent \\
                 78: Expected but Nonarriving Agents \\
                 79: Its and It's \\
                 80: Adverbs Versus Adjectives \\
                 81: Persons Versus People \\
                 82: Cap /LC \\
                 83: Feel Versus Think \\
                 84: Parallelism \\
                 85: Points of Ellipsis \\
                 86: Last \\
                 87: Focus On \\
                 88: Latin, Greek, and Other Troublesome Plurals \\
                 89: Around \\
                 90: Nose \\
                 91: Literal and Virtual \\
                 92: Semicolon \\
                 93: Colon \\
                 94: Comparatives \\
                 95: Tables \\
                 96: Tense \\
                 97: Abstracts \\
                 98: Neither Nor \\
                 99: Will Likely Be \\
                 100: Importantly \\
                 101: Since \\
                 102: References \\
                 103: Cannot Can Not \\
                 104: Also \\
                 105: Nonwords \\
                 106: Missing That \\
                 107: All of \\
                 108: Utilize \\
                 109: Dissertations \\
                 110: Issue \\
                 111: Terms for Describing Human-Computer Interaction
                 \\
                 112: So Called \\
                 113: Note that Versus Notice that \\
                 114: A Lot of \\
                 115: Indices Versus Indexes \\
                 116: Solids \\
                 117: Equations \\
                 118: Half \\
                 119: Media \\
                 120: Not Versus Rather than \\
                 121: Visual Aids for Presentations \\
                 122: Plural Acronyms \\
                 123: Style Sheets and Spell Checkers \\
                 124: Maybe Versus May Be \\
                 125: Figures \\
                 126: General-Specific Words \\
                 127: Continuous Versus Continual \\
                 128: Fewer Versus Less \\
                 129: Italic Type \\
                 130: Truncated Words \\
                 131: Percent \\
                 132: Object, Modifier, Activity \\
                 133: Rewords \\
                 134: Further Versus Farther \\
                 135: Pronouns for Recipients \\
                 136: Authorship on Research Articles \\
                 137: Respectively \\
                 138: Possessives \\
                 139: Cliches, Jargon, and Euphemisms \\
                 140: Design Elements \\
                 141: Word Match \\
                 142: Sex Versus Gender \\
                 143: Awhile \\
                 144: Footnotes \\
                 145: Mouth \\
                 146: Boxes \\
                 147: Exercises, Examples, and Questions \\
                 148: Writer's Block",
}


bibtype: book
filename: master.bib
label: Dupre:1998:BWG
author: Lyn Dupre
title: BUGS in writing: a guide to debugging your prose
publisher: pub-AW
address: pub-AW:adr
edition: Revised.
pages: xxxv + 660
year: 1998
ISBN: 0-201-37921-X OR 020137921X
ISBN13: 978-0-201-37921-1 OR 9780201379211
LCCN: PE1408 .D85 1998
bibdate: Wed Jan 5 10:22:44 MST 2022
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2022.01.05 10:22:44 MST
subject: English language; Rhetoric; Grammar; Report writing
acknowledgement: ack-nhfb
rawauthor: Lyn Dupr{\'e}
rawtitle: {BUGS} in writing: a guide to debugging your prose
TOC:
Read Me: Ear 1: Passive or Missing Agents 2: You and Your Reader 3: So, So That, Such That 4: Two or More 5: Only 6: Redundant Terms 7: Pronouns 8: Undefined This 9: Motivate 10: Oxymorons 11: Shall Versus Will 12: Key Terms 13: Proven Versus Proved 14: Everyone, Someone, No One, None 15: Colon 16: Effort 17: Which Versus That 18: Spread-Out Phrases 19: While 20: Repeated Prepositions 21: Abbreviations and Acronyms 22: Verbize 23: Commas 24: Number Spelling 25: Impact 26: Lists 27: Like Versus Such As 28: Either and Both 29: Hyphens 30: Full Versus Incomplete Infinitives 31: Titles 32: Contractions 33: Per 34: Number Styles 35: Quotations 36: Fuzzy Words 37: Parentheses 38: Split Infinitives 39: Is Due To 40: Center On 41: Quotation Marks 42: Remarks Inserted After That 43: Figure Captions 44: Data 45: Ensure, Assure, Insure 46: Foreword Versus Forward 47: Blocks:Theorems, Proofs, Lemmas 48: Above and Below 49: En Dashes 50: As to Whether 51: Who Versus That 52: Though 53: References to Parts 54: Dates and Times of Day 55: Reason Is Because 56: With Terms 57: Equals 58: Placement of Adverbs 59: U.S. Versus British Spelling 60: Placement of Prepositions 61: Different From 62: Callouts 63: Exclamation Point 64: Deduce Versus Infer 65: Citations 66: The Fact That 67: Cross-References 68: Proposals 69: Better, Best, Worst ldots 291 70: Missing Words 71: Aggravate 72: Upon 73: Whether Versus If 74: Sections and Heads 75: Comprise 76: In Order To 77: Em Dashes 78: Eminent, Emanate, Imminent, Immanent 79: Expected but Nonarriving Agents 80: Its Versus It's 81: Adverbs Versus Adjectives 82: Persons Versus People 83: Cap / lc 84: Feel Versus Think 85: Parallelism 86: Points of Ellipsis 87: Last 88: Focus On 89: Troublesome Plurals 90: Around 91: Nose 92: Literal and Virtual 93: Semicolon 94: Code 95: Comparatives 96: Tables 97: Tense 98: Abstracts 99: Neither Nor 100: Will Likely Be 101: Importantly 102: Since 103: References 104: Cannot Versus Can Not 105: Also 106: Nonwords 107: Missing That 108: All Of 109: Utilize 110: Dissertations 111: Issue 112: Terms for Human-Computer Interaction 113: So Called 114: Note That Versus Notice That 115: Affect Versus Effect 116: Indices Versus Indexes 117: Solidus 118: Equations 119: Half 120: Media 121: Not Versus Rather Than 122: Visual Aids for Presentations 123: Plural Abbreviations 124: Style Sheets and Spell Checkers 125: Maybe Versus May Be 126: Figures 127: Gender-Specific Words 128: Continuous Versus Continual 129: Fewer Versus Less 130: Italic Type 131: Truncated Words 132: Percent 133: Object, Modifier, Activity 134: Rewords 135: Further Versus Farther 136: Pronouns for Recipients 137: Authorship on Research Articles 138: Respectively 139: Possessives 140: Cliches, Jargon, and Euphemisms 141: Design Elements and Eye 142: Word Match 143: Sex Versus Gender 144: Awhile 145: Footnotes 146: Mouth 147: Boxes 148: Exercises, Examples, and Questions 149: Writer's Block

rawTOC:
Read Me: Ear \\ 1: Passive or Missing Agents \\ 2: You and Your Reader \\ 3: So, So That, Such That \\ 4: Two or More \\ 5: Only \\ 6: Redundant Terms \\ 7: Pronouns \\ 8: Undefined This \\ 9: Motivate \\ 10: Oxymorons \\ 11: Shall Versus Will \\ 12: Key Terms \\ 13: Proven Versus Proved \\ 14: Everyone, Someone, No One, None \\ 15: Colon \\ 16: Effort \\ 17: Which Versus That \\ 18: Spread-Out Phrases \\ 19: While \\ 20: Repeated Prepositions \\ 21: Abbreviations and Acronyms \\ 22: Verbize \\ 23: Commas \\ 24: Number Spelling \\ 25: Impact \\ 26: Lists \\ 27: Like Versus Such As \\ 28: Either and Both \\ 29: Hyphens \\ 30: Full Versus Incomplete Infinitives \\ 31: Titles \\ 32: Contractions \\ 33: Per \\ 34: Number Styles \\ 35: Quotations \\ 36: Fuzzy Words \\ 37: Parentheses \\ 38: Split Infinitives \\ 39: Is Due To \\ 40: Center On \\ 41: Quotation Marks \\ 42: Remarks Inserted After That \\ 43: Figure Captions \\ 44: Data \\ 45: Ensure, Assure, Insure \\ 46: Foreword Versus Forward \\ 47: Blocks:Theorems, Proofs, Lemmas \\ 48: Above and Below \\ 49: En Dashes \\ 50: As to Whether \\ 51: Who Versus That \\ 52: Though \\ 53: References to Parts \\ 54: Dates and Times of Day \\ 55: Reason Is Because \\ 56: With Terms \\ 57: Equals \\ 58: Placement of Adverbs \\ 59: U.S. Versus British Spelling \\ 60: Placement of Prepositions \\ 61: Different From \\ 62: Callouts \\ 63: Exclamation Point \\ 64: Deduce Versus Infer \\ 65: Citations \\ 66: The Fact That \\ 67: Cross-References \\ 68: Proposals \\ 69: Better, Best, Worst \ldots{} 291 \\ 70: Missing Words \\ 71: Aggravate \\ 72: Upon \\ 73: Whether Versus If \\ 74: Sections and Heads \\ 75: Comprise \\ 76: In Order To \\ 77: Em Dashes \\ 78: Eminent, Emanate, Imminent, Immanent \\ 79: Expected but Nonarriving Agents \\ 80: Its Versus It's \\ 81: Adverbs Versus Adjectives \\ 82: Persons Versus People \\ 83: Cap / lc \\ 84: Feel Versus Think \\ 85: Parallelism \\ 86: Points of Ellipsis \\ 87: Last \\ 88: Focus On \\ 89: Troublesome Plurals \\ 90: Around \\ 91: Nose \\ 92: Literal and Virtual \\ 93: Semicolon \\ 94: Code \\ 95: Comparatives \\ 96: Tables \\ 97: Tense \\ 98: Abstracts \\ 99: Neither Nor \\ 100: Will Likely Be \\ 101: Importantly \\ 102: Since \\ 103: References \\ 104: Cannot Versus Can Not \\ 105: Also \\ 106: Nonwords \\ 107: Missing That \\ 108: All Of \\ 109: Utilize \\ 110: Dissertations \\ 111: Issue \\ 112: Terms for Human-Computer Interaction \\ 113: So Called \\ 114: Note That Versus Notice That \\ 115: Affect Versus Effect \\ 116: Indices Versus Indexes \\ 117: Solidus \\ 118: Equations \\ 119: Half \\ 120: Media \\ 121: Not Versus Rather Than \\ 122: Visual Aids for Presentations \\ 123: Plural Abbreviations \\ 124: Style Sheets and Spell Checkers \\ 125: Maybe Versus May Be \\ 126: Figures \\ 127: Gender-Specific Words \\ 128: Continuous Versus Continual \\ 129: Fewer Versus Less \\ 130: Italic Type \\ 131: Truncated Words \\ 132: Percent \\ 133: Object, Modifier, Activity \\ 134: Rewords \\ 135: Further Versus Farther \\ 136: Pronouns for Recipients \\ 137: Authorship on Research Articles \\ 138: Respectively \\ 139: Possessives \\ 140: Cliches, Jargon, and Euphemisms \\ 141: Design Elements and Eye \\ 142: Word Match \\ 143: Sex Versus Gender \\ 144: Awhile \\ 145: Footnotes \\ 146: Mouth \\ 147: Boxes \\ 148: Exercises, Examples, and Questions \\ 149: Writer's Block

entry:
@Book{Dupre:1998:BWG,
  author =       "Lyn Dupr{\'e}",
  title =        "{BUGS} in writing: a guide to debugging your prose",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Revised.",
  pages =        "xxxv + 660",
  year =         "1998",
  ISBN =         "0-201-37921-X",
  ISBN-13 =      "978-0-201-37921-1",
  LCCN =         "PE1408 .D85 1998",
  bibdate =      "Wed Jan 5 10:22:44 MST 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "English language; Rhetoric; Grammar; Report writing",
  tableofcontents = "Read Me: Ear \\
                 1: Passive or Missing Agents \\
                 2: You and Your Reader \\
                 3: So, So That, Such That \\
                 4: Two or More \\
                 5: Only \\
                 6: Redundant Terms \\
                 7: Pronouns \\
                 8: Undefined This \\
                 9: Motivate \\
                 10: Oxymorons \\
                 11: Shall Versus Will \\
                 12: Key Terms \\
                 13: Proven Versus Proved \\
                 14: Everyone, Someone, No One, None \\
                 15: Colon \\
                 16: Effort \\
                 17: Which Versus That \\
                 18: Spread-Out Phrases \\
                 19: While \\
                 20: Repeated Prepositions \\
                 21: Abbreviations and Acronyms \\
                 22: Verbize \\
                 23: Commas \\
                 24: Number Spelling \\
                 25: Impact \\
                 26: Lists \\
                 27: Like Versus Such As \\
                 28: Either and Both \\
                 29: Hyphens \\
                 30: Full Versus Incomplete Infinitives \\
                 31: Titles \\
                 32: Contractions \\
                 33: Per \\
                 34: Number Styles \\
                 35: Quotations \\
                 36: Fuzzy Words \\
                 37: Parentheses \\
                 38: Split Infinitives \\
                 39: Is Due To \\
                 40: Center On \\
                 41: Quotation Marks \\
                 42: Remarks Inserted After That \\
                 43: Figure Captions \\
                 44: Data \\
                 45: Ensure, Assure, Insure \\
                 46: Foreword Versus Forward \\
                 47: Blocks:Theorems, Proofs, Lemmas \\
                 48: Above and Below \\
                 49: En Dashes \\
                 50: As to Whether \\
                 51: Who Versus That \\
                 52: Though \\
                 53: References to Parts \\
                 54: Dates and Times of Day \\
                 55: Reason Is Because \\
                 56: With Terms \\
                 57: Equals \\
                 58: Placement of Adverbs \\
                 59: U.S. Versus British Spelling \\
                 60: Placement of Prepositions \\
                 61: Different From \\
                 62: Callouts \\
                 63: Exclamation Point \\
                 64: Deduce Versus Infer \\
                 65: Citations \\
                 66: The Fact That \\
                 67: Cross-References \\
                 68: Proposals \\
                 69: Better, Best, Worst \ldots{} 291 \\
                 70: Missing Words \\
                 71: Aggravate \\
                 72: Upon \\
                 73: Whether Versus If \\
                 74: Sections and Heads \\
                 75: Comprise \\
                 76: In Order To \\
                 77: Em Dashes \\
                 78: Eminent, Emanate, Imminent, Immanent \\
                 79: Expected but Nonarriving Agents \\
                 80: Its Versus It's \\
                 81: Adverbs Versus Adjectives \\
                 82: Persons Versus People \\
                 83: Cap / lc \\
                 84: Feel Versus Think \\
                 85: Parallelism \\
                 86: Points of Ellipsis \\
                 87: Last \\
                 88: Focus On \\
                 89: Troublesome Plurals \\
                 90: Around \\
                 91: Nose \\
                 92: Literal and Virtual \\
                 93: Semicolon \\
                 94: Code \\
                 95: Comparatives \\
                 96: Tables \\
                 97: Tense \\
                 98: Abstracts \\
                 99: Neither Nor \\
                 100: Will Likely Be \\
                 101: Importantly \\
                 102: Since \\
                 103: References \\
                 104: Cannot Versus Can Not \\
                 105: Also \\
                 106: Nonwords \\
                 107: Missing That \\
                 108: All Of \\
                 109: Utilize \\
                 110: Dissertations \\
                 111: Issue \\
                 112: Terms for Human-Computer Interaction \\
                 113: So Called \\
                 114: Note That Versus Notice That \\
                 115: Affect Versus Effect \\
                 116: Indices Versus Indexes \\
                 117: Solidus \\
                 118: Equations \\
                 119: Half \\
                 120: Media \\
                 121: Not Versus Rather Than \\
                 122: Visual Aids for Presentations \\
                 123: Plural Abbreviations \\
                 124: Style Sheets and Spell Checkers \\
                 125: Maybe Versus May Be \\
                 126: Figures \\
                 127: Gender-Specific Words \\
                 128: Continuous Versus Continual \\
                 129: Fewer Versus Less \\
                 130: Italic Type \\
                 131: Truncated Words \\
                 132: Percent \\
                 133: Object, Modifier, Activity \\
                 134: Rewords \\
                 135: Further Versus Farther \\
                 136: Pronouns for Recipients \\
                 137: Authorship on Research Articles \\
                 138: Respectively \\
                 139: Possessives \\
                 140: Cliches, Jargon, and Euphemisms \\
                 141: Design Elements and Eye \\
                 142: Word Match \\
                 143: Sex Versus Gender \\
                 144: Awhile \\
                 145: Footnotes \\
                 146: Mouth \\
                 147: Boxes \\
                 148: Exercises, Examples, and Questions \\
                 149: Writer's Block",
}


bibtype: book
filename: master.bib
label: Durbeck:1988:OHD
editor: Robert C. Durbeck and Sol Sherr
title: Output Hardcopy Devices
publisher: pub-ACADEMIC
address: pub-ACADEMIC:adr
pages: xii + 526
year: 1988
ISBN: 0-12-225040-0 OR 0122250400
ISBN13: 978-0-12-225040-8 OR 9780122250408
LCCN: TK7887.7 .O981 1988
bibdate: Tue Dec 14 22:47:46 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:47:46 ???
URL: http://www.sciencedirect.com/science/book/9780122250408
acknowledgement: ack-nhfb
raweditor: Robert C. Durbeck and Sol Sherr
rawtitle: Output Hardcopy Devices
note:
See article by Mike Parker on printer fonts, and undesirability of white-writing engines. I have not bought this book.

rawnote:
See article by Mike Parker on printer fonts, and undesirability of white-writing engines. I have not bought this book.

entry:
@Book{Durbeck:1988:OHD,
  editor =       "Robert C. Durbeck and Sol Sherr",
  title =        "Output Hardcopy Devices",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xii + 526",
  year =         "1988",
  ISBN =         "0-12-225040-0",
  ISBN-13 =      "978-0-12-225040-8",
  LCCN =         "TK7887.7 .O981 1988",
  bibdate =      "Tue Dec 14 22:47:46 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See article by Mike Parker on printer fonts, and
                 undesirability of white-writing engines. I have not
                 bought this book.",
  URL =          "http://www.sciencedirect.com/science/book/9780122250408",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: duSautoy:2003:MPS
author: Marcus du Sautoy
title: The music of the primes: searching to solve the greatest mystery in mathematics
publisher: pub-HARPERCOLLINS
address: pub-HARPERCOLLINS:adr
pages: 335
year: 2003
ISBN: 0-06-621070-4 OR 0066210704
ISBN13: 978-0-06-621070-4 OR 9780066210704
LCCN: QA246 .D8 2003
bibdate: Mon Aug 11 12:28:44 2003
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2003.08.11 12:28:44 ???
keywords: Numbers, Prime; Riemann, Bernhard, 1826--1866
acknowledgement: ack-nhfb
rawauthor: Marcus du Sautoy
rawtitle: The music of the primes: searching to solve the greatest mystery in mathematics
TOC:
Who wants to be a millionaire? The atoms of arithmetic Riemann's imaginary mathematical looking-glass The Riemann Hypothesis: From random primes to orderly zeros The mathematical relay race: Realising Riemann's revolution Ramanujan, the mathematical mystic Mathematical exodus: From Gottingen to Princeton Machines of the mind The computer age: From the mind to the desktop Cracking numbers and codes From orderly zeros to quantum chaos The missing piece of the jigsaw

rawTOC:
Who wants to be a millionaire? \\ The atoms of arithmetic \\ Riemann's imaginary mathematical looking-glass \\ The Riemann Hypothesis: From random primes to orderly zeros \\ The mathematical relay race: Realising Riemann's revolution \\ Ramanujan, the mathematical mystic \\ Mathematical exodus: From G{\"o}ttingen to Princeton \\ Machines of the mind \\ The computer age: From the mind to the desktop \\ Cracking numbers and codes \\ From orderly zeros to quantum chaos \\ The missing piece of the jigsaw

entry:
@Book{duSautoy:2003:MPS,
  author =       "Marcus du Sautoy",
  title =        "The music of the primes: searching to solve the
                 greatest mystery in mathematics",
  publisher =    pub-HARPERCOLLINS,
  address =      pub-HARPERCOLLINS:adr,
  pages =        "335",
  year =         "2003",
  ISBN =         "0-06-621070-4",
  ISBN-13 =      "978-0-06-621070-4",
  LCCN =         "QA246 .D8 2003",
  bibdate =      "Mon Aug 11 12:28:44 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$24.95, CAN\$38.95",
  acknowledgement = ack-nhfb,
  keywords =     "Numbers, Prime; Riemann, Bernhard, 1826--1866",
  tableofcontents = "Who wants to be a millionaire? \\
                 The atoms of arithmetic \\
                 Riemann's imaginary mathematical looking-glass \\
                 The Riemann Hypothesis: From random primes to orderly
                 zeros \\
                 The mathematical relay race: Realising Riemann's
                 revolution \\
                 Ramanujan, the mathematical mystic \\
                 Mathematical exodus: From G{\"o}ttingen to Princeton
                 \\
                 Machines of the mind \\
                 The computer age: From the mind to the desktop \\
                 Cracking numbers and codes \\
                 From orderly zeros to quantum chaos \\
                 The missing piece of the jigsaw",
}


bibtype: book
filename: master.bib
label: Dushman:1938:EQM
author: Saul Dushman
title: The Elements of Quantum Mechanics
publisher: pub-WILEY
address: pub-WILEY:adr
pages: xiii + 452
year: 1938
LCCN: QC174.1 .D8
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: Saul Dushman
rawtitle: The Elements of Quantum Mechanics
entry:
@Book{Dushman:1938:EQM,
  author =       "Saul Dushman",
  title =        "The Elements of Quantum Mechanics",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xiii + 452",
  year =         "1938",
  LCCN =         "QC174.1 .D8",
  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: article
filename: master.bib
label: Dvonch:color-pdl
author: Mary Ann Dvonch and Paul Roetling and Robert Buckley
title: Color Descriptors in Page Description Languages
journal: j-PROC-SID
volume: 30
number: 2
pages: 177--181
year: 1989
bibdate: Sun Dec 4 12:30:46 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.12.04 12:30:46 ???
acknowledgement: ack-nhfb
rawauthor: Mary Ann Dvonch and Paul Roetling and Robert Buckley
rawtitle: Color Descriptors in Page Description Languages
entry:
@Article{Dvonch:color-pdl,
  author =       "Mary Ann Dvonch and Paul Roetling and Robert Buckley",
  title =        "Color Descriptors in Page Description Languages",
  journal =      j-PROC-SID,
  volume =       "30",
  number =       "2",
  pages =        "177--181",
  year =         "1989",
  bibdate =      "Sun Dec 4 12:30:46 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Dybvig:1987:SPL
author: R. Kent Dybvig
title: The SCHEME programming language
publisher: pub-PH
address: pub-PH:adr
pages: 242
year: 1987
ISBN: 0-13-791864-X (paperback) OR 013791864X (paperback)
ISBN13: 978-0-13-791864-5 (paperback) OR 9780137918645 (paperback)
LCCN: QA76.73.S34 D93 1987
bibdate: Sat Jan 19 08:19:21 MST 2019
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2019.01.19 08:19:21 MST
subject: SCHEME (Computer program language); computer systems
acknowledgement: ack-nhfb
rawauthor: R. Kent Dybvig
rawtitle: The {SCHEME} programming language
TOC:
Preface / ix Introduction / 1 Getting Started / 11 Going Further / 55 Procedures and Variable Bindings / 83 Control Operations / 93 Operations as Objects / 119 Input and Output / 169 Syntactic Extension / 181 Extended Examples / 211 Bibliography / 259 Answers to Selected Exercises / 261 Formal Syntax of Scheme / 277 Summary of Forms / 281 Index / 289

rawTOC:
Preface / ix \\ Introduction / 1 \\ Getting Started / 11 \\ Going Further / 55 \\ Procedures and Variable Bindings / 83 \\ Control Operations / 93 \\ Operations as Objects / 119 \\ Input and Output / 169 \\ Syntactic Extension / 181 \\ Extended Examples / 211 \\ Bibliography / 259 \\ Answers to Selected Exercises / 261 \\ Formal Syntax of Scheme / 277 \\ Summary of Forms / 281 \\ Index / 289

entry:
@Book{Dybvig:1987:SPL,
  author =       "R. Kent Dybvig",
  title =        "The {SCHEME} programming language",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "242",
  year =         "1987",
  ISBN =         "0-13-791864-X (paperback)",
  ISBN-13 =      "978-0-13-791864-5 (paperback)",
  LCCN =         "QA76.73.S34 D93 1987",
  bibdate =      "Sat Jan 19 08:19:21 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  subject =      "SCHEME (Computer program language); computer systems",
  tableofcontents = "Preface / ix \\
                 Introduction / 1 \\
                 Getting Started / 11 \\
                 Going Further / 55 \\
                 Procedures and Variable Bindings / 83 \\
                 Control Operations / 93 \\
                 Operations as Objects / 119 \\
                 Input and Output / 169 \\
                 Syntactic Extension / 181 \\
                 Extended Examples / 211 \\
                 Bibliography / 259 \\
                 Answers to Selected Exercises / 261 \\
                 Formal Syntax of Scheme / 277 \\
                 Summary of Forms / 281 \\
                 Index / 289",
}


bibtype: book
filename: master.bib
label: Dybvig:1996:SPL
author: R. Kent Dybvig
title: The SCHEME Programming Language: ANSI Scheme
publisher: pub-PH
address: pub-PH:adr
edition: Second
pages: xii + 248
year: 1996
ISBN: 0-13-454646-6 OR 0134546466
ISBN13: 978-0-13-454646-9 OR 9780134546469
LCCN: QA76.73.S34 D93 1996
bibdate: Thu May 09 14:09:08 2002
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2002.05.09 14:09:08 ???
URL: http://www.scheme.com/tspl2d/
acknowledgement: ack-nhfb
rawauthor: R. Kent Dybvig
rawtitle: The {SCHEME} Programming Language: {ANSI} Scheme
abstract:
Scheme is a general purpose programming language descended from Algol and Lisp. Because it is conceptually clean and simple, it is an easy language to learn. At the same time, it is a powerful language, and full mastery of its power requires careful study and practice. Scheme is widely used in computing education and research, as well as for a broad spectrum of industrial applications ranging from graphical user interfaces and language compilers to virtual reality engines, web navigators, and enterprise computing solutions. This revised edition of booktitle The Scheme Programming Language provides an introduction to the language for readers with some programming experience. Beginning with a gentle introduction for novice Scheme programmers, it leads the reader through a series of progressively more difficult examples that introduce each of the major features of the language. Advanced concepts and features are thoroughly covered with examples and exercises appropriate even for more experienced programmers.

TOC:
1: Introduction Scheme Syntax Scheme Naming Conventions Typographical and Notational Conventions 2: Getting Started Interacting with Scheme Simple Expressions Evaluating Scheme Expressions Variables and Let Expressions Lambda Expressions Top-Level Definitions Conditional Expressions Simple Recursion Assignment 3: Going Further Syntactic Extension More Recursion Continuations Continuation Passing Style Internal Definitions 4: Variable Binding Variable References Lambda Local Binding Variable Definitions Assignment 5: Control Operations Constants and Quotation Procedure Application Sequencing Conditionals Recursion, Iteration, and Mapping Continuations Delayed Evaluation Multiple Values Eval 6: Operations on Objects Generic Equivalence and Type Predicates Lists and Pairs Numbers Characters Strings Vectors Symbols 7: Input and Output Input Operations Output Operations Loading Programs Transcript Files 8: Syntactic Extension Keyword Bindings Syntax-Rules Transformers Syntax-Case Transformers Examples 9: Extended Examples Matrix and Vector Multiplication List Sorting A Set Constructor Word Frequency Counting Scheme Printer Formatted Output A Meta-Circular Interpreter for Scheme Defining Abstract Objects Fast Fourier Transform A Unification Algorithm Multitasking with Engines Bibliography Formal Syntax of Scheme Summary of Forms Index

rawabstract:
Scheme is a general purpose programming language descended from Algol and Lisp. Because it is conceptually clean and simple, it is an easy language to learn. At the same time, it is a powerful language, and full mastery of its power requires careful study and practice. Scheme is widely used in computing education and research, as well as for a broad spectrum of industrial applications ranging from graphical user interfaces and language compilers to virtual reality engines, web navigators, and enterprise computing solutions. This revised edition of \booktitle{The Scheme Programming Language} provides an introduction to the language for readers with some programming experience. Beginning with a gentle introduction for novice Scheme programmers, it leads the reader through a series of progressively more difficult examples that introduce each of the major features of the language. Advanced concepts and features are thoroughly covered with examples and exercises appropriate even for more experienced programmers.

rawTOC:
1: Introduction \\ Scheme Syntax \\ Scheme Naming Conventions \\ Typographical and Notational Conventions \\ 2: \\ Getting Started \\ Interacting with Scheme \\ Simple Expressions \\ Evaluating Scheme Expressions \\ Variables and Let Expressions \\ Lambda Expressions \\ Top-Level Definitions \\ Conditional Expressions \\ Simple Recursion \\ Assignment \\ 3: \\ Going Further \\ Syntactic Extension \\ More Recursion \\ Continuations \\ Continuation Passing Style \\ Internal Definitions \\ 4: \\ Variable Binding \\ Variable References \\ Lambda \\ Local Binding \\ Variable Definitions \\ Assignment \\ 5: \\ Control Operations \\ Constants and Quotation \\ Procedure Application \\ Sequencing \\ Conditionals \\ Recursion, Iteration, and Mapping \\ Continuations \\ Delayed Evaluation \\ Multiple \\ Values \\ Eval \\ 6: \\ Operations on Objects \\ Generic Equivalence and Type Predicates \\ Lists and Pairs \\ Numbers \\ Characters \\ Strings \\ Vectors \\ Symbols \\ 7: \\ Input and Output \\ Input Operations \\ Output Operations \\ Loading Programs \\ Transcript Files \\ 8: \\ Syntactic Extension \\ Keyword Bindings \\ Syntax-Rules Transformers \\ Syntax-Case Transformers \\ Examples \\ 9: \\ Extended Examples \\ Matrix and Vector Multiplication \\ List Sorting \\ A Set Constructor \\ Word Frequency Counting \\ Scheme Printer \\ Formatted Output \\ A Meta-Circular Interpreter for Scheme \\ Defining Abstract Objects \\ Fast Fourier Transform \\ A Unification Algorithm \\ Multitasking with Engines \\ Bibliography \\ Formal Syntax of Scheme \\ Summary of Forms \\ Index

entry:
@Book{Dybvig:1996:SPL,
  author =       "R. Kent Dybvig",
  title =        "The {SCHEME} Programming Language: {ANSI} Scheme",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Second",
  pages =        "xii + 248",
  year =         "1996",
  ISBN =         "0-13-454646-6",
  ISBN-13 =      "978-0-13-454646-9",
  LCCN =         "QA76.73.S34 D93 1996",
  bibdate =      "Thu May 09 14:09:08 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$64.00",
  URL =          "http://www.scheme.com/tspl2d/",
  abstract =     "Scheme is a general purpose programming language
                 descended from Algol and Lisp. Because it is
                 conceptually clean and simple, it is an easy language
                 to learn. At the same time, it is a powerful language,
                 and full mastery of its power requires careful study
                 and practice. Scheme is widely used in computing
                 education and research, as well as for a broad spectrum
                 of industrial applications ranging from graphical user
                 interfaces and language compilers to virtual reality
                 engines, web navigators, and enterprise computing
                 solutions. This revised edition of \booktitle{The
                 Scheme Programming Language} provides an introduction
                 to the language for readers with some programming
                 experience. Beginning with a gentle introduction for
                 novice Scheme programmers, it leads the reader through
                 a series of progressively more difficult examples that
                 introduce each of the major features of the language.
                 Advanced concepts and features are thoroughly covered
                 with examples and exercises appropriate even for more
                 experienced programmers.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "1: Introduction \\
                 Scheme Syntax \\
                 Scheme Naming Conventions \\
                 Typographical and Notational Conventions \\
                 2: \\
                 Getting Started \\
                 Interacting with Scheme \\
                 Simple Expressions \\
                 Evaluating Scheme Expressions \\
                 Variables and Let Expressions \\
                 Lambda Expressions \\
                 Top-Level Definitions \\
                 Conditional Expressions \\
                 Simple Recursion \\
                 Assignment \\
                 3: \\
                 Going Further \\
                 Syntactic Extension \\
                 More Recursion \\
                 Continuations \\
                 Continuation Passing Style \\
                 Internal Definitions \\
                 4: \\
                 Variable Binding \\
                 Variable References \\
                 Lambda \\
                 Local Binding \\
                 Variable Definitions \\
                 Assignment \\
                 5: \\
                 Control Operations \\
                 Constants and Quotation \\
                 Procedure Application \\
                 Sequencing \\
                 Conditionals \\
                 Recursion, Iteration, and Mapping \\
                 Continuations \\
                 Delayed Evaluation \\
                 Multiple \\
                 Values \\
                 Eval \\
                 6: \\
                 Operations on Objects \\
                 Generic Equivalence and Type Predicates \\
                 Lists and Pairs \\
                 Numbers \\
                 Characters \\
                 Strings \\
                 Vectors \\
                 Symbols \\
                 7: \\
                 Input and Output \\
                 Input Operations \\
                 Output Operations \\
                 Loading Programs \\
                 Transcript Files \\
                 8: \\
                 Syntactic Extension \\
                 Keyword Bindings \\
                 Syntax-Rules Transformers \\
                 Syntax-Case Transformers \\
                 Examples \\
                 9: \\
                 Extended Examples \\
                 Matrix and Vector Multiplication \\
                 List Sorting \\
                 A Set Constructor \\
                 Word Frequency Counting \\
                 Scheme Printer \\
                 Formatted Output \\
                 A Meta-Circular Interpreter for Scheme \\
                 Defining Abstract Objects \\
                 Fast Fourier Transform \\
                 A Unification Algorithm \\
                 Multitasking with Engines \\
                 Bibliography \\
                 Formal Syntax of Scheme \\
                 Summary of Forms \\
                 Index",
}


bibtype: book
filename: master.bib
label: Dybvig:2003:SPL
author: R. Kent Dybvig
title: The Scheme programming language
publisher: pub-MIT
address: pub-MIT:adr
edition: Third
pages: xi + 295
year: 2003
ISBN: 0-262-54148-3 (paperback) OR 0262541483 (paperback)
ISBN13: 978-0-262-54148-0 (paperback) OR 9780262541480 (paperback)
LCCN: QA76.73.S34.D93; QA76.73.S34.D93 2003
bibdate: Mon Mar 20 16:43:23 MST 2006
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; library.mit.edu:9909/mit01
bibtimestamp: 2006.03.20 16:43:23 MST
subject: Scheme (Computer program language)
acknowledgement: ack-nhfb
rawauthor: R. Kent Dybvig
rawtitle: The {Scheme} programming language
TOC:
1. Introduction 2. Getting Started 3. Going Further 4. Procedures and Variable Bindings 5. Control Operations 6. Operations on Objects 7. Input and Output 8. Syntactic Extension 9. Extended Examples

rawTOC:
1. Introduction\\ 2. Getting Started\\ 3. Going Further\\ 4. Procedures and Variable Bindings\\ 5. Control Operations\\ 6. Operations on Objects\\ 7. Input and Output\\ 8. Syntactic Extension\\ 9. Extended Examples

entry:
@Book{Dybvig:2003:SPL,
  author =       "R. Kent Dybvig",
  title =        "The {Scheme} programming language",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  edition =      "Third",
  pages =        "xi + 295",
  year =         "2003",
  ISBN =         "0-262-54148-3 (paperback)",
  ISBN-13 =      "978-0-262-54148-0 (paperback)",
  LCCN =         "QA76.73.S34.D93; QA76.73.S34.D93 2003",
  bibdate =      "Mon Mar 20 16:43:23 MST 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.mit.edu:9909/mit01",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Scheme (Computer program language)",
  tableofcontents = "1. Introduction\\
                 2. Getting Started\\
                 3. Going Further\\
                 4. Procedures and Variable Bindings\\
                 5. Control Operations\\
                 6. Operations on Objects\\
                 7. Input and Output\\
                 8. Syntactic Extension\\
                 9. Extended Examples",
}


bibtype: book
filename: master.bib
label: Dyer:1965:AAS
author: John R. (John Robert) Dyer
title: Applications of Absorption Spectroscopy of Organic Compounds
publisher: pub-PH
address: pub-PH:adr
pages: x + 147
year: 1965
LCCN: QD476 .D9
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: John R. (John Robert) Dyer
rawtitle: Applications of Absorption Spectroscopy of Organic Compounds
entry:
@Book{Dyer:1965:AAS,
  author =       "John R. (John Robert) Dyer",
  title =        "Applications of Absorption Spectroscopy of Organic
                 Compounds",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "x + 147",
  year =         "1965",
  LCCN =         "QD476 .D9",
  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: Dylla:2020:SJP
author: H. Frederick Dylla
booktitle: Scientific Journeys: a Physicist Explores the Culture, History and Personalities of Science
title: Scientific Journeys: a Physicist Explores the Culture, History and Personalities of Science
publisher: Springer
address: Cham, Switzerland
pages: xxv + 222
year: 2020
DOI: https://doi.org/10.1007/978-3-030-55800-0
ISBN: 3-030-55799-5 (paperback), 3-030-55800-2 (e-book) OR 3030557995 (paperback), 3030558002 (ebook)
LCCN: Q125 .D955 2020
bibdate: Tue May 4 06:37:04 MDT 2021
bibtimestamp: 2021.05.04 06:37:04 MDT
acknowledgement: ack-nhfb
rawauthor: H. Frederick Dylla
rawbooktitle: Scientific Journeys: a Physicist Explores the Culture, History and Personalities of Science
rawtitle: Scientific Journeys: a Physicist Explores the Culture, History and Personalities of Science
ISBN13:
978-3-030-55799-7 (paperback), 978-3-030-55800-0 (e-book) OR 9783030557997 (paperback), 9783030558000 (ebook)

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

abstract:
This collection of essays traces a scientific journey bookmarked by remarkable mentors and milestones of science. It provides fascinating reading for everyone interested in the history, public appreciation, and value of science, as well as giving first-hand accounts of many key events and prominent figures. The author was one of the ``sputnik kids'' growing up in the US at the start of the space age. He built a working laser just two years after they were first invented, an experience that convinced him to become a physicist. During his 50-year career in physics, many personalities and notable events in science and technology helped to form his view of how science contributes to the modern world, including his conviction that the impact of science can be most effective when introduced within the context of the humanities --- especially history, literature and the arts. From the Foreword by former U.S. Congressman, Rush D. Holt: In this volume, we have the wide-ranging thoughts and observations of Fred Dylla, an accomplished physicist with an engineer's fascination for gadgets, a historian's long perspective, an artist's aesthetic eye, and a teacher's passion for sharing ideas. Throughout his varied career [ldots ] his curiosity has been his foremost characteristic and his ability to see the connection between apparently disparate things his greatest skill. [ldots ] Here he examines the roots and growth of innovation in examples from Bell Laboratories, Edison Electric Light Company, and cubist painter Georges Braque. He considers the essential place of publishing in science, that epochal intellectual technique for learning how the world works. He shows the human enrichment and practical benefits that derive from wise investments in scientific research, as well as the waste resulting from a failure to embrace appropriate technologies.

subject:
Physics; Science; Social aspects; Technology; History, Modern; Printing; Publishers and publishing; Popular Science in Physics; Societal Aspects of Physics, Outreach and Education; Popular Science in Technology; Modern History; Printing and Publishing; US Politics; History, Modern; Physics; Printing; Publishers and publishing; Social aspects; Technology; United States; Politics and government

TOC:
Part I: Signposts 1: Literature and Legacy Flow Along the Rhine / 3 2: Invention and Discovery: Fleming and Edison / 7 3: Rutherford's Nuclear World / 11 4: Fueling Science for War and Peace / 17 5: Shelter Island's Famous Physicists / 21 6: Feynman's Scientific Integrity / 25 7: Calculating from Memory / 29 8: The Electronic Water Cooler / 33 9: Lessons from Steve Jobs / 37 10: What We Hear from Bose / 41 11: The French Connection / 45 12: Mr. Fresnel's Gift to the World / 49 13: Lighting the Way for Innovation / 53 14: China's Science Ambassador / 59 15: Bringing Science Back to Vietnam / 63 Part II: Mentors and Milestones 16: Exciting the Imagination: My First Laser / 69 17: The Master Teacher / 75 18: How Long is the Fuse on Fusion? 83 19: Excitement and Disappointment: The Emotions of Science / 89 20: Considering Future Energy Options: Extrapolations from a Real Experiment / 93 21: My Encounters with the Queen of Carbon / 97 22: A Prize Hidden Under a Piece of Tape / 101 23: The Big Machine / 105 24: The Collider that Couldn't / 111 25: One Man Can Make a Difference / 115 26: A Bright Light in Virginia / 125 27: Gravity's Songs / 133 Part III: Science Policy Matters 28: Innovation in a Young Nation / 143 29: Big and Small Science: No Need to Choose / 147 30: Reminding All of Us That Basic Research Pays Off / 149 31: Science and Engineering: Hand-in-Hand / 153 32: The Professor is on the Screen / 157 33: Go Visit a Science Museum / 161 Part IV: Communicating Science 34: Illuminating Manuscripts / 167 35: Science Must Navigate the Gale of Creative Destruction / 171 36: Roundtables Help / 175 37: Imagine a World Without Editors / 179 38: Please Read My Paper / 183 39: Getting It Right / 187 40: A Vision for Open Scholarship / 191 41: The Scientific Journal Marks 350 / 193 Part V: Art and Science 42: Time Exposed for Science / 199 43: Science, Art, and Theater / 203 44: In and Out of the Plane / 207 45 Following the White Line / 211 Acknowledgements / 217 Epilogue / 221

rawabstract:
This collection of essays traces a scientific journey bookmarked by remarkable mentors and milestones of science. It provides fascinating reading for everyone interested in the history, public appreciation, and value of science, as well as giving first-hand accounts of many key events and prominent figures. The author was one of the ``sputnik kids'' growing up in the US at the start of the space age. He built a working laser just two years after they were first invented, an experience that convinced him to become a physicist. During his 50-year career in physics, many personalities and notable events in science and technology helped to form his view of how science contributes to the modern world, including his conviction that the impact of science can be most effective when introduced within the context of the humanities --- especially history, literature and the arts. From the Foreword by former U.S. Congressman, Rush D. Holt: In this volume, we have the wide-ranging thoughts and observations of Fred Dylla, an accomplished physicist with an engineer's fascination for gadgets, a historian's long perspective, an artist's aesthetic eye, and a teacher's passion for sharing ideas. Throughout his varied career [\ldots{}] his curiosity has been his foremost characteristic and his ability to see the connection between apparently disparate things his greatest skill. [\ldots{}] Here he examines the roots and growth of innovation in examples from Bell Laboratories, Edison Electric Light Company, and cubist painter Georges Braque. He considers the essential place of publishing in science, that epochal intellectual technique for learning how the world works. He shows the human enrichment and practical benefits that derive from wise investments in scientific research, as well as the waste resulting from a failure to embrace appropriate technologies.

shortTOC:
Introduction Part 1: Signposts Part 2: Mentors and Milestones Part 3: Science Policy Matters Part 4: Communicating Science Part 5: Art and Science Epilogue

rawshortTOC:
Introduction \\ Part 1: Signposts \\ Part 2: Mentors and Milestones \\ Part 3: Science Policy Matters \\ Part 4: Communicating Science \\ Part 5: Art and Science \\ Epilogue

rawTOC:
Part I: Signposts \\ 1: Literature and Legacy Flow Along the Rhine / 3 \\ 2: Invention and Discovery: Fleming and Edison / 7 \\ 3: Rutherford's Nuclear World / 11 \\ 4: Fueling Science for War and Peace / 17 \\ 5: Shelter Island's Famous Physicists / 21 \\ 6: Feynman's Scientific Integrity / 25 \\ 7: Calculating from Memory / 29 \\ 8: The Electronic Water Cooler / 33 \\ 9: Lessons from Steve Jobs / 37 \\ 10: What We Hear from Bose / 41 \\ 11: The French Connection / 45 \\ 12: Mr. Fresnel's Gift to the World / 49 \\ 13: Lighting the Way for Innovation / 53 \\ 14: China's Science Ambassador / 59 \\ 15: Bringing Science Back to Vietnam / 63 \\ Part II: Mentors and Milestones \\ 16: Exciting the Imagination: My First Laser / 69 \\ 17: The Master Teacher / 75 \\ 18: How Long is the Fuse on Fusion? 83 \\ 19: Excitement and Disappointment: The Emotions of Science / 89 \\ 20: Considering Future Energy Options: Extrapolations from a Real Experiment / 93 \\ 21: My Encounters with the Queen of Carbon / 97 \\ 22: A Prize Hidden Under a Piece of Tape / 101 \\ 23: The Big Machine / 105 \\ 24: The Collider that Couldn't / 111 \\ 25: One Man Can Make a Difference / 115 \\ 26: A Bright Light in Virginia / 125 \\ 27: Gravity's Songs / 133 \\ Part III: Science Policy Matters \\ 28: Innovation in a Young Nation / 143 \\ 29: Big and Small Science: No Need to Choose / 147 \\ 30: Reminding All of Us That Basic Research Pays Off / 149 \\ 31: Science and Engineering: Hand-in-Hand / 153 \\ 32: The Professor is on the Screen / 157 \\ 33: Go Visit a Science Museum / 161 \\ Part IV: Communicating Science \\ 34: Illuminating Manuscripts / 167 \\ 35: Science Must Navigate the Gale of Creative Destruction / 171 \\ 36: Roundtables Help / 175 \\ 37: Imagine a World Without Editors / 179 \\ 38: Please Read My Paper / 183 \\ 39: Getting It Right / 187 \\ 40: A Vision for Open Scholarship / 191 \\ 41: The Scientific Journal Marks 350 / 193 \\ Part V: Art and Science \\ 42: Time Exposed for Science / 199 \\ 43: Science, Art, and Theater / 203 \\ 44: In and Out of the Plane / 207 \\ 45 Following the White Line / 211 \\ Acknowledgements / 217 \\ Epilogue / 221

entry:
@Book{Dylla:2020:SJP,
  author =       "H. Frederick Dylla",
  booktitle =    "Scientific Journeys: a Physicist Explores the Culture,
                 History and Personalities of Science",
  title =        "Scientific Journeys: a Physicist Explores the Culture,
                 History and Personalities of Science",
  publisher =    "Springer",
  address =      "Cham, Switzerland",
  pages =        "xxv + 222",
  year =         "2020",
  DOI =          "https://doi.org/10.1007/978-3-030-55800-0",
  ISBN =         "3-030-55799-5 (paperback), 3-030-55800-2 (e-book)",
  ISBN-13 =      "978-3-030-55799-7 (paperback), 978-3-030-55800-0
                 (e-book)",
  LCCN =         "Q125 .D955 2020",
  bibdate =      "Tue May 4 06:37:04 MDT 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/f/feynman-richard-p.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/r/rutherford-ernest.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "This collection of essays traces a scientific journey
                 bookmarked by remarkable mentors and milestones of
                 science. It provides fascinating reading for everyone
                 interested in the history, public appreciation, and
                 value of science, as well as giving first-hand accounts
                 of many key events and prominent figures. The author
                 was one of the ``sputnik kids'' growing up in the US at
                 the start of the space age. He built a working laser
                 just two years after they were first invented, an
                 experience that convinced him to become a physicist.
                 During his 50-year career in physics, many
                 personalities and notable events in science and
                 technology helped to form his view of how science
                 contributes to the modern world, including his
                 conviction that the impact of science can be most
                 effective when introduced within the context of the
                 humanities --- especially history, literature and the
                 arts. From the Foreword by former U.S. Congressman,
                 Rush D. Holt: In this volume, we have the wide-ranging
                 thoughts and observations of Fred Dylla, an
                 accomplished physicist with an engineer's fascination
                 for gadgets, a historian's long perspective, an
                 artist's aesthetic eye, and a teacher's passion for
                 sharing ideas. Throughout his varied career [\ldots{}]
                 his curiosity has been his foremost characteristic and
                 his ability to see the connection between apparently
                 disparate things his greatest skill. [\ldots{}] Here he
                 examines the roots and growth of innovation in examples
                 from Bell Laboratories, Edison Electric Light Company,
                 and cubist painter Georges Braque. He considers the
                 essential place of publishing in science, that epochal
                 intellectual technique for learning how the world
                 works. He shows the human enrichment and practical
                 benefits that derive from wise investments in
                 scientific research, as well as the waste resulting
                 from a failure to embrace appropriate technologies.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Introduction \\
                 Part 1: Signposts \\
                 Part 2: Mentors and Milestones \\
                 Part 3: Science Policy Matters \\
                 Part 4: Communicating Science \\
                 Part 5: Art and Science \\
                 Epilogue",
  subject =      "Physics; Science; Social aspects; Technology; History,
                 Modern; Printing; Publishers and publishing; Popular
                 Science in Physics; Societal Aspects of Physics,
                 Outreach and Education; Popular Science in Technology;
                 Modern History; Printing and Publishing; US Politics;
                 History, Modern; Physics; Printing; Publishers and
                 publishing; Social aspects; Technology; United States;
                 Politics and government",
  tableofcontents = "Part I: Signposts \\
                 1: Literature and Legacy Flow Along the Rhine / 3 \\
                 2: Invention and Discovery: Fleming and Edison / 7 \\
                 3: Rutherford's Nuclear World / 11 \\
                 4: Fueling Science for War and Peace / 17 \\
                 5: Shelter Island's Famous Physicists / 21 \\
                 6: Feynman's Scientific Integrity / 25 \\
                 7: Calculating from Memory / 29 \\
                 8: The Electronic Water Cooler / 33 \\
                 9: Lessons from Steve Jobs / 37 \\
                 10: What We Hear from Bose / 41 \\
                 11: The French Connection / 45 \\
                 12: Mr. Fresnel's Gift to the World / 49 \\
                 13: Lighting the Way for Innovation / 53 \\
                 14: China's Science Ambassador / 59 \\
                 15: Bringing Science Back to Vietnam / 63 \\
                 Part II: Mentors and Milestones \\
                 16: Exciting the Imagination: My First Laser / 69 \\
                 17: The Master Teacher / 75 \\
                 18: How Long is the Fuse on Fusion? 83 \\
                 19: Excitement and Disappointment: The Emotions of
                 Science / 89 \\
                 20: Considering Future Energy Options: Extrapolations
                 from a Real Experiment / 93 \\
                 21: My Encounters with the Queen of Carbon / 97 \\
                 22: A Prize Hidden Under a Piece of Tape / 101 \\
                 23: The Big Machine / 105 \\
                 24: The Collider that Couldn't / 111 \\
                 25: One Man Can Make a Difference / 115 \\
                 26: A Bright Light in Virginia / 125 \\
                 27: Gravity's Songs / 133 \\
                 Part III: Science Policy Matters \\
                 28: Innovation in a Young Nation / 143 \\
                 29: Big and Small Science: No Need to Choose / 147 \\
                 30: Reminding All of Us That Basic Research Pays Off /
                 149 \\
                 31: Science and Engineering: Hand-in-Hand / 153 \\
                 32: The Professor is on the Screen / 157 \\
                 33: Go Visit a Science Museum / 161 \\
                 Part IV: Communicating Science \\
                 34: Illuminating Manuscripts / 167 \\
                 35: Science Must Navigate the Gale of Creative
                 Destruction / 171 \\
                 36: Roundtables Help / 175 \\
                 37: Imagine a World Without Editors / 179 \\
                 38: Please Read My Paper / 183 \\
                 39: Getting It Right / 187 \\
                 40: A Vision for Open Scholarship / 191 \\
                 41: The Scientific Journal Marks 350 / 193 \\
                 Part V: Art and Science \\
                 42: Time Exposed for Science / 199 \\
                 43: Science, Art, and Theater / 203 \\
                 44: In and Out of the Plane / 207 \\
                 45 Following the White Line / 211 \\
                 Acknowledgements / 217 \\
                 Epilogue / 221",
}


bibtype: book
filename: master.bib
label: Dyson:2010:MCG
author: Freeman J. Dyson
title: Many-Colored Glass: Reflections on the Place of Life in the Universe
publisher: University of Virginia Press
address: Charlottesville, VA, USA
pages: xi + 162
year: 2010
ISBN: 0-8139-2973-3 OR 0813929733
ISBN13: 978-0-8139-2973-6 OR 9780813929736
LCCN: QH501 .D97 2010
bibdate: Mon Oct 18 16:54:08 MDT 2010
bibtimestamp: 2010.10.18 16:54:08 MDT
note: Page--Barbour Lectures for 2004.
keywords: Fermi Paradox
remark: Hardback edition 2007. Paperback edition 2010.
acknowledgement: ack-nhfb
rawauthor: Freeman J. Dyson
rawnote: Page--Barbour Lectures for 2004.
rawtitle: Many-Colored Glass: Reflections on the Place of Life in the Universe
bibsource:
fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

TOC:
The future of biotechnology A debate with Bill Joy Heretical thoughts about science and society A friendly universe Can life go on forever? Looking for life The varieties of human experience

rawTOC:
The future of biotechnology \\ A debate with Bill Joy \\ Heretical thoughts about science and society \\ A friendly universe \\ Can life go on forever? \\ Looking for life \\ The varieties of human experience

entry:
@Book{Dyson:2010:MCG,
  author =       "Freeman J. Dyson",
  title =        "Many-Colored Glass: Reflections on the Place of Life
                 in the Universe",
  publisher =    "University of Virginia Press",
  address =      "Charlottesville, VA, USA",
  pages =        "xi + 162",
  year =         "2010",
  ISBN =         "0-8139-2973-3",
  ISBN-13 =      "978-0-8139-2973-6",
  LCCN =         "QH501 .D97 2010",
  bibdate =      "Mon Oct 18 16:54:08 MDT 2010",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Page--Barbour Lectures for 2004.",
  acknowledgement = ack-nhfb,
  keywords =     "Fermi Paradox",
  remark =       "Hardback edition 2007. Paperback edition 2010.",
  tableofcontents = "The future of biotechnology \\
                 A debate with Bill Joy \\
                 Heretical thoughts about science and society \\
                 A friendly universe \\
                 Can life go on forever? \\
                 Looking for life \\
                 The varieties of human experience",
}


bibtype: book
filename: master.bib
label: Earnshaw:1985:FAC
author: Rae A. Earnshaw
title: Fundamental Algorithms for Computer Graphics
publisher: pub-SV
address: pub-SV:adr
pages: xvi + 1042
year: 1985
ISBN: 0-387-13920-6 (New York), 3-540-13920-6 (Berlin) OR 0387139206 (New York), 3540139206 (Berlin)
LCCN: QA76.6 .N379 1985
bibdate: Wed Dec 15 08:55:01 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 08:55:01 ???
acknowledgement: ack-nhfb
rawauthor: Rae A. Earnshaw
rawtitle: Fundamental Algorithms for Computer Graphics
ISBN13:
978-0-387-13920-3 (New York), 978-3-540-13920-1 (Berlin) OR 9780387139203 (New York), 9783540139201 (Berlin)

TOC:
Line and area algorithms Arcs, circles and conics Curves and curve drawing Character generation and display Contouring and surface drawing Hardware architectures and algorithms Computational geometry and CAD Theoretical aspects and models Human-computer interface issues

rawTOC:
Line and area algorithms \\ Arcs, circles and conics \\ Curves and curve drawing \\ Character generation and display \\ Contouring and surface drawing \\ Hardware architectures and algorithms \\ Computational geometry and CAD \\ Theoretical aspects and models \\ Human-computer interface issues

entry:
@Book{Earnshaw:1985:FAC,
  author =       "Rae A. Earnshaw",
  title =        "Fundamental Algorithms for Computer Graphics",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvi + 1042",
  year =         "1985",
  ISBN =         "0-387-13920-6 (New York), 3-540-13920-6 (Berlin)",
  ISBN-13 =      "978-0-387-13920-3 (New York), 978-3-540-13920-1
                 (Berlin)",
  LCCN =         "QA76.6 .N379 1985",
  bibdate =      "Wed Dec 15 08:55:01 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Line and area algorithms \\
                 Arcs, circles and conics \\
                 Curves and curve drawing \\
                 Character generation and display \\
                 Contouring and surface drawing \\
                 Hardware architectures and algorithms \\
                 Computational geometry and CAD \\
                 Theoretical aspects and models \\
                 Human-computer interface issues",
}


bibtype: book
filename: master.bib
label: Earnshaw:1987:WPS
editor: Rae A. Earnshaw
title: Workstations and Publication Systems
publisher: pub-SV
address: pub-SV:adr
pages: viii + 229
year: 1987
ISBN: 0-387-96527-0, 3-540-96527-0 OR 0387965270, 3540965270
ISBN13: 978-0-387-96527-7, 978-3-540-96527-5 OR 9780387965277, 9783540965275
LCCN: Z286.E43 W67 1987
bibdate: Fri Jul 22 01:06:23 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.07.22 01:06:23 ???
acknowledgement: ack-nhfb
raweditor: Rae A. Earnshaw
rawtitle: Workstations and Publication Systems
entry:
@Book{Earnshaw:1987:WPS,
  editor =       "Rae A. Earnshaw",
  title =        "Workstations and Publication Systems",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "viii + 229",
  year =         "1987",
  ISBN =         "0-387-96527-0, 3-540-96527-0",
  ISBN-13 =      "978-0-387-96527-7, 978-3-540-96527-5",
  LCCN =         "Z286.E43 W67 1987",
  bibdate =      "Fri Jul 22 01:06:23 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$29.50",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: master.bib
label: Eckert:1948:EC
author: W. J. Eckert
title: Electrons and computation
journal: j-SCI-MONTHLY
volume: 67
number: 5
pages: 315--323
month: nov
monthnumber: 11
year: 1948
CODEN: SCMOAA
ISSN: 0096-3771 OR 00963771
bibdate: Wed Oct 13 11:27:40 2010
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2010.10.13 11:27:40 ???
note: Reprinted in cite [ 5.3]Randell:1982:ODC.
acknowledgement: ack-nhfb
rawauthor: W. J. Eckert
rawnote: Reprinted in \cite[\S 5.3]{Randell:1982:ODC}.
rawtitle: Electrons and computation
entry:
@Article{Eckert:1948:EC,
  author =       "W. J. Eckert",
  title =        "Electrons and computation",
  journal =      j-SCI-MONTHLY,
  volume =       "67",
  number =       "5",
  pages =        "315--323",
  month =        nov,
  year =         "1948",
  CODEN =        "SCMOAA",
  ISSN =         "0096-3771",
  bibdate =      "Wed Oct 13 11:27:40 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 5.3]{Randell:1982:ODC}.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Eckhouse:1979:MSO
author: Richard H. Eckhouse, Jr. and L. Robert Morris
title: Minicomputer Systems: Organization, Programming, and Applications (PDP-11)
publisher: pub-PH
address: pub-PH:adr
edition: Second
pages: xix + 491
year: 1979
ISBN: 0-13-583914-9 OR 0135839149
ISBN13: 978-0-13-583914-0 OR 9780135839140
LCCN: QA76.8.P2E26 1979
bibdate: Fri Aug 07 17:22:02 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.08.07 17:22:02 ???
acknowledgement: ack-nhfb
rawauthor: Richard H. {Eckhouse, Jr.} and L. Robert Morris
rawtitle: Minicomputer Systems: Organization, Programming, and Applications ({PDP-11})
entry:
@Book{Eckhouse:1979:MSO,
  author =       "Richard H. {Eckhouse, Jr.} and L. Robert Morris",
  title =        "Minicomputer Systems: Organization, Programming, and
                 Applications ({PDP-11})",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Second",
  pages =        "xix + 491",
  year =         "1979",
  ISBN =         "0-13-583914-9",
  ISBN-13 =      "978-0-13-583914-0",
  LCCN =         "QA76.8.P2E26 1979",
  bibdate =      "Fri Aug 07 17:22:02 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Eckstein:2000:US
author: Robert Eckstein and David Collier-Brown and Peter Kelly
title: Using Samba
publisher: pub-ORA
address: pub-ORA:adr
pages: xi + 398
year: 2000
ISBN: 1-56592-449-5 OR 1565924495
ISBN13: 978-1-56592-449-9 OR 9781565924499
LCCN: QA76.9.C55 E267 2000; QA76.9.C55 E267 2000; TK5105.5 .E35 2000
bibdate: Mon Nov 22 15:57:08 1999
bibtimestamp: 1999.11.22 15:57:08 ???
URL: http://www.oreilly.com/catalog/9781565924499
acknowledgement: ack-nhfb
rawauthor: Robert Eckstein and David Collier-Brown and Peter Kelly
rawtitle: Using {Samba}
bibsource:
https://www.math.utah.edu/pub/tex/bib/linux.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/ora.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

note:
Includes CD-ROM with complete mirror of Samba site with Samba 2.0.5a, including sources, documentation, binaries, and supplementary tools.

abstract:
Samba is cross-platform triumph: it turns a Unix or Linux system into a file and print server for Microsoft Windows network clients. Now you can let users store their files (and even important executables) in a single place for easy sharing and backup, protected by Unix or NT security mechanisms, and still offer such transparent access that PC users don't even realize they're going to another system. The magic behind Samba is that it recognizes and speaks the SMB protocol developed by Microsoft for file and printer sharing on its own systems. The authors present the most common configurations and problems in an easy-to-follow manner, along with instructions for getting the most out of Samba. Whether you're playing on one note or a full three-octave range, this book will give you an efficient and secure server. The CD-ROM included with this book is a complete mirror of the Samba FTP site, including sources, ready-to-install binaries, documentation, and related utilities.

TOC:
1: Learning the Samba / 1 What is Samba? / 2 What Can Samba Do For Me? / 3 Getting Familiar with a SMB/CIFS Network / 9 Microsoft Implementations / 18 An Overview of the Samba Distribution / 27 How Can I Get Samba? / 28 What's New in Samba 2.0? / 28 And That's Not All / 30 2: Installing Samba on a Unix System / 31 Downloading the Samba Distribution / 32 Configuring Samba / 34 Compiling and Installing Samba / 38 A Basic Samba Configuration File / 41 Starting the Samba Daemons / 46 Testing the Samba Daemons / 49 3: Configuring Windows Clients / 50 Setting Up Windows 95/98 Computers / 50 Setting Up Windows NT 4.0 Computers / 63 An Introduction to SMB/CIFS / 74 4: Disk Shares / 82 Learning the Samba Configuration File / 82 Special Sections / 88 Configuration File Options / 91 Server Configuration / 93 Disk Share Configuration / 96 Networking Options with Samba / 101 Virtual Servers / 106 Logging Configuration Options / 108 5: Browsing and Advanced Disk Shares / 114 Browsing / 114 Filesystem Differences / 127 File Permissions and Attributes on MS-DOS and Unix / 135 Name Mangling and Case / 143 Locks and Oplocks / 149 6: Users, Security, and Domains / 155 Users and Groups / 155 Controlling Access to Shares / 158 Authentication Security / 164 Passwords / 171 Windows Domains / 184 Logon Scripts / 192 7: Printing and Name Resolution / 201 Sending Print Jobs to Samba / 201 Printing to Windows Client Printers / 213 Name Resolution with Samba / 224 8: Additional Samba Information / 230 Supporting Programmers / 230 Magic Scripts / 233 Internationalization / 234 WinPopup Messages / 237 Recently Added Options / 238 Miscellaneous Options / 240 Backups with smbtar / 245 9: Troubleshooting Samba / 250 Tool Bag / 250 Fault Tree / 257 Extra Resources / 291 A: Configuring Samba with SSL / 295 B: Samba Performance Tuning / 312 C: Samba Configuration Option Quick Reference / 329 D: Summary of Samba Daemons and Commands / 359 E: Downloading Samba with CVS / 378 F: Sample Configuration File / 379

rawabstract:
Samba is cross-platform triumph: it turns a Unix or Linux system into a file and print server for Microsoft Windows network clients. Now you can let users store their files (and even important executables) in a single place for easy sharing and backup, protected by Unix or NT security mechanisms, and still offer such transparent access that PC users don't even realize they're going to another system. The magic behind Samba is that it recognizes and speaks the SMB protocol developed by Microsoft for file and printer sharing on its own systems. The authors present the most common configurations and problems in an easy-to-follow manner, along with instructions for getting the most out of Samba. Whether you're playing on one note or a full three-octave range, this book will give you an efficient and secure server. The CD-ROM included with this book is a complete mirror of the Samba FTP site, including sources, ready-to-install binaries, documentation, and related utilities.

rawnote:
Includes CD-ROM with complete mirror of Samba site with Samba 2.0.5a, including sources, documentation, binaries, and supplementary tools.

shortTOC:
1: Learning the Samba / 1 2: Installing Samba on a Unix System / 31 3: Configuring Windows Clients / 50 4: Disk Shares / 82 5: Browsing and Advanced Disk Shares / 114 6: Users, Security, and Domains / 155 7: Printing and Name Resolution / 201 8: Additional Samba Information / 230 9: Troubleshooting Samba / 250 A: Configuring Samba with SSL / 295 B: Samba Performance Tuning / 312 C: Samba Configuration Option Quick Reference / 329 D: Summary of Samba Daemons and Commands / 359 E: Downloading Samba with CVS / 378 F: Sample Configuration File / 379

rawshortTOC:
1: Learning the Samba / 1 \\ 2: Installing Samba on a Unix System / 31 \\ 3: Configuring Windows Clients / 50 \\ 4: Disk Shares / 82 \\ 5: Browsing and Advanced Disk Shares / 114 \\ 6: Users, Security, and Domains / 155 \\ 7: Printing and Name Resolution / 201 \\ 8: Additional Samba Information / 230 \\ 9: Troubleshooting Samba / 250 \\ A: Configuring Samba with SSL / 295 \\ B: Samba Performance Tuning / 312 \\ C: Samba Configuration Option Quick Reference / 329 \\ D: Summary of Samba Daemons and Commands / 359 \\ E: Downloading Samba with CVS / 378 \\ F: Sample Configuration File / 379

rawTOC:
1: Learning the Samba / 1 \\ What is Samba? / 2 \\ What Can Samba Do For Me? / 3 \\ Getting Familiar with a SMB/CIFS Network / 9 \\ Microsoft Implementations / 18 \\ An Overview of the Samba Distribution / 27 \\ How Can I Get Samba? / 28 \\ What's New in Samba 2.0? / 28 \\ And That's Not All / 30 \\ 2: Installing Samba on a Unix System / 31 \\ Downloading the Samba Distribution / 32 \\ Configuring Samba / 34 \\ Compiling and Installing Samba / 38 \\ A Basic Samba Configuration File / 41 \\ Starting the Samba Daemons / 46 \\ Testing the Samba Daemons / 49 \\ 3: Configuring Windows Clients / 50 \\ Setting Up Windows 95/98 Computers / 50 \\ Setting Up Windows NT 4.0 Computers / 63 \\ An Introduction to SMB/CIFS / 74 \\ 4: Disk Shares / 82 \\ Learning the Samba Configuration File / 82 \\ Special Sections / 88 \\ Configuration File Options / 91 \\ Server Configuration / 93 \\ Disk Share Configuration / 96 \\ Networking Options with Samba / 101 \\ Virtual Servers / 106 \\ Logging Configuration Options / 108 \\ 5: Browsing and Advanced Disk Shares / 114 \\ Browsing / 114 \\ Filesystem Differences / 127 \\ File Permissions and Attributes on MS-DOS and Unix / 135 \\ Name Mangling and Case / 143 \\ Locks and Oplocks / 149 \\ 6: Users, Security, and Domains / 155 \\ Users and Groups / 155 \\ Controlling Access to Shares / 158 \\ Authentication Security / 164 \\ Passwords / 171 \\ Windows Domains / 184 \\ Logon Scripts / 192 \\ 7: Printing and Name Resolution / 201 \\ Sending Print Jobs to Samba / 201 \\ Printing to Windows Client Printers / 213 \\ Name Resolution with Samba / 224 \\ 8: Additional Samba Information / 230 \\ Supporting Programmers / 230 \\ Magic Scripts / 233 \\ Internationalization / 234 \\ WinPopup Messages / 237 \\ Recently Added Options / 238 \\ Miscellaneous Options / 240 \\ Backups with smbtar / 245 \\ 9: Troubleshooting Samba / 250 \\ Tool Bag / 250 \\ Fault Tree / 257 \\ Extra Resources / 291 \\ A: Configuring Samba with SSL / 295 \\ B: Samba Performance Tuning / 312 \\ C: Samba Configuration Option Quick Reference / 329 \\ D: Summary of Samba Daemons and Commands / 359 \\ E: Downloading Samba with CVS / 378 \\ F: Sample Configuration File / 379

entry:
@Book{Eckstein:2000:US,
  author =       "Robert Eckstein and David Collier-Brown and Peter
                 Kelly",
  title =        "Using {Samba}",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xi + 398",
  year =         "2000",
  ISBN =         "1-56592-449-5",
  ISBN-13 =      "978-1-56592-449-9",
  LCCN =         "QA76.9.C55 E267 2000; QA76.9.C55 E267 2000; TK5105.5
                 .E35 2000",
  bibdate =      "Mon Nov 22 15:57:08 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/linux.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "Includes CD-ROM with complete mirror of Samba site
                 with Samba 2.0.5a, including sources, documentation,
                 binaries, and supplementary tools.",
  price =        "US\$34.95",
  URL =          "http://www.oreilly.com/catalog/9781565924499",
  abstract =     "Samba is cross-platform triumph: it turns a Unix or
                 Linux system into a file and print server for Microsoft
                 Windows network clients. Now you can let users store
                 their files (and even important executables) in a
                 single place for easy sharing and backup, protected by
                 Unix or NT security mechanisms, and still offer such
                 transparent access that PC users don't even realize
                 they're going to another system. The magic behind Samba
                 is that it recognizes and speaks the SMB protocol
                 developed by Microsoft for file and printer sharing on
                 its own systems. The authors present the most common
                 configurations and problems in an easy-to-follow
                 manner, along with instructions for getting the most
                 out of Samba. Whether you're playing on one note or a
                 full three-octave range, this book will give you an
                 efficient and secure server. The CD-ROM included with
                 this book is a complete mirror of the Samba FTP site,
                 including sources, ready-to-install binaries,
                 documentation, and related utilities.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1: Learning the Samba / 1 \\
                 2: Installing Samba on a Unix System / 31 \\
                 3: Configuring Windows Clients / 50 \\
                 4: Disk Shares / 82 \\
                 5: Browsing and Advanced Disk Shares / 114 \\
                 6: Users, Security, and Domains / 155 \\
                 7: Printing and Name Resolution / 201 \\
                 8: Additional Samba Information / 230 \\
                 9: Troubleshooting Samba / 250 \\
                 A: Configuring Samba with SSL / 295 \\
                 B: Samba Performance Tuning / 312 \\
                 C: Samba Configuration Option Quick Reference / 329 \\
                 D: Summary of Samba Daemons and Commands / 359 \\
                 E: Downloading Samba with CVS / 378 \\
                 F: Sample Configuration File / 379",
  tableofcontents = "1: Learning the Samba / 1 \\
                 What is Samba? / 2 \\
                 What Can Samba Do For Me? / 3 \\
                 Getting Familiar with a SMB/CIFS Network / 9 \\
                 Microsoft Implementations / 18 \\
                 An Overview of the Samba Distribution / 27 \\
                 How Can I Get Samba? / 28 \\
                 What's New in Samba 2.0? / 28 \\
                 And That's Not All / 30 \\
                 2: Installing Samba on a Unix System / 31 \\
                 Downloading the Samba Distribution / 32 \\
                 Configuring Samba / 34 \\
                 Compiling and Installing Samba / 38 \\
                 A Basic Samba Configuration File / 41 \\
                 Starting the Samba Daemons / 46 \\
                 Testing the Samba Daemons / 49 \\
                 3: Configuring Windows Clients / 50 \\
                 Setting Up Windows 95/98 Computers / 50 \\
                 Setting Up Windows NT 4.0 Computers / 63 \\
                 An Introduction to SMB/CIFS / 74 \\
                 4: Disk Shares / 82 \\
                 Learning the Samba Configuration File / 82 \\
                 Special Sections / 88 \\
                 Configuration File Options / 91 \\
                 Server Configuration / 93 \\
                 Disk Share Configuration / 96 \\
                 Networking Options with Samba / 101 \\
                 Virtual Servers / 106 \\
                 Logging Configuration Options / 108 \\
                 5: Browsing and Advanced Disk Shares / 114 \\
                 Browsing / 114 \\
                 Filesystem Differences / 127 \\
                 File Permissions and Attributes on MS-DOS and Unix /
                 135 \\
                 Name Mangling and Case / 143 \\
                 Locks and Oplocks / 149 \\
                 6: Users, Security, and Domains / 155 \\
                 Users and Groups / 155 \\
                 Controlling Access to Shares / 158 \\
                 Authentication Security / 164 \\
                 Passwords / 171 \\
                 Windows Domains / 184 \\
                 Logon Scripts / 192 \\
                 7: Printing and Name Resolution / 201 \\
                 Sending Print Jobs to Samba / 201 \\
                 Printing to Windows Client Printers / 213 \\
                 Name Resolution with Samba / 224 \\
                 8: Additional Samba Information / 230 \\
                 Supporting Programmers / 230 \\
                 Magic Scripts / 233 \\
                 Internationalization / 234 \\
                 WinPopup Messages / 237 \\
                 Recently Added Options / 238 \\
                 Miscellaneous Options / 240 \\
                 Backups with smbtar / 245 \\
                 9: Troubleshooting Samba / 250 \\
                 Tool Bag / 250 \\
                 Fault Tree / 257 \\
                 Extra Resources / 291 \\
                 A: Configuring Samba with SSL / 295 \\
                 B: Samba Performance Tuning / 312 \\
                 C: Samba Configuration Option Quick Reference / 329 \\
                 D: Summary of Samba Daemons and Commands / 359 \\
                 E: Downloading Samba with CVS / 378 \\
                 F: Sample Configuration File / 379",
}


bibtype: book
filename: master.bib
label: Edmonds:2008:HTA
author: Jeff Edmonds
title: How to Think About Algorithms
publisher: pub-CAMBRIDGE
address: pub-CAMBRIDGE:adr
pages: xiii + 448
year: 2008
LCCN: QA9.58 .E36 2008
bibdate: Wed May 14 18:48:48 MDT 2008
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2008.05.14 18:48:48 MDT
subject: Algorithms; Study and teaching; Loops (Group theory); Invariants; Recursion theory
acknowledgement: ack-nhfb
rawauthor: Jeff Edmonds
rawtitle: How to Think About Algorithms
ISBN:
0-521-84931-4 (hardcover), 0-521-61410-4 (paperback), 0-511-41278-9 (e-book), 0-511-41370-X (e-book) OR 0521849314 (hardcover), 0521614104 (paperback), 0511412789 (ebook), 051141370X (ebook)

ISBN13:
978-0-521-84931-9 (hardcover), 978-0-521-61410-8 (paperback), 978-0-511-41278-3 (e-book), 978-0-511-41370-4 (e-book) OR 9780521849319 (hardcover), 9780521614108 (paperback), 9780511412783 (ebook), 9780511413704 (ebook)

URL:
http://www.loc.gov/catdir/enhancements/fy0808/2008001238-b.html; http://www.loc.gov/catdir/enhancements/fy0808/2008001238-d.html; http://www.loc.gov/catdir/enhancements/fy0808/2008001238-t.html

TOC:
Iterative algorithms: measures of progress and loop invariants Examples using more-of-the-input loop invariants Abstract data types Narrowing the search space: binary search Iterative sorting algorithms Euclid's GCD algorithm The loop invariant for lower bounds Abstractions, techniques, and theory Some simple examples of recursive algorithms Recursion on trees Recursive images Parsing with context-free grammars Definition of optimization problems Graph search algorithms Network flows and linear programming Greedy algorithms Recursive backtracking Dynamic programming algorithms Examples of dynamic programs Reductions and NP-completeness Randomized algorithms Existential and universal quantifiers Time complexity Logarithms and exponentials Asymptotic growth Adding-made-easy approximations Recurrence relations A formal proof of correctness

rawTOC:
Iterative algorithms: measures of progress and loop invariants \\ Examples using more-of-the-input loop invariants \\ Abstract data types \\ Narrowing the search space: binary search \\ Iterative sorting algorithms \\ Euclid's GCD algorithm \\ The loop invariant for lower bounds \\ Abstractions, techniques, and theory \\ Some simple examples of recursive algorithms \\ Recursion on trees \\ Recursive images \\ Parsing with context-free grammars \\ Definition of optimization problems \\ Graph search algorithms \\ Network flows and linear programming \\ Greedy algorithms \\ Recursive backtracking \\ Dynamic programming algorithms \\ Examples of dynamic programs \\ Reductions and NP-completeness \\ Randomized algorithms \\ Existential and universal quantifiers \\ Time complexity \\ Logarithms and exponentials \\ Asymptotic growth \\ Adding-made-easy approximations \\ Recurrence relations \\ A formal proof of correctness

entry:
@Book{Edmonds:2008:HTA,
  author =       "Jeff Edmonds",
  title =        "How to Think About Algorithms",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xiii + 448",
  year =         "2008",
  ISBN =         "0-521-84931-4 (hardcover), 0-521-61410-4 (paperback),
                 0-511-41278-9 (e-book), 0-511-41370-X (e-book)",
  ISBN-13 =      "978-0-521-84931-9 (hardcover), 978-0-521-61410-8
                 (paperback), 978-0-511-41278-3 (e-book),
                 978-0-511-41370-4 (e-book)",
  LCCN =         "QA9.58 .E36 2008",
  bibdate =      "Wed May 14 18:48:48 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0808/2008001238-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0808/2008001238-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0808/2008001238-t.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Algorithms; Study and teaching; Loops (Group theory);
                 Invariants; Recursion theory",
  tableofcontents = "Iterative algorithms: measures of progress and loop
                 invariants \\
                 Examples using more-of-the-input loop invariants \\
                 Abstract data types \\
                 Narrowing the search space: binary search \\
                 Iterative sorting algorithms \\
                 Euclid's GCD algorithm \\
                 The loop invariant for lower bounds \\
                 Abstractions, techniques, and theory \\
                 Some simple examples of recursive algorithms \\
                 Recursion on trees \\
                 Recursive images \\
                 Parsing with context-free grammars \\
                 Definition of optimization problems \\
                 Graph search algorithms \\
                 Network flows and linear programming \\
                 Greedy algorithms \\
                 Recursive backtracking \\
                 Dynamic programming algorithms \\
                 Examples of dynamic programs \\
                 Reductions and NP-completeness \\
                 Randomized algorithms \\
                 Existential and universal quantifiers \\
                 Time complexity \\
                 Logarithms and exponentials \\
                 Asymptotic growth \\
                 Adding-made-easy approximations \\
                 Recurrence relations \\
                 A formal proof of correctness",
}


bibtype: book
filename: master.bib
label: EFF:1998:CSE
author: Electronic Frontier Foundation
title: Cracking DES: Secrets of Encryption Research, Wiretap Politics & Chip Design
publisher: pub-ORA
address: pub-ORA:adr
pages: 272
month: jul
monthnumber: 7
year: 1998
ISBN: 1-56592-520-3 OR 1565925203
ISBN13: 978-1-56592-520-5 OR 9781565925205
LCCN: QA76.9.A25 C783
bibdate: Thu Apr 15 07:49:39 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; http://www.oreilly.com/catalog/crackdes/
bibtimestamp: 1999.04.15 07:49:39 ???
URL: http://www.eff.org/descracker/; http://www.sunworld.com/swol-07-1998/swol-07-if.html?072098a#2
acknowledgement: ack-nhfb
rawauthor: {Electronic Frontier Foundation}
rawtitle: Cracking {DES}: Secrets of Encryption Research, Wiretap Politics \& Chip Design
abstract:
Data Encryption Standard withstood the test of time for twenty years. Cracking DES: Secrets of Encryption Research, Wiretap Politics & Chip Design shows exactly how it was brought down. Every cryptographer, security designer, and student of cryptography policy should read this book to understand how the world changed as it fell.

rawabstract:
Data Encryption Standard withstood the test of time for twenty years. Cracking DES: Secrets of Encryption Research, Wiretap Politics \& Chip Design shows exactly how it was brought down. Every cryptographer, security designer, and student of cryptography policy should read this book to understand how the world changed as it fell.

entry:
@Book{EFF:1998:CSE,
  author =       "{Electronic Frontier Foundation}",
  title =        "Cracking {DES}: Secrets of Encryption Research,
                 Wiretap Politics \& Chip Design",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "272",
  month =        jul,
  year =         "1998",
  ISBN =         "1-56592-520-3",
  ISBN-13 =      "978-1-56592-520-5",
  LCCN =         "QA76.9.A25 C783",
  bibdate =      "Thu Apr 15 07:49:39 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.oreilly.com/catalog/crackdes/",
  price =        "US\$29.95",
  URL =          "http://www.eff.org/descracker/;
                 http://www.sunworld.com/swol-07-1998/swol-07-if.html?072098a#2",
  abstract =     "Data Encryption Standard withstood the test of time
                 for twenty years. Cracking DES: Secrets of Encryption
                 Research, Wiretap Politics \& Chip Design shows exactly
                 how it was brought down. Every cryptographer, security
                 designer, and student of cryptography policy should
                 read this book to understand how the world changed as
                 it fell.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: EguiaMoraza:2018:RHP
author: Iban Eguia Moraza
title: Rust High Performance: Learn to Skyrocket the Performance of Your Rust Applications
publisher: pub-PACKT
address: pub-PACKT:adr
pages: 265
year: 2018
ISBN: 1-78847-823-1 OR 1788478231
ISBN13: 978-1-78839-948-7, 978-1-78847-823-6 OR 9781788399487, 9781788478236
LCCN: QA76.7
bibdate: Tue Dec 10 05:42:07 MST 2019
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2019.12.10 05:42:07 MST
acknowledgement: ack-nhfb
rawauthor: Iban {Eguia Moraza}
rawtitle: {Rust} High Performance: Learn to Skyrocket the Performance of Your {Rust} Applications
abstract:
Sometimes it's difficult to get the best performance out of Rust. This book teaches you how to optimize the speed of your Rust code to the level of languages such as C/C++. You'll understand and fix common pitfalls, learn how to improve your productivity by using metaprogramming, and speed up your code by concurrently executing parts of it.

subject:
Programming languages (Electronic computers); Computer programming; Application software; Development; Computers; Programming; Parallel; Software Development and Engineering; Tools; software development; Parallel processing; Programming Languages; C; Programming and scripting languages: general; Development; Computer programming; Programming languages (Electronic computers)

TOC:
Preface 1: Common Performance Pitfalls Asking the Rust compiler about performance Optimizations Build configuration Optimization level Debug information Link-time optimizations Debug assertions Panic behavior Runtime library paths Translation issues Indexing degradations Using iterators Iterator adaptors Real-life example Specialized adaptors Interaction between adaptors Itertools Borrowing degradations Cyclomatic complexity Summary 2: Extra Performance Enhancements Compile-time checks Sequential state machines Complex state machines Real-life type system check example Extra performance tips Using closures to avoid runtime evaluation Unstable sorting Map hashing Perfect hash functions Standard library collections Sequences Maps Sets Summary 3: Memory Management in Rust Mastering the borrow checker Allocations Mutability, borrowing, and owning Lifetimes Memory representation Alignment Complex enumerations Unions Shared pointers The cell module Cells RefCell The rc module Summary 4: Lints and Clippy Using Rust compiler lints Lints Avoiding anonymous parameters Avoiding heap allocated box pointers Avoiding missing implementations Enforcing documentation Pointing out trivial casts Linting unsafe code blocks Unused lints Variant size differences Lint groups Clippy Installation Configuration Lints Casting Bad practice Performance lints Unwraps Shadowing Integer overflow Lint groups Summary 5: Profiling Your Rust Application Understanding the hardware Understanding how the CPU works Speeding up memory access with the cache Cache misses How can you fix it? Cache invalidation CPU pipeline Branch prediction The relevance of branch prediction for our code Profiling tools Valgrind Callgrind Cachegrind OProfile Summary 6: Benchmarking Selecting what to benchmark Benchmarking in nightly Rust Benchmarking in stable Rust Continuous integration for benchmarks Travis-CI integration Benchmark statistics with Criterion Summary 7: Built-in Macros and Configuration Items Understanding attributes Trait derivations Crate features Configuration attributes Macros Console printing String formatting Compilation environment Loading byte arrays and strings at compile time Code paths Checking preconditions and postconditions Others Nightly Rust Conservative trait return Constant functions Inline assembly and naked functions Using bigger integers Single instruction multiple data Allocation API Compiler plugins Summary 8: Must-Have Macro Crates Working with external data Data serialization and deserialization Serializing and deserializing complex structures Parsing byte streams Learning about useful small crates Creating lazily evaluated statics

rawabstract:
Sometimes it's difficult to get the best performance out of Rust. This book teaches you how to optimize the speed of your Rust code to the level of languages such as C/C++. You'll understand and fix common pitfalls, learn how to improve your productivity by using metaprogramming, and speed up your code by concurrently executing parts of it.

rawTOC:
Preface \\ 1: Common Performance Pitfalls \\ Asking the Rust compiler about performance \\ Optimizations \\ Build configuration \\ Optimization level \\ Debug information \\ Link-time optimizations \\ Debug assertions \\ Panic behavior \\ Runtime library paths \\ Translation issues \\ Indexing degradations \\ Using iterators \\ Iterator adaptors \\ Real-life example \\ Specialized adaptors \\ Interaction between adaptors \\ Itertools \\ Borrowing degradations \\ Cyclomatic complexity \\ Summary \\ 2: Extra Performance Enhancements \\ Compile-time checks \\ Sequential state machines \\ Complex state machines \\ Real-life type system check example \\ Extra performance tips \\ Using closures to avoid runtime evaluation \\ Unstable sorting \\ Map hashing \\ Perfect hash functions \\ Standard library collections \\ Sequences \\ Maps \\ Sets \\ Summary \\ 3: Memory Management in Rust \\ Mastering the borrow checker \\ Allocations \\ Mutability, borrowing, and owning \\ Lifetimes \\ Memory representation \\ Alignment \\ Complex enumerations \\ Unions \\ Shared pointers \\ The cell module \\ Cells \\ RefCell \\ The rc module \\ Summary \\ 4: Lints and Clippy \\ Using Rust compiler lints \\ Lints \\ Avoiding anonymous parameters \\ Avoiding heap allocated box pointers \\ Avoiding missing implementations \\ Enforcing documentation \\ Pointing out trivial casts \\ Linting unsafe code blocks \\ Unused lints \\ Variant size differences \\ Lint groups \\ Clippy \\ Installation \\ Configuration \\ Lints \\ Casting \\ Bad practice \\ Performance lints \\ Unwraps \\ Shadowing \\ Integer overflow \\ Lint groups \\ Summary \\ 5: Profiling Your Rust Application \\ Understanding the hardware \\ Understanding how the CPU works \\ Speeding up memory access with the cache \\ Cache misses \\ How can you fix it? \\ Cache invalidation \\ CPU pipeline \\ Branch prediction \\ The relevance of branch prediction for our code \\ Profiling tools \\ Valgrind \\ Callgrind \\ Cachegrind \\ OProfile \\ Summary \\ 6: Benchmarking \\ Selecting what to benchmark \\ Benchmarking in nightly Rust \\ Benchmarking in stable Rust \\ Continuous integration for benchmarks \\ Travis-CI integration \\ Benchmark statistics with Criterion \\ Summary \\ 7: Built-in Macros and Configuration Items \\ Understanding attributes \\ Trait derivations \\ Crate features \\ Configuration attributes \\ Macros \\ Console printing \\ String formatting \\ Compilation environment \\ Loading byte arrays and strings at compile time \\ Code paths \\ Checking preconditions and postconditions \\ Others \\ Nightly Rust \\ Conservative trait return \\ Constant functions \\ Inline assembly and naked functions \\ Using bigger integers \\ Single instruction multiple data \\ Allocation API \\ Compiler plugins \\ Summary \\ 8: Must-Have Macro Crates \\ Working with external data \\ Data serialization and deserialization \\ Serializing and deserializing complex structures \\ Parsing byte streams \\ Learning about useful small crates \\ Creating lazily evaluated statics

entry:
@Book{EguiaMoraza:2018:RHP,
  author =       "Iban {Eguia Moraza}",
  title =        "{Rust} High Performance: Learn to Skyrocket the
                 Performance of Your {Rust} Applications",
  publisher =    pub-PACKT,
  address =      pub-PACKT:adr,
  pages =        "265",
  year =         "2018",
  ISBN =         "1-78847-823-1",
  ISBN-13 =      "978-1-78839-948-7, 978-1-78847-823-6",
  LCCN =         "QA76.7",
  bibdate =      "Tue Dec 10 05:42:07 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Sometimes it's difficult to get the best performance
                 out of Rust. This book teaches you how to optimize the
                 speed of your Rust code to the level of languages such
                 as C/C++. You'll understand and fix common pitfalls,
                 learn how to improve your productivity by using
                 metaprogramming, and speed up your code by concurrently
                 executing parts of it.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Programming languages (Electronic computers); Computer
                 programming; Application software; Development;
                 Computers; Programming; Parallel; Software Development
                 and Engineering; Tools; software development; Parallel
                 processing; Programming Languages; C; Programming and
                 scripting languages: general; Development; Computer
                 programming; Programming languages (Electronic
                 computers)",
  tableofcontents = "Preface \\
                 1: Common Performance Pitfalls \\
                 Asking the Rust compiler about performance \\
                 Optimizations \\
                 Build configuration \\
                 Optimization level \\
                 Debug information \\
                 Link-time optimizations \\
                 Debug assertions \\
                 Panic behavior \\
                 Runtime library paths \\
                 Translation issues \\
                 Indexing degradations \\
                 Using iterators \\
                 Iterator adaptors \\
                 Real-life example \\
                 Specialized adaptors \\
                 Interaction between adaptors \\
                 Itertools \\
                 Borrowing degradations \\
                 Cyclomatic complexity \\
                 Summary \\
                 2: Extra Performance Enhancements \\
                 Compile-time checks \\
                 Sequential state machines \\
                 Complex state machines \\
                 Real-life type system check example \\
                 Extra performance tips \\
                 Using closures to avoid runtime evaluation \\
                 Unstable sorting \\
                 Map hashing \\
                 Perfect hash functions \\
                 Standard library collections \\
                 Sequences \\
                 Maps \\
                 Sets \\
                 Summary \\
                 3: Memory Management in Rust \\
                 Mastering the borrow checker \\
                 Allocations \\
                 Mutability, borrowing, and owning \\
                 Lifetimes \\
                 Memory representation \\
                 Alignment \\
                 Complex enumerations \\
                 Unions \\
                 Shared pointers \\
                 The cell module \\
                 Cells \\
                 RefCell \\
                 The rc module \\
                 Summary \\
                 4: Lints and Clippy \\
                 Using Rust compiler lints \\
                 Lints \\
                 Avoiding anonymous parameters \\
                 Avoiding heap allocated box pointers \\
                 Avoiding missing implementations \\
                 Enforcing documentation \\
                 Pointing out trivial casts \\
                 Linting unsafe code blocks \\
                 Unused lints \\
                 Variant size differences \\
                 Lint groups \\
                 Clippy \\
                 Installation \\
                 Configuration \\
                 Lints \\
                 Casting \\
                 Bad practice \\
                 Performance lints \\
                 Unwraps \\
                 Shadowing \\
                 Integer overflow \\
                 Lint groups \\
                 Summary \\
                 5: Profiling Your Rust Application \\
                 Understanding the hardware \\
                 Understanding how the CPU works \\
                 Speeding up memory access with the cache \\
                 Cache misses \\
                 How can you fix it? \\
                 Cache invalidation \\
                 CPU pipeline \\
                 Branch prediction \\
                 The relevance of branch prediction for our code \\
                 Profiling tools \\
                 Valgrind \\
                 Callgrind \\
                 Cachegrind \\
                 OProfile \\
                 Summary \\
                 6: Benchmarking \\
                 Selecting what to benchmark \\
                 Benchmarking in nightly Rust \\
                 Benchmarking in stable Rust \\
                 Continuous integration for benchmarks \\
                 Travis-CI integration \\
                 Benchmark statistics with Criterion \\
                 Summary \\
                 7: Built-in Macros and Configuration Items \\
                 Understanding attributes \\
                 Trait derivations \\
                 Crate features \\
                 Configuration attributes \\
                 Macros \\
                 Console printing \\
                 String formatting \\
                 Compilation environment \\
                 Loading byte arrays and strings at compile time \\
                 Code paths \\
                 Checking preconditions and postconditions \\
                 Others \\
                 Nightly Rust \\
                 Conservative trait return \\
                 Constant functions \\
                 Inline assembly and naked functions \\
                 Using bigger integers \\
                 Single instruction multiple data \\
                 Allocation API \\
                 Compiler plugins \\
                 Summary \\
                 8: Must-Have Macro Crates \\
                 Working with external data \\
                 Data serialization and deserialization \\
                 Serializing and deserializing complex structures \\
                 Parsing byte streams \\
                 Learning about useful small crates \\
                 Creating lazily evaluated statics",
}


bibtype: book
filename: master.bib
label: Ehrlich:1973:PCP
author: Robert Ehrlich
title: Physics and Computers; Problems, Simulations, and Data Analysis
publisher: pub-HOUGHTON-MIFFLIN
address: pub-HOUGHTON-MIFFLIN:adr
pages: vi + 279
year: 1973
ISBN: 0-395-59472-1 (??invalid checksum??) OR 0395594721 (??invalid checksum??)
ISBN13: 978-0-395-59472-8 (??invalid checksum??) OR 9780395594728 (??invalid checksum??)
LCCN: QC20.2.E35
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: Robert Ehrlich
rawtitle: Physics and Computers; Problems, Simulations, and Data Analysis
entry:
@Book{Ehrlich:1973:PCP,
  author =       "Robert Ehrlich",
  title =        "Physics and Computers; Problems, Simulations, and Data
                 Analysis",
  publisher =    pub-HOUGHTON-MIFFLIN,
  address =      pub-HOUGHTON-MIFFLIN:adr,
  pages =        "vi + 279",
  year =         "1973",
  ISBN =         "0-395-59472-1 (??invalid checksum??)",
  ISBN-13 =      "978-0-395-59472-8 (??invalid checksum??)",
  LCCN =         "QC20.2.E35",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Eijkhout:1992:TTT
author: Victor Eijkhout
title: TeX by Topic, a TeX nician's Reference
publisher: pub-AW
address: pub-AW:adr
pages: vii + 307
year: 1992
ISBN: 0-201-56882-9 OR 0201568829
ISBN13: 978-0-201-56882-0 OR 9780201568820
LCCN: Z253.4.T47 E38 1992
bibdate: Tue Dec 14 22:47:52 1993
bibtimestamp: 1993.12.14 22:47:52 ???
URL: http://eijkhout.net/texbytopic/
acknowledgement: ack-nhfb
rawauthor: Victor Eijkhout
rawtitle: {\TeX} by Topic, a {\TeX}nician's Reference
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/sgml.bib; https://www.math.utah.edu/pub/tex/bib/texbook3.bib

TOC:
License / 15 Preface / 21 1 The Structure of the TEX Processor / 23 1.1 Four TEX processors / 23 1.2 The input processor / 24 1.2.1 Character input / 24 1.2.2 Two-level input processing / 24 1.3 The expansion processor / 25 1.3.1 The process of expansion / 25 1.3.2 Special cases: expandafter , noexpand , and the / 25 1.3.3 Braces in the expansion processor / 26 1.4 The execution processor / 26 1.5 The visual processor / 27 1.6 Examples / 28 1.6.1 Skipped spaces / 28 1.6.2 Internal quantities and their representations / 28 2 Category Codes and Internal States / 29 2.1 Introduction / 29 2.2 Initial processing / 29 2.3 Category codes / 30 2.4 From characters to tokens / 32 2.5 The input processor as a finite state automaton / 32 2.5.1 State N: new line / 32 2.5.2 State S: skipping spaces / 32 2.5.3 State M: middle of line / 32 2.6 Accessing the full character set / 33 2.7 Transitions between internal states / 33 2.7.1 0: escape character / 33 2.7.2 1--4, 7--8, 11--13: non-blank characters / 34 2.7.3 5: end of line / 34 2.7.4 6: parameter / 34 2.7.5 7: superscript / 34 2.7.6 9: ignored character / 34 2.7.7 10: space / 35 2.7.8 14: comment / 35 2.7.9 15: invalid / 35 2.8 Letters and other characters / 35 2.9 The par token / 36 2.10 Spaces / 37 2.10.1 Skipped spaces / 37 2.10.2 Optional spaces / 37 2.10.3 Ignored and obeyed spaces / 38 2.10.4 More ignored spaces / 38 2.10.5 space token / 39 2.10.6 Control space / 39 2.10.7 ` ' / 39 2.11 More about line ends / 40 2.11.1 Obeylines / 40 2.11.2 Changing the endlinechar / 40 2.11.3 More remarks about the end-of-line character / 41 2.12 More about the input processor / 41 2.12.1 The input processor as a separate process / 41 2.12.2 The input processor not as a separate process / 42 2.12.3 Recursive invocation of the input processor / 42 2.13 The <at> convention / 43 3 Characters / 45 3.1 Character codes / 45 3.2 Control sequences for characters / 46 3.2.1 Denoting characters to be typeset: char / 46 3.2.2 Implicit character tokens: let / 47 3.3 Accents / 48 3.4 Testing characters / 49 3.5 Uppercase and lowercase / 50 3.5.1 Uppercase and lowercase codes / 50 3.5.2 Uppercase and lowercase commands / 50 3.5.3 Uppercase and lowercase forms of keywords / 50 3.5.4 Creative use of uppercase and lowercase / 51 3.6 Codes of a character / 51 3.7 Converting tokens into character strings / 51 3.7.1 Output of control sequences / 52 3.7.2 Category codes of a string / 52 4 Fonts / 53 4.1 Fonts / 53 4.2 Font declaration / 54 4.2.1 Fonts and tfm files / 54 4.2.2 Querying the current font and font names / 54 4.2.3 nullfont / 55 4.3 Font information / 55 4.3.1 Font dimensions / 55 4.3.2 Kerning / 56 4.3.3 Italic correction / 56 4.3.4 Ligatures / 57 4.3.5 Boundary ligatures / 57 5 Boxes / 59 5.1 Boxes / 60 5.2 Box registers / 60 5.2.1 Allocation: newbox / 60 5.2.2 Usage: setbox , box , copy / 61 5.2.3 Testing: ifvoid , ifhbox , ifvbox / 61 5.2.4 The lastbox / 61 5.3 Natural dimensions of boxes / 62 5.3.1 Dimensions of created horizontal boxes / 62 5.3.2 Dimensions of created vertical boxes / 62 5.3.3 Examples / 63 5.4 More about box dimensions / 64 5.4.1 Predetermined dimensions / 64 5.4.2 Changes to box dimensions / 65 5.4.3 Moving boxes around / 65 5.4.4 Box dimensions and box placement / 65 5.4.5 Boxes and negative glue / 66 5.5 Overfull and underfull boxes / 67 5.6 Opening and closing boxes / 67 5.7 Unboxing / 68 5.8 Text in boxes / 69 5.9 Assorted remarks / 70 5.9.1 Forgetting the box / 70 5.9.2 Special-purpose boxes / 70 5.9.3 The height of a vertical box in horizontal mode / 70 5.9.4 More subtleties with vertical boxes / 70 5.9.5 Hanging the lastbox back in the list / 71 5.9.6 Dissecting paragraphs with lastbox / 72 6 Horizontal and Vertical Mode / 73 6.1 Horizontal and vertical mode / 73 6.1.1 Horizontal mode / 73 6.1.2 Vertical mode / 74 6.2 Horizontal and vertical commands / 74 6.3 The internal modes / 75 6.3.1 Restricted horizontal mode / 75 6.3.2 Internal vertical mode / 75 6.4 Boxes and modes / 76 6.4.1 What box do you use in what mode? / 76 6.4.2 What mode holds in what box? / 76 6.4.3 Mode-dependent behaviour of boxes / 76 6.5 Modes and glue / 76 6.6 Migrating material / 77 6.6.1 vadjust / 77 6.7 Testing modes / 77 7 Numbers / 79 7.1 Numbers and number's / 79 7.2 Integers / 79 7.2.1 Denotations: integers / 80 7.2.2 Denotations: characters / 80 7.2.3 Internal integers / 81 7.2.4 Internal integers: other codes of a character / 82 7.2.5 special integer / 82 7.2.6 Other internal quantities: coersion to integer / 82 7.2.7 Trailing spaces / 82 7.3 Numbers / 82 7.4 Integer registers / 83 7.5 Arithmetic / 83 7.5.1 Arithmetic statements / 84 7.5.2 Floating-point arithmetic / 84 7.5.3 Fixed-point arithmetic / 84 7.6 Number testing / 84 7.7 Remarks / 85 7.7.1 Character constants / 85 7.7.2 Expanding too far / how far / 85 8 Dimensions and Glue / 87 8.1 Definition of glue and dimen / 88 8.1.1 Definition of dimensions / 88 8.1.2 Definition of glue / 89 8.1.3 Conversion of glue to dimen / 90 8.1.4 Registers for dimen and skip / 90 8.1.5 Arithmetic: addition / 90 8.1.6 Arithmetic: multiplication and division / 91 8.2 More about dimensions / 91 8.2.1 Units of measurement / 91 8.2.2 Dimension testing / 92 8.2.3 Defined dimensions / 92 8.3 More about glue / 92 8.3.1 Stretch and shrink / 93 8.3.2 Glue setting / 94 8.3.3 Badness / 94 8.3.4 Glue and breaking / 95 8.3.5 kern / 95 8.3.6 Glue and modes / 95 8.3.7 The last glue item in a list: backspacing / 96 8.3.8 Examples of backspacing / 96 8.3.9 Glue in trace output / 97 9 Rules and Leaders / 99 9.1 Rules / 99 9.1.1 Rule dimensions / 100 9.2 Leaders / 100 9.2.1 Rule leaders / 101 9.2.2 Box leaders / 102 9.2.3 Evenly spaced leaders / 102 9.3 Assorted remarks / 103 9.3.1 Rules and modes / 103 9.3.2 Ending a paragraph with leaders / 103 9.3.3 Leaders and box registers / 103 9.3.4 Output in leader boxes / 104 9.3.5 Box leaders in trace output / 104 9.3.6 Leaders and shifted margins / 104 10 Grouping / 105 10.1 The grouping mechanism / 105 10.2 Local and global assignments / 106 10.3 Group delimiters / 106 10.4 More about braces / 107 10.4.1 Brace counters / 107 10.4.2 The brace as a token / 108 10.4.3 Open and closing brace control symbols / 108 11 Macros / 109 11.1 Introduction / 109 11.2 Layout of a macro definition / 110 11.3 Prefixes / 110 11.4 The definition type / 111 11.5 The parameter text / 111 11.5.1 Undelimited parameters / 112 11.5.2 Delimited parameters / 112 11.5.3 Examples with delimited arguments / 113 11.5.4 Empty arguments / 114 11.5.5 The macro parameter character / 114 11.5.6 Brace delimiting / 115 11.6 Construction of control sequences / 115 11.7 Token assignments by let and futurelet / 116 11.7.1 let / 116 11.7.2 futurelet / 117 11.8 Assorted remarks / 117 11.8.1 Active characters / 117 11.8.2 Macros versus primitives / 117 11.8.3 Tail recursion / 118 11.9 Macro techniques / 119 11.9.1 Unknown number of arguments / 119 11.9.2 Examining the argument / 119 11.9.3 Optional macro parameters with futurelet / 121 11.9.4 Two-step macros / 121 11.9.5 A comment environment / 122 12 Expansion / 125 12.1 Introduction / 125 12.2 Ordinary expansion / 125 12.3 Reversing expansion order / 126 12.3.1 One step expansion: expandafter / 126 12.3.2 Total expansion: edef / 127 12.3.3 afterassignment / 127 12.3.4 aftergroup / 128 12.4 Preventing expansion / 129 12.4.1 noexpand / 129 12.4.2 noexpand and active characters / 129 12.5 relax / 130 12.5.1 relax and csname / 130 12.5.2 Preventing expansion with relax / 131 12.5.3 TEX inserts a relax / 131 12.5.4 The value of non-macros; the / 132 12.6 Examples / 132 12.6.1 Expanding after / 132 12.6.2 Defining inside an edef / 133 12.6.3 Expansion and write / 134 12.6.4 Controlled expansion inside an edef / 135 12.6.5 Multiple prevention of expansion / 135 12.6.6 More examples with relax / 136 12.6.7 Example: category code saving and restoring / 136 12.6.8 Combining aftergroup and boxes / 137 12.6.9 More expansion / 138 13 Conditionals / 139 13.1 The shape of conditionals / 139 13.2 Character and control sequence tests / 140 13.2.1 if / 140 13.2.2 ifcat / 140 13.2.3 ifx / 141 13.3 Mode tests / 141 13.4 Numerical tests / 142 13.5 Other tests / 142 13.5.1 Dimension testing / 142 13.5.2 Box tests / 142 13.5.3 I/O tests / 142 13.5.4 Case statement / 142 13.5.5 Special tests / 143 13.6 The newif macro / 143 13.7 Evaluation of conditionals / 144 13.8 Assorted remarks / 145 13.8.1 The test gobbles up tokens / 145 13.8.2 The test wants to gobble up the else or fi / 145 13.8.3 Macros and conditionals; the use of expandafter / 146 13.8.4 Incorrect matching / 147 13.8.5 Conditionals and grouping / 147 13.8.6 A trick / 148 13.8.7 More examples of expansion in conditionals / 148 14 Token Lists / 151 14.1 Token lists / 151 14.2 Use of token lists / 151 14.3 token parameter / 152 14.4 Token list registers / 152 14.5 Examples / 153 14.5.1 Operations on token lists: stack macros / 153 14.5.2 Executing token lists / 154 15 Baseline Distances / 155 15.1 Interline glue / 155 15.2 The perceived depth of boxes / 157 15.3 Terminology / 158 15.4 Additional remarks / 158 16 Paragraph Start / 159 16.1 When does a paragraph start / 159 16.2 What happens when a paragraph starts / 160 16.3 Assorted remarks / 160 16.3.1 Starting a paragraph with a box / 160 16.3.2 Starting a paragraph with a group / 160 16.4 Examples / 161 16.4.1 Stretchable indentation / 161 16.4.2 Suppressing indentation / 161 16.4.3 An indentation scheme / 161 16.4.4 A paragraph skip scheme / 162 17 Paragraph End / 165 17.1 The way paragraphs end / 165 17.1.1 The par command and the par token / 165 17.1.2 Paragraph filling: parfillskip / 166 17.2 Assorted remarks / 166 17.2.1 Ending a paragraph and a group at the same time / 166 17.2.2 Ending a paragraph with hfill break / 167 17.2.3 Ending a paragraph with a rule / 167 17.2.4 No page breaks in between paragraphs / 167 17.2.5 Finite parfillskip / 167 17.2.6 A precaution for paragraphs that do not indent / 168 18 Paragraph Shape / 169 18.1 The width of text lines / 170 18.2 Shape parameters / 170 18.2.1 Hanging indentation / 170 18.2.2 General paragraph shapes: parshape / 171 18.3 Assorted remarks / 171 18.3.1 Centred last lines / 171 18.3.2 Indenting into the margin / 172 18.3.3 Hang a paragraph from an object / 172 18.3.4 Another approach to hanging indentation / 173 18.3.5 Hanging indentation versus leftskip shifting / 173 18.3.6 More examples / 174 19 Line Breaking / 175 19.1 Paragraph break cost calculation / 176 19.1.1 Badness / 176 19.1.2 Penalties and other break locations / 177 19.1.3 Demerits / 177 19.1.4 The number of lines of a paragraph / 178 19.1.5 Between the lines / 178 19.2 The process of breaking / 178 19.2.1 Three passes / 179 19.2.2 Tolerance values / 179 19.3 Discretionaries / 179 19.3.1 Hyphens and discretionaries / 179 19.3.2 Examples of discretionaries / 180 19.4 Hyphenation / 181 19.4.1 Start of a word / 181 19.4.2 End of a word / 181 19.4.3 TEX2 versus TEX3 / 182 19.4.4 Patterns and exceptions / 182 19.5 Switching hyphenation patterns / 182 20 Spacing / 185 20.1 Introduction / 185 20.2 Automatic interword space / 185 20.3 User interword space / 186 20.4 Control space and tie / 187 20.5 More on the space factor / 188 20.5.1 Space factor assignments / 188 20.5.2 Punctuation / 188 20.5.3 Other non-letters / 189 20.5.4 Other influences on the space factor / 189 21 Characters in Math Mode / 191 21.1 Mathematical characters / 192 21.2 Delimiters / 192 21.2.1 Delimiter codes / 193 21.2.2 Explicit delimiter commands / 193 21.2.3 Finding a delimiter; successors / 193 21.2.4 big , Big , bigg , and Bigg delimiter macros / 194 21.3 Radicals / 194 21.4 Math accents / 195 22 Fonts in Formulas / 197 22.1 Determining the font of a character in math mode / 197 22.2 Initial family settings / 198 22.3 Family definition / 198 22.4 Some specific font changes / 198 22.4.1 Change the font of ordinary characters and uppercase Greek / 198 22.4.2 Change uppercase Greek independent of text font / 199 22.4.3 Change the font of lowercase Greek and mathematical symbols / 199 22.5 Assorted remarks / 199 22.5.1 New fonts in formulas / 199 22.5.2 Evaluating the families / 200 23 Mathematics Typesetting / 201 23.1 Math modes / 202 23.2 Styles in math mode / 202 23.2.1 Superscripts and subscripts 203 / 11 23.2.2 Choice of styles / 203 23.3 Classes of mathematical objects / 204 23.4 Large operators and their limits / 204 23.5 Vertical centring: vcenter / 205 23.6 Mathematical spacing: mu glue / 205 23.6.1 Classification of mu glue / 206 23.6.2 Muskip registers / 206 23.6.3 Other spaces in math mode / 207 23.7 Generalized fractions / 207 23.8 Underlining, overlining / 208 23.9 Line breaking in math formulas / 208 23.10 Font dimensions of families 2 and 3 / 208 23.10.1 Symbol font attributes / 208 23.10.2 Extension font attributes / 209 23.10.3 Example: subscript lowering / 210 24 Display Math / 211 24.1 Displays / 211 24.2 Displays in paragraphs / 212 24.3 Vertical material around displays / 212 24.4 Glue setting of the display math list / 213 24.5 Centring the display formula: displacement / 213 24.6 Equation numbers / 214 24.6.1 Ordinary equation numbers / 214 24.6.2 The equation number on a separate line / 214 24.7 Non-centred displays / 214 25 Alignment / 217 25.1 Introduction / 217 25.2 Horizontal and vertical alignment / 217 25.2.1 Horizontal alignments: halign / 218 25.2.2 Vertical alignments: valign / 218 25.2.3 Material between the lines: noalign / 218 25.2.4 Size of the alignment / 219 25.3 The preamble / 219 25.3.1 Infinite preambles / 219 25.3.2 Brace counting in preambles / 220 25.3.3 Expansion in the preamble / 220 25.3.4 tabskip / 220 25.4 The alignment / 221 25.4.1 Reading an entry / 221 25.4.2 Alternate specifications: omit / 221 25.4.3 Spanning across multiple columns: span / 222 25.4.4 Rules in alignments / 222 25.4.5 End of a line: cr and crcr / 223 25.5 Example: math alignments / 224 26 Page Shape / 225 26.1 The reference point for global positioning / 225 26.2 topskip / 225 26.3 Page height and depth / 226 27 Page Breaking / 227 27.1 The current page and the recent contributions / 228 27.2 Activating the page builder / 228 27.3 Page length bookkeeping / 228 27.4 Breakpoints / 229 27.4.1 Possible breakpoints / 229 27.4.2 Breakpoint penalties / 229 27.4.3 Breakpoint computation / 230 27.5 vsplit / 231 27.6 Examples of page breaking / 232 27.6.1 Filling up a page / 232 27.6.2 Determining the breakpoint / 232 27.6.3 The page builder after a paragraph / 233 28 Output Routines / 235 28.1 The output token list / 235 28.2 Output and box 255 / 236 28.3 Marks / 236 28.4 Assorted remarks / 238 28.4.1 Hazards in non-trivial output routines / 238 28.4.2 Page numbering / 238 28.4.3 Headlines and footlines in plain TEX / 238 28.4.4 Example: no widow lines / 238 28.4.5 Example: no indentation top of page / 239 28.4.6 More examples of output routines / 240 29 Insertions / 241 29.1 Insertion items / 241 29.2 Insertion class declaration / 242 29.3 Insertion parameters / 242 29.4 Moving insertion items from the contributions list / 243 29.5 Insertions in the output routine / 244 29.6 Plain TEX insertions / 244 30 File Input and Output / 245 30.1 Including files: input and endinput / 245 30.2 File I/O / 246 30.2.1 Opening and closing streams / 246 30.2.2 Input with read / 246 30.2.3 Output with write / 247 30.3 Whatsits / 247 30.4 Assorted remarks / 248 30.4.1 Inspecting input / 248 30.4.2 Testing for existence of files / 248 30.4.3 Timing problems / 248 30.4.4 message versus immediate write 16 / 248 30.4.5 Write inside a vertical box / 249 30.4.6 Expansion and spaces in write and message / 249 31 Allocation / 251 31.1 Allocation commands / 251 31.1.1 count , dimen , skip , muskip , toks / 252 31.1.2 box , fam , write , read , insert / 252 31.2 Ground rules for macro writers / 252 32 Running TEX / 255 32.1 Jobs / 255 32.1.1 Start of the job / 255 32.1.2 End of the job / 256 32.1.3 The log file / 256 32.2 Run modes / 256 33 TEX and the Outside World / 259 33.1 TEX, IniTEX, VirTEX / 259 33.1.1 Formats: loading / 259 33.1.2 Formats: dumping / 260 33.1.3 Formats: preloading / 260 33.1.4 The knowledge of IniTEX / 260 33.1.5 Memory sizes of TEX and IniTEX / 261 33.2 More about formats / 261 33.2.1 Compatibility / 261 33.2.2 Preloaded fonts / 261 33.2.3 The plain format / 262 33.2.4 The LATEX format / 262 33.2.5 Mathematical formats / 262 33.2.6 Other formats / 262 33.3 The dvi file / 263 33.3.1 The dvi file format / 263 33.3.2 Page identification / 263 33.3.3 Magnification / 263 33.4 Specials / 264 33.5 Time / 264 33.6 Fonts / 264 33.6.1 Font metrics / 264 33.6.2 Virtual fonts / 265 33.6.3 Font files / 265 33.6.4 Computer Modern / 266 33.7 TEX and web / 266 33.8 The TEX Users Group / 267 34 Tracing / 269 34.1 Meaning and content: show , showthe , meaning / 270 34.2 Show boxes: showbox , tracingoutput / 270 34.3 Global statistics / 272 34.4 Execution tracing / 273 35 Errors, Catastrophes, and Help / 275 35.1 Error messages / 275 35.2 Overflow errors / 276 35.2.1 Buffer size (500) / 276 35.2.2 Exception dictionary (307) / 276 35.2.3 Font memory (20,000) / 276 35.2.4 Grouping levels / 277 35.2.5 Hash size (2100) / 277 35.2.6 Number of strings (3000) / 277 35.2.7 Input stack size (200) / 277 35.2.8 Main memory size (30,000) / 277 35.2.9 Parameter stack size (60) / 277 35.2.10 Pattern memory (8000) / 278 35.2.11 Pattern memory ops per language / 278 35.2.12 Pool size (32,000) / 278 35.2.13 Save size (600) / 278 35.2.14 Semantic nest size (40) / 278 35.2.15 Text input levels (6) / 278 36 The Grammar of TEX / 279 36.1 Notations / 279 36.2 Keywords / 280 36.3 Specific grammatical terms / 280 36.3.1 equals / 280 36.3.2 filler, general text / 280 36.3.3 and left brace right brace / 281 36.3.4 math field / 281 36.4 Differences between TEX versions 2 and 3 / 281 37 Glossary of TEX Primitives / 283 38 Tables / 297 38.1 Character tables / 298 38.2 Computer modern fonts / 300 38.3 Plain TEX math symbols / 305 38.3.1 Mathcharacter codes / 305 38.3.2 Delimiter codes / 306 38.3.3 mathchardef tokens: ordinary symbols / 307 38.3.4 mathchardef tokens: large operators / 308 38.3.5 mathchardef tokens: binary operations / 309 38.3.6 mathchardef tokens: relations / 310 38.3.7 delimiter macros / 311 39 Index / 313 Bibliography / 321

rawTOC:
License / 15 \\ Preface / 21 \\ 1 The Structure of the TEX Processor / 23 \\ 1.1 Four TEX processors / 23 \\ 1.2 The input processor / 24 \\ 1.2.1 Character input / 24 \\ 1.2.2 Two-level input processing / 24 \\ 1.3 The expansion processor / 25 \\ 1.3.1 The process of expansion / 25 \\ 1.3.2 Special cases: \expandafter, \noexpand, and \the / 25 \\ 1.3.3 Braces in the expansion processor / 26 \\ 1.4 The execution processor / 26 \\ 1.5 The visual processor / 27 \\ 1.6 Examples / 28 \\ 1.6.1 Skipped spaces / 28 \\ 1.6.2 Internal quantities and their representations / 28 \\ 2 Category Codes and Internal States / 29 \\ 2.1 Introduction / 29 \\ 2.2 Initial processing / 29 \\ 2.3 Category codes / 30 \\ 2.4 From characters to tokens / 32 \\ 2.5 The input processor as a finite state automaton / 32 \\ 2.5.1 State N: new line / 32 \\ 2.5.2 State S: skipping spaces / 32 \\ 2.5.3 State M: middle of line / 32 \\ 2.6 Accessing the full character set / 33 \\ 2.7 Transitions between internal states / 33 \\ 2.7.1 0: escape character / 33 \\ 2.7.2 1--4, 7--8, 11--13: non-blank characters / 34 \\ 2.7.3 5: end of line / 34 \\ 2.7.4 6: parameter / 34 \\ 2.7.5 7: superscript / 34 \\ 2.7.6 9: ignored character / 34 \\ 2.7.7 10: space / 35 \\ 2.7.8 14: comment / 35 \\ 2.7.9 15: invalid / 35 \\ 2.8 Letters and other characters / 35 \\ 2.9 The \par token / 36 \\ 2.10 Spaces / 37 \\ 2.10.1 Skipped spaces / 37 \\ 2.10.2 Optional spaces / 37 \\ 2.10.3 Ignored and obeyed spaces / 38 \\ 2.10.4 More ignored spaces / 38 \\ 2.10.5 space token / 39 \\ 2.10.6 Control space / 39 \\ 2.10.7 ` ' / 39 \\ 2.11 More about line ends / 40 \\ 2.11.1 Obeylines / 40 \\ 2.11.2 Changing the \endlinechar / 40 \\ 2.11.3 More remarks about the end-of-line character / 41 \\ 2.12 More about the input processor / 41 \\ 2.12.1 The input processor as a separate process / 41 \\ 2.12.2 The input processor not as a separate process / 42 \\ 2.12.3 Recursive invocation of the input processor / 42 \\ 2.13 The <at> convention / 43 \\ 3 Characters / 45 \\ 3.1 Character codes / 45 \\ 3.2 Control sequences for characters / 46 \\ 3.2.1 Denoting characters to be typeset: \char / 46 \\ 3.2.2 Implicit character tokens: \let / 47 \\ 3.3 Accents / 48 \\ 3.4 Testing characters / 49 \\ 3.5 Uppercase and lowercase / 50 \\ 3.5.1 Uppercase and lowercase codes / 50 \\ 3.5.2 Uppercase and lowercase commands / 50 \\ 3.5.3 Uppercase and lowercase forms of keywords / 50 \\ 3.5.4 Creative use of \uppercase and \lowercase / 51 \\ 3.6 Codes of a character / 51 \\ 3.7 Converting tokens into character strings / 51 \\ 3.7.1 Output of control sequences / 52 \\ 3.7.2 Category codes of a \string / 52 \\ 4 Fonts / 53 \\ 4.1 Fonts / 53 \\ 4.2 Font declaration / 54 \\ 4.2.1 Fonts and tfm files / 54 \\ 4.2.2 Querying the current font and font names / 54 \\ 4.2.3 \nullfont / 55 \\ 4.3 Font information / 55 \\ 4.3.1 Font dimensions / 55 \\ 4.3.2 Kerning / 56 \\ 4.3.3 Italic correction / 56 \\ 4.3.4 Ligatures / 57 \\ 4.3.5 Boundary ligatures / 57 \\ 5 Boxes / 59 \\ 5.1 Boxes / 60 \\ 5.2 Box registers / 60 \\ 5.2.1 Allocation: \newbox / 60 \\ 5.2.2 Usage: \setbox, \box, \copy / 61 \\ 5.2.3 Testing: \ifvoid, \ifhbox, \ifvbox / 61 \\ 5.2.4 The \lastbox / 61 \\ 5.3 Natural dimensions of boxes / 62 \\ 5.3.1 Dimensions of created horizontal boxes / 62 \\ 5.3.2 Dimensions of created vertical boxes / 62 \\ 5.3.3 Examples / 63 \\ 5.4 More about box dimensions / 64 \\ 5.4.1 Predetermined dimensions / 64 \\ 5.4.2 Changes to box dimensions / 65 \\ 5.4.3 Moving boxes around / 65 \\ 5.4.4 Box dimensions and box placement / 65 \\ 5.4.5 Boxes and negative glue / 66 \\ 5.5 Overfull and underfull boxes / 67 \\ 5.6 Opening and closing boxes / 67 \\ 5.7 Unboxing / 68 \\ 5.8 Text in boxes / 69 \\ 5.9 Assorted remarks / 70 \\ 5.9.1 Forgetting the \box / 70 \\ 5.9.2 Special-purpose boxes / 70 \\ 5.9.3 The height of a vertical box in horizontal mode / 70 \\ 5.9.4 More subtleties with vertical boxes / 70 \\ 5.9.5 Hanging the \lastbox back in the list / 71 \\ 5.9.6 Dissecting paragraphs with \lastbox / 72 \\ 6 Horizontal and Vertical Mode / 73 \\ 6.1 Horizontal and vertical mode / 73 \\ 6.1.1 Horizontal mode / 73 \\ 6.1.2 Vertical mode / 74 \\ 6.2 Horizontal and vertical commands / 74 \\ 6.3 The internal modes / 75 \\ 6.3.1 Restricted horizontal mode / 75 \\ 6.3.2 Internal vertical mode / 75 \\ 6.4 Boxes and modes / 76 \\ 6.4.1 What box do you use in what mode? / 76 \\ 6.4.2 What mode holds in what box? / 76 \\ 6.4.3 Mode-dependent behaviour of boxes / 76 \\ 6.5 Modes and glue / 76 \\ 6.6 Migrating material / 77 \\ 6.6.1 \vadjust / 77 \\ 6.7 Testing modes / 77 \\ 7 Numbers / 79 \\ 7.1 Numbers and number's / 79 \\ 7.2 Integers / 79 \\ 7.2.1 Denotations: integers / 80 \\ 7.2.2 Denotations: characters / 80 \\ 7.2.3 Internal integers / 81 \\ 7.2.4 Internal integers: other codes of a character / 82 \\ 7.2.5 special integer / 82 \\ 7.2.6 Other internal quantities: coersion to integer / 82 \\ 7.2.7 Trailing spaces / 82 \\ 7.3 Numbers / 82 \\ 7.4 Integer registers / 83 \\ 7.5 Arithmetic / 83 \\ 7.5.1 Arithmetic statements / 84 \\ 7.5.2 Floating-point arithmetic / 84 \\ 7.5.3 Fixed-point arithmetic / 84 \\ 7.6 Number testing / 84 \\ 7.7 Remarks / 85 \\ 7.7.1 Character constants / 85 \\ 7.7.2 Expanding too far / how far / 85 \\ 8 Dimensions and Glue / 87 \\ 8.1 Definition of glue and dimen / 88 \\ 8.1.1 Definition of dimensions / 88 \\ 8.1.2 Definition of glue / 89 \\ 8.1.3 Conversion of glue to dimen / 90 \\ 8.1.4 Registers for \dimen and \skip / 90 \\ 8.1.5 Arithmetic: addition / 90 \\ 8.1.6 Arithmetic: multiplication and division / 91 \\ 8.2 More about dimensions / 91 \\ 8.2.1 Units of measurement / 91 \\ 8.2.2 Dimension testing / 92 \\ 8.2.3 Defined dimensions / 92 \\ 8.3 More about glue / 92 \\ 8.3.1 Stretch and shrink / 93 \\ 8.3.2 Glue setting / 94 \\ 8.3.3 Badness / 94 \\ 8.3.4 Glue and breaking / 95 \\ 8.3.5 \kern / 95 \\ 8.3.6 Glue and modes / 95 \\ 8.3.7 The last glue item in a list: backspacing / 96 \\ 8.3.8 Examples of backspacing / 96 \\ 8.3.9 Glue in trace output / 97 \\ 9 Rules and Leaders / 99 \\ 9.1 Rules / 99 \\ 9.1.1 Rule dimensions / 100 \\ 9.2 Leaders / 100 \\ 9.2.1 Rule leaders / 101 \\ 9.2.2 Box leaders / 102 \\ 9.2.3 Evenly spaced leaders / 102 \\ 9.3 Assorted remarks / 103 \\ 9.3.1 Rules and modes / 103 \\ 9.3.2 Ending a paragraph with leaders / 103 \\ 9.3.3 Leaders and box registers / 103 \\ 9.3.4 Output in leader boxes / 104 \\ 9.3.5 Box leaders in trace output / 104 \\ 9.3.6 Leaders and shifted margins / 104 \\ 10 Grouping / 105 \\ 10.1 The grouping mechanism / 105 \\ 10.2 Local and global assignments / 106 \\ 10.3 Group delimiters / 106 \\ 10.4 More about braces / 107 \\ 10.4.1 Brace counters / 107 \\ 10.4.2 The brace as a token / 108 \\ 10.4.3 Open and closing brace control symbols / 108 \\ 11 Macros / 109 \\ 11.1 Introduction / 109 \\ 11.2 Layout of a macro definition / 110 \\ 11.3 Prefixes / 110 \\ 11.4 The definition type / 111 \\ 11.5 The parameter text / 111 \\ 11.5.1 Undelimited parameters / 112 \\ 11.5.2 Delimited parameters / 112 \\ 11.5.3 Examples with delimited arguments / 113 \\ 11.5.4 Empty arguments / 114 \\ 11.5.5 The macro parameter character / 114 \\ 11.5.6 Brace delimiting / 115 \\ 11.6 Construction of control sequences / 115 \\ 11.7 Token assignments by \let and \futurelet / 116 \\ 11.7.1 \let / 116 \\ 11.7.2 \futurelet / 117 \\ 11.8 Assorted remarks / 117 \\ 11.8.1 Active characters / 117 \\ 11.8.2 Macros versus primitives / 117 \\ 11.8.3 Tail recursion / 118 \\ 11.9 Macro techniques / 119 \\ 11.9.1 Unknown number of arguments / 119 \\ 11.9.2 Examining the argument / 119 \\ 11.9.3 Optional macro parameters with \futurelet / 121 \\ 11.9.4 Two-step macros / 121 \\ 11.9.5 A comment environment / 122 \\ 12 Expansion / 125 \\ 12.1 Introduction / 125 \\ 12.2 Ordinary expansion / 125 \\ 12.3 Reversing expansion order / 126 \\ 12.3.1 One step expansion: \expandafter / 126 \\ 12.3.2 Total expansion: \edef / 127 \\ 12.3.3 \afterassignment / 127 \\ 12.3.4 \aftergroup / 128 \\ 12.4 Preventing expansion / 129 \\ 12.4.1 \noexpand / 129 \\ 12.4.2 \noexpand and active characters / 129 \\ 12.5 \relax / 130 \\ 12.5.1 \relax and \csname / 130 \\ 12.5.2 Preventing expansion with \relax / 131 \\ 12.5.3 TEX inserts a \relax / 131 \\ 12.5.4 The value of non-macros; \the / 132 \\ 12.6 Examples / 132 \\ 12.6.1 Expanding after / 132 \\ 12.6.2 Defining inside an \edef / 133 \\ 12.6.3 Expansion and \write / 134 \\ 12.6.4 Controlled expansion inside an \edef / 135 \\ 12.6.5 Multiple prevention of expansion / 135 \\ 12.6.6 More examples with \relax / 136 \\ 12.6.7 Example: category code saving and restoring / 136 \\ 12.6.8 Combining \aftergroup and boxes / 137 \\ 12.6.9 More expansion / 138 \\ 13 Conditionals / 139 \\ 13.1 The shape of conditionals / 139 \\ 13.2 Character and control sequence tests / 140 \\ 13.2.1 \if / 140 \\ 13.2.2 \ifcat / 140 \\ 13.2.3 \ifx / 141 \\ 13.3 Mode tests / 141 \\ 13.4 Numerical tests / 142 \\ 13.5 Other tests / 142 \\ 13.5.1 Dimension testing / 142 \\ 13.5.2 Box tests / 142 \\ 13.5.3 I/O tests / 142 \\ 13.5.4 Case statement / 142 \\ 13.5.5 Special tests / 143 \\ 13.6 The \newif macro / 143 \\ 13.7 Evaluation of conditionals / 144 \\ 13.8 Assorted remarks / 145 \\ 13.8.1 The test gobbles up tokens / 145 \\ 13.8.2 The test wants to gobble up the \else or \fi / 145 \\ 13.8.3 Macros and conditionals; the use of \expandafter / 146 \\ 13.8.4 Incorrect matching / 147 \\ 13.8.5 Conditionals and grouping / 147 \\ 13.8.6 A trick / 148 \\ 13.8.7 More examples of expansion in conditionals / 148 \\ 14 Token Lists / 151 \\ 14.1 Token lists / 151 \\ 14.2 Use of token lists / 151 \\ 14.3 token parameter / 152 \\ 14.4 Token list registers / 152 \\ 14.5 Examples / 153 \\ 14.5.1 Operations on token lists: stack macros / 153 \\ 14.5.2 Executing token lists / 154 \\ 15 Baseline Distances / 155 \\ 15.1 Interline glue / 155 \\ 15.2 The perceived depth of boxes / 157 \\ 15.3 Terminology / 158 \\ 15.4 Additional remarks / 158 \\ 16 Paragraph Start / 159 \\ 16.1 When does a paragraph start / 159 \\ 16.2 What happens when a paragraph starts / 160 \\ 16.3 Assorted remarks / 160 \\ 16.3.1 Starting a paragraph with a box / 160 \\ 16.3.2 Starting a paragraph with a group / 160 \\ 16.4 Examples / 161 \\ 16.4.1 Stretchable indentation / 161 \\ 16.4.2 Suppressing indentation / 161 \\ 16.4.3 An indentation scheme / 161 \\ 16.4.4 A paragraph skip scheme / 162 \\ 17 Paragraph End / 165 \\ 17.1 The way paragraphs end / 165 \\ 17.1.1 The \par command and the \par token / 165 \\ 17.1.2 Paragraph filling: \parfillskip / 166 \\ 17.2 Assorted remarks / 166 \\ 17.2.1 Ending a paragraph and a group at the same time / 166 \\ 17.2.2 Ending a paragraph with \hfill\break / 167 \\ 17.2.3 Ending a paragraph with a rule / 167 \\ 17.2.4 No page breaks in between paragraphs / 167 \\ 17.2.5 Finite \parfillskip / 167 \\ 17.2.6 A precaution for paragraphs that do not indent / 168 \\ 18 Paragraph Shape / 169 \\ 18.1 The width of text lines / 170 \\ 18.2 Shape parameters / 170 \\ 18.2.1 Hanging indentation / 170 \\ 18.2.2 General paragraph shapes: \parshape / 171 \\ 18.3 Assorted remarks / 171 \\ 18.3.1 Centred last lines / 171 \\ 18.3.2 Indenting into the margin / 172 \\ 18.3.3 Hang a paragraph from an object / 172 \\ 18.3.4 Another approach to hanging indentation / 173 \\ 18.3.5 Hanging indentation versus \leftskip shifting / 173 \\ 18.3.6 More examples / 174 \\ 19 Line Breaking / 175 \\ 19.1 Paragraph break cost calculation / 176 \\ 19.1.1 Badness / 176 \\ 19.1.2 Penalties and other break locations / 177 \\ 19.1.3 Demerits / 177 \\ 19.1.4 The number of lines of a paragraph / 178 \\ 19.1.5 Between the lines / 178 \\ 19.2 The process of breaking / 178 \\ 19.2.1 Three passes / 179 \\ 19.2.2 Tolerance values / 179 \\ 19.3 Discretionaries / 179 \\ 19.3.1 Hyphens and discretionaries / 179 \\ 19.3.2 Examples of discretionaries / 180 \\ 19.4 Hyphenation / 181 \\ 19.4.1 Start of a word / 181 \\ 19.4.2 End of a word / 181 \\ 19.4.3 TEX2 versus TEX3 / 182 \\ 19.4.4 Patterns and exceptions / 182 \\ 19.5 Switching hyphenation patterns / 182 \\ 20 Spacing / 185 \\ 20.1 Introduction / 185 \\ 20.2 Automatic interword space / 185 \\ 20.3 User interword space / 186 \\ 20.4 Control space and tie / 187 \\ 20.5 More on the space factor / 188 \\ 20.5.1 Space factor assignments / 188 \\ 20.5.2 Punctuation / 188 \\ 20.5.3 Other non-letters / 189 \\ 20.5.4 Other influences on the space factor / 189 \\ 21 Characters in Math Mode / 191 \\ 21.1 Mathematical characters / 192 \\ 21.2 Delimiters / 192 \\ 21.2.1 Delimiter codes / 193 \\ 21.2.2 Explicit \delimiter commands / 193 \\ 21.2.3 Finding a delimiter; successors / 193 \\ 21.2.4 \big, \Big, \bigg, and \Bigg delimiter macros / 194 \\ 21.3 Radicals / 194 \\ 21.4 Math accents / 195 \\ 22 Fonts in Formulas / 197 \\ 22.1 Determining the font of a character in math mode / 197 \\ 22.2 Initial family settings / 198 \\ 22.3 Family definition / 198 \\ 22.4 Some specific font changes / 198 \\ 22.4.1 Change the font of ordinary characters and uppercase Greek / 198 \\ 22.4.2 Change uppercase Greek independent of text font / 199 \\ 22.4.3 Change the font of lowercase Greek and mathematical symbols / 199 \\ 22.5 Assorted remarks / 199 \\ 22.5.1 New fonts in formulas / 199 \\ 22.5.2 Evaluating the families / 200 \\ 23 Mathematics Typesetting / 201 \\ 23.1 Math modes / 202 \\ 23.2 Styles in math mode / 202 \\ 23.2.1 Superscripts and subscripts 203 / 11 \\ 23.2.2 Choice of styles / 203 \\ 23.3 Classes of mathematical objects / 204 \\ 23.4 Large operators and their limits / 204 \\ 23.5 Vertical centring: \vcenter / 205 \\ 23.6 Mathematical spacing: mu glue / 205 \\ 23.6.1 Classification of mu glue / 206 \\ 23.6.2 Muskip registers / 206 \\ 23.6.3 Other spaces in math mode / 207 \\ 23.7 Generalized fractions / 207 \\ 23.8 Underlining, overlining / 208 \\ 23.9 Line breaking in math formulas / 208 \\ 23.10 Font dimensions of families 2 and 3 / 208 \\ 23.10.1 Symbol font attributes / 208 \\ 23.10.2 Extension font attributes / 209 \\ 23.10.3 Example: subscript lowering / 210 \\ 24 Display Math / 211 \\ 24.1 Displays / 211 \\ 24.2 Displays in paragraphs / 212 \\ 24.3 Vertical material around displays / 212 \\ 24.4 Glue setting of the display math list / 213 \\ 24.5 Centring the display formula: displacement / 213 \\ 24.6 Equation numbers / 214 \\ 24.6.1 Ordinary equation numbers / 214 \\ 24.6.2 The equation number on a separate line / 214 \\ 24.7 Non-centred displays / 214 \\ 25 Alignment / 217 \\ 25.1 Introduction / 217 \\ 25.2 Horizontal and vertical alignment / 217 \\ 25.2.1 Horizontal alignments: \halign / 218 \\ 25.2.2 Vertical alignments: \valign / 218 \\ 25.2.3 Material between the lines: \noalign / 218 \\ 25.2.4 Size of the alignment / 219 \\ 25.3 The preamble / 219 \\ 25.3.1 Infinite preambles / 219 \\ 25.3.2 Brace counting in preambles / 220 \\ 25.3.3 Expansion in the preamble / 220 \\ 25.3.4 \tabskip / 220 \\ 25.4 The alignment / 221 \\ 25.4.1 Reading an entry / 221 \\ 25.4.2 Alternate specifications: \omit / 221 \\ 25.4.3 Spanning across multiple columns: \span / 222 \\ 25.4.4 Rules in alignments / 222 \\ 25.4.5 End of a line: \cr and \crcr / 223 \\ 25.5 Example: math alignments / 224 \\ 26 Page Shape / 225 \\ 26.1 The reference point for global positioning / 225 \\ 26.2 \topskip / 225 \\ 26.3 Page height and depth / 226 \\ 27 Page Breaking / 227 \\ 27.1 The current page and the recent contributions / 228 \\ 27.2 Activating the page builder / 228 \\ 27.3 Page length bookkeeping / 228 \\ 27.4 Breakpoints / 229 \\ 27.4.1 Possible breakpoints / 229 \\ 27.4.2 Breakpoint penalties / 229 \\ 27.4.3 Breakpoint computation / 230 \\ 27.5 \vsplit / 231 \\ 27.6 Examples of page breaking / 232 \\ 27.6.1 Filling up a page / 232 \\ 27.6.2 Determining the breakpoint / 232 \\ 27.6.3 The page builder after a paragraph / 233 \\ 28 Output Routines / 235 \\ 28.1 The \output token list / 235 \\ 28.2 Output and \box255 / 236 \\ 28.3 Marks / 236 \\ 28.4 Assorted remarks / 238 \\ 28.4.1 Hazards in non-trivial output routines / 238 \\ 28.4.2 Page numbering / 238 \\ 28.4.3 Headlines and footlines in plain TEX / 238 \\ 28.4.4 Example: no widow lines / 238 \\ 28.4.5 Example: no indentation top of page / 239 \\ 28.4.6 More examples of output routines / 240 \\ 29 Insertions / 241 \\ 29.1 Insertion items / 241 \\ 29.2 Insertion class declaration / 242 \\ 29.3 Insertion parameters / 242 \\ 29.4 Moving insertion items from the contributions list / 243 \\ 29.5 Insertions in the output routine / 244 \\ 29.6 Plain TEX insertions / 244 \\ 30 File Input and Output / 245 \\ 30.1 Including files: \input and \endinput / 245 \\ 30.2 File I/O / 246 \\ 30.2.1 Opening and closing streams / 246 \\ 30.2.2 Input with \read / 246 \\ 30.2.3 Output with \write / 247 \\ 30.3 Whatsits / 247 \\ 30.4 Assorted remarks / 248 \\ 30.4.1 Inspecting input / 248 \\ 30.4.2 Testing for existence of files / 248 \\ 30.4.3 Timing problems / 248 \\ 30.4.4 \message versus \immediate\write16 / 248 \\ 30.4.5 Write inside a vertical box / 249 \\ 30.4.6 Expansion and spaces in \write and \message / 249 \\ 31 Allocation / 251 \\ 31.1 Allocation commands / 251 \\ 31.1.1 \count, \dimen, \skip, \muskip, \toks / 252 \\ 31.1.2 \box, \fam, \write, \read, \insert / 252 \\ 31.2 Ground rules for macro writers / 252 \\ 32 Running TEX / 255 \\ 32.1 Jobs / 255 \\ 32.1.1 Start of the job / 255 \\ 32.1.2 End of the job / 256 \\ 32.1.3 The log file / 256 \\ 32.2 Run modes / 256 \\ 33 TEX and the Outside World / 259 \\ 33.1 TEX, IniTEX, VirTEX / 259 \\ 33.1.1 Formats: loading / 259 \\ 33.1.2 Formats: dumping / 260 \\ 33.1.3 Formats: preloading / 260 \\ 33.1.4 The knowledge of IniTEX / 260 \\ 33.1.5 Memory sizes of TEX and IniTEX / 261 \\ 33.2 More about formats / 261 \\ 33.2.1 Compatibility / 261 \\ 33.2.2 Preloaded fonts / 261 \\ 33.2.3 The plain format / 262 \\ 33.2.4 The LATEX format / 262 \\ 33.2.5 Mathematical formats / 262 \\ 33.2.6 Other formats / 262 \\ 33.3 The dvi file / 263 \\ 33.3.1 The dvi file format / 263 \\ 33.3.2 Page identification / 263 \\ 33.3.3 Magnification / 263 \\ 33.4 Specials / 264 \\ 33.5 Time / 264 \\ 33.6 Fonts / 264 \\ 33.6.1 Font metrics / 264 \\ 33.6.2 Virtual fonts / 265 \\ 33.6.3 Font files / 265 \\ 33.6.4 Computer Modern / 266 \\ 33.7 TEX and web / 266 \\ 33.8 The TEX Users Group / 267 \\ 34 Tracing / 269 \\ 34.1 Meaning and content: \show, \showthe, \meaning / 270 \\ 34.2 Show boxes: \showbox, \tracingoutput / 270 \\ 34.3 Global statistics / 272 \\ 34.4 Execution tracing / 273 \\ 35 Errors, Catastrophes, and Help / 275 \\ 35.1 Error messages / 275 \\ 35.2 Overflow errors / 276 \\ 35.2.1 Buffer size (500) / 276 \\ 35.2.2 Exception dictionary (307) / 276 \\ 35.2.3 Font memory (20,000) / 276 \\ 35.2.4 Grouping levels / 277 \\ 35.2.5 Hash size (2100) / 277 \\ 35.2.6 Number of strings (3000) / 277 \\ 35.2.7 Input stack size (200) / 277 \\ 35.2.8 Main memory size (30,000) / 277 \\ 35.2.9 Parameter stack size (60) / 277 \\ 35.2.10 Pattern memory (8000) / 278 \\ 35.2.11 Pattern memory ops per language / 278 \\ 35.2.12 Pool size (32,000) / 278 \\ 35.2.13 Save size (600) / 278 \\ 35.2.14 Semantic nest size (40) / 278 \\ 35.2.15 Text input levels (6) / 278 \\ 36 The Grammar of TEX / 279 \\ 36.1 Notations / 279 \\ 36.2 Keywords / 280 \\ 36.3 Specific grammatical terms / 280 \\ 36.3.1 equals / 280 \\ 36.3.2 filler, general text / 280 \\ 36.3.3 {} and left brace right brace / 281 \\ 36.3.4 math field / 281 \\ 36.4 Differences between TEX versions 2 and 3 / 281 \\ 37 Glossary of TEX Primitives / 283 \\ 38 Tables / 297 \\ 38.1 Character tables / 298 \\ 38.2 Computer modern fonts / 300 \\ 38.3 Plain TEX math symbols / 305 \\ 38.3.1 Mathcharacter codes / 305 \\ 38.3.2 Delimiter codes / 306 \\ 38.3.3 mathchardef tokens: ordinary symbols / 307 \\ 38.3.4 mathchardef tokens: large operators / 308 \\ 38.3.5 mathchardef tokens: binary operations / 309 \\ 38.3.6 mathchardef tokens: relations / 310 \\ 38.3.7 \delimiter macros / 311 \\ 39 Index / 313 \\ Bibliography / 321

entry:
@Book{Eijkhout:1992:TTT,
  author =       "Victor Eijkhout",
  title =        "{\TeX} by Topic, a {\TeX}nician's Reference",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "vii + 307",
  year =         "1992",
  ISBN =         "0-201-56882-9",
  ISBN-13 =      "978-0-201-56882-0",
  LCCN =         "Z253.4.T47 E38 1992",
  bibdate =      "Tue Dec 14 22:47:52 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sgml.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  URL =          "http://eijkhout.net/texbytopic/",
  acknowledgement = ack-nhfb,
  tableofcontents = "License / 15 \\
                 Preface / 21 \\
                 1 The Structure of the TEX Processor / 23 \\
                 1.1 Four TEX processors / 23 \\
                 1.2 The input processor / 24 \\
                 1.2.1 Character input / 24 \\
                 1.2.2 Two-level input processing / 24 \\
                 1.3 The expansion processor / 25 \\
                 1.3.1 The process of expansion / 25 \\
                 1.3.2 Special cases: \expandafter, \noexpand, and \the
                 / 25 \\
                 1.3.3 Braces in the expansion processor / 26 \\
                 1.4 The execution processor / 26 \\
                 1.5 The visual processor / 27 \\
                 1.6 Examples / 28 \\
                 1.6.1 Skipped spaces / 28 \\
                 1.6.2 Internal quantities and their representations /
                 28 \\
                 2 Category Codes and Internal States / 29 \\
                 2.1 Introduction / 29 \\
                 2.2 Initial processing / 29 \\
                 2.3 Category codes / 30 \\
                 2.4 From characters to tokens / 32 \\
                 2.5 The input processor as a finite state automaton /
                 32 \\
                 2.5.1 State N: new line / 32 \\
                 2.5.2 State S: skipping spaces / 32 \\
                 2.5.3 State M: middle of line / 32 \\
                 2.6 Accessing the full character set / 33 \\
                 2.7 Transitions between internal states / 33 \\
                 2.7.1 0: escape character / 33 \\
                 2.7.2 1--4, 7--8, 11--13: non-blank characters / 34 \\
                 2.7.3 5: end of line / 34 \\
                 2.7.4 6: parameter / 34 \\
                 2.7.5 7: superscript / 34 \\
                 2.7.6 9: ignored character / 34 \\
                 2.7.7 10: space / 35 \\
                 2.7.8 14: comment / 35 \\
                 2.7.9 15: invalid / 35 \\
                 2.8 Letters and other characters / 35 \\
                 2.9 The \par token / 36 \\
                 2.10 Spaces / 37 \\
                 2.10.1 Skipped spaces / 37 \\
                 2.10.2 Optional spaces / 37 \\
                 2.10.3 Ignored and obeyed spaces / 38 \\
                 2.10.4 More ignored spaces / 38 \\
                 2.10.5 space token / 39 \\
                 2.10.6 Control space / 39 \\
                 2.10.7 ` ' / 39 \\
                 2.11 More about line ends / 40 \\
                 2.11.1 Obeylines / 40 \\
                 2.11.2 Changing the \endlinechar / 40 \\
                 2.11.3 More remarks about the end-of-line character /
                 41 \\
                 2.12 More about the input processor / 41 \\
                 2.12.1 The input processor as a separate process / 41
                 \\
                 2.12.2 The input processor not as a separate process /
                 42 \\
                 2.12.3 Recursive invocation of the input processor / 42
                 \\
                 2.13 The <at> convention / 43 \\
                 3 Characters / 45 \\
                 3.1 Character codes / 45 \\
                 3.2 Control sequences for characters / 46 \\
                 3.2.1 Denoting characters to be typeset: \char / 46 \\
                 3.2.2 Implicit character tokens: \let / 47 \\
                 3.3 Accents / 48 \\
                 3.4 Testing characters / 49 \\
                 3.5 Uppercase and lowercase / 50 \\
                 3.5.1 Uppercase and lowercase codes / 50 \\
                 3.5.2 Uppercase and lowercase commands / 50 \\
                 3.5.3 Uppercase and lowercase forms of keywords / 50
                 \\
                 3.5.4 Creative use of \uppercase and \lowercase / 51
                 \\
                 3.6 Codes of a character / 51 \\
                 3.7 Converting tokens into character strings / 51 \\
                 3.7.1 Output of control sequences / 52 \\
                 3.7.2 Category codes of a \string / 52 \\
                 4 Fonts / 53 \\
                 4.1 Fonts / 53 \\
                 4.2 Font declaration / 54 \\
                 4.2.1 Fonts and tfm files / 54 \\
                 4.2.2 Querying the current font and font names / 54 \\
                 4.2.3 \nullfont / 55 \\
                 4.3 Font information / 55 \\
                 4.3.1 Font dimensions / 55 \\
                 4.3.2 Kerning / 56 \\
                 4.3.3 Italic correction / 56 \\
                 4.3.4 Ligatures / 57 \\
                 4.3.5 Boundary ligatures / 57 \\
                 5 Boxes / 59 \\
                 5.1 Boxes / 60 \\
                 5.2 Box registers / 60 \\
                 5.2.1 Allocation: \newbox / 60 \\
                 5.2.2 Usage: \setbox, \box, \copy / 61 \\
                 5.2.3 Testing: \ifvoid, \ifhbox, \ifvbox / 61 \\
                 5.2.4 The \lastbox / 61 \\
                 5.3 Natural dimensions of boxes / 62 \\
                 5.3.1 Dimensions of created horizontal boxes / 62 \\
                 5.3.2 Dimensions of created vertical boxes / 62 \\
                 5.3.3 Examples / 63 \\
                 5.4 More about box dimensions / 64 \\
                 5.4.1 Predetermined dimensions / 64 \\
                 5.4.2 Changes to box dimensions / 65 \\
                 5.4.3 Moving boxes around / 65 \\
                 5.4.4 Box dimensions and box placement / 65 \\
                 5.4.5 Boxes and negative glue / 66 \\
                 5.5 Overfull and underfull boxes / 67 \\
                 5.6 Opening and closing boxes / 67 \\
                 5.7 Unboxing / 68 \\
                 5.8 Text in boxes / 69 \\
                 5.9 Assorted remarks / 70 \\
                 5.9.1 Forgetting the \box / 70 \\
                 5.9.2 Special-purpose boxes / 70 \\
                 5.9.3 The height of a vertical box in horizontal mode /
                 70 \\
                 5.9.4 More subtleties with vertical boxes / 70 \\
                 5.9.5 Hanging the \lastbox back in the list / 71 \\
                 5.9.6 Dissecting paragraphs with \lastbox / 72 \\
                 6 Horizontal and Vertical Mode / 73 \\
                 6.1 Horizontal and vertical mode / 73 \\
                 6.1.1 Horizontal mode / 73 \\
                 6.1.2 Vertical mode / 74 \\
                 6.2 Horizontal and vertical commands / 74 \\
                 6.3 The internal modes / 75 \\
                 6.3.1 Restricted horizontal mode / 75 \\
                 6.3.2 Internal vertical mode / 75 \\
                 6.4 Boxes and modes / 76 \\
                 6.4.1 What box do you use in what mode? / 76 \\
                 6.4.2 What mode holds in what box? / 76 \\
                 6.4.3 Mode-dependent behaviour of boxes / 76 \\
                 6.5 Modes and glue / 76 \\
                 6.6 Migrating material / 77 \\
                 6.6.1 \vadjust / 77 \\
                 6.7 Testing modes / 77 \\
                 7 Numbers / 79 \\
                 7.1 Numbers and number's / 79 \\
                 7.2 Integers / 79 \\
                 7.2.1 Denotations: integers / 80 \\
                 7.2.2 Denotations: characters / 80 \\
                 7.2.3 Internal integers / 81 \\
                 7.2.4 Internal integers: other codes of a character /
                 82 \\
                 7.2.5 special integer / 82 \\
                 7.2.6 Other internal quantities: coersion to integer /
                 82 \\
                 7.2.7 Trailing spaces / 82 \\
                 7.3 Numbers / 82 \\
                 7.4 Integer registers / 83 \\
                 7.5 Arithmetic / 83 \\
                 7.5.1 Arithmetic statements / 84 \\
                 7.5.2 Floating-point arithmetic / 84 \\
                 7.5.3 Fixed-point arithmetic / 84 \\
                 7.6 Number testing / 84 \\
                 7.7 Remarks / 85 \\
                 7.7.1 Character constants / 85 \\
                 7.7.2 Expanding too far / how far / 85 \\
                 8 Dimensions and Glue / 87 \\
                 8.1 Definition of glue and dimen / 88 \\
                 8.1.1 Definition of dimensions / 88 \\
                 8.1.2 Definition of glue / 89 \\
                 8.1.3 Conversion of glue to dimen / 90 \\
                 8.1.4 Registers for \dimen and \skip / 90 \\
                 8.1.5 Arithmetic: addition / 90 \\
                 8.1.6 Arithmetic: multiplication and division / 91 \\
                 8.2 More about dimensions / 91 \\
                 8.2.1 Units of measurement / 91 \\
                 8.2.2 Dimension testing / 92 \\
                 8.2.3 Defined dimensions / 92 \\
                 8.3 More about glue / 92 \\
                 8.3.1 Stretch and shrink / 93 \\
                 8.3.2 Glue setting / 94 \\
                 8.3.3 Badness / 94 \\
                 8.3.4 Glue and breaking / 95 \\
                 8.3.5 \kern / 95 \\
                 8.3.6 Glue and modes / 95 \\
                 8.3.7 The last glue item in a list: backspacing / 96
                 \\
                 8.3.8 Examples of backspacing / 96 \\
                 8.3.9 Glue in trace output / 97 \\
                 9 Rules and Leaders / 99 \\
                 9.1 Rules / 99 \\
                 9.1.1 Rule dimensions / 100 \\
                 9.2 Leaders / 100 \\
                 9.2.1 Rule leaders / 101 \\
                 9.2.2 Box leaders / 102 \\
                 9.2.3 Evenly spaced leaders / 102 \\
                 9.3 Assorted remarks / 103 \\
                 9.3.1 Rules and modes / 103 \\
                 9.3.2 Ending a paragraph with leaders / 103 \\
                 9.3.3 Leaders and box registers / 103 \\
                 9.3.4 Output in leader boxes / 104 \\
                 9.3.5 Box leaders in trace output / 104 \\
                 9.3.6 Leaders and shifted margins / 104 \\
                 10 Grouping / 105 \\
                 10.1 The grouping mechanism / 105 \\
                 10.2 Local and global assignments / 106 \\
                 10.3 Group delimiters / 106 \\
                 10.4 More about braces / 107 \\
                 10.4.1 Brace counters / 107 \\
                 10.4.2 The brace as a token / 108 \\
                 10.4.3 Open and closing brace control symbols / 108 \\
                 11 Macros / 109 \\
                 11.1 Introduction / 109 \\
                 11.2 Layout of a macro definition / 110 \\
                 11.3 Prefixes / 110 \\
                 11.4 The definition type / 111 \\
                 11.5 The parameter text / 111 \\
                 11.5.1 Undelimited parameters / 112 \\
                 11.5.2 Delimited parameters / 112 \\
                 11.5.3 Examples with delimited arguments / 113 \\
                 11.5.4 Empty arguments / 114 \\
                 11.5.5 The macro parameter character / 114 \\
                 11.5.6 Brace delimiting / 115 \\
                 11.6 Construction of control sequences / 115 \\
                 11.7 Token assignments by \let and \futurelet / 116 \\
                 11.7.1 \let / 116 \\
                 11.7.2 \futurelet / 117 \\
                 11.8 Assorted remarks / 117 \\
                 11.8.1 Active characters / 117 \\
                 11.8.2 Macros versus primitives / 117 \\
                 11.8.3 Tail recursion / 118 \\
                 11.9 Macro techniques / 119 \\
                 11.9.1 Unknown number of arguments / 119 \\
                 11.9.2 Examining the argument / 119 \\
                 11.9.3 Optional macro parameters with \futurelet / 121
                 \\
                 11.9.4 Two-step macros / 121 \\
                 11.9.5 A comment environment / 122 \\
                 12 Expansion / 125 \\
                 12.1 Introduction / 125 \\
                 12.2 Ordinary expansion / 125 \\
                 12.3 Reversing expansion order / 126 \\
                 12.3.1 One step expansion: \expandafter / 126 \\
                 12.3.2 Total expansion: \edef / 127 \\
                 12.3.3 \afterassignment / 127 \\
                 12.3.4 \aftergroup / 128 \\
                 12.4 Preventing expansion / 129 \\
                 12.4.1 \noexpand / 129 \\
                 12.4.2 \noexpand and active characters / 129 \\
                 12.5 \relax / 130 \\
                 12.5.1 \relax and \csname / 130 \\
                 12.5.2 Preventing expansion with \relax / 131 \\
                 12.5.3 TEX inserts a \relax / 131 \\
                 12.5.4 The value of non-macros; \the / 132 \\
                 12.6 Examples / 132 \\
                 12.6.1 Expanding after / 132 \\
                 12.6.2 Defining inside an \edef / 133 \\
                 12.6.3 Expansion and \write / 134 \\
                 12.6.4 Controlled expansion inside an \edef / 135 \\
                 12.6.5 Multiple prevention of expansion / 135 \\
                 12.6.6 More examples with \relax / 136 \\
                 12.6.7 Example: category code saving and restoring /
                 136 \\
                 12.6.8 Combining \aftergroup and boxes / 137 \\
                 12.6.9 More expansion / 138 \\
                 13 Conditionals / 139 \\
                 13.1 The shape of conditionals / 139 \\
                 13.2 Character and control sequence tests / 140 \\
                 13.2.1 \if / 140 \\
                 13.2.2 \ifcat / 140 \\
                 13.2.3 \ifx / 141 \\
                 13.3 Mode tests / 141 \\
                 13.4 Numerical tests / 142 \\
                 13.5 Other tests / 142 \\
                 13.5.1 Dimension testing / 142 \\
                 13.5.2 Box tests / 142 \\
                 13.5.3 I/O tests / 142 \\
                 13.5.4 Case statement / 142 \\
                 13.5.5 Special tests / 143 \\
                 13.6 The \newif macro / 143 \\
                 13.7 Evaluation of conditionals / 144 \\
                 13.8 Assorted remarks / 145 \\
                 13.8.1 The test gobbles up tokens / 145 \\
                 13.8.2 The test wants to gobble up the \else or \fi /
                 145 \\
                 13.8.3 Macros and conditionals; the use of \expandafter
                 / 146 \\
                 13.8.4 Incorrect matching / 147 \\
                 13.8.5 Conditionals and grouping / 147 \\
                 13.8.6 A trick / 148 \\
                 13.8.7 More examples of expansion in conditionals / 148
                 \\
                 14 Token Lists / 151 \\
                 14.1 Token lists / 151 \\
                 14.2 Use of token lists / 151 \\
                 14.3 token parameter / 152 \\
                 14.4 Token list registers / 152 \\
                 14.5 Examples / 153 \\
                 14.5.1 Operations on token lists: stack macros / 153
                 \\
                 14.5.2 Executing token lists / 154 \\
                 15 Baseline Distances / 155 \\
                 15.1 Interline glue / 155 \\
                 15.2 The perceived depth of boxes / 157 \\
                 15.3 Terminology / 158 \\
                 15.4 Additional remarks / 158 \\
                 16 Paragraph Start / 159 \\
                 16.1 When does a paragraph start / 159 \\
                 16.2 What happens when a paragraph starts / 160 \\
                 16.3 Assorted remarks / 160 \\
                 16.3.1 Starting a paragraph with a box / 160 \\
                 16.3.2 Starting a paragraph with a group / 160 \\
                 16.4 Examples / 161 \\
                 16.4.1 Stretchable indentation / 161 \\
                 16.4.2 Suppressing indentation / 161 \\
                 16.4.3 An indentation scheme / 161 \\
                 16.4.4 A paragraph skip scheme / 162 \\
                 17 Paragraph End / 165 \\
                 17.1 The way paragraphs end / 165 \\
                 17.1.1 The \par command and the \par token / 165 \\
                 17.1.2 Paragraph filling: \parfillskip / 166 \\
                 17.2 Assorted remarks / 166 \\
                 17.2.1 Ending a paragraph and a group at the same time
                 / 166 \\
                 17.2.2 Ending a paragraph with \hfill\break / 167 \\
                 17.2.3 Ending a paragraph with a rule / 167 \\
                 17.2.4 No page breaks in between paragraphs / 167 \\
                 17.2.5 Finite \parfillskip / 167 \\
                 17.2.6 A precaution for paragraphs that do not indent /
                 168 \\
                 18 Paragraph Shape / 169 \\
                 18.1 The width of text lines / 170 \\
                 18.2 Shape parameters / 170 \\
                 18.2.1 Hanging indentation / 170 \\
                 18.2.2 General paragraph shapes: \parshape / 171 \\
                 18.3 Assorted remarks / 171 \\
                 18.3.1 Centred last lines / 171 \\
                 18.3.2 Indenting into the margin / 172 \\
                 18.3.3 Hang a paragraph from an object / 172 \\
                 18.3.4 Another approach to hanging indentation / 173
                 \\
                 18.3.5 Hanging indentation versus \leftskip shifting /
                 173 \\
                 18.3.6 More examples / 174 \\
                 19 Line Breaking / 175 \\
                 19.1 Paragraph break cost calculation / 176 \\
                 19.1.1 Badness / 176 \\
                 19.1.2 Penalties and other break locations / 177 \\
                 19.1.3 Demerits / 177 \\
                 19.1.4 The number of lines of a paragraph / 178 \\
                 19.1.5 Between the lines / 178 \\
                 19.2 The process of breaking / 178 \\
                 19.2.1 Three passes / 179 \\
                 19.2.2 Tolerance values / 179 \\
                 19.3 Discretionaries / 179 \\
                 19.3.1 Hyphens and discretionaries / 179 \\
                 19.3.2 Examples of discretionaries / 180 \\
                 19.4 Hyphenation / 181 \\
                 19.4.1 Start of a word / 181 \\
                 19.4.2 End of a word / 181 \\
                 19.4.3 TEX2 versus TEX3 / 182 \\
                 19.4.4 Patterns and exceptions / 182 \\
                 19.5 Switching hyphenation patterns / 182 \\
                 20 Spacing / 185 \\
                 20.1 Introduction / 185 \\
                 20.2 Automatic interword space / 185 \\
                 20.3 User interword space / 186 \\
                 20.4 Control space and tie / 187 \\
                 20.5 More on the space factor / 188 \\
                 20.5.1 Space factor assignments / 188 \\
                 20.5.2 Punctuation / 188 \\
                 20.5.3 Other non-letters / 189 \\
                 20.5.4 Other influences on the space factor / 189 \\
                 21 Characters in Math Mode / 191 \\
                 21.1 Mathematical characters / 192 \\
                 21.2 Delimiters / 192 \\
                 21.2.1 Delimiter codes / 193 \\
                 21.2.2 Explicit \delimiter commands / 193 \\
                 21.2.3 Finding a delimiter; successors / 193 \\
                 21.2.4 \big, \Big, \bigg, and \Bigg delimiter macros /
                 194 \\
                 21.3 Radicals / 194 \\
                 21.4 Math accents / 195 \\
                 22 Fonts in Formulas / 197 \\
                 22.1 Determining the font of a character in math mode /
                 197 \\
                 22.2 Initial family settings / 198 \\
                 22.3 Family definition / 198 \\
                 22.4 Some specific font changes / 198 \\
                 22.4.1 Change the font of ordinary characters and
                 uppercase Greek / 198 \\
                 22.4.2 Change uppercase Greek independent of text font
                 / 199 \\
                 22.4.3 Change the font of lowercase Greek and
                 mathematical symbols / 199 \\
                 22.5 Assorted remarks / 199 \\
                 22.5.1 New fonts in formulas / 199 \\
                 22.5.2 Evaluating the families / 200 \\
                 23 Mathematics Typesetting / 201 \\
                 23.1 Math modes / 202 \\
                 23.2 Styles in math mode / 202 \\
                 23.2.1 Superscripts and subscripts 203 / 11 \\
                 23.2.2 Choice of styles / 203 \\
                 23.3 Classes of mathematical objects / 204 \\
                 23.4 Large operators and their limits / 204 \\
                 23.5 Vertical centring: \vcenter / 205 \\
                 23.6 Mathematical spacing: mu glue / 205 \\
                 23.6.1 Classification of mu glue / 206 \\
                 23.6.2 Muskip registers / 206 \\
                 23.6.3 Other spaces in math mode / 207 \\
                 23.7 Generalized fractions / 207 \\
                 23.8 Underlining, overlining / 208 \\
                 23.9 Line breaking in math formulas / 208 \\
                 23.10 Font dimensions of families 2 and 3 / 208 \\
                 23.10.1 Symbol font attributes / 208 \\
                 23.10.2 Extension font attributes / 209 \\
                 23.10.3 Example: subscript lowering / 210 \\
                 24 Display Math / 211 \\
                 24.1 Displays / 211 \\
                 24.2 Displays in paragraphs / 212 \\
                 24.3 Vertical material around displays / 212 \\
                 24.4 Glue setting of the display math list / 213 \\
                 24.5 Centring the display formula: displacement / 213
                 \\
                 24.6 Equation numbers / 214 \\
                 24.6.1 Ordinary equation numbers / 214 \\
                 24.6.2 The equation number on a separate line / 214 \\
                 24.7 Non-centred displays / 214 \\
                 25 Alignment / 217 \\
                 25.1 Introduction / 217 \\
                 25.2 Horizontal and vertical alignment / 217 \\
                 25.2.1 Horizontal alignments: \halign / 218 \\
                 25.2.2 Vertical alignments: \valign / 218 \\
                 25.2.3 Material between the lines: \noalign / 218 \\
                 25.2.4 Size of the alignment / 219 \\
                 25.3 The preamble / 219 \\
                 25.3.1 Infinite preambles / 219 \\
                 25.3.2 Brace counting in preambles / 220 \\
                 25.3.3 Expansion in the preamble / 220 \\
                 25.3.4 \tabskip / 220 \\
                 25.4 The alignment / 221 \\
                 25.4.1 Reading an entry / 221 \\
                 25.4.2 Alternate specifications: \omit / 221 \\
                 25.4.3 Spanning across multiple columns: \span / 222
                 \\
                 25.4.4 Rules in alignments / 222 \\
                 25.4.5 End of a line: \cr and \crcr / 223 \\
                 25.5 Example: math alignments / 224 \\
                 26 Page Shape / 225 \\
                 26.1 The reference point for global positioning / 225
                 \\
                 26.2 \topskip / 225 \\
                 26.3 Page height and depth / 226 \\
                 27 Page Breaking / 227 \\
                 27.1 The current page and the recent contributions /
                 228 \\
                 27.2 Activating the page builder / 228 \\
                 27.3 Page length bookkeeping / 228 \\
                 27.4 Breakpoints / 229 \\
                 27.4.1 Possible breakpoints / 229 \\
                 27.4.2 Breakpoint penalties / 229 \\
                 27.4.3 Breakpoint computation / 230 \\
                 27.5 \vsplit / 231 \\
                 27.6 Examples of page breaking / 232 \\
                 27.6.1 Filling up a page / 232 \\
                 27.6.2 Determining the breakpoint / 232 \\
                 27.6.3 The page builder after a paragraph / 233 \\
                 28 Output Routines / 235 \\
                 28.1 The \output token list / 235 \\
                 28.2 Output and \box255 / 236 \\
                 28.3 Marks / 236 \\
                 28.4 Assorted remarks / 238 \\
                 28.4.1 Hazards in non-trivial output routines / 238 \\
                 28.4.2 Page numbering / 238 \\
                 28.4.3 Headlines and footlines in plain TEX / 238 \\
                 28.4.4 Example: no widow lines / 238 \\
                 28.4.5 Example: no indentation top of page / 239 \\
                 28.4.6 More examples of output routines / 240 \\
                 29 Insertions / 241 \\
                 29.1 Insertion items / 241 \\
                 29.2 Insertion class declaration / 242 \\
                 29.3 Insertion parameters / 242 \\
                 29.4 Moving insertion items from the contributions list
                 / 243 \\
                 29.5 Insertions in the output routine / 244 \\
                 29.6 Plain TEX insertions / 244 \\
                 30 File Input and Output / 245 \\
                 30.1 Including files: \input and \endinput / 245 \\
                 30.2 File I/O / 246 \\
                 30.2.1 Opening and closing streams / 246 \\
                 30.2.2 Input with \read / 246 \\
                 30.2.3 Output with \write / 247 \\
                 30.3 Whatsits / 247 \\
                 30.4 Assorted remarks / 248 \\
                 30.4.1 Inspecting input / 248 \\
                 30.4.2 Testing for existence of files / 248 \\
                 30.4.3 Timing problems / 248 \\
                 30.4.4 \message versus \immediate\write16 / 248 \\
                 30.4.5 Write inside a vertical box / 249 \\
                 30.4.6 Expansion and spaces in \write and \message /
                 249 \\
                 31 Allocation / 251 \\
                 31.1 Allocation commands / 251 \\
                 31.1.1 \count, \dimen, \skip, \muskip, \toks / 252 \\
                 31.1.2 \box, \fam, \write, \read, \insert / 252 \\
                 31.2 Ground rules for macro writers / 252 \\
                 32 Running TEX / 255 \\
                 32.1 Jobs / 255 \\
                 32.1.1 Start of the job / 255 \\
                 32.1.2 End of the job / 256 \\
                 32.1.3 The log file / 256 \\
                 32.2 Run modes / 256 \\
                 33 TEX and the Outside World / 259 \\
                 33.1 TEX, IniTEX, VirTEX / 259 \\
                 33.1.1 Formats: loading / 259 \\
                 33.1.2 Formats: dumping / 260 \\
                 33.1.3 Formats: preloading / 260 \\
                 33.1.4 The knowledge of IniTEX / 260 \\
                 33.1.5 Memory sizes of TEX and IniTEX / 261 \\
                 33.2 More about formats / 261 \\
                 33.2.1 Compatibility / 261 \\
                 33.2.2 Preloaded fonts / 261 \\
                 33.2.3 The plain format / 262 \\
                 33.2.4 The LATEX format / 262 \\
                 33.2.5 Mathematical formats / 262 \\
                 33.2.6 Other formats / 262 \\
                 33.3 The dvi file / 263 \\
                 33.3.1 The dvi file format / 263 \\
                 33.3.2 Page identification / 263 \\
                 33.3.3 Magnification / 263 \\
                 33.4 Specials / 264 \\
                 33.5 Time / 264 \\
                 33.6 Fonts / 264 \\
                 33.6.1 Font metrics / 264 \\
                 33.6.2 Virtual fonts / 265 \\
                 33.6.3 Font files / 265 \\
                 33.6.4 Computer Modern / 266 \\
                 33.7 TEX and web / 266 \\
                 33.8 The TEX Users Group / 267 \\
                 34 Tracing / 269 \\
                 34.1 Meaning and content: \show, \showthe, \meaning /
                 270 \\
                 34.2 Show boxes: \showbox, \tracingoutput / 270 \\
                 34.3 Global statistics / 272 \\
                 34.4 Execution tracing / 273 \\
                 35 Errors, Catastrophes, and Help / 275 \\
                 35.1 Error messages / 275 \\
                 35.2 Overflow errors / 276 \\
                 35.2.1 Buffer size (500) / 276 \\
                 35.2.2 Exception dictionary (307) / 276 \\
                 35.2.3 Font memory (20,000) / 276 \\
                 35.2.4 Grouping levels / 277 \\
                 35.2.5 Hash size (2100) / 277 \\
                 35.2.6 Number of strings (3000) / 277 \\
                 35.2.7 Input stack size (200) / 277 \\
                 35.2.8 Main memory size (30,000) / 277 \\
                 35.2.9 Parameter stack size (60) / 277 \\
                 35.2.10 Pattern memory (8000) / 278 \\
                 35.2.11 Pattern memory ops per language / 278 \\
                 35.2.12 Pool size (32,000) / 278 \\
                 35.2.13 Save size (600) / 278 \\
                 35.2.14 Semantic nest size (40) / 278 \\
                 35.2.15 Text input levels (6) / 278 \\
                 36 The Grammar of TEX / 279 \\
                 36.1 Notations / 279 \\
                 36.2 Keywords / 280 \\
                 36.3 Specific grammatical terms / 280 \\
                 36.3.1 equals / 280 \\
                 36.3.2 filler, general text / 280 \\
                 36.3.3 {} and left brace right brace / 281 \\
                 36.3.4 math field / 281 \\
                 36.4 Differences between TEX versions 2 and 3 / 281 \\
                 37 Glossary of TEX Primitives / 283 \\
                 38 Tables / 297 \\
                 38.1 Character tables / 298 \\
                 38.2 Computer modern fonts / 300 \\
                 38.3 Plain TEX math symbols / 305 \\
                 38.3.1 Mathcharacter codes / 305 \\
                 38.3.2 Delimiter codes / 306 \\
                 38.3.3 mathchardef tokens: ordinary symbols / 307 \\
                 38.3.4 mathchardef tokens: large operators / 308 \\
                 38.3.5 mathchardef tokens: binary operations / 309 \\
                 38.3.6 mathchardef tokens: relations / 310 \\
                 38.3.7 \delimiter macros / 311 \\
                 39 Index / 313 \\
                 Bibliography / 321",
  xxnote =       "See \cite{Poppelier:1992:BRJ,Poppelier:1992:BR}.",
}


bibtype: book
filename: master.bib
label: Einstein:1966:EPE
author: Albert Einstein and Leopold Infeld
title: The Evolution of Physics from Early Concepts to Relativity and Quanta
publisher: pub-SIMON-SCHUSTER
address: pub-SIMON-SCHUSTER:adr
pages: xvi + 302
year: 1966
ISBN: 0-671-20156-5 OR 0671201565
ISBN13: 978-0-671-20156-2 OR 9780671201562
LCCN: QC7 .E5 1961
bibdate: Mon Oct 9 06:48:08 MDT 2006
bibtimestamp: 2006.10.09 06:48:08 MDT
series: A Touchstone book
remark: Reprint of 1938 and 1961 editions.
subject: Physics; History; Relativity (physics); Quantum theory
acknowledgement: ack-nhfb
authordates: Albert Einstein (1879--1955); Leopold Infeld (1898--1968)
rawauthor: Albert Einstein and Leopold Infeld
rawtitle: The Evolution of Physics from Early Concepts to Relativity and Quanta
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/i/infeld-leopold.bib; 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

TOC:
Introduction to the new edition / xi Preface / xv Part I. the rise of the mechanical view The great mystery story / 3 The first clew / 5 Vectors / 11 The riddle of motion / 18 One clew remains / 31 Is heat a substance? / 35 The roller-coaster / 44 The rate of exchange / 47 The philosophical background / 51 The kinetic theory of matter / 55 Part II. The decline of the mechanical view The two electric fluids / 69 The magnetic fluids / 80 The first serious difficulty / 84 The velocity of light / 90 Light as a substance / 93 The riddle of color / 96 What is a wave? / 100 The wave theory of light / 105 Longitudinal or transverse light waves? / 116 Ether and the mechanical view / 119 Part III. Field, relativity The field as representation / 125 The two pillars of the field theory / 137 The reality of the field / 142 Field and ether / 150 The mechanical scaffold / 153 Ether and motion / 164 Time, distance, relativity / 177 Relativity and mechanics / 192 The time--space continuum / 199 General relativity / 209 Outside and inside the elevator / 214 Geometry and experiment / 222 General relativity and its verification / 235 Field and matter / 240 Part IV. Quanta Continuity--discontinuity / 149 Elementary quanta of matter and electricity / 151 The quanta of light / 157 Light spectra / 165 The waves of matter / 170 Probability waves / 180 Physics and reality / 194 Index

rawTOC:
Introduction to the new edition / xi \\ Preface / xv \\ Part I. the rise of the mechanical view \\ The great mystery story / 3 \\ The first clew / 5 \\ Vectors / 11 \\ The riddle of motion / 18 \\ One clew remains / 31 \\ Is heat a substance? / 35 \\ The roller-coaster / 44 \\ The rate of exchange / 47 \\ The philosophical background / 51 \\ The kinetic theory of matter / 55 \\ Part II. The decline of the mechanical view \\ The two electric fluids / 69 \\ The magnetic fluids / 80 \\ The first serious difficulty / 84 \\ The velocity of light / 90 \\ Light as a substance / 93 \\ The riddle of color / 96 \\ What is a wave? / 100 \\ The wave theory of light / 105 \\ Longitudinal or transverse light waves? / 116 \\ Ether and the mechanical view / 119 \\ Part III. Field, relativity \\ The field as representation / 125 \\ The two pillars of the field theory / 137 \\ The reality of the field / 142 \\ Field and ether / 150 \\ The mechanical scaffold / 153 \\ Ether and motion / 164 \\ Time, distance, relativity / 177 \\ Relativity and mechanics / 192 \\ The time--space continuum / 199 \\ General relativity / 209 \\ Outside and inside the elevator / 214 \\ Geometry and experiment / 222 \\ General relativity and its verification / 235 \\ Field and matter / 240 \\ Part IV. Quanta \\ Continuity--discontinuity / 149 \\ Elementary quanta of matter and electricity / 151 \\ The quanta of light / 157 \\ Light spectra / 165 \\ The waves of matter / 170 \\ Probability waves / 180 \\ Physics and reality / 194 \\ Index

entry:
@Book{Einstein:1966:EPE,
  author =       "Albert Einstein and Leopold Infeld",
  title =        "The Evolution of Physics from Early Concepts to
                 Relativity and Quanta",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "xvi + 302",
  year =         "1966",
  ISBN =         "0-671-20156-5",
  ISBN-13 =      "978-0-671-20156-2",
  LCCN =         "QC7 .E5 1961",
  bibdate =      "Mon Oct 9 06:48:08 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/i/infeld-leopold.bib;
                 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",
  series =       "A Touchstone book",
  acknowledgement = ack-nhfb,
  author-dates = "Albert Einstein (1879--1955); Leopold Infeld
                 (1898--1968)",
  remark =       "Reprint of 1938 and 1961 editions.",
  subject =      "Physics; History; Relativity (physics); Quantum
                 theory",
  tableofcontents = "Introduction to the new edition / xi \\
                 Preface / xv \\
                 Part I. the rise of the mechanical view \\
                 The great mystery story / 3 \\
                 The first clew / 5 \\
                 Vectors / 11 \\
                 The riddle of motion / 18 \\
                 One clew remains / 31 \\
                 Is heat a substance? / 35 \\
                 The roller-coaster / 44 \\
                 The rate of exchange / 47 \\
                 The philosophical background / 51 \\
                 The kinetic theory of matter / 55 \\
                 Part II. The decline of the mechanical view \\
                 The two electric fluids / 69 \\
                 The magnetic fluids / 80 \\
                 The first serious difficulty / 84 \\
                 The velocity of light / 90 \\
                 Light as a substance / 93 \\
                 The riddle of color / 96 \\
                 What is a wave? / 100 \\
                 The wave theory of light / 105 \\
                 Longitudinal or transverse light waves? / 116 \\
                 Ether and the mechanical view / 119 \\
                 Part III. Field, relativity \\
                 The field as representation / 125 \\
                 The two pillars of the field theory / 137 \\
                 The reality of the field / 142 \\
                 Field and ether / 150 \\
                 The mechanical scaffold / 153 \\
                 Ether and motion / 164 \\
                 Time, distance, relativity / 177 \\
                 Relativity and mechanics / 192 \\
                 The time--space continuum / 199 \\
                 General relativity / 209 \\
                 Outside and inside the elevator / 214 \\
                 Geometry and experiment / 222 \\
                 General relativity and its verification / 235 \\
                 Field and matter / 240 \\
                 Part IV. Quanta \\
                 Continuity--discontinuity / 149 \\
                 Elementary quanta of matter and electricity / 151 \\
                 The quanta of light / 157 \\
                 Light spectra / 165 \\
                 The waves of matter / 170 \\
                 Probability waves / 180 \\
                 Physics and reality / 194 \\
                 Index",
}


bibtype: book
filename: master.bib
label: Einstein:2005:MRb
author: Albert Einstein and Brian Greene
title: The Meaning of Relativity
volume: 1921
publisher: pub-PRINCETON
address: pub-PRINCETON:adr
edition: Expanded Princeton Science Library
pages: xxiv + 166
year: 2005
ISBN: 0-691-12027-7 OR 0691120277
ISBN13: 978-0-691-12027-0 OR 9780691120270
LCCN: QC6
bibdate: Wed Nov 23 11:39:22 2005
bibtimestamp: 2005.11.23 11:39:22 ???
series: The Stafford Little lectures
URL: http://press.princeton.edu/titles/484.html
remark: With a new introduction by Brian Greene.
acknowledgement: ack-nhfb
rawauthor: Albert Einstein and Brian Greene
rawtitle: The Meaning of {Relativity}
bibsource:
https://www.math.utah.edu/pub/tex/bib/einstein.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/physperspect.bib

TOC:
Introduction by Brian Greene vii A Note on the Fifth Edition xxv Space and Time in Pre-Relativity Physics 1 The Theory of Special Relativity 24 The General Theory of Relativity 55 The General Theory of Relativity (continued) 79 Appendix for the Second Edition 109 Appendix II. Relativistic Theory of the Non-Symmetric Field 133 Index 167

rawTOC:
Introduction by Brian Greene vii \\ A Note on the Fifth Edition xxv \\ Space and Time in Pre-Relativity Physics 1 \\ The Theory of Special Relativity 24 \\ The General Theory of Relativity 55 \\ The General Theory of Relativity (continued) 79 \\ Appendix for the Second Edition 109 \\ Appendix II. Relativistic Theory of the Non-Symmetric Field 133 \\ Index 167

entry:
@Book{Einstein:2005:MRb,
  author =       "Albert Einstein and Brian Greene",
  title =        "The Meaning of {Relativity}",
  volume =       "1921",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  edition =      "Expanded {Princeton} Science Library",
  pages =        "xxiv + 166",
  year =         "2005",
  ISBN =         "0-691-12027-7",
  ISBN-13 =      "978-0-691-12027-0",
  LCCN =         "QC6",
  bibdate =      "Wed Nov 23 11:39:22 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/physperspect.bib",
  series =       "The Stafford Little lectures",
  URL =          "http://press.princeton.edu/titles/484.html",
  acknowledgement = ack-nhfb,
  remark =       "With a new introduction by Brian Greene.",
  tableofcontents = "Introduction by Brian Greene vii \\
                 A Note on the Fifth Edition xxv \\
                 Space and Time in Pre-Relativity Physics 1 \\
                 The Theory of Special Relativity 24 \\
                 The General Theory of Relativity 55 \\
                 The General Theory of Relativity (continued) 79 \\
                 Appendix for the Second Edition 109 \\
                 Appendix II. Relativistic Theory of the Non-Symmetric
                 Field 133 \\
                 Index 167",
}


bibtype: book
filename: master.bib
label: Eisenberg:1969:SPW
author: D. (David) Eisenberg and W. (Walter) Kauzmann
title: The Structure and Properties of Water
publisher: pub-CLARENDON
address: pub-CLARENDON:adr
pages: ix + 296
year: 1969
ISBN: 0-19-855339-0 OR 0198553390
ISBN13: 978-0-19-855339-7 OR 9780198553397
LCCN: QD169.W3 E35
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: D. (David) Eisenberg and W. (Walter) Kauzmann
rawtitle: The Structure and Properties of Water
entry:
@Book{Eisenberg:1969:SPW,
  author =       "D. (David) Eisenberg and W. (Walter) Kauzmann",
  title =        "The Structure and Properties of Water",
  publisher =    pub-CLARENDON,
  address =      pub-CLARENDON:adr,
  pages =        "ix + 296",
  year =         "1969",
  ISBN =         "0-19-855339-0",
  ISBN-13 =      "978-0-19-855339-7",
  LCCN =         "QD169.W3 E35",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Eisenstaedt:2006:CHR
author: Jean Eisenstaedt
title: The Curious History of Relativity: How Einstein's Theory of Gravity Was Lost and Found Again
volume: 15
publisher: pub-PRINCETON
address: pub-PRINCETON:adr
pages: ix + 363
year: 2006
ISBN: 0-691-11865-5 OR 0691118655
ISBN13: 978-0-691-11865-9 OR 9780691118659
LCCN: QC173.6 EIS; 06.E06047
bibdate: Thu Jan 25 18:28:33 MST 2007
bibtimestamp: 2007.01.25 18:28:33 MST
series: CNRS editions
acknowledgement: ack-nhfb
subjectdates: Albert Einstein (1879--1955)
rawauthor: Jean Eisenstaedt
rawtitle: The Curious History of {Relativity}: How {Einstein}'s Theory of Gravity Was Lost and Found Again
bibsource:
https://www.math.utah.edu/pub/tex/bib/einstein.bib; https://www.math.utah.edu/pub/tex/bib/jhistastron.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/physperspect.bib; library.ox.ac.uk:210/ADVANCE

abstract:
[This book] tells the story of the events surrounding general relativity and the techniques employed by Einstein and the relativists to construct, develop, and understand his almost impenetrable theory. [It] also describes the theories place in the evolution of twentieth-century physics.

remark:
Translated by Arturo Sangalli of em Einstein et la relativite generale. Les chemins de l'espace-temps, by Jean Eisenstaedt cite Eisenstaedt:2002:ERG. Foreword by Thibault Damour.

subject:
General relativity (Physics); Space and time; Relativity; Light; Gravity; Physics; History; Einstein, Albert

TOC:
Foreword Introduction: a difficult theory 1. The speed of light and classical physics 2: Light and the structure of space--time 3: Toward a new theory of gravitation 4: Einstein's principles 5: The birth of general relativity 6: General relativity: a physical geometry 7: Relativity verified: Mercury's anomaly 8: Relativity verified: the deflection of light rays 9: Relativity verified: the line shift 10: The crossing of the desert 11: An unpopular theory 12: The rejection of black holes 13: Paths in Schwarzschild's space--time 14: No ordinary stars 15: Gravitation, astrophysics, and cosmology Afterword: The paths of general relativity Bibliography Name index

rawabstract:
[This book] tells the story of the events surrounding general relativity and the techniques employed by Einstein and the relativists to construct, develop, and understand his almost impenetrable theory. [It] also describes the theories place in the evolution of twentieth-century physics.

rawTOC:
Foreword \\ Introduction: a difficult theory \\ 1. The speed of light and classical physics \\ 2: Light and the structure of space--time \\ 3: Toward a new theory of gravitation \\ 4: Einstein's principles \\ 5: The birth of general relativity \\ 6: General relativity: a physical geometry \\ 7: Relativity verified: Mercury's anomaly \\ 8: Relativity verified: the deflection of light rays \\ 9: Relativity verified: the line shift \\ 10: The crossing of the desert \\ 11: An unpopular theory \\ 12: The rejection of black holes \\ 13: Paths in Schwarzschild's space--time \\ 14: No ordinary stars \\ 15: Gravitation, astrophysics, and cosmology \\ Afterword: The paths of general relativity \\ Bibliography \\ Name index

entry:
@Book{Eisenstaedt:2006:CHR,
  author =       "Jean Eisenstaedt",
  title =        "The Curious History of {Relativity}: How {Einstein}'s
                 Theory of Gravity Was Lost and Found Again",
  volume =       "15",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "ix + 363",
  year =         "2006",
  ISBN =         "0-691-11865-5",
  ISBN-13 =      "978-0-691-11865-9",
  LCCN =         "QC173.6 EIS; 06.E06047",
  bibdate =      "Thu Jan 25 18:28:33 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/jhistastron.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/physperspect.bib;
                 library.ox.ac.uk:210/ADVANCE",
  series =       "CNRS editions",
  abstract =     "[This book] tells the story of the events surrounding
                 general relativity and the techniques employed by
                 Einstein and the relativists to construct, develop, and
                 understand his almost impenetrable theory. [It] also
                 describes the theories place in the evolution of
                 twentieth-century physics.",
  acknowledgement = ack-nhfb,
  remark =       "Translated by Arturo Sangalli of {\em Einstein et la
                 relativit{\'e} g{\'e}n{\'e}rale. Les chemins de
                 l'espace-temps}, by Jean Eisenstaedt
                 \cite{Eisenstaedt:2002:ERG}. Foreword by Thibault
                 Damour.",
  subject =      "General relativity (Physics); Space and time;
                 Relativity; Light; Gravity; Physics; History; Einstein,
                 Albert",
  subject-dates = "Albert Einstein (1879--1955)",
  tableofcontents = "Foreword \\
                 Introduction: a difficult theory \\
                 1. The speed of light and classical physics \\
                 2: Light and the structure of space--time \\
                 3: Toward a new theory of gravitation \\
                 4: Einstein's principles \\
                 5: The birth of general relativity \\
                 6: General relativity: a physical geometry \\
                 7: Relativity verified: Mercury's anomaly \\
                 8: Relativity verified: the deflection of light rays
                 \\
                 9: Relativity verified: the line shift \\
                 10: The crossing of the desert \\
                 11: An unpopular theory \\
                 12: The rejection of black holes \\
                 13: Paths in Schwarzschild's space--time \\
                 14: No ordinary stars \\
                 15: Gravitation, astrophysics, and cosmology \\
                 Afterword: The paths of general relativity \\
                 Bibliography \\
                 Name index",
}


bibtype: book
filename: master.bib
label: Ekman:2016:MBD
author: Martin Ekman
title: The man behind ``Degrees Celsius'': a pioneer in investigating the Earth and its changes
publisher: Summer Institute for Historical Geophysics
address: Godby, AA land Islands, Finland
pages: 159
year: 2016
ISBN: 952-93-7732-0 OR 9529377320
ISBN13: 978-952-93-7732-9 OR 9789529377329
bibdate: Thu Aug 30 10:20:37 MDT 2018
bibtimestamp: 2018.08.30 10:20:37 MDT
subject: Celsius, Anders; Earth sciences; History
acknowledgement: ack-nhfb
authordates: 1951--
subjectdates: 1701--1744
rawauthor: Martin Ekman
rawtitle: The man behind ``{Degrees Celsius}'': a pioneer in investigating the {Earth} and its changes
bibsource:
fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/hgss.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
This is a book about an unknown person with a well-known name, Anders Celsius, a book about his life and works. It is, thereby, also a book about the beginning of systematically investigating the Earth and its changes. Celsius may be characterized as a pioneer in investigating the Earth by means of systematic observations and by collecting long series of numerical data. In the early 1700s he and his assistants measured and studied latitude, longitude, gravity, magnetism, sea level change, land uplift, air pressure, temperature and northern lights. Much of Celsius' inspiration for his works came from his participation in an international expedition to the Arctic Circle, the purpose of which was nothing less than trying to confirm the theories of Newton. In many respects Celsius concentrated on utilizing Sweden's northerly position on the Earth, promoting such investigations that could not easily be made in more southerly countries. This book is the story of the life and works of a man who started from meager circumstances in an isolated northern university but developed into a pioneering Earth scientist with international contacts. It is also the story of a scientist who was engaged in creating an observatory and supporting an academy for the benefit of society but who died in the middle of his activities.

remark:
Anders Celsius may be characterized as a pioneer in investigating the Earth by means of systematic observations and by collecting long series of numerical data. In the early 1700s he and his assistants measured and studied latitude, longitude, gravity, magnetism, sea level change, land uplift, air pressure, temperature and northern lights.

TOC:
Preface The unknown man with the well-known name: An introduction Where and when: Official and personal background 2.1 University and science: From clerical control to academic freedom 2.2 Father's parents: The quarrelling astronomer and his wife 2.3 Mother's parents: The quiet astronomer and his wife 2.4 Father and mother: The unhappy astronomer and his wife Curiosity and unpaid work: Student and young scientist 3.1 Growing up 3.2 A novelty 3.3 Up in the church tower, down in the silver mine 3.4 Waiting in Uppsala Out in the world: For or against Newton? 4.1 A safe position 4.2 Via Berlin to Rome 4.3 In Paris: A turning point 4.4 In London: Preparing for the north 4.5 To the Arctic Circle: Stars and ice 4.6 Was Newton right? At home again: Investigating the unknown Earth 5.1 An observatory for investigating the Earth 5.2 Latitude, longitude and mapping 5.3 Gravity and the Earth's shape 5.4 Land uplift / water decrease and history 5.5 Sea level and the atmosphere 5.6 Temperature, air pressure and climate change 5.7 Magnetism and magnetic changes 5.8 Northern lights and a big surprise 5.9 Science, family and friendship --- and love? After Celsius: An unusual heritage 6.1 The sudden end of life 6.2 The decline of the observatory 6.3 A new observatory in Stockholm 6.4 The unknown man with the well-known name: Looking back Appendix: A dramatic love story References Illustrations Index

rawabstract:
This is a book about an unknown person with a well-known name, Anders Celsius, a book about his life and works. It is, thereby, also a book about the beginning of systematically investigating the Earth and its changes. Celsius may be characterized as a pioneer in investigating the Earth by means of systematic observations and by collecting long series of numerical data. In the early 1700s he and his assistants measured and studied latitude, longitude, gravity, magnetism, sea level change, land uplift, air pressure, temperature and northern lights. Much of Celsius' inspiration for his works came from his participation in an international expedition to the Arctic Circle, the purpose of which was nothing less than trying to confirm the theories of Newton. In many respects Celsius concentrated on utilizing Sweden's northerly position on the Earth, promoting such investigations that could not easily be made in more southerly countries. This book is the story of the life and works of a man who started from meager circumstances in an isolated northern university but developed into a pioneering Earth scientist with international contacts. It is also the story of a scientist who was engaged in creating an observatory and supporting an academy for the benefit of society but who died in the middle of his activities.

rawTOC:
Preface \\ The unknown man with the well-known name: An introduction \\ Where and when: Official and personal background \\ 2.1 University and science: From clerical control to academic freedom \\ 2.2 Father's parents: The quarrelling astronomer and his wife \\ 2.3 Mother's parents: The quiet astronomer and his wife \\ 2.4 Father and mother: The unhappy astronomer and his wife \\ Curiosity and unpaid work: Student and young scientist \\ 3.1 Growing up \\ 3.2 A novelty \\ 3.3 Up in the church tower, down in the silver mine \\ 3.4 Waiting in Uppsala \\ Out in the world: For or against Newton? \\ 4.1 A safe position \\ 4.2 Via Berlin to Rome \\ 4.3 In Paris: A turning point \\ 4.4 In London: Preparing for the north \\ 4.5 To the Arctic Circle: Stars and ice \\ 4.6 Was Newton right? \\ At home again: Investigating the unknown Earth \\ 5.1 An observatory for investigating the Earth \\ 5.2 Latitude, longitude and mapping \\ 5.3 Gravity and the Earth's shape \\ 5.4 Land uplift / water decrease and history \\ 5.5 Sea level and the atmosphere \\ 5.6 Temperature, air pressure and climate change \\ 5.7 Magnetism and magnetic changes \\ 5.8 Northern lights and a big surprise \\ 5.9 Science, family and friendship --- and love? \\ After Celsius: An unusual heritage \\ 6.1 The sudden end of life \\ 6.2 The decline of the observatory \\ 6.3 A new observatory in Stockholm \\ 6.4 The unknown man with the well-known name: Looking back \\ Appendix: A dramatic love story \\ References \\ Illustrations \\ Index

entry:
@Book{Ekman:2016:MBD,
  author =       "Martin Ekman",
  title =        "The man behind ``{Degrees Celsius}'': a pioneer in
                 investigating the {Earth} and its changes",
  publisher =    "Summer Institute for Historical Geophysics",
  address =      "Godby, {\AA}land Islands, Finland",
  pages =        "159",
  year =         "2016",
  ISBN =         "952-93-7732-0",
  ISBN-13 =      "978-952-93-7732-9",
  LCCN =         "????",
  bibdate =      "Thu Aug 30 10:20:37 MDT 2018",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/hgss.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "This is a book about an unknown person with a
                 well-known name, Anders Celsius, a book about his life
                 and works. It is, thereby, also a book about the
                 beginning of systematically investigating the Earth and
                 its changes. Celsius may be characterized as a pioneer
                 in investigating the Earth by means of systematic
                 observations and by collecting long series of numerical
                 data. In the early 1700s he and his assistants measured
                 and studied latitude, longitude, gravity, magnetism,
                 sea level change, land uplift, air pressure,
                 temperature and northern lights. Much of Celsius'
                 inspiration for his works came from his participation
                 in an international expedition to the Arctic Circle,
                 the purpose of which was nothing less than trying to
                 confirm the theories of Newton. In many respects
                 Celsius concentrated on utilizing Sweden's northerly
                 position on the Earth, promoting such investigations
                 that could not easily be made in more southerly
                 countries. This book is the story of the life and works
                 of a man who started from meager circumstances in an
                 isolated northern university but developed into a
                 pioneering Earth scientist with international contacts.
                 It is also the story of a scientist who was engaged in
                 creating an observatory and supporting an academy for
                 the benefit of society but who died in the middle of
                 his activities.",
  acknowledgement = ack-nhfb,
  author-dates = "1951--",
  remark =       "Anders Celsius may be characterized as a pioneer in
                 investigating the Earth by means of systematic
                 observations and by collecting long series of numerical
                 data. In the early 1700s he and his assistants measured
                 and studied latitude, longitude, gravity, magnetism,
                 sea level change, land uplift, air pressure,
                 temperature and northern lights.",
  subject =      "Celsius, Anders; Earth sciences; History",
  subject-dates = "1701--1744",
  tableofcontents = "Preface \\
                 The unknown man with the well-known name: An
                 introduction \\
                 Where and when: Official and personal background \\
                 2.1 University and science: From clerical control to
                 academic freedom \\
                 2.2 Father's parents: The quarrelling astronomer and
                 his wife \\
                 2.3 Mother's parents: The quiet astronomer and his wife
                 \\
                 2.4 Father and mother: The unhappy astronomer and his
                 wife \\
                 Curiosity and unpaid work: Student and young scientist
                 \\
                 3.1 Growing up \\
                 3.2 A novelty \\
                 3.3 Up in the church tower, down in the silver mine \\
                 3.4 Waiting in Uppsala \\
                 Out in the world: For or against Newton? \\
                 4.1 A safe position \\
                 4.2 Via Berlin to Rome \\
                 4.3 In Paris: A turning point \\
                 4.4 In London: Preparing for the north \\
                 4.5 To the Arctic Circle: Stars and ice \\
                 4.6 Was Newton right? \\
                 At home again: Investigating the unknown Earth \\
                 5.1 An observatory for investigating the Earth \\
                 5.2 Latitude, longitude and mapping \\
                 5.3 Gravity and the Earth's shape \\
                 5.4 Land uplift / water decrease and history \\
                 5.5 Sea level and the atmosphere \\
                 5.6 Temperature, air pressure and climate change \\
                 5.7 Magnetism and magnetic changes \\
                 5.8 Northern lights and a big surprise \\
                 5.9 Science, family and friendship --- and love? \\
                 After Celsius: An unusual heritage \\
                 6.1 The sudden end of life \\
                 6.2 The decline of the observatory \\
                 6.3 A new observatory in Stockholm \\
                 6.4 The unknown man with the well-known name: Looking
                 back \\
                 Appendix: A dramatic love story \\
                 References \\
                 Illustrations \\
                 Index",
}


bibtype: book
filename: master.bib
label: Ekstrom:1984:DIP
author: Michael P. Ekstrom
title: Digital Image Processing Techniques
volume: 2
publisher: pub-ACADEMIC
address: pub-ACADEMIC:adr
pages: xiii + 372
year: 1984
ISBN: 0-12-236760-X OR 012236760X
ISBN13: 978-0-12-236760-1 OR 9780122367601
LCCN: TA1632 .D496 1984
bibdate: Tue Dec 14 22:47:54 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:47:54 ???
series: Computational Techniques, Editors: Berni J. Alder and Sidney Fernbach
acknowledgement: ack-nhfb
rawauthor: Michael P. Ekstrom
rawtitle: Digital Image Processing Techniques
entry:
@Book{Ekstrom:1984:DIP,
  author =       "Michael P. Ekstrom",
  title =        "Digital Image Processing Techniques",
  volume =       "2",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xiii + 372",
  year =         "1984",
  ISBN =         "0-12-236760-X",
  ISBN-13 =      "978-0-12-236760-1",
  LCCN =         "TA1632 .D496 1984",
  bibdate =      "Tue Dec 14 22:47:54 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Computational Techniques, Editors: Berni J. Alder and
                 Sidney Fernbach",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Eliel:1962:SCC
author: Ernest L. (Ernest Ludwig) Eliel
title: Stereochemistry of Carbon Compounds
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
pages: xv + 486
year: 1962
LCCN: QD481 .E45
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: Ernest L. (Ernest Ludwig) Eliel
rawtitle: Stereochemistry of Carbon Compounds
entry:
@Book{Eliel:1962:SCC,
  author =       "Ernest L. (Ernest Ludwig) Eliel",
  title =        "Stereochemistry of Carbon Compounds",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xv + 486",
  year =         "1962",
  LCCN =         "QD481 .E45",
  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: Ellis:1989:MCS
author: Wade Ellis, Jr. and Ed Lodi
title: Maple for the Calculus Student
publisher: pub-BROOKS-COLE
address: pub-BROOKS-COLE:adr
pages: vii + 67
year: 1989
ISBN: 0-534-11874-7 OR 0534118747
ISBN13: 978-0-534-11874-7 OR 9780534118747
LCCN: QA155.7.E4 E44 1989
bibdate: Wed Dec 15 08:56:03 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 08:56:03 ???
acknowledgement: ack-nhfb
rawauthor: Wade {Ellis, Jr.} and Ed Lodi
rawtitle: {Maple} for the Calculus Student
entry:
@Book{Ellis:1989:MCS,
  author =       "Wade {Ellis, Jr.} and Ed Lodi",
  title =        "{Maple} for the Calculus Student",
  publisher =    pub-BROOKS-COLE,
  address =      pub-BROOKS-COLE:adr,
  pages =        "vii + 67",
  year =         "1989",
  ISBN =         "0-534-11874-7",
  ISBN-13 =      "978-0-534-11874-7",
  LCCN =         "QA155.7.E4 E44 1989",
  bibdate =      "Wed Dec 15 08:56:03 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: Ellis:1990:ACR
author: Margaret A. Ellis and Bjarne Stroustrup
title: The Annotated C++ Reference Manual
publisher: pub-AW
address: pub-AW:adr
pages: x + 447
year: 1990
ISBN: 0-201-51459-1 (hardcover) OR 0201514591 (hardcover)
ISBN13: 978-0-201-51459-9 (hardcover) OR 9780201514599 (hardcover)
LCCN: QA76.73.C153 E35 1990
bibdate: Tue Dec 14 22:47:56 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 1993.12.14 22:47:56 ???
acknowledgement: ack-nhfb
rawauthor: Margaret A. Ellis and Bjarne Stroustrup
rawtitle: The Annotated {C++} Reference Manual
TOC:
Lexical conventions Basic concepts Standard conversions Expressions Statements Declarations Declarators Classes Derived classes Member access control Special member functions Overloading Templates Exception handling Preprocessing Grammar summary Compatibility

rawTOC:
Lexical conventions \\ Basic concepts \\ Standard conversions \\ Expressions \\ Statements \\ Declarations \\ Declarators \\ Classes \\ Derived classes \\ Member access control \\ Special member functions \\ Overloading \\ Templates \\ Exception handling \\ Preprocessing \\ Grammar summary \\ Compatibility

entry:
@Book{Ellis:1990:ACR,
  author =       "Margaret A. Ellis and Bjarne Stroustrup",
  title =        "The Annotated {C++} Reference Manual",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "x + 447",
  year =         "1990",
  ISBN =         "0-201-51459-1 (hardcover)",
  ISBN-13 =      "978-0-201-51459-9 (hardcover)",
  LCCN =         "QA76.73.C153 E35 1990",
  bibdate =      "Tue Dec 14 22:47:56 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Lexical conventions \\
                 Basic concepts \\
                 Standard conversions \\
                 Expressions \\
                 Statements \\
                 Declarations \\
                 Declarators \\
                 Classes \\
                 Derived classes \\
                 Member access control \\
                 Special member functions \\
                 Overloading \\
                 Templates \\
                 Exception handling \\
                 Preprocessing \\
                 Grammar summary \\
                 Compatibility",
}


bibtype: book
filename: master.bib
label: Ellis:1990:FPI
author: T. M. R. Ellis
title: Fortran 77 Programming: With an Introduction to Fortran 90 Standard
publisher: pub-AW
address: pub-AW:adr
edition: Second
pages: xxi + 641
year: 1990
ISBN: 0-201-41638-7 (paperback) OR 0201416387 (paperback)
ISBN13: 978-0-201-41638-1 (paperback) OR 9780201416381 (paperback)
LCCN: QA76.73.F25 E43 1990
bibdate: Mon Jan 3 11:48:52 1994
bibtimestamp: 1994.01.03 11:48:52 ???
note: Rev. ed. of: A structured approach to FORTRAN 77 programming.
series: International Computer Science Series
URL: http://www.cbooks.com/sqlnut/SP/search/gtsumt?source=&isbn=0-201-41638-7
acknowledgement: ack-nhfb
rawauthor: T. M. R. Ellis
rawnote: Rev. ed. of: A structured approach to FORTRAN 77 programming.
rawtitle: {Fortran 77} Programming: With an Introduction to {Fortran 90 Standard}
bibsource:
https://www.math.utah.edu/pub/tex/bib/ansistd.bib; https://www.math.utah.edu/pub/tex/bib/fortran3.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

keywords:
Computer systems --- Structured programming --- Programming; Fortran 77 (computer program language); Fortran 90 (computer program language); languages: Fortran 77 language; Structured programming; Fortran (Computer program language)

TOC:
Introduction, Fundamental principles A simple program Arithmetic, expressions and assignment Procedures and structure plan Loop Array Decision Other types of loop Simple input/output facilities Keeping data in file Developing and testing programs Towards real programs: An intro to numerical methods in Fortran 77 programs Character handling Other data types More about arrays Global data More about procedures More about formats and file-handling More about numerical methods Obsolete and little used features of Fortran 77 Looking to the future: An outline of the next standard Fortran language Fortran 90 Seven golden rules Appendices

rawTOC:
Introduction, Fundamental principles \\ A simple program \\ Arithmetic, expressions and assignment \\ Procedures and structure plan \\ Loop \\ Array \\ Decision \\ Other types of loop \\ Simple input/output facilities \\ Keeping data in file \\ Developing and testing programs \\ Towards real programs: An intro to numerical methods in Fortran 77 programs \\ Character handling \\ Other data types \\ More about arrays \\ Global data \\ More about procedures \\ More about formats and file-handling \\ More about numerical methods \\ Obsolete and little used features of Fortran 77 \\ Looking to the future: An outline of the next standard Fortran language Fortran 90 \\ Seven golden rules \\ Appendices

entry:
@Book{Ellis:1990:FPI,
  author =       "T. M. R. Ellis",
  title =        "{Fortran 77} Programming: With an Introduction to
                 {Fortran 90 Standard}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xxi + 641",
  year =         "1990",
  ISBN =         "0-201-41638-7 (paperback)",
  ISBN-13 =      "978-0-201-41638-1 (paperback)",
  LCCN =         "QA76.73.F25 E43 1990",
  bibdate =      "Mon Jan 3 11:48:52 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ansistd.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran3.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Rev. ed. of: A structured approach to FORTRAN 77
                 programming.",
  price =        "US\$38.75",
  series =       "International Computer Science Series",
  URL =          "http://www.cbooks.com/sqlnut/SP/search/gtsumt?source=&isbn=0-201-41638-7",
  acknowledgement = ack-nhfb,
  dimensions =   "9.10in x 7.48in x 1.42in",
  keywords =     "Computer systems --- Structured programming ---
                 Programming; Fortran 77 (computer program language);
                 Fortran 90 (computer program language); languages:
                 Fortran 77 language; Structured programming; {Fortran}
                 (Computer program language)",
  paperback =    "yes",
  tableofcontents = "Introduction, Fundamental principles \\
                 A simple program \\
                 Arithmetic, expressions and assignment \\
                 Procedures and structure plan \\
                 Loop \\
                 Array \\
                 Decision \\
                 Other types of loop \\
                 Simple input/output facilities \\
                 Keeping data in file \\
                 Developing and testing programs \\
                 Towards real programs: An intro to numerical methods in
                 Fortran 77 programs \\
                 Character handling \\
                 Other data types \\
                 More about arrays \\
                 Global data \\
                 More about procedures \\
                 More about formats and file-handling \\
                 More about numerical methods \\
                 Obsolete and little used features of Fortran 77 \\
                 Looking to the future: An outline of the next standard
                 Fortran language Fortran 90 \\
                 Seven golden rules \\
                 Appendices",
}


bibtype: book
filename: master.bib
label: Emling:2012:MCH
author: Shelley Emling
title: Marie Curie and her daughters: the private lives of science's first family
publisher: Palgrave Macmillan
address: New York, NY, USA
pages: xx + 219 + 8
year: 2012
ISBN: 0-230-11571-3 (hardback) OR 0230115713 (hardback)
ISBN13: 978-0-230-11571-2 (hardback) OR 9780230115712 (hardback)
LCCN: QD22.C8 E46 2012
bibdate: Sat Jan 5 06:22:11 MST 2013
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2013.01.05 06:22:11 MST
acknowledgement: ack-nhfb
subjectdates: 1867--1934; 1867--1934; 1897--1956; 1904--2007
rawauthor: Shelley Emling
rawtitle: {Marie Curie} and her daughters: the private lives of science's first family
abstract:
Marie Curie was the first person to be honored by two Nobel Prizes and she pioneered the use of radiation therapy for cancer patients. But she was also a mother, widowed young, who raised two extraordinary daughters alone: Irene, a Nobel Prize winning chemist in her own right, who played an important role in the development of the atomic bomb, and Eve, a highly regarded humanitarian and journalist, who fought alongside the French Resistance during WW II. As a woman fighting to succeed in a male dominated profession and a Polish immigrant caught in a xenophobic society, she had to find ways to support her research. Drawing on personal interviews with Curie's descendents, as well as revelatory new archives, this is a wholly new story about Marie Curie--and a family of women inextricably connected to the dawn of nuclear physics

subject:
Curie, Marie; Family; Joliot-Curie, Irene; Curie, Eve; Women scientists; Family relationships; Mothers and daughters; Women chemists; Biography; Women philanthropists; Women journalists; Science / History; Biography and Autobiography / Science and Technology; History / Europe / France

TOC:
Prologue An Absolutely Miserable Year Moving On Meeting Missy Finally, America The White House New and Improved Another Dynamic Duo Turning to America--Again Into the Spotlight The End Of A Quest Tributes and New Causes All About Eve The Ravages Of Another World War Rough Waters The Legacy

rawabstract:
Marie Curie was the first person to be honored by two Nobel Prizes and she pioneered the use of radiation therapy for cancer patients. But she was also a mother, widowed young, who raised two extraordinary daughters alone: Irene, a Nobel Prize winning chemist in her own right, who played an important role in the development of the atomic bomb, and Eve, a highly regarded humanitarian and journalist, who fought alongside the French Resistance during WW II. As a woman fighting to succeed in a male dominated profession and a Polish immigrant caught in a xenophobic society, she had to find ways to support her research. Drawing on personal interviews with Curie's descendents, as well as revelatory new archives, this is a wholly new story about Marie Curie--and a family of women inextricably connected to the dawn of nuclear physics

rawTOC:
Prologue \\ An Absolutely Miserable Year \\ Moving On \\ Meeting Missy \\ Finally, America \\ The White House \\ New and Improved \\ Another Dynamic Duo \\ Turning to America--Again \\ Into the Spotlight \\ The End Of A Quest \\ Tributes and New Causes \\ All About Eve \\ The Ravages Of Another World War \\ Rough Waters \\ The Legacy

entry:
@Book{Emling:2012:MCH,
  author =       "Shelley Emling",
  title =        "{Marie Curie} and her daughters: the private lives of
                 science's first family",
  publisher =    "Palgrave Macmillan",
  address =      "New York, NY, USA",
  pages =        "xx + 219 + 8",
  year =         "2012",
  ISBN =         "0-230-11571-3 (hardback)",
  ISBN-13 =      "978-0-230-11571-2 (hardback)",
  LCCN =         "QD22.C8 E46 2012",
  bibdate =      "Sat Jan 5 06:22:11 MST 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Marie Curie was the first person to be honored by two
                 Nobel Prizes and she pioneered the use of radiation
                 therapy for cancer patients. But she was also a mother,
                 widowed young, who raised two extraordinary daughters
                 alone: Irene, a Nobel Prize winning chemist in her own
                 right, who played an important role in the development
                 of the atomic bomb, and Eve, a highly regarded
                 humanitarian and journalist, who fought alongside the
                 French Resistance during WW II. As a woman fighting to
                 succeed in a male dominated profession and a Polish
                 immigrant caught in a xenophobic society, she had to
                 find ways to support her research. Drawing on personal
                 interviews with Curie's descendents, as well as
                 revelatory new archives, this is a wholly new story
                 about Marie Curie--and a family of women inextricably
                 connected to the dawn of nuclear physics",
  acknowledgement = ack-nhfb,
  subject =      "Curie, Marie; Family; Joliot-Curie, Ir\`ene; Curie,
                 Eve; Women scientists; Family relationships; Mothers
                 and daughters; Women chemists; Biography; Women
                 philanthropists; Women journalists; Science / History;
                 Biography and Autobiography / Science and Technology;
                 History / Europe / France",
  subject-dates = "1867--1934; 1867--1934; 1897--1956; 1904--2007",
  tableofcontents = "Prologue \\
                 An Absolutely Miserable Year \\
                 Moving On \\
                 Meeting Missy \\
                 Finally, America \\
                 The White House \\
                 New and Improved \\
                 Another Dynamic Duo \\
                 Turning to America--Again \\
                 Into the Spotlight \\
                 The End Of A Quest \\
                 Tributes and New Causes \\
                 All About Eve \\
                 The Ravages Of Another World War \\
                 Rough Waters \\
                 The Legacy",
}


bibtype: book
filename: master.bib
label: Enderle:1984:CGP
author: G. Enderle and K. Kansy and G. Pfaff
title: Computer Graphics Programming. GKS: The Graphics Standard
publisher: pub-SV
address: pub-SV:adr
pages: xvi + 542
year: 1984
ISBN: 0-387-11525-0 (New York), 3-540-11525-0 (Berlin) OR 0387115250 (New York), 3540115250 (Berlin)
LCCN: T385 .E531 1984
bibdate: Wed May 01 09:12:36 2002
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2002.05.01 09:12:36 ???
series: Symbolic Computation, Editor: J. Encarnacao and P. Hayes
acknowledgement: ack-nhfb
rawauthor: G. Enderle and K. Kansy and G. Pfaff
rawtitle: Computer Graphics Programming. {GKS}: The Graphics Standard
ISBN13:
978-0-387-11525-2 (New York), 978-3-540-11525-0 (Berlin) OR 9780387115252 (New York), 9783540115250 (Berlin)

abstract:
For several years the authors of this book have been involved in the design and the national and international review of the forthcoming graphical standard. When the end of this process could be foreseen and the International Standard ``Graphical Kernel System'' (GKS) was cast into its. final form, the urgent need arose for detailed information to the graphics community about this standard and for the education of graphics programmers. One major goal of GKS, besides the portability of graphical application programs and the device independence, is ``programmer portability'' by establishing a common base for training of graphics programmers. Having accompanied the path of GKS from the very early stages of defining the basic concepts and designing its first versions up to the final draft of the International Standard, we felt it worthwhile to start the venture of a text book on computer graphics programming based on GKS. This book is aimed, at one hand, at graphics users, experts and managers who want to get an overview of the new standard and a better understanding of its concepts. On the other hand, it addresses the graphics programmers who want to use GKS for realizing their graphical applications. It can serve as the base for teaching and studying functions, concepts and methods of GKS. Additionally, it will be a valuable source of information for implementors of GKS.

TOC:
I: Introduction to Computer Graphics Based on GKS 1 What is Computer Graphics? 2 Intention and Contents of Part I 3 The Computer Graphics User 4 Interfaces of the Graphical Kernel System 5 Principles and Goals of the Graphical Kernel System 6 Main Concepts of the Graphical Kernel System 7 Creating Graphical Output 8 Coordinate Systems and Transformations 9 The Graphical Workstation 10 Input 11 Segments 12 The GKS Metafile 13 States and State Lists 14 Error Handling II: The Process of Generating a Standard 1 The Evolution of Computer Graphics 2 Committees, People and Events 3 GKS Review: Issues and Their Solution III: Graphics Kernel System Programming 1 Format and Structure of Part III 2 Levels 3 States and State Lists 4 Workstations 5 Transformations 6 Output Primitives 7 Segments 8 Input 9 Error Handling 10 Inquiry Functions 11 Metafile Interface IV: The GKS Environment 1 Mapping of Output Primitives and Attributes on Physical Workstations 2 The Mapping of Logical to Physical Input Devices 3 Implementation Aspects 4 Language Interfaces and Their Implementation 5 Interfaces to Graphics Devices 6 Metafiles 7 Certification/Validation of GKS 8 Terminology 9 3D Extensions to GKS Appendix 1: GKS Metafile Format 1.1 Status of the Metafile Definition 1.2 File Format and Data Format 1.3 Generation and Interpretation of Metafile 1.4 Control Items 1.5 Items for Output Primitives 1.6 Items for Output Primitive Attributes 1.7 Items for Workstation Attributes 1.8 Item for Clipping Rectangle 1.9 Items for Workstation Transformation 1.10 Items for Segment Manipulation 1.11 Items for Segment Attributes 1.12 User Items Appendix 2: Vocabulary References

rawabstract:
For several years the authors of this book have been involved in the design and the national and international review of the forthcoming graphical standard. When the end of this process could be foreseen and the International Standard ``Graphical Kernel System'' (GKS) was cast into its. final form, the urgent need arose for detailed information to the graphics community about this standard and for the education of graphics programmers. One major goal of GKS, besides the portability of graphical application programs and the device independence, is ``programmer portability'' by establishing a common base for training of graphics programmers. Having accompanied the path of GKS from the very early stages of defining the basic concepts and designing its first versions up to the final draft of the International Standard, we felt it worthwhile to start the venture of a text book on computer graphics programming based on GKS. This book is aimed, at one hand, at graphics users, experts and managers who want to get an overview of the new standard and a better understanding of its concepts. On the other hand, it addresses the graphics programmers who want to use GKS for realizing their graphical applications. It can serve as the base for teaching and studying functions, concepts and methods of GKS. Additionally, it will be a valuable source of information for implementors of GKS.

rawTOC:
I: Introduction to Computer Graphics Based on GKS \\ 1 What is Computer Graphics? \\ 2 Intention and Contents of Part I \\ 3 The Computer Graphics User \\ 4 Interfaces of the Graphical Kernel System \\ 5 Principles and Goals of the Graphical Kernel System \\ 6 Main Concepts of the Graphical Kernel System \\ 7 Creating Graphical Output \\ 8 Coordinate Systems and Transformations \\ 9 The Graphical Workstation \\ 10 Input \\ 11 Segments \\ 12 The GKS Metafile \\ 13 States and State Lists \\ 14 Error Handling \\ II: The Process of Generating a Standard \\ 1 The Evolution of Computer Graphics \\ 2 Committees, People and Events \\ 3 GKS Review: Issues and Their Solution \\ III: Graphics Kernel System Programming \\ 1 Format and Structure of Part III \\ 2 Levels \\ 3 States and State Lists \\ 4 Workstations \\ 5 Transformations \\ 6 Output Primitives \\ 7 Segments \\ 8 Input \\ 9 Error Handling \\ 10 Inquiry Functions \\ 11 Metafile Interface \\ IV: The GKS Environment \\ 1 Mapping of Output Primitives and Attributes on Physical Workstations \\ 2 The Mapping of Logical to Physical Input Devices \\ 3 Implementation Aspects \\ 4 Language Interfaces and Their Implementation \\ 5 Interfaces to Graphics Devices \\ 6 Metafiles \\ 7 Certification/Validation of GKS \\ 8 Terminology \\ 9 3D Extensions to GKS \\ Appendix 1: GKS Metafile Format \\ 1.1 Status of the Metafile Definition \\ 1.2 File Format and Data Format \\ 1.3 Generation and Interpretation of Metafile \\ 1.4 Control Items \\ 1.5 Items for Output Primitives \\ 1.6 Items for Output Primitive Attributes \\ 1.7 Items for Workstation Attributes \\ 1.8 Item for Clipping Rectangle \\ 1.9 Items for Workstation Transformation \\ 1.10 Items for Segment Manipulation \\ 1.11 Items for Segment Attributes \\ 1.12 User Items \\ Appendix 2: Vocabulary \\ References

entry:
@Book{Enderle:1984:CGP,
  author =       "G. Enderle and K. Kansy and G. Pfaff",
  title =        "Computer Graphics Programming. {GKS}: The Graphics
                 Standard",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvi + 542",
  year =         "1984",
  ISBN =         "0-387-11525-0 (New York), 3-540-11525-0 (Berlin)",
  ISBN-13 =      "978-0-387-11525-2 (New York), 978-3-540-11525-0
                 (Berlin)",
  LCCN =         "T385 .E531 1984",
  bibdate =      "Wed May 01 09:12:36 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Symbolic Computation, Editor: J. Encarna{\c{c}}{\~a}o
                 and P. Hayes",
  abstract =     "For several years the authors of this book have been
                 involved in the design and the national and
                 international review of the forthcoming graphical
                 standard. When the end of this process could be
                 foreseen and the International Standard ``Graphical
                 Kernel System'' (GKS) was cast into its. final form,
                 the urgent need arose for detailed information to the
                 graphics community about this standard and for the
                 education of graphics programmers. One major goal of
                 GKS, besides the portability of graphical application
                 programs and the device independence, is ``programmer
                 portability'' by establishing a common base for
                 training of graphics programmers. Having accompanied
                 the path of GKS from the very early stages of defining
                 the basic concepts and designing its first versions up
                 to the final draft of the International Standard, we
                 felt it worthwhile to start the venture of a text book
                 on computer graphics programming based on GKS. This
                 book is aimed, at one hand, at graphics users, experts
                 and managers who want to get an overview of the new
                 standard and a better understanding of its concepts. On
                 the other hand, it addresses the graphics programmers
                 who want to use GKS for realizing their graphical
                 applications. It can serve as the base for teaching and
                 studying functions, concepts and methods of GKS.
                 Additionally, it will be a valuable source of
                 information for implementors of GKS.",
  acknowledgement = ack-nhfb,
  tableofcontents = "I: Introduction to Computer Graphics Based on GKS
                 \\
                 1 What is Computer Graphics? \\
                 2 Intention and Contents of Part I \\
                 3 The Computer Graphics User \\
                 4 Interfaces of the Graphical Kernel System \\
                 5 Principles and Goals of the Graphical Kernel System
                 \\
                 6 Main Concepts of the Graphical Kernel System \\
                 7 Creating Graphical Output \\
                 8 Coordinate Systems and Transformations \\
                 9 The Graphical Workstation \\
                 10 Input \\
                 11 Segments \\
                 12 The GKS Metafile \\
                 13 States and State Lists \\
                 14 Error Handling \\
                 II: The Process of Generating a Standard \\
                 1 The Evolution of Computer Graphics \\
                 2 Committees, People and Events \\
                 3 GKS Review: Issues and Their Solution \\
                 III: Graphics Kernel System Programming \\
                 1 Format and Structure of Part III \\
                 2 Levels \\
                 3 States and State Lists \\
                 4 Workstations \\
                 5 Transformations \\
                 6 Output Primitives \\
                 7 Segments \\
                 8 Input \\
                 9 Error Handling \\
                 10 Inquiry Functions \\
                 11 Metafile Interface \\
                 IV: The GKS Environment \\
                 1 Mapping of Output Primitives and Attributes on
                 Physical Workstations \\
                 2 The Mapping of Logical to Physical Input Devices \\
                 3 Implementation Aspects \\
                 4 Language Interfaces and Their Implementation \\
                 5 Interfaces to Graphics Devices \\
                 6 Metafiles \\
                 7 Certification/Validation of GKS \\
                 8 Terminology \\
                 9 3D Extensions to GKS \\
                 Appendix 1: GKS Metafile Format \\
                 1.1 Status of the Metafile Definition \\
                 1.2 File Format and Data Format \\
                 1.3 Generation and Interpretation of Metafile \\
                 1.4 Control Items \\
                 1.5 Items for Output Primitives \\
                 1.6 Items for Output Primitive Attributes \\
                 1.7 Items for Workstation Attributes \\
                 1.8 Item for Clipping Rectangle \\
                 1.9 Items for Workstation Transformation \\
                 1.10 Items for Segment Manipulation \\
                 1.11 Items for Segment Attributes \\
                 1.12 User Items \\
                 Appendix 2: Vocabulary \\
                 References",
}


bibtype: book
filename: master.bib
label: Enderle:1987:CGP
author: G. Enderle and K. Kansy and G. Pfaff
title: Computer Graphics Programming. GKS: The Graphics Standard
publisher: pub-SV
address: pub-SV:adr
edition: Second
pages: xxiii + 651
year: 1987
ISBN: 3-540-16317-4 (Berlin), 0-387-16317-4 (New York) OR 3540163174 (Berlin), 0387163174 (New York)
LCCN: T385 .E531 1987
bibdate: Wed May 01 09:13:10 2002
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2002.05.01 09:13:10 ???
series: Symbolic Computation, Editor: J. Encarnacao and P. Hayes
acknowledgement: ack-nhfb
rawauthor: G. Enderle and K. Kansy and G. Pfaff
rawtitle: Computer Graphics Programming. {GKS}: The Graphics Standard
ISBN13:
978-3-540-16317-6 (Berlin), 978-0-387-16317-8 (New York) OR 9783540163176 (Berlin), 9780387163178 (New York)

entry:
@Book{Enderle:1987:CGP,
  author =       "G. Enderle and K. Kansy and G. Pfaff",
  title =        "Computer Graphics Programming. {GKS}: The Graphics
                 Standard",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xxiii + 651",
  year =         "1987",
  ISBN =         "3-540-16317-4 (Berlin), 0-387-16317-4 (New York)",
  ISBN-13 =      "978-3-540-16317-6 (Berlin), 978-0-387-16317-8 (New
                 York)",
  LCCN =         "T385 .E531 1987",
  bibdate =      "Wed May 01 09:13:10 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Symbolic Computation, Editor: J. Encarna{\c{c}}{\~a}o
                 and P. Hayes",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: England:1987:SUG
author: D. England
title: A Sun User's Guide
publisher: pub-MACMILLAN-EDUCATION
address: pub-MACMILLAN-EDUCATION:adr
pages: viii + 220
year: 1987
ISBN: 0-333-44849-9 OR 0333448499
ISBN13: 978-0-333-44849-6 OR 9780333448496
LCCN: QA76.8.S9 S85 1987
bibdate: Tue Dec 14 22:48:00 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:48:00 ???
series: Macmillan Computer Science Series, Editor: F. H. Sumner
acknowledgement: ack-nhfb
rawauthor: D. England
rawtitle: A Sun User's Guide
entry:
@Book{England:1987:SUG,
  author =       "D. England",
  title =        "A Sun User's Guide",
  publisher =    pub-MACMILLAN-EDUCATION,
  address =      pub-MACMILLAN-EDUCATION:adr,
  pages =        "viii + 220",
  year =         "1987",
  ISBN =         "0-333-44849-9",
  ISBN-13 =      "978-0-333-44849-6",
  LCCN =         "QA76.8.S9 S85 1987",
  bibdate =      "Tue Dec 14 22:48:00 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Macmillan Computer Science Series, Editor: F. H.
                 Sumner",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Essinger:2004:JWH
author: James Essinger
title: Jacquard's Web: How a Hand-Loom Led to the Birth of the Information Age
publisher: pub-OXFORD
address: pub-OXFORD:adr
pages: xi + 302
year: 2004
ISBN: 0-19-280577-0 OR 0192805770
ISBN13: 978-0-19-280577-5 OR 9780192805775
LCCN: QA76.17 .E88 2004
bibdate: Sun Feb 3 11:24:21 MST 2013
bibtimestamp: 2013.02.03 11:24:21 MST
acknowledgement: ack-nhfb
rawauthor: James Essinger
rawtitle: {Jacquard}'s Web: How a Hand-Loom Led to the Birth of the Information Age
bibsource:
https://www.math.utah.edu/pub/tex/bib/adabooks.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.bibsys.no:2100/BIBSYS; z3950.loc.gov:7090/Voyager

URL:
http://www.loc.gov/catdir/enhancements/fy0620/2004276200-d.html; http://www.loc.gov/catdir/enhancements/fy0620/2004276200-t.html

abstract:
Jacquard's Web is the story of some of the most ingenious inventors the world has ever known, a fascinating account of how a hand-loom invented in Napoleonic France led to the development of the modern information age. James Essinger, a master story-teller, shows through a series of remarkable and meticulously researched historical connections (spanning two centuries and never investigated before) that the Jacquard loom kick-started a process of scientific evolution which would lead directly to the development of the modern computer. The invention of Jacquard's loom in 1804 enabled the master silk-weavers of Lyons to weave fabrics 25 times faster than had previously been possible. The device used punched cards, which stored instructions for weaving whatever pattern or design was required; it proved an outstanding success. These cards can very reasonably be described as the world's first computer programmes. In this engaging and delightful book, James Essinger reveals a plethora of extraordinary links between the nineteenth-century world of weaving and today's computer age: to give just one example, modern computer graphics displays are based on exactly the same principles as those employed in Jacquard's special woven tableaux. Jacquard's Web also introduces some of the most colourful and interesting characters in the history of science and technology: the modest but exceptionally dedicated Jacquard himself, the brilliant but temperamental Victorian polymath Charles Babbage, who dreamt of a cogwheel computer operated using Jacquard cards, and the imaginative and perceptive Ada Lovelace, Lord Byron's only legitimate daughter.

subject:
Babbage, Charles; Jacquard, Joseph Marie; hullkort; punched cards; computers; history; Jacquard knitting machines; information technology

TOC:
Acknowledgements 1. The engraving that wasn't 2. A better mouse-trap 3. The son of a master weaver 4. The Emperor's new clothes 5. From weaving to computing 6. The difference engine 7. The analytical engine 8. A question of faith and funding 9. The lady who loved the Jacquard loom 10. A crisis with the American census 11. The first Jacquard looms that wove information 12. The birth of IBM 13. The Thomas Watson phenomenon 14. Howard Aiken dreams of a computer 15. IBM and the Harvard Mark 1 16. Weaving at the speed of light 17. The future Index

rawabstract:
Jacquard's Web is the story of some of the most ingenious inventors the world has ever known, a fascinating account of how a hand-loom invented in Napoleonic France led to the development of the modern information age. James Essinger, a master story-teller, shows through a series of remarkable and meticulously researched historical connections (spanning two centuries and never investigated before) that the Jacquard loom kick-started a process of scientific evolution which would lead directly to the development of the modern computer. The invention of Jacquard's loom in 1804 enabled the master silk-weavers of Lyons to weave fabrics 25 times faster than had previously been possible. The device used punched cards, which stored instructions for weaving whatever pattern or design was required; it proved an outstanding success. These cards can very reasonably be described as the world's first computer programmes. In this engaging and delightful book, James Essinger reveals a plethora of extraordinary links between the nineteenth-century world of weaving and today's computer age: to give just one example, modern computer graphics displays are based on exactly the same principles as those employed in Jacquard's special woven tableaux. Jacquard's Web also introduces some of the most colourful and interesting characters in the history of science and technology: the modest but exceptionally dedicated Jacquard himself, the brilliant but temperamental Victorian polymath Charles Babbage, who dreamt of a cogwheel computer operated using Jacquard cards, and the imaginative and perceptive Ada Lovelace, Lord Byron's only legitimate daughter.

rawTOC:
Acknowledgements \\ 1. The engraving that wasn't \\ 2. A better mouse-trap \\ 3. The son of a master weaver \\ 4. The Emperor's new clothes \\ 5. From weaving to computing \\ 6. The difference engine \\ 7. The analytical engine \\ 8. A question of faith and funding \\ 9. The lady who loved the Jacquard loom \\ 10. A crisis with the American census \\ 11. The first Jacquard looms that wove information \\ 12. The birth of IBM \\ 13. The Thomas Watson phenomenon \\ 14. Howard Aiken dreams of a computer \\ 15. IBM and the Harvard Mark 1 \\ 16. Weaving at the speed of light \\ 17. The future \\ Index

entry:
@Book{Essinger:2004:JWH,
  author =       "James Essinger",
  title =        "{Jacquard}'s Web: How a Hand-Loom Led to the Birth of
                 the Information Age",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xi + 302",
  year =         "2004",
  ISBN =         "0-19-280577-0",
  ISBN-13 =      "978-0-19-280577-5",
  LCCN =         "QA76.17 .E88 2004",
  bibdate =      "Sun Feb 3 11:24:21 MST 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/adabooks.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.bibsys.no:2100/BIBSYS;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0620/2004276200-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0620/2004276200-t.html",
  abstract =     "Jacquard's Web is the story of some of the most
                 ingenious inventors the world has ever known, a
                 fascinating account of how a hand-loom invented in
                 Napoleonic France led to the development of the modern
                 information age. James Essinger, a master story-teller,
                 shows through a series of remarkable and meticulously
                 researched historical connections (spanning two
                 centuries and never investigated before) that the
                 Jacquard loom kick-started a process of scientific
                 evolution which would lead directly to the development
                 of the modern computer. The invention of Jacquard's
                 loom in 1804 enabled the master silk-weavers of Lyons
                 to weave fabrics 25 times faster than had previously
                 been possible. The device used punched cards, which
                 stored instructions for weaving whatever pattern or
                 design was required; it proved an outstanding success.
                 These cards can very reasonably be described as the
                 world's first computer programmes. In this engaging and
                 delightful book, James Essinger reveals a plethora of
                 extraordinary links between the nineteenth-century
                 world of weaving and today's computer age: to give just
                 one example, modern computer graphics displays are
                 based on exactly the same principles as those employed
                 in Jacquard's special woven tableaux. Jacquard's Web
                 also introduces some of the most colourful and
                 interesting characters in the history of science and
                 technology: the modest but exceptionally dedicated
                 Jacquard himself, the brilliant but temperamental
                 Victorian polymath Charles Babbage, who dreamt of a
                 cogwheel computer operated using Jacquard cards, and
                 the imaginative and perceptive Ada Lovelace, Lord
                 Byron's only legitimate daughter.",
  acknowledgement = ack-nhfb,
  subject =      "Babbage, Charles; Jacquard, Joseph Marie; hullkort;
                 punched cards; computers; history; Jacquard knitting
                 machines; information technology",
  tableofcontents = "Acknowledgements \\
                 1. The engraving that wasn't \\
                 2. A better mouse-trap \\
                 3. The son of a master weaver \\
                 4. The Emperor's new clothes \\
                 5. From weaving to computing \\
                 6. The difference engine \\
                 7. The analytical engine \\
                 8. A question of faith and funding \\
                 9. The lady who loved the Jacquard loom \\
                 10. A crisis with the American census \\
                 11. The first Jacquard looms that wove information \\
                 12. The birth of IBM \\
                 13. The Thomas Watson phenomenon \\
                 14. Howard Aiken dreams of a computer \\
                 15. IBM and the Harvard Mark 1 \\
                 16. Weaving at the speed of light \\
                 17. The future \\
                 Index",
}


bibtype: book
filename: master.bib
label: Esterson:2019:EWR
author: Allen Esterson and David C. Cassidy and Ruth Lewin Sime
title: Einstein's wife: the real story of Mileva Einstein-Maric
publisher: pub-MIT
address: pub-MIT:adr
pages: xxi + 313
year: 2019
LCCN: QC16.E52 E88 2019
bibdate: Thu May 23 10:15:05 MDT 2019
bibtimestamp: 2019.05.23 10:15:05 MDT
acknowledgement: ack-nhfb
authordates: 1936--
subjectdates: Mileva Maric (1875--1948); Albert Einstein (1879--1955)
rawauthor: Allen Esterson and David C. Cassidy and Ruth Lewin Sime
rawtitle: {Einstein}'s wife: the real story of {Mileva Einstein-Mari{\'c}}
ISBN:
0-262-03961-3 (hardcover), 0-262-53897-0 (paperback) OR 0262039613 (hardcover), 0262538970 (paperback)

ISBN13:
978-0-262-03961-1 (hardcover), 978-0-262-53897-8 (paperback) OR 9780262039611 (hardcover), 9780262538978 (paperback)

bibsource:
fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/einstein.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
Albert Einstein's first wife, Mileva Einstein-Maric, was forgotten for decades. When a trove of correspondence between them beginning in their student days was discovered in 1986, her story began to be told. Some of the tellers of the ``Mileva Story'' made startling claims: that she was a brilliant mathematician who surpassed her husband, and that she made uncredited contributions to his most celebrated papers in 1905, including his paper on special relativity. This book, based on extensive historical research, uncovers the real ``Mileva Story.'' Mileva was one of the few women of her era to pursue higher education in science; she and Einstein were students together at the Zurich Polytechnic. Mileva's ambitions for a science career, however, suffered a series of setbacks --- failed diploma examinations, a disagreement with her doctoral dissertation adviser, an out-of-wedlock pregnancy by Einstein. She and Einstein married in 1903 and had two sons, but the marriage failed. Was Mileva her husband's uncredited coauthor, unpaid assistant, or his essential helpmeet? It's tempting to believe that she was her husband's secret collaborator, but the authors of booktitle Einstein's Wife look at the actual evidence, and a chapter by Ruth Lewin Sime offers important historical context. The story they tell is that of a brave and determined young woman who struggled against a variety of obstacles at a time when science was not very welcoming to women.

subject:
Einstein-Maric, Mileva; Einstein, Albert; Marriage; Family; Women mathematicians; Biography; Serbia; Germany; Mathematicians

TOC:
Acknowledgments / vii Abbreviations / ix Introduction / xi I: Mileva and Albert / David C. Cassidy / 1 1: Two Trajectories / 3 2: The Zurich Polytechnic / 23 3: An unsuccessful marriage / 65 II: Women in science / Ruth Lewin Sime / 89 4: Women in science: struggle and success / 91 III: Examining the Mileva story / Allen Esterson / 99 5: The story begins / 101 6: The story emerges / 111 7: Collaboration as students / 139 8: Collaboration during their marriage / 161 9: The story spreads / 201 10: The story continues / 237 11: The story concludes / 263 Appendix A: Maric's Pre-Polytechnic Grades / 269 Appendix B: Einstein's Pre-Polytechnic Grades / 271 Appendix C: Semester Grades for Einstein and Maric at the Zurich Polytechnic / 273 Appendix D: Grades on the Intermediate and Diploma Exams / 275 Appendix E: Grades on Leaving Certificates / 277 Notes / 279 Bibliography / 287 Index / 303

rawabstract:
Albert Einstein's first wife, Mileva Einstein-Mari{\'c}, was forgotten for decades. When a trove of correspondence between them beginning in their student days was discovered in 1986, her story began to be told. Some of the tellers of the ``Mileva Story'' made startling claims: that she was a brilliant mathematician who surpassed her husband, and that she made uncredited contributions to his most celebrated papers in 1905, including his paper on special relativity. This book, based on extensive historical research, uncovers the real ``Mileva Story.'' Mileva was one of the few women of her era to pursue higher education in science; she and Einstein were students together at the Zurich Polytechnic. Mileva's ambitions for a science career, however, suffered a series of setbacks --- failed diploma examinations, a disagreement with her doctoral dissertation adviser, an out-of-wedlock pregnancy by Einstein. She and Einstein married in 1903 and had two sons, but the marriage failed. Was Mileva her husband's uncredited coauthor, unpaid assistant, or his essential helpmeet? It's tempting to believe that she was her husband's secret collaborator, but the authors of \booktitle{Einstein's Wife} look at the actual evidence, and a chapter by Ruth Lewin Sime offers important historical context. The story they tell is that of a brave and determined young woman who struggled against a variety of obstacles at a time when science was not very welcoming to women.

rawTOC:
Acknowledgments / vii \\ Abbreviations / ix \\ Introduction / xi \\ I: Mileva and Albert / David C. Cassidy / 1 \\ 1: Two Trajectories / 3 \\ 2: The Zurich Polytechnic / 23 \\ 3: An unsuccessful marriage / 65 \\ II: Women in science / Ruth Lewin Sime / 89 \\ 4: Women in science: struggle and success / 91 \\ III: Examining the Mileva story / Allen Esterson / 99 \\ 5: The story begins / 101 \\ 6: The story emerges / 111 \\ 7: Collaboration as students / 139 \\ 8: Collaboration during their marriage / 161 \\ 9: The story spreads / 201 \\ 10: The story continues / 237 \\ 11: The story concludes / 263 \\ Appendix A: Mari{\'c}'s Pre-Polytechnic Grades / 269 \\ Appendix B: Einstein's Pre-Polytechnic Grades / 271 \\ Appendix C: Semester Grades for Einstein and Mari{\'c} at the Zurich Polytechnic / 273 \\ Appendix D: Grades on the Intermediate and Diploma Exams / 275 \\ Appendix E: Grades on Leaving Certificates / 277 \\ Notes / 279 \\ Bibliography / 287 \\ Index / 303

entry:
@Book{Esterson:2019:EWR,
  author =       "Allen Esterson and David C. Cassidy and Ruth Lewin
                 Sime",
  title =        "{Einstein}'s wife: the real story of {Mileva
                 Einstein-Mari{\'c}}",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xxi + 313",
  year =         "2019",
  ISBN =         "0-262-03961-3 (hardcover), 0-262-53897-0 (paperback)",
  ISBN-13 =      "978-0-262-03961-1 (hardcover), 978-0-262-53897-8
                 (paperback)",
  LCCN =         "QC16.E52 E88 2019",
  bibdate =      "Thu May 23 10:15:05 MDT 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Albert Einstein's first wife, Mileva
                 Einstein-Mari{\'c}, was forgotten for decades. When a
                 trove of correspondence between them beginning in their
                 student days was discovered in 1986, her story began to
                 be told. Some of the tellers of the ``Mileva Story''
                 made startling claims: that she was a brilliant
                 mathematician who surpassed her husband, and that she
                 made uncredited contributions to his most celebrated
                 papers in 1905, including his paper on special
                 relativity. This book, based on extensive historical
                 research, uncovers the real ``Mileva Story.'' Mileva
                 was one of the few women of her era to pursue higher
                 education in science; she and Einstein were students
                 together at the Zurich Polytechnic. Mileva's ambitions
                 for a science career, however, suffered a series of
                 setbacks --- failed diploma examinations, a
                 disagreement with her doctoral dissertation adviser, an
                 out-of-wedlock pregnancy by Einstein. She and Einstein
                 married in 1903 and had two sons, but the marriage
                 failed. Was Mileva her husband's uncredited coauthor,
                 unpaid assistant, or his essential helpmeet? It's
                 tempting to believe that she was her husband's secret
                 collaborator, but the authors of \booktitle{Einstein's
                 Wife} look at the actual evidence, and a chapter by
                 Ruth Lewin Sime offers important historical context.
                 The story they tell is that of a brave and determined
                 young woman who struggled against a variety of
                 obstacles at a time when science was not very welcoming
                 to women.",
  acknowledgement = ack-nhfb,
  author-dates = "1936--",
  subject =      "Einstein-Mari{\'c}, Mileva; Einstein, Albert;
                 Marriage; Family; Women mathematicians; Biography;
                 Serbia; Germany; Mathematicians",
  subject-dates = "Mileva Mari{\'c} (1875--1948); Albert Einstein
                 (1879--1955)",
  tableofcontents = "Acknowledgments / vii \\
                 Abbreviations / ix \\
                 Introduction / xi \\
                 I: Mileva and Albert / David C. Cassidy / 1 \\
                 1: Two Trajectories / 3 \\
                 2: The Zurich Polytechnic / 23 \\
                 3: An unsuccessful marriage / 65 \\
                 II: Women in science / Ruth Lewin Sime / 89 \\
                 4: Women in science: struggle and success / 91 \\
                 III: Examining the Mileva story / Allen Esterson / 99
                 \\
                 5: The story begins / 101 \\
                 6: The story emerges / 111 \\
                 7: Collaboration as students / 139 \\
                 8: Collaboration during their marriage / 161 \\
                 9: The story spreads / 201 \\
                 10: The story continues / 237 \\
                 11: The story concludes / 263 \\
                 Appendix A: Mari{\'c}'s Pre-Polytechnic Grades / 269
                 \\
                 Appendix B: Einstein's Pre-Polytechnic Grades / 271 \\
                 Appendix C: Semester Grades for Einstein and Mari{\'c}
                 at the Zurich Polytechnic / 273 \\
                 Appendix D: Grades on the Intermediate and Diploma
                 Exams / 275 \\
                 Appendix E: Grades on Leaving Certificates / 277 \\
                 Notes / 279 \\
                 Bibliography / 287 \\
                 Index / 303",
}


bibtype: book
filename: master.bib
label: Estrada:1993:CI
author: Susan Estrada
title: Connecting to the Internet
publisher: pub-ORA
address: pub-ORA:adr
pages: xv + 170
month: aug
monthnumber: 8
year: 1993
ISBN: 1-56592-061-9 OR 1565920619
ISBN13: 978-1-56592-061-3 OR 9781565920613
LCCN: TK 5105.875 I57 E82c 1993
bibdate: Thu Dec 9 18:37:47 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.09 18:37:47 ???
acknowledgement: ack-nhfb
rawauthor: Susan Estrada
rawtitle: Connecting to the Internet
entry:
@Book{Estrada:1993:CI,
  author =       "Susan Estrada",
  title =        "Connecting to the Internet",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xv + 170",
  month =        aug,
  year =         "1993",
  ISBN =         "1-56592-061-9",
  ISBN-13 =      "978-1-56592-061-3",
  LCCN =         "TK 5105.875 I57 E82c 1993",
  bibdate =      "Thu Dec 9 18:37:47 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$15.95",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}


bibtype: book
filename: master.bib
label: Ethier:2007:OPM
editor: Stewart N. Ethier and William R. Eadington
title: Optimal Play: Mathematical Studies of Games and Gambling
publisher: Institute for the Study of Gambling and Commercial Gaming
address: Reno, NV, USA
pages: xxvi + 550
year: 2007
ISBN: 0-9796873-0-6 OR 0979687306
ISBN13: 978-0-9796873-0-3 OR 9780979687303
LCCN: QA273 .O685 2007
bibdate: Mon Dec 3 15:45:33 MST 2007
bibtimestamp: 2007.12.03 15:45:33 MST
remark: NHFB provided technical advice for this volume.
acknowledgement: ack-nhfb
raweditor: Stewart N. Ethier and William R. Eadington
rawtitle: Optimal Play: Mathematical Studies of Games and Gambling
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager

entry:
@Book{Ethier:2007:OPM,
  editor =       "Stewart N. Ethier and William R. Eadington",
  title =        "Optimal Play: Mathematical Studies of Games and
                 Gambling",
  publisher =    "Institute for the Study of Gambling and Commercial
                 Gaming",
  address =      "Reno, NV, USA",
  pages =        "xxvi + 550",
  year =         "2007",
  ISBN =         "0-9796873-0-6",
  ISBN-13 =      "978-0-9796873-0-3",
  LCCN =         "QA273 .O685 2007",
  bibdate =      "Mon Dec 3 15:45:33 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  remark =       "NHFB provided technical advice for this volume.",
}


bibtype: book
filename: master.bib
label: Ethier:2010:DCP
author: Stewart N. Ethier
title: The Doctrine of Chances: Probabilistic Aspects of Gambling
publisher: pub-SV
address: pub-SV:adr
pages: xiv + 816
year: 2010
DOI: https://doi.org/10.1007/978-3-540-78783-9
ISBN: 3-540-78782-8 (hardcover), 3-540-78783-6 OR 3540787828 (hardcover), 3540787836
ISBN13: 978-3-540-78782-2 (hardcover), 978-3-540-78783-9 OR 9783540787822 (hardcover), 9783540787839
LCCN: QA271 .E84 2010
bibdate: Fri Mar 24 16:40:59 MDT 2017
bibtimestamp: 2017.03.24 16:40:59 MDT
series: Probability and its applications
remark: NHFB provided bibliographic support and technical advice for this volume.
subject: Games of chance (Mathematics); Gambling systems
acknowledgement: ack-nhfb
authordates: 1948--
rawauthor: Stewart N. Ethier
rawtitle: The Doctrine of Chances: Probabilistic Aspects of Gambling
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager

abstract:
Three centuries ago Montmort and De Moivre published two of the first books on probability theory, then called the doctrine of chances, emphasizing its most important application at that time, games of chance. This volume, on the probabilistic aspects of gambling, is a modern version of those classics. While covering the classical material such as house advantage and gambler's ruin, it also takes up such 20th-century topics as martingales, Markov chains, game theory, bold play, and optimal proportional play. In addition there is extensive coverage of specific casino games such as roulette, craps, video poker, baccarat, and twenty-one. The volume addresses researchers and graduate students in probability theory, stochastic processes, game theory, operations research, statistics but it is also accessible to undergraduate students, who have had a course in probability.

TOC:
Preface / v List of Notation / xiii Part I Theory 1 Review of Probability / 3 1.1 Combinatorics and Probability / 3 1.2 Independence and Conditional Probability / 15 1.3 Random Variables and Random Vectors / 21 1.4 Expectation and Variance / 27 1.5 Law of Large Numbers and Central Limit Theorem / 42 1.6 Problems / 52 1.7 Notes / 64 2 Conditional Expectation / 75 2.1 Conditioning on an Event / 75 2.2 Conditioning on a Random Vector / 79 2.3 Problems / 88 2.4 Notes / 92 3 Martingales / 95 3.1 Definitions and Examples / 95 3.2 Optional Stopping Theorem / 99 3.3 Martingale Convergence Theorem / 106 3.4 Problems / 111 3.5 Notes / 115 4 Markov Chains / 119 4.1 Definitions and Examples / 119 4.2 Transience and Recurrence / 127 4.3 Asymptotic Behavior / 136 4.4 Renewal Theorem / 115 4.5 Problems / 150 4.6 Note / 157 5 Game Theory / 159 5.1 Matrix Games / 150 5.2 Minimax Theorem / 171 5.3 Utility Theory / 185 5.4 Problems / 103 5.5 Notes / 107 6 House Advantage / 100 6.1 A Single Wager / 100 6.2 Composite Wagers / 219 6.3 Volatility / 225 6.4 Problems / 231 6.5 Notes / 236 7 Gambler's Ruin / 241 7.1 Even-Money Payoffs / 211 7.2 Integer Payoffs / 252 7.3 Arbitrary Payoffs / 250 7.4 Problems / 267 7.5 Notes / 271 8 Betting Systems / 275 8.1 Examples / 275 8.2 Conservation of Fairness / 208 8.3 Problems / 305 8.4 Notes / 311 9 Bold Play / 317 9.1 Red-and-Black / 317 9.2 Red-and-Black with a House Limit / 330 9.3 Primitive Casinos / 338 9.4 Problems / 350 9.5 Notes / 355 10 Optimal Proportional Play / 357 10.1 A Single Wager / 357 10.2 Simultaneous Wagers / 363 10.3 Optimality Properties / 371 10.4 Problems / 384 10.5 Notes / 388 11 Card Theory / 391 11.1 Shuffling / 391 11.2 Dealing / 400 11.3 Card Counting / 408 11.4 Problems / 421 11.5 Notes / 424 Part II Applications 12 Slot Machines / 429 12.1 Expected Payout / 429 12.2 Volatility and Ruin / 441 12.3 Problems / 450 12.4 Notes / 455 13 Roulette / 461 13.1 Unbiased Wheels / 461 13.2 Biased Wheels / 469 13.3 Problems / 474 13.4 Notes / 477 14 Keno / 483 14.1 The m-Spot Ticket / 483 14.2 Way Tickets / 489 14.3 Problems / 493 14.4 Notes / 496 15 Craps / 501 15.1 Line Bets and Free Odds / 501 15.2 The Shooter's Hand / 505 15.3 Problems / 513 15.4 Notes / 517 16 House-Banked Poker / 525 16.1 Let It Ride / 525 16.2 Three Card Poker / 534 16.3 Problems / 539 16.4 Notes / 542 17 Video Poker / 545 17.1 Jacks or Better / 545 17.2 Deuces Wild / 553 17.3 Problems / 566 17.4 Notes / 570 18 Faro / 573 18.1 The Denomination Bet / 573 18.2 Prom Soda to Hock / 578 18.3 Problems / 586 18.4 Notes / 589 19 Baccarat / 597 19.1 Player vs. Banker / 597 19.2 Card Counting / 605 19.3 Problems / 608 19.4 Notes / 613 20 Trente et Quarante / 623 20.1 Red, Black, Color, Inverse / 623 20.2 Card Counting / 628 20.3 Problems / 634 20.4 Notes / 637 21 Twenty-One / 643 21.1 Rules / 643 21.2 Basic Strategy / 650 21.3 Card Counting / 663 21.4 Problems / 670 21.5 Notes / 676 22 Poker / 689 22.1 Rules and Pot Odds / 689 22.2 Poker Models and Game Theory / 694 22.3 Texas Hold'em / 704 22.4 Problems / 725 22.5 Notes / 731 A Results Cited / 745 A.I Algebra and Number Theory / 745 A.2 Analysis and Probability / 747 Bibliography / 751 Index / 783

rawabstract:
Three centuries ago Montmort and De Moivre published two of the first books on probability theory, then called the doctrine of chances, emphasizing its most important application at that time, games of chance. This volume, on the probabilistic aspects of gambling, is a modern version of those classics. While covering the classical material such as house advantage and gambler's ruin, it also takes up such 20th-century topics as martingales, Markov chains, game theory, bold play, and optimal proportional play. In addition there is extensive coverage of specific casino games such as roulette, craps, video poker, baccarat, and twenty-one. The volume addresses researchers and graduate students in probability theory, stochastic processes, game theory, operations research, statistics but it is also accessible to undergraduate students, who have had a course in probability.

rawTOC:
Preface / v \\ List of Notation / xiii \\ Part I Theory \\ 1 Review of Probability / 3 \\ 1.1 Combinatorics and Probability / 3 \\ 1.2 Independence and Conditional Probability / 15 \\ 1.3 Random Variables and Random Vectors / 21 \\ 1.4 Expectation and Variance / 27 \\ 1.5 Law of Large Numbers and Central Limit Theorem / 42 \\ 1.6 Problems / 52 \\ 1.7 Notes / 64 \\ 2 Conditional Expectation / 75 \\ 2.1 Conditioning on an Event / 75 \\ 2.2 Conditioning on a Random Vector / 79 \\ 2.3 Problems / 88 \\ 2.4 Notes / 92 \\ 3 Martingales / 95 \\ 3.1 Definitions and Examples / 95 \\ 3.2 Optional Stopping Theorem / 99 \\ 3.3 Martingale Convergence Theorem / 106 \\ 3.4 Problems / 111 \\ 3.5 Notes / 115 \\ 4 Markov Chains / 119 \\ 4.1 Definitions and Examples / 119 \\ 4.2 Transience and Recurrence / 127 \\ 4.3 Asymptotic Behavior / 136 \\ 4.4 Renewal Theorem / 115 \\ 4.5 Problems / 150 \\ 4.6 Note / 157 \\ 5 Game Theory / 159 \\ 5.1 Matrix Games / 150 \\ 5.2 Minimax Theorem / 171 \\ 5.3 Utility Theory / 185 \\ 5.4 Problems / 103 \\ 5.5 Notes / 107 \\ 6 House Advantage / 100 \\ 6.1 A Single Wager / 100 \\ 6.2 Composite Wagers / 219 \\ 6.3 Volatility / 225 \\ 6.4 Problems / 231 \\ 6.5 Notes / 236 \\ 7 Gambler's Ruin / 241 7.1 Even-Money Payoffs / 211 \\ 7.2 Integer Payoffs / 252 \\ 7.3 Arbitrary Payoffs / 250 \\ 7.4 Problems / 267 \\ 7.5 Notes / 271 \\ 8 Betting Systems / 275 \\ 8.1 Examples / 275 \\ 8.2 Conservation of Fairness / 208 \\ 8.3 Problems / 305 \\ 8.4 Notes / 311 \\ 9 Bold Play / 317 \\ 9.1 Red-and-Black / 317 \\ 9.2 Red-and-Black with a House Limit / 330 \\ 9.3 Primitive Casinos / 338 \\ 9.4 Problems / 350 \\ 9.5 Notes / 355 \\ 10 Optimal Proportional Play / 357 \\ 10.1 A Single Wager / 357 \\ 10.2 Simultaneous Wagers / 363 \\ 10.3 Optimality Properties / 371 \\ 10.4 Problems / 384 \\ 10.5 Notes / 388 \\ 11 Card Theory / 391 \\ 11.1 Shuffling / 391 \\ 11.2 Dealing / 400 \\ 11.3 Card Counting / 408 \\ 11.4 Problems / 421 \\ 11.5 Notes / 424 \\ Part II Applications \\ 12 Slot Machines / 429 \\ 12.1 Expected Payout / 429 \\ 12.2 Volatility and Ruin / 441 \\ 12.3 Problems / 450 \\ 12.4 Notes / 455 \\ 13 Roulette / 461 \\ 13.1 Unbiased Wheels / 461 \\ 13.2 Biased Wheels / 469 \\ 13.3 Problems / 474 \\ 13.4 Notes / 477 \\ 14 Keno / 483 \\ 14.1 The m-Spot Ticket / 483 \\ 14.2 Way Tickets / 489 \\ 14.3 Problems / 493 \\ 14.4 Notes / 496 \\ 15 Craps / 501 \\ 15.1 Line Bets and Free Odds / 501 \\ 15.2 The Shooter's Hand / 505 \\ 15.3 Problems / 513 \\ 15.4 Notes / 517 \\ 16 House-Banked Poker / 525 \\ 16.1 Let It Ride / 525 \\ 16.2 Three Card Poker / 534 \\ 16.3 Problems / 539 \\ 16.4 Notes / 542 \\ 17 Video Poker / 545 \\ 17.1 Jacks or Better / 545 \\ 17.2 Deuces Wild / 553 \\ 17.3 Problems / 566 \\ 17.4 Notes / 570 \\ 18 Faro / 573 \\ 18.1 The Denomination Bet / 573 \\ 18.2 Prom Soda to Hock / 578 \\ 18.3 Problems / 586 \\ 18.4 Notes / 589 \\ 19 Baccarat / 597 \\ 19.1 Player vs. Banker / 597 \\ 19.2 Card Counting / 605 \\ 19.3 Problems / 608 \\ 19.4 Notes / 613 \\ 20 Trente et Quarante / 623 \\ 20.1 Red, Black, Color, Inverse / 623 \\ 20.2 Card Counting / 628 \\ 20.3 Problems / 634 \\ 20.4 Notes / 637 \\ 21 Twenty-One / 643 \\ 21.1 Rules / 643 \\ 21.2 Basic Strategy / 650 \\ 21.3 Card Counting / 663 \\ 21.4 Problems / 670 \\ 21.5 Notes / 676 \\ 22 Poker / 689 \\ 22.1 Rules and Pot Odds / 689 \\ 22.2 Poker Models and Game Theory / 694 \\ 22.3 Texas Hold'em / 704 \\ 22.4 Problems / 725 \\ 22.5 Notes / 731 \\ A Results Cited / 745 \\ A.I Algebra and Number Theory / 745 \\ A.2 Analysis and Probability / 747 \\ Bibliography / 751 \\ Index / 783

entry:
@Book{Ethier:2010:DCP,
  author =       "Stewart N. Ethier",
  title =        "The Doctrine of Chances: Probabilistic Aspects of
                 Gambling",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiv + 816",
  year =         "2010",
  DOI =          "https://doi.org/10.1007/978-3-540-78783-9",
  ISBN =         "3-540-78782-8 (hardcover), 3-540-78783-6",
  ISBN-13 =      "978-3-540-78782-2 (hardcover), 978-3-540-78783-9",
  LCCN =         "QA271 .E84 2010",
  bibdate =      "Fri Mar 24 16:40:59 MDT 2017",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Probability and its applications",
  abstract =     "Three centuries ago Montmort and De Moivre published
                 two of the first books on probability theory, then
                 called the doctrine of chances, emphasizing its most
                 important application at that time, games of chance.
                 This volume, on the probabilistic aspects of gambling,
                 is a modern version of those classics. While covering
                 the classical material such as house advantage and
                 gambler's ruin, it also takes up such 20th-century
                 topics as martingales, Markov chains, game theory, bold
                 play, and optimal proportional play. In addition there
                 is extensive coverage of specific casino games such as
                 roulette, craps, video poker, baccarat, and twenty-one.
                 The volume addresses researchers and graduate students
                 in probability theory, stochastic processes, game
                 theory, operations research, statistics but it is also
                 accessible to undergraduate students, who have had a
                 course in probability.",
  acknowledgement = ack-nhfb,
  author-dates = "1948--",
  remark =       "NHFB provided bibliographic support and technical
                 advice for this volume.",
  subject =      "Games of chance (Mathematics); Gambling systems",
  tableofcontents = "Preface / v \\
                 List of Notation / xiii \\
                 Part I Theory \\
                 1 Review of Probability / 3 \\
                 1.1 Combinatorics and Probability / 3 \\
                 1.2 Independence and Conditional Probability / 15 \\
                 1.3 Random Variables and Random Vectors / 21 \\
                 1.4 Expectation and Variance / 27 \\
                 1.5 Law of Large Numbers and Central Limit Theorem / 42
                 \\
                 1.6 Problems / 52 \\
                 1.7 Notes / 64 \\
                 2 Conditional Expectation / 75 \\
                 2.1 Conditioning on an Event / 75 \\
                 2.2 Conditioning on a Random Vector / 79 \\
                 2.3 Problems / 88 \\
                 2.4 Notes / 92 \\
                 3 Martingales / 95 \\
                 3.1 Definitions and Examples / 95 \\
                 3.2 Optional Stopping Theorem / 99 \\
                 3.3 Martingale Convergence Theorem / 106 \\
                 3.4 Problems / 111 \\
                 3.5 Notes / 115 \\
                 4 Markov Chains / 119 \\
                 4.1 Definitions and Examples / 119 \\
                 4.2 Transience and Recurrence / 127 \\
                 4.3 Asymptotic Behavior / 136 \\
                 4.4 Renewal Theorem / 115 \\
                 4.5 Problems / 150 \\
                 4.6 Note / 157 \\
                 5 Game Theory / 159 \\
                 5.1 Matrix Games / 150 \\
                 5.2 Minimax Theorem / 171 \\
                 5.3 Utility Theory / 185 \\
                 5.4 Problems / 103 \\
                 5.5 Notes / 107 \\
                 6 House Advantage / 100 \\
                 6.1 A Single Wager / 100 \\
                 6.2 Composite Wagers / 219 \\
                 6.3 Volatility / 225 \\
                 6.4 Problems / 231 \\
                 6.5 Notes / 236 \\
                 7 Gambler's Ruin / 241 7.1 Even-Money Payoffs / 211 \\
                 7.2 Integer Payoffs / 252 \\
                 7.3 Arbitrary Payoffs / 250 \\
                 7.4 Problems / 267 \\
                 7.5 Notes / 271 \\
                 8 Betting Systems / 275 \\
                 8.1 Examples / 275 \\
                 8.2 Conservation of Fairness / 208 \\
                 8.3 Problems / 305 \\
                 8.4 Notes / 311 \\
                 9 Bold Play / 317 \\
                 9.1 Red-and-Black / 317 \\
                 9.2 Red-and-Black with a House Limit / 330 \\
                 9.3 Primitive Casinos / 338 \\
                 9.4 Problems / 350 \\
                 9.5 Notes / 355 \\
                 10 Optimal Proportional Play / 357 \\
                 10.1 A Single Wager / 357 \\
                 10.2 Simultaneous Wagers / 363 \\
                 10.3 Optimality Properties / 371 \\
                 10.4 Problems / 384 \\
                 10.5 Notes / 388 \\
                 11 Card Theory / 391 \\
                 11.1 Shuffling / 391 \\
                 11.2 Dealing / 400 \\
                 11.3 Card Counting / 408 \\
                 11.4 Problems / 421 \\
                 11.5 Notes / 424 \\
                 Part II Applications \\
                 12 Slot Machines / 429 \\
                 12.1 Expected Payout / 429 \\
                 12.2 Volatility and Ruin / 441 \\
                 12.3 Problems / 450 \\
                 12.4 Notes / 455 \\
                 13 Roulette / 461 \\
                 13.1 Unbiased Wheels / 461 \\
                 13.2 Biased Wheels / 469 \\
                 13.3 Problems / 474 \\
                 13.4 Notes / 477 \\
                 14 Keno / 483 \\
                 14.1 The m-Spot Ticket / 483 \\
                 14.2 Way Tickets / 489 \\
                 14.3 Problems / 493 \\
                 14.4 Notes / 496 \\
                 15 Craps / 501 \\
                 15.1 Line Bets and Free Odds / 501 \\
                 15.2 The Shooter's Hand / 505 \\
                 15.3 Problems / 513 \\
                 15.4 Notes / 517 \\
                 16 House-Banked Poker / 525 \\
                 16.1 Let It Ride / 525 \\
                 16.2 Three Card Poker / 534 \\
                 16.3 Problems / 539 \\
                 16.4 Notes / 542 \\
                 17 Video Poker / 545 \\
                 17.1 Jacks or Better / 545 \\
                 17.2 Deuces Wild / 553 \\
                 17.3 Problems / 566 \\
                 17.4 Notes / 570 \\
                 18 Faro / 573 \\
                 18.1 The Denomination Bet / 573 \\
                 18.2 Prom Soda to Hock / 578 \\
                 18.3 Problems / 586 \\
                 18.4 Notes / 589 \\
                 19 Baccarat / 597 \\
                 19.1 Player vs. Banker / 597 \\
                 19.2 Card Counting / 605 \\
                 19.3 Problems / 608 \\
                 19.4 Notes / 613 \\
                 20 Trente et Quarante / 623 \\
                 20.1 Red, Black, Color, Inverse / 623 \\
                 20.2 Card Counting / 628 \\
                 20.3 Problems / 634 \\
                 20.4 Notes / 637 \\
                 21 Twenty-One / 643 \\
                 21.1 Rules / 643 \\
                 21.2 Basic Strategy / 650 \\
                 21.3 Card Counting / 663 \\
                 21.4 Problems / 670 \\
                 21.5 Notes / 676 \\
                 22 Poker / 689 \\
                 22.1 Rules and Pot Odds / 689 \\
                 22.2 Poker Models and Game Theory / 694 \\
                 22.3 Texas Hold'em / 704 \\
                 22.4 Problems / 725 \\
                 22.5 Notes / 731 \\
                 A Results Cited / 745 \\
                 A.I Algebra and Number Theory / 745 \\
                 A.2 Analysis and Probability / 747 \\
                 Bibliography / 751 \\
                 Index / 783",
}


bibtype: book
filename: master.bib
label: Etter:1987:SFE
author: D. M. Etter
title: Structured FORTRAN 77 for engineers and scientists
publisher: pub-BENCUM
address: pub-BENCUM:adr
edition: Second
pages: xxi + 519
year: 1987
ISBN: 0-8053-2495-X (paperback) OR 080532495X (paperback)
ISBN13: 978-0-8053-2495-2 (paperback) OR 9780805324952 (paperback)
LCCN: QA76.73.F25 E85 1987
bibdate: Sat Jan 27 13:40:57 MST 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1996.01.27 13:40:57 MST
keywords: Structured programming; Fortran 77 (Computer program language)
acknowledgement: ack-nhfb
rawauthor: D. M. Etter
rawtitle: Structured {FORTRAN} 77 for engineers and scientists
entry:
@Book{Etter:1987:SFE,
  author =       "D. M. Etter",
  title =        "Structured {FORTRAN} 77 for engineers and scientists",
  publisher =    pub-BENCUM,
  address =      pub-BENCUM:adr,
  edition =      "Second",
  pages =        "xxi + 519",
  year =         "1987",
  ISBN =         "0-8053-2495-X (paperback)",
  ISBN-13 =      "978-0-8053-2495-2 (paperback)",
  LCCN =         "QA76.73.F25 E85 1987",
  bibdate =      "Sat Jan 27 13:40:57 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Structured programming; {Fortran} 77 (Computer program
                 language)",
}


bibtype: book
filename: master.bib
label: Etter:1993:SFE
author: Delores M. Etter
title: Structured Fortran 77 for Engineers and Scientists
publisher: pub-BENCUM
address: pub-BENCUM:adr
edition: Fourth
pages: xxiii + 616
year: 1993
ISBN: 0-8053-1775-9 OR 0805317759
ISBN13: 978-0-8053-1775-6 OR 9780805317756
LCCN: QA76.73.F25 E85 1993
bibdate: Sun Sep 28 10:42:07 MDT 1997
bibtimestamp: 1997.09.28 10:42:07 MDT
acknowledgement: ack-nhfb
rawauthor: Delores M. Etter
rawtitle: Structured {Fortran 77} for Engineers and Scientists
bibsource:
https://www.math.utah.edu/pub/tex/bib/fortran3.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

keywords:
computer programming; Computer programming; Fortran 77 (computer program language); Fortran 77 (Computer program language)

TOC:
1: An Introduction to Problem Solving with FORTRAN 77 / 1 2: Arithmetic Computations / 25 3: Control Structures / 91 4: Engineering and Scientific Data Files / 165 5: Array Processing / 203 6: Function Subprograms / 259 7: Subroutine Subprograms / 323 8: Additional Data Types / 371 9: Additional File Handling / 423 10: Numerical Applications / 465 11: The New Fortran 90 Standard / 517 Appendix A: FORTRAN 77 Intrinsic Functions / 537 Appendix B: Additional FORTRAN 77 Topics / 541 Appendix C: Plotting Data Files with MATLAB and Lotus 1-2-3 / 552 Glossary of Key Words / 558 Answers to Self-Tests / 566 Answers to Selected Problems / 578 Index / 609

rawTOC:
1: An Introduction to Problem Solving with FORTRAN 77 / 1 \\ 2: Arithmetic Computations / 25 \\ 3: Control Structures / 91 \\ 4: Engineering and Scientific Data Files / 165 \\ 5: Array Processing / 203 \\ 6: Function Subprograms / 259 \\ 7: Subroutine Subprograms / 323 \\ 8: Additional Data Types / 371 \\ 9: Additional File Handling / 423 \\ 10: Numerical Applications / 465 \\ 11: The New Fortran 90 Standard / 517 \\ Appendix A: FORTRAN 77 Intrinsic Functions / 537 \\ Appendix B: Additional FORTRAN 77 Topics / 541 \\ Appendix C: Plotting Data Files with MATLAB and Lotus 1-2-3 / 552 \\ Glossary of Key Words / 558 \\ Answers to Self-Tests / 566 \\ Answers to Selected Problems / 578 \\ Index / 609

entry:
@Book{Etter:1993:SFE,
  author =       "Delores M. Etter",
  title =        "Structured {Fortran 77} for Engineers and Scientists",
  publisher =    pub-BENCUM,
  address =      pub-BENCUM:adr,
  edition =      "Fourth",
  pages =        "xxiii + 616",
  year =         "1993",
  ISBN =         "0-8053-1775-9",
  ISBN-13 =      "978-0-8053-1775-6",
  LCCN =         "QA76.73.F25 E85 1993",
  bibdate =      "Sun Sep 28 10:42:07 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran3.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  dimensions =   "9.11in x 7.37in x 0.97in",
  keywords =     "computer programming; Computer programming; Fortran 77
                 (computer program language); Fortran 77 (Computer
                 program language)",
  libnote =      "Not yet in my library.",
  paperback =    "yes",
  tableofcontents = "1: An Introduction to Problem Solving with FORTRAN
                 77 / 1 \\
                 2: Arithmetic Computations / 25 \\
                 3: Control Structures / 91 \\
                 4: Engineering and Scientific Data Files / 165 \\
                 5: Array Processing / 203 \\
                 6: Function Subprograms / 259 \\
                 7: Subroutine Subprograms / 323 \\
                 8: Additional Data Types / 371 \\
                 9: Additional File Handling / 423 \\
                 10: Numerical Applications / 465 \\
                 11: The New Fortran 90 Standard / 517 \\
                 Appendix A: FORTRAN 77 Intrinsic Functions / 537 \\
                 Appendix B: Additional FORTRAN 77 Topics / 541 \\
                 Appendix C: Plotting Data Files with MATLAB and Lotus
                 1-2-3 / 552 \\
                 Glossary of Key Words / 558 \\
                 Answers to Self-Tests / 566 \\
                 Answers to Selected Problems / 578 \\
                 Index / 609",
}


bibtype: book
filename: master.bib
label: Evans:2003:IAP
author: James S. Evans and Gregory L. Trimper
title: Itanium Architecture for Programmers: Understanding 64-bit Processors and EPIC Principles
publisher: pub-PH
address: pub-PH:adr
pages: xxxiv + 529
year: 2003
ISBN: 0-13-101372-6 OR 0131013726
ISBN13: 978-0-13-101372-8 OR 9780131013728
LCCN: QA76.8.I83 E83 2003
bibdate: Wed Aug 20 08:55:32 MDT 2003
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2003.08.20 08:55:32 MDT
keywords: Itanium (microprocessor)
acknowledgement: ack-nhfb
rawauthor: James S. Evans and Gregory L. Trimper
rawtitle: {Itanium} Architecture for Programmers: Understanding 64-bit Processors and {EPIC} Principles
abstract:
Step-by-step guide to assembly language for the 64-bit Itanium processors, with extensive examples Details of Explicitly Parallel Instruction Computing (EPIC): Instruction set, addressing, register stack engine, predication, I/O, procedure calls, floating-point operations, and more Learn how to comprehend and optimize open source, Intel, and HP-UX compiler output Understand the full power of 64-bit Itanium EPIC processors Itanium Architecture for Programmers is a comprehensive introduction to the breakthrough capabilities of the new 64-bit Itanium architecture. Using standard command-line tools and extensive examples, the authors illuminate the Itanium design within the broader context of contemporary computer architecture via a step-by-step investigation of Itanium assembly language. Coverage includes: The potential of Explicitly Parallel Instruction Computing (EPIC) Itanium instruction formats and addressing modes Innovations such as the register stack engine (RSE) and extensive predication Procedure calls and procedure-calling mechanisms Floating-point operations I/O techniques, from simple debugging to the use of files Optimization of output from open source, Intel, and HP-UX compilers An essential resource for both computing professionals and students of architecture or assembly language, Itanium Architecture for Programmers includes extensive printed and Web-based references, plus many numeric, essay, and programming exercises for each chapter.

TOC:
1. Architecture and Implementation 2. Computer Structures and Data Representations 3. The Program Assembler and Debugger 4. Itanium Instruction Formats and Addressing 5. Comparison, Branches, and Predication 6. Logical Operations, Bit-Shifts, and Bytes 7. Subroutines, Procedures, and Functions 8. Floating-Point Operations 9. Input and Output of Text 10. Performance Considerations 11. Looking at Output from Compilers 12. Parallel Operations 13. Variations Among Implementations Appendix A: Command-Line Environments Appendix C: Itanium Instruction Set Appendix D: Itanium Registers and Their Uses Appendix E: Conditional Assembly and Macros (GCC Assembler) Appendix F: Inline Assembly

rawabstract:
Step-by-step guide to assembly language for the 64-bit Itanium processors, with extensive examples Details of Explicitly Parallel Instruction Computing (EPIC): Instruction set, addressing, register stack engine, predication, I/O, procedure calls, floating-point operations, and more Learn how to comprehend and optimize open source, Intel, and HP-UX compiler output Understand the full power of 64-bit Itanium EPIC processors Itanium Architecture for Programmers is a comprehensive introduction to the breakthrough capabilities of the new 64-bit Itanium architecture. Using standard command-line tools and extensive examples, the authors illuminate the Itanium design within the broader context of contemporary computer architecture via a step-by-step investigation of Itanium assembly language. Coverage includes: The potential of Explicitly Parallel Instruction Computing (EPIC) Itanium instruction formats and addressing modes Innovations such as the register stack engine (RSE) and extensive predication Procedure calls and procedure-calling mechanisms Floating-point operations I/O techniques, from simple debugging to the use of files Optimization of output from open source, Intel, and HP-UX compilers An essential resource for both computing professionals and students of architecture or assembly language, Itanium Architecture for Programmers includes extensive printed and Web-based references, plus many numeric, essay, and programming exercises for each chapter.

rawTOC:
1. Architecture and Implementation \\ 2. Computer Structures and Data Representations \\ 3. The Program Assembler and Debugger \\ 4. Itanium Instruction Formats and Addressing \\ 5. Comparison, Branches, and Predication \\ 6. Logical Operations, Bit-Shifts, and Bytes \\ 7. Subroutines, Procedures, and Functions \\ 8. Floating-Point Operations \\ 9. Input and Output of Text \\ 10. Performance Considerations \\ 11. Looking at Output from Compilers \\ 12. Parallel Operations \\ 13. Variations Among Implementations \\ Appendix A: Command-Line Environments \\ Appendix C: Itanium Instruction Set \\ Appendix D: Itanium Registers and Their Uses \\ Appendix E: Conditional Assembly and Macros (GCC Assembler) \\ Appendix F: Inline Assembly

entry:
@Book{Evans:2003:IAP,
  author =       "James S. Evans and Gregory L. Trimper",
  title =        "{Itanium} Architecture for Programmers: Understanding
                 64-bit Processors and {EPIC} Principles",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xxxiv + 529",
  year =         "2003",
  ISBN =         "0-13-101372-6",
  ISBN-13 =      "978-0-13-101372-8",
  LCCN =         "QA76.8.I83 E83 2003",
  bibdate =      "Wed Aug 20 08:55:32 MDT 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Step-by-step guide to assembly language for the 64-bit
                 Itanium processors, with extensive examples Details of
                 Explicitly Parallel Instruction Computing (EPIC):
                 Instruction set, addressing, register stack engine,
                 predication, I/O, procedure calls, floating-point
                 operations, and more Learn how to comprehend and
                 optimize open source, Intel, and HP-UX compiler output
                 Understand the full power of 64-bit Itanium EPIC
                 processors Itanium Architecture for Programmers is a
                 comprehensive introduction to the breakthrough
                 capabilities of the new 64-bit Itanium architecture.
                 Using standard command-line tools and extensive
                 examples, the authors illuminate the Itanium design
                 within the broader context of contemporary computer
                 architecture via a step-by-step investigation of
                 Itanium assembly language. Coverage includes: The
                 potential of Explicitly Parallel Instruction Computing
                 (EPIC) Itanium instruction formats and addressing modes
                 Innovations such as the register stack engine (RSE) and
                 extensive predication Procedure calls and
                 procedure-calling mechanisms Floating-point operations
                 I/O techniques, from simple debugging to the use of
                 files Optimization of output from open source, Intel,
                 and HP-UX compilers An essential resource for both
                 computing professionals and students of architecture or
                 assembly language, Itanium Architecture for Programmers
                 includes extensive printed and Web-based references,
                 plus many numeric, essay, and programming exercises for
                 each chapter.",
  acknowledgement = ack-nhfb,
  keywords =     "Itanium (microprocessor)",
  tableofcontents = "1. Architecture and Implementation \\
                 2. Computer Structures and Data Representations \\
                 3. The Program Assembler and Debugger \\
                 4. Itanium Instruction Formats and Addressing \\
                 5. Comparison, Branches, and Predication \\
                 6. Logical Operations, Bit-Shifts, and Bytes \\
                 7. Subroutines, Procedures, and Functions \\
                 8. Floating-Point Operations \\
                 9. Input and Output of Text \\
                 10. Performance Considerations \\
                 11. Looking at Output from Compilers \\
                 12. Parallel Operations \\
                 13. Variations Among Implementations \\
                 Appendix A: Command-Line Environments \\
                 Appendix C: Itanium Instruction Set \\
                 Appendix D: Itanium Registers and Their Uses \\
                 Appendix E: Conditional Assembly and Macros (GCC
                 Assembler) \\
                 Appendix F: Inline Assembly",
}


bibtype: book
filename: master.bib
label: Everett:1965:TC
author: D. H. Everett
title: Thermodynamique Chimique
publisher: pub-DUNOD
address: pub-DUNOD:adr
pages: xix + 252
year: 1965
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 ???
note: French translation by R. Paris of original English edition.
acknowledgement: ack-nhfb
rawauthor: D. H. Everett
rawnote: French translation by R. P{\^a}ris of original English edition.
rawtitle: Thermodynamique Chimique
entry:
@Book{Everett:1965:TC,
  author =       "D. H. Everett",
  title =        "Thermodynamique Chimique",
  publisher =    pub-DUNOD,
  address =      pub-DUNOD:adr,
  pages =        "xix + 252",
  year =         "1965",
  LCCN =         "????",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "French translation by R. P{\^a}ris of original English
                 edition.",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Eves:1983:IHM
author: Howard Eves
title: An Introduction to the History of Mathematics
publisher: Saunders College Publishing
address: Philadelphia, PA, USA
pages: xviii + 593
year: 1983
ISBN: 0-03-062064-3 OR 0030620643
ISBN13: 978-0-03-062064-5 OR 9780030620645
LCCN: QA21.E8
bibdate: Sat Apr 27 15:49:51 2002
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2002.04.27 15:49:51 ???
subject: Mathematics; History; Mathematiques; Histoire; Mathematics; Geschichte; Mathematik
acknowledgement: ack-nhfb
rawauthor: Howard Eves
rawtitle: An Introduction to the History of Mathematics
TOC:
Preface / v Introduction / xvi Before the Seventeenth Century / 1 Numeral Systems / 2 1-1 Primitive Counting 1-2 Number Bases 1-3 Written Number Systems 1-4 Simple Grouping Systems 1-5 Multiplicative Grouping Systems 1-6 Ciphered Numeral Systems 1-7 Positional Numeral Systems 1-8 Early Computing 1-9 The Hindu-Arabic Numeral System 1-10 Arbitrary Bases Problem Studies / 16 1.1 Number Words 1.2 Written Numbers 1.3 Alphabetic Greek Numeral System 1.4 Old and Hypothetical Numeral Systems 1.5 Finger Numbers 1.6 Radix Fractions 1.7 Arithmetic in Other Scales 1.8 Problems in Scales of Notation 1.9 Some Recreational Aspects of the Binary Scale 1.10 Some Number Tricks Essay Topics / 20 Bibliography / 20 Babylonian and Egyptian Mathematics / 22 2-1 The Ancient Orient Babylonia: 2-2 Sources 2-3 Commercial and Agrarian Mathematics 2-4 Geometry 2-5 Algebra 2-6 Plimpton 322 Egypt: 2-7 Sources and Dates 2-8 Arithmetic and Algebra 2-9 Geometry 2-10 A Curious Problem in the Rhind Papyrus Problem Studies / 36 2.1 Regular Numbers 2.2 Compound Interest 2.3 Quadratic Equations 2.4 Algebraic Geometry 2.5 The Susa Tablets 2.6 Cubics 2.7 Square Root Approximations 2.8 Duplation and Mediation 2.9 Unit Fractions 2.10 The Sylvester Process 2.11 The Seqt of a Pyramid 2.12 Egyptian Algebra 2.13 Egyptian Geometry 2.14 The Greatest Egyptian Pyramid 2.15 Some Problems from the Moscow Papyrus 2.16 The 3, 4, 5 Triangle Essay Topics / 43 Bibliography / 44 Three: Pythagorean Mathematics / 45 3-1 Birth of Demonstrative Mathematics 3-2 Pythagoras and the Pythagoreans 3-3 Pythagorean Arithmetic 3-4 Pythagorean Theorem and Pythagorean Triples 3-5 Discovery of Irrational Magnitudes 3-6 Algebraic Identities 3-7 Geometric Solution of Quadratic Equations 3-8 Transformation of Areas 3-9 The Regular Solids 3-10 Postulational Thinking Problem Studies / 64 3.1 The Practical Problems of Thales 3.2 Perfect and Amicable Numbers 3.3 Figurate Numbers 3.4 Means 3.5 Dissection Proofs of the Pythagorean Theorem 3.6 Pythagorean Triples 3.7 Irrational Numbers 3.8 Algebraic Identities 3.9 Geometric Algebra 3.10 Geometric Solution of Quadratic Equations 3.11 Transformation of Areas 3.12 Regular Solids 3.13 Some Problems Concerning the Regular Solids 3.14 Golden Section 3.15 An Interesting Relation Essay Topics / 72 Bibliography / 72 Four: Duplication, Trisection, and Quadrature / 74 4-1 The Period from Thales to Euclid 4-2 Lines of Mathematical Development 4-3 The Three Famous Problems 4-4 The Euclidean Tools 4-5 Duplication of the Cube 4-6 Trisection of an Angle 4-7 Quadrature of the Circle 4-8 A Chronology of $pi $ Problem Studies / 90 4.1 Euclidean and Modern Compasses 4.2 Duplication by Archytas and Menaechmus 4.3 Duplication by Apollonius and Eratosthenes 4.4 The Cissoid of Diodes 4.5 Some Seventeenth-Century Duplications 4-6 Applications of the Insertion Principle 4.7 The Conchoid of Nicomedes 4.8 Trisection by Conics 4.9 Asymptotic Euclidean Constructions 4.10 The Quadratrix 4.11 Approximate Rectification 4.12 Lunes of Hippocrates 4.13 Computation of $pi $ 4.14 The Snell Refinement 4.15 Mnemonics for $pi $ Essay Topics / 98 Bibliography / 98 Five: Euclid and His Elements / 100 5-1 Alexandria 5-2 Euclid 5-3 Euclid's ``Elements'' 5-4 Content of the ``Elements'' 5-5 The Theory of Proportion 5-6 Regular Polygons 5-7 Formal Aspect of the ``Elements'' 5-8 Euclid's Other Works Problem Studies / 113 5.1 The Euclidean Algorithm 5.2 Applications of the Euclidean Algorithm 5.3 The Pythagorean Theorem 5.4 Euclid's Book II 5.5 Applications of the Fundamental Theorem of Arithmetic 5.6 The Eudoxian Theory of Proportion 5.7 Regular Polygons 5.8 The Angle-Sum of a Triangle 5.9 A Deductive Sequence Concerning Areas 5.10 A Deductive Sequence Concerning Angles 5-11 Elements 5.12 Data 5.13 Constructions Employing Data 5.14 Divisions Essay Topics / 119 Bibliography / 119 Greek Mathematics After Euclid / 121 6-1 Historical Setting 6-2 Archimedes 6-3 Eratosthenes 6-4 Apollonius 6-5 Hipparchus, Menelaus, Ptolemy, and Greek Trigonometry 6-6 Heron 6-7 Ancient Greek Algebra 6-8 Diophantus 6-9 Pappus 6-10 The Commentators Problem Studies / 140 6.1 Measurements by Aristarchus and Eratosthenes 6.2 On the Sphere and Cylinder 6.3 The Problem of the Crown 6.4 The Arbelos and the Salinon 6.5 The Theorem of the Broken Chord 6.6 The Focus--Directrix Property 6.7 Tangencies 6.8 Problems from Apollonius 6.9 Ptolemy's Table of Chords 6.10 Stereographic Projection 6.11 Problems from Heron 6.12 Simultaneous Equations 6.13 Problems from the ``Greek Anthology'' 6.14 Type Problems from the ``Greek Anthology'' 6.15 Diophantus 6.16 Some Number Theory in the ``Arithmetica'' 6.17 Problems from Pappus 6.18 The Centroid Theorems 6.19 The Trammel Construction of an Ellipse 6.20 The Theorem of Menelaus 6.21 More on Means Essay Topics / 154 Bibliography / 155 Chinese, Hindu, and Arabian Mathematics / 156 China: 7-1 Sources and Periods 7-2 From the Chou to the Tang 7-3 From the Tang Through the Ming India: 7-4 General Survey 7-5 Number Computing 7-6 Arithmetic and Algebra 7-7 Geometry and Trigonometry 7-8 Contrast Between Greek and Hindu Mathematics Arabia: 7-9 The Rise of Moslem Culture 7-10 Arithmetic and Algebra 7-11 Geometry and Trigonometry 7-12 Some Etymology 7-13 The Arabian Contribution Problem Studies / 178 7.1 Some Problems from the ``Arithmetic in Nine Sections'' 7.2 The Pythagorean Theorem 7.3 Magic Squares 7.4 Some Early Hindu Problems 7.5 Problems from Mahavira 7.6 Problems from Bhaskara 7.7 Quadratic Surds 7.8 Indeterminate Equations of the First Degree 7.9 The Diagonals of a Cyclic Quadrilateral 7.10 Brahmagupta's Quadrilaterals 7.11 Tabit Ibn Qorra, Al-karkhi, and Nasir Ed-din 7.12 Casting Out 9's 7.13 Casting Out 11's 7.14 Double False Position 7.15 Khayyam's Solution of Cubics 7.16 A Geometric Solution of Cubics 7.17 Geometrical Constructions on a Sphere Essay Topics / 187 Bibliography / 188 Eight: European Mathematics, 500 to 1600 / 189 8-1 The Dark Ages 8-2 The Period of Transmission 8-3 Fibonacci and the Thirteenth Century 8-4 The Fourteenth Century 8-5 The Fifteenth Century 8-6 The Early Arithmetics 8-7 Beginnings of Algebraic Symbolism 8-8 Cubic and Quartic Equations 8-9 Francois Viete 8-10 Other Mathematicians of the Sixteenth Century Problem Studies / 209 8.1 Problems from the Dark Ages 8.2 The Fibonacci Sequence 8.3 Problems from the ``Liber Abaci'' 8.4 Further Problems of Fibonacci 8.5 Star-Polygons 8.6 Jordanus and Cusa 8.7 Durer and Magic Squares of Doubly-Even Order 8.8 Problems from Regiomontanus 8.9 Problems from Chuquet 8.10 Problems from Pacioli 8.11 Early Commercial Problems 8.12 The Gelosia and Galley Algorithms 8.13 Gematria and Arithmography 8.14 Cubic Equations 8.15 Quartic Equations 8-16 Sixteenth-Century Notation 8.17 Prolems from Viete 8-18 Problems from Clavius 8.19 Some Geometry Essay Topics / 220 Bibliography / 221 Part Two: The Seventeenth Century and After the Dawn of Modern Mathematics / 223 Nine: The Dawn of Modern Mathematics / 224 9-1 The Seventeenth Century 9-2 Napier 9-3 Logarithms 9-4 The Savilian and Lucasian Professorships 9-5 Harriot and Oughtred 9-6 Galileo 9-7 Kepler 9-8 Desargues 9-9 Pascal Problem Studies / 246 9.1 Logarithms 9.2 Napier and Spherical Trigonometry 9.3 Napier's Rods 9.4 The Slide Rule 9.5 Freely Falling Bodies 9.6 Sector Compasses 9.7 Some Simple Paradoxes from Galileo's ``Discorsi'' 9.8 Kepler's Laws 9.9 Mosaics 9.10 Proving Theorems by Projection 9.11 Pascal's Youthful Empirical ``Proof'' 9.12 Pascal's Theorem 9.13 Pascal's Triangle Essay Topics / 256 Bibliography / 256 Ten: Analytic Geometry and Other Precalculus Developments / 258 10-1 Analytic Geometry 10-2 Descartes 10-3 Fermat 10-4 Roberval and Torricelli 10-5 Huygens 10-6 Some Seventeenth-Century Mathematicians of France and Italy 10-7 Some Seventeenth-Century Mathematicians of Germany and the Low Countries 10-8 Some Seventeenth-Century British Mathematicians Problem Studies / 279 10.1 Geometric Algebra 10.2 Descartes's ``La Geometrie'' 10.3 Descartes's Rule of Signs 10.4 Problems from Descartes 10.5 Fermat's Theorems 10.6 The Problem of the Points 10.7 Problems from Huygens 10.8 Higher Plane Curves 10.9 Recreational Problems from Bachet 10.10 Some Geometry 10.11 Computation of Logarithms by Series Essay Topics / 285 Bibliography / 285 Eleven: The Calculus and Related Concepts / 287 11-1 Introduction 11-2 Zeno's Paradoxes 11-3 Eudoxus' Method of Exhaustion 11-4 Archimedes' Method of Equilibrium 11-5 The Beginnings of Integration in Western Europe 11-6 Cavalieri's Method of Indivisibles 11-7 The Beginning of Differentiation 11-8 Wallis and Barrow 11-9 Newton 11-10 Leibniz Problem Studies / 311 11.1 The Method of Exhaustion 11.2 The Method of Equilibrium 11.3 Some Archimedean Problems 11.4 The Method of Indivisibles 11.5 The Prismoidal Formula 11.6 Differentiation 11.7 The Binomial Theorem 11.8 An Upper Bound for the Roots of a Polynomial Equation 11.9 Approximate Solution of Equations 11.10 Algebra of Classes Essay Topics / 316 Bibliography / 317 Twelve: The Eighteenth Century and the Exploitation of the Calculus / 319 12-1 Introduction and Apology 12-2 The Bernoulli Family 12-3 De Moivre and Probability 12-4 Taylor and Maclaurin 12-5 Euler 12-6 Clairaut, D'Alembert, and Lambert 12-7 Lagrange 12-8 Laplace and Legendre 12-9 Monge and Carnot 12-10 The Metric System 12-11 Summary Problem Studies / 344 12.1 Bernoulli Numbers 12.2 De Moivre's Formula 12.3 Distributions 12.4 Formal Manipulation of Series 12.5 A Conjecture and a Paradox 12.6 Euler and an Infinite Series 12.7 Orbiform Curves 12.8 Unicursal and Multicursal Graphs 12.9 Some Differential Equations 12.10 Hyperbolic Functions 12.11 Lagrange and Analytic Geometry 12.12 Buffon's Needle Problem 12.13 Random Chord in a Circle 12.14 The Method of Least Squares 12.15 Some Mongean Geometry 12.16 Sensed Magnitudes 12.17 Carnot's Theorem Essay Topics / 355 Bibliography / 356 Thirteen: The Early Nineteenth Century and the Liberation of Geometry and Algebra / 357 13-1 The Prince of Mathematicians 13-2 Fourier and Poisson 13-3 Cauchy 13-4 Abel and Galois 13-5 Jacobi and Dirichlet 13-6 Non-Euclidean Geometry 13-7 The Emergence of Algebraic Structure 13-8 The Liberation of Algebra 13-9 Hamilton, Grassmann, Boole, and De Morgan 13-10 Cayley, Sylvester, and Hermite 13-11 Academies, Societies, and Periodicals Problem Studies / 392 13.1 The Fundamental Theorem of Algebra 13.2 Basic Properties of Congruence 13.3 Gauss and Numbers 13.4 Fourier Series 13.5 Cauchy and Infinite Series 13.6 Group Theory 13.7 Examples of Groups 13.8 Abelian Groups 13.9 Saccheri Quadrilaterals 13.10 The Hypothesis of the Acute Angle 13.11 A Euclidean Model for Hyperbolic Geometry 13.12 Non-Euclidean Geometry and Physical Space 13.13 Systems with a Common Algebraic Structure 13.14 Algebraic Laws 13.15 More on Algebraic Laws 13.16 Complex Numbers as Ordered Pairs of Real Numbers 13.17 Quaternions 13.18 Matrices 13.19 Jordan and Lie Algebras 13.20 Vectors 13.21 An Interesting Algebra 13.22 A Point Algebra 13.23 An Infinite Non-Abelian Group 13.24 The Hamiltonian Game Essay Topics / 403 Bibliography / 403 The Later Nineteenth Century and the Arithmetization of Analysis / 405 14-1 Sequel to Euclid 14-2 Impossibility of Solving the Three Famous Problems with Euclidean Tools 14-3 Compasses Or Straightedge Alone 14-4 Projective Geometry 14-5 Analytic Geometry 14-6 N-dimensional Geometry 14-7 Differential Geometry 14-8 The Erlanger Programm of Felix Klein 14-9 The Arithmetization of Analysis 14-10 Weierstrass and Riemann 14-11 Cantor, Kronecker, and Poincare 14-12 Sonja Kovalevsky and Emmy Noether 14-13 The Prime Numbers Problem Studies / 437 14.1 The Feuerbach Configuration 14.2 Commandino's Theorem 14.3 The Altitudes of a Tetrahedron 14.4 Space Analogs 14.5 Isogonal Elements 14.6 Impossible Constructions 14.7 Some Approximate Constructions 14.8 Mascheroni Construction Theorem 14.9 Constructions with Straightedge and Rusty Compasses 14.10 Lemoine's Geometrography 14.11 Principle of Duality 14.12 A Self-Dual Postulate Set for Projective Geometry 14.13 Principle of Duality of Trigonometry 14.14 Coordinate Systems 14.15 Line Coordinates 14.16 Dimensionality 14.17 Abridged Notation 14.18 Homogeneous Coordinates 14.19 Plucker's Numbers 14.20 N-dimensional Geometry 14.21 Gaussian Curvature 14.22 The Tractoid 14.23 The Erlanger Programm 14.24 Mysticism and Absurdity in the Early Calculus 14.25 Early Difficulties with Infinite Series 14.26 Some Paradoxes in Elementary Algebra 14.27 Some Paradoxes in Calculus 14.28 A Continuous Curve Having No Tangents 14.29 Algebraic and Transcendental Numbers 14.30 Prime Numbers Essay Topics / 454 Bibliography / 455 Fifteen: Abstraction and the Transition Into the Twentieth Century / 457 15-1 Logical Shortcomings of Euclid's ``Elements'' 15-2 Axiomatics 15-3 The Evolution of Some Basic Concepts 15-4 Transfinite Numbers 15-5 Topology 15-6 Mathematical Logic 15-7 Antinomies of Set Theory 15-8 Philosophies of Mathematics 15-9 Computers 15-10 The New Math and Bourbaki 15-11 The Tree of Mathematics Problem Studies / 493 15.1 Tacit Assumptions Made by Euclid 15.2 Three Geometrical Paradoxes 15.3 Dedekind's Continuity Postulate 15.4 A Coordinate Interpretation of Euclid's Postulates 15.5 A Spherical Interpretation of Euclid's Postulates 15.6 Pasch's Postulate 15.7 An Abstract Mathematical System 15.8 Axiomatics 15.9 Associated Hypothetical Propositions 15.10 Intuition Versus Proof 15.11 A Miniature Mathematical System 15.12 A Set of Inconsistent Statements 15.13 A Postulate Set Related to Relativity Theory 15.14 Bees and Hives 15.15 Metric Space 15.16 Equivalent Segments 15.17 Some Denumerable and Nondenumerable Sets 15.18 Polynomials of Heights 1, 2, 3, 4, and 5 15.19 The Measure of a Denumerable Set of Points 15.20 Transfinite Numbers and Dimension Theory 15.21 Circles and Lines 15.22 Homeomorphic Surfaces 15.23 Sides and Edges 15.24 Paradromic Rings 15.25 Polyhedral Surfaces 15.26 Faces and Vertices of Polyhedral Surfaces 15.27 Hausdorff Space 15.28 Allied Propositions 15.29 Three-Valued Logics 15.30 The Russell Paradox 15.31 A Paradox 15.32 Some Dilemmas and Some Questions 15.33 Recreational Mathematics Essay Topics / 506 Bibliography / 507 General Bibliography / 512 A Chronological Table / 514 Answers and Suggestions for the Solution of the Problem Studies / 522 Index / 553

shortTOC:
1: Numeral systems 2: Babylonian and Egyptian mathematics 3: Pythagorean mathematics 4: Duplication, trisection, and quadrature 5: Euclid and his elements 6: Greek mathematics after Euclid 7: Chinese, Hindu, and Arabian mathematics 8: European mathematics, 500 to 1600 9: The dawn of modern mathematics 10: Analytical geometry and other precalculus developments 11: The calculus and related concepts 12: The eighteenth century and the exploitation of the calculus 13: The early nineteenth century and the liberation of geometry and algebra 14: The later nineteenth century ad the arithmetization of analysis 15: Abstraction and the transition into the twentieth century Essay Topics Bibliography General Bibliography A Chronological Table Answers and Suggestions for the Solution of the Problem Studies Index

rawshortTOC:
1: Numeral systems \\ 2: Babylonian and Egyptian mathematics \\ 3: Pythagorean mathematics \\ 4: Duplication, trisection, and quadrature \\ 5: Euclid and his elements \\ 6: Greek mathematics after Euclid \\ 7: Chinese, Hindu, and Arabian mathematics \\ 8: European mathematics, 500 to 1600 \\ 9: The dawn of modern mathematics \\ 10: Analytical geometry and other precalculus developments \\ 11: The calculus and related concepts \\ 12: The eighteenth century and the exploitation of the calculus \\ 13: The early nineteenth century and the liberation of geometry and algebra \\ 14: The later nineteenth century ad the arithmetization of analysis \\ 15: Abstraction and the transition into the twentieth century \\ Essay Topics \\ Bibliography \\ General Bibliography \\ A Chronological Table \\ Answers and Suggestions for the Solution of the Problem Studies \\ Index

rawTOC:
Preface / v \\ Introduction / xvi \\ Before the Seventeenth Century / 1 \\ Numeral Systems / 2 \\ 1-1 Primitive Counting \\ 1-2 Number Bases \\ 1-3 Written Number Systems \\ 1-4 Simple Grouping Systems \\ 1-5 Multiplicative Grouping Systems \\ 1-6 Ciphered Numeral Systems \\ 1-7 Positional Numeral Systems \\ 1-8 Early Computing \\ 1-9 The Hindu-Arabic Numeral System \\ 1-10 Arbitrary Bases \\ Problem Studies / 16 \\ 1.1 Number Words \\ 1.2 Written Numbers \\ 1.3 Alphabetic Greek Numeral System \\ 1.4 Old and Hypothetical Numeral Systems \\ 1.5 Finger Numbers \\ 1.6 Radix Fractions \\ 1.7 Arithmetic in Other Scales \\ 1.8 Problems in Scales of Notation \\ 1.9 Some Recreational Aspects of the Binary Scale \\ 1.10 Some Number Tricks \\ Essay Topics / 20 \\ Bibliography / 20 \\ Babylonian and Egyptian Mathematics / 22 \\ 2-1 The Ancient Orient \\ Babylonia: \\ 2-2 Sources \\ 2-3 Commercial and Agrarian Mathematics \\ 2-4 Geometry \\ 2-5 Algebra \\ 2-6 Plimpton 322 \\ Egypt: \\ 2-7 Sources and Dates \\ 2-8 Arithmetic and Algebra \\ 2-9 Geometry \\ 2-10 A Curious Problem in the Rhind Papyrus \\ Problem Studies / 36 \\ 2.1 Regular Numbers \\ 2.2 Compound Interest \\ 2.3 Quadratic Equations \\ 2.4 Algebraic Geometry \\ 2.5 The Susa Tablets \\ 2.6 Cubics \\ 2.7 Square Root Approximations \\ 2.8 Duplation and Mediation \\ 2.9 Unit Fractions \\ 2.10 The Sylvester Process \\ 2.11 The Seqt of a Pyramid \\ 2.12 Egyptian Algebra \\ 2.13 Egyptian Geometry \\ 2.14 The Greatest Egyptian Pyramid \\ 2.15 Some Problems from the Moscow Papyrus \\ 2.16 The 3, 4, 5 Triangle \\ Essay Topics / 43 \\ Bibliography / 44 \\ Three: Pythagorean Mathematics / 45 \\ 3-1 Birth of Demonstrative Mathematics \\ 3-2 Pythagoras and the Pythagoreans \\ 3-3 Pythagorean Arithmetic \\ 3-4 Pythagorean Theorem and Pythagorean Triples \\ 3-5 Discovery of Irrational Magnitudes \\ 3-6 Algebraic Identities \\ 3-7 Geometric Solution of Quadratic Equations \\ 3-8 Transformation of Areas \\ 3-9 The Regular Solids \\ 3-10 Postulational Thinking \\ Problem Studies / 64 \\ 3.1 The Practical Problems of Thales \\ 3.2 Perfect and Amicable Numbers \\ 3.3 Figurate Numbers \\ 3.4 Means \\ 3.5 Dissection Proofs of the Pythagorean Theorem \\ 3.6 Pythagorean Triples \\ 3.7 Irrational Numbers \\ 3.8 Algebraic Identities \\ 3.9 Geometric Algebra \\ 3.10 Geometric Solution of Quadratic Equations \\ 3.11 Transformation of Areas \\ 3.12 Regular Solids \\ 3.13 Some Problems Concerning the Regular Solids \\ 3.14 Golden Section \\ 3.15 An Interesting Relation \\ Essay Topics / 72 \\ Bibliography / 72 \\ Four: Duplication, Trisection, and Quadrature / 74 \\ 4-1 The Period from Thales to Euclid \\ 4-2 Lines of Mathematical Development \\ 4-3 The Three Famous Problems \\ 4-4 The Euclidean Tools \\ 4-5 Duplication of the Cube \\ 4-6 Trisection of an Angle \\ 4-7 Quadrature of the Circle \\ 4-8 A Chronology of $\pi$ \\ Problem Studies / 90 \\ 4.1 Euclidean and Modern Compasses \\ 4.2 Duplication by Archytas and Menaechmus \\ 4.3 Duplication by Apollonius and Eratosthenes \\ 4.4 The Cissoid of Diodes \\ 4.5 Some Seventeenth-Century Duplications \\ 4-6 Applications of the Insertion Principle \\ 4.7 The Conchoid of Nicomedes \\ 4.8 Trisection by Conics \\ 4.9 Asymptotic Euclidean Constructions \\ 4.10 The Quadratrix \\ 4.11 Approximate Rectification \\ 4.12 Lunes of Hippocrates \\ 4.13 Computation of $\pi$ \\ 4.14 The Snell Refinement \\ 4.15 Mnemonics for $\pi$ \\ Essay Topics / 98 \\ Bibliography / 98 \\ Five: Euclid and His Elements / 100 \\ 5-1 Alexandria \\ 5-2 Euclid \\ 5-3 Euclid's ``Elements'' \\ 5-4 Content of the ``Elements'' \\ 5-5 The Theory of Proportion \\ 5-6 Regular Polygons \\ 5-7 Formal Aspect of the ``Elements'' \\ 5-8 Euclid's Other Works \\ Problem Studies / 113 \\ 5.1 The Euclidean Algorithm \\ 5.2 Applications of the Euclidean Algorithm \\ 5.3 The Pythagorean Theorem \\ 5.4 Euclid's Book II \\ 5.5 Applications of the Fundamental Theorem of Arithmetic \\ 5.6 The Eudoxian Theory of Proportion \\ 5.7 Regular Polygons \\ 5.8 The Angle-Sum of a Triangle \\ 5.9 A Deductive Sequence Concerning Areas \\ 5.10 A Deductive Sequence Concerning Angles \\ 5-11 Elements \\ 5.12 Data \\ 5.13 Constructions Employing Data \\ 5.14 Divisions \\ Essay Topics / 119 \\ Bibliography / 119 \\ Greek Mathematics After Euclid / 121 \\ 6-1 Historical Setting \\ 6-2 Archimedes \\ 6-3 Eratosthenes \\ 6-4 Apollonius \\ 6-5 Hipparchus, Menelaus, Ptolemy, and Greek Trigonometry \\ 6-6 Heron \\ 6-7 Ancient Greek Algebra \\ 6-8 Diophantus \\ 6-9 Pappus \\ 6-10 The Commentators \\ Problem Studies / 140 \\ 6.1 Measurements by Aristarchus and Eratosthenes \\ 6.2 On the Sphere and Cylinder \\ 6.3 The Problem of the Crown \\ 6.4 The Arbelos and the Salinon \\ 6.5 The Theorem of the Broken Chord \\ 6.6 The Focus--Directrix Property \\ 6.7 Tangencies \\ 6.8 Problems from Apollonius \\ 6.9 Ptolemy's Table of Chords \\ 6.10 Stereographic Projection \\ 6.11 Problems from Heron \\ 6.12 Simultaneous Equations \\ 6.13 Problems from the ``Greek Anthology'' \\ 6.14 Type Problems from the ``Greek Anthology'' \\ 6.15 Diophantus \\ 6.16 Some Number Theory in the ``Arithmetica'' \\ 6.17 Problems from Pappus \\ 6.18 The Centroid Theorems \\ 6.19 The Trammel Construction of an Ellipse \\ 6.20 The Theorem of Menelaus \\ 6.21 More on Means \\ Essay Topics / 154 \\ Bibliography / 155 \\ Chinese, Hindu, and Arabian Mathematics / 156 \\ China: \\ 7-1 Sources and Periods \\ 7-2 From the Chou to the Tang \\ 7-3 From the Tang Through the Ming \\ India: \\ 7-4 General Survey \\ 7-5 Number Computing \\ 7-6 Arithmetic and Algebra \\ 7-7 Geometry and Trigonometry \\ 7-8 Contrast Between Greek and Hindu Mathematics \\ Arabia: \\ 7-9 The Rise of Moslem Culture \\ 7-10 Arithmetic and Algebra \\ 7-11 Geometry and Trigonometry \\ 7-12 Some Etymology \\ 7-13 The Arabian Contribution \\ Problem Studies / 178 \\ 7.1 Some Problems from the ``Arithmetic in Nine Sections'' \\ 7.2 The Pythagorean Theorem \\ 7.3 Magic Squares \\ 7.4 Some Early Hindu Problems \\ 7.5 Problems from Mahavira \\ 7.6 Problems from Bh{\=a}skara \\ 7.7 Quadratic Surds \\ 7.8 Indeterminate Equations of the First Degree \\ 7.9 The Diagonals of a Cyclic Quadrilateral \\ 7.10 Brahmagupta's Quadrilaterals \\ 7.11 Tabit Ibn Qorra, Al-karkh{\=\i}, and Nasir Ed-d{\=\i}n \\ 7.12 Casting Out 9's \\ 7.13 Casting Out 11's \\ 7.14 Double False Position \\ 7.15 Khayyam's Solution of Cubics \\ 7.16 A Geometric Solution of Cubics \\ 7.17 Geometrical Constructions on a Sphere \\ Essay Topics / 187 \\ Bibliography / 188 \\ Eight: European Mathematics, 500 to 1600 / 189 \\ 8-1 The Dark Ages \\ 8-2 The Period of Transmission \\ 8-3 Fibonacci and the Thirteenth Century \\ 8-4 The Fourteenth Century \\ 8-5 The Fifteenth Century \\ 8-6 The Early Arithmetics \\ 8-7 Beginnings of Algebraic Symbolism \\ 8-8 Cubic and Quartic Equations \\ 8-9 Fran{\c{c}}ois Vi{\`e}te \\ 8-10 Other Mathematicians of the Sixteenth Century \\ Problem Studies / 209 \\ 8.1 Problems from the Dark Ages \\ 8.2 The Fibonacci Sequence \\ 8.3 Problems from the ``Liber Abaci'' \\ 8.4 Further Problems of Fibonacci \\ 8.5 Star-Polygons \\ 8.6 Jordanus and Cusa \\ 8.7 D{\"u}rer and Magic Squares of Doubly-Even Order \\ 8.8 Problems from Regiomontanus \\ 8.9 Problems from Chuquet \\ 8.10 Problems from Pacioli \\ 8.11 Early Commercial Problems \\ 8.12 The Gelosia and Galley Algorithms \\ 8.13 Gematria and Arithmography \\ 8.14 Cubic Equations \\ 8.15 Quartic Equations \\ 8-16 Sixteenth-Century Notation \\ 8.17 Prolems from Vi{\`e}te \\ 8-18 Problems from Clavius \\ 8.19 Some Geometry \\ Essay Topics / 220 \\ Bibliography / 221 \\ Part Two: The Seventeenth Century and After the Dawn of Modern Mathematics / 223 \\ Nine: The Dawn of Modern Mathematics / 224 \\ 9-1 The Seventeenth Century \\ 9-2 Napier \\ 9-3 Logarithms \\ 9-4 The Savilian and Lucasian Professorships \\ 9-5 Harriot and Oughtred \\ 9-6 Galileo \\ 9-7 Kepler \\ 9-8 Desargues \\ 9-9 Pascal \\ Problem Studies / 246 \\ 9.1 Logarithms \\ 9.2 Napier and Spherical Trigonometry \\ 9.3 Napier's Rods \\ 9.4 The Slide Rule \\ 9.5 Freely Falling Bodies \\ 9.6 Sector Compasses \\ 9.7 Some Simple Paradoxes from Galileo's ``Discorsi'' \\ 9.8 Kepler's Laws \\ 9.9 Mosaics \\ 9.10 Proving Theorems by Projection \\ 9.11 Pascal's Youthful Empirical ``Proof'' \\ 9.12 Pascal's Theorem \\ 9.13 Pascal's Triangle \\ Essay Topics / 256 \\ Bibliography / 256 \\ Ten: Analytic Geometry and Other Precalculus Developments / 258 \\ 10-1 Analytic Geometry \\ 10-2 Descartes \\ 10-3 Fermat \\ 10-4 Roberval and Torricelli \\ 10-5 Huygens \\ 10-6 Some Seventeenth-Century Mathematicians of France and Italy \\ 10-7 Some Seventeenth-Century Mathematicians of Germany and the Low Countries \\ 10-8 Some Seventeenth-Century British Mathematicians \\ Problem Studies / 279 \\ 10.1 Geometric Algebra \\ 10.2 Descartes's ``La G{\'e}ometrie'' \\ 10.3 Descartes's Rule of Signs \\ 10.4 Problems from Descartes \\ 10.5 Fermat's Theorems \\ 10.6 The Problem of the Points \\ 10.7 Problems from Huygens \\ 10.8 Higher Plane Curves \\ 10.9 Recreational Problems from Bachet \\ 10.10 Some Geometry \\ 10.11 Computation of Logarithms by Series \\ Essay Topics / 285 \\ Bibliography / 285 \\ Eleven: The Calculus and Related Concepts / 287 \\ 11-1 Introduction \\ 11-2 Zeno's Paradoxes \\ 11-3 Eudoxus' Method of Exhaustion \\ 11-4 Archimedes' Method of Equilibrium \\ 11-5 The Beginnings of Integration in Western Europe \\ 11-6 Cavalieri's Method of Indivisibles \\ 11-7 The Beginning of Differentiation \\ 11-8 Wallis and Barrow \\ 11-9 Newton \\ 11-10 Leibniz \\ Problem Studies / 311 \\ 11.1 The Method of Exhaustion \\ 11.2 The Method of Equilibrium \\ 11.3 Some Archimedean Problems \\ 11.4 The Method of Indivisibles \\ 11.5 The Prismoidal Formula \\ 11.6 Differentiation \\ 11.7 The Binomial Theorem \\ 11.8 An Upper Bound for the Roots of a Polynomial Equation \\ 11.9 Approximate Solution of Equations \\ 11.10 Algebra of Classes \\ Essay Topics / 316 \\ Bibliography / 317 \\ Twelve: The Eighteenth Century and the Exploitation of the Calculus / 319 \\ 12-1 Introduction and Apology \\ 12-2 The Bernoulli Family \\ 12-3 De Moivre and Probability \\ 12-4 Taylor and Maclaurin \\ 12-5 Euler \\ 12-6 Clairaut, D'Alembert, and Lambert \\ 12-7 Lagrange \\ 12-8 Laplace and Legendre \\ 12-9 Monge and Carnot \\ 12-10 The Metric System \\ 12-11 Summary \\ Problem Studies / 344 \\ 12.1 Bernoulli Numbers \\ 12.2 De Moivre's Formula \\ 12.3 Distributions \\ 12.4 Formal Manipulation of Series \\ 12.5 A Conjecture and a Paradox \\ 12.6 Euler and an Infinite Series \\ 12.7 Orbiform Curves \\ 12.8 Unicursal and Multicursal Graphs \\ 12.9 Some Differential Equations \\ 12.10 Hyperbolic Functions \\ 12.11 Lagrange and Analytic Geometry \\ 12.12 Buffon's Needle Problem \\ 12.13 Random Chord in a Circle \\ 12.14 The Method of Least Squares \\ 12.15 Some Mongean Geometry \\ 12.16 Sensed Magnitudes \\ 12.17 Carnot's Theorem \\ Essay Topics / 355 \\ Bibliography / 356 \\ Thirteen: The Early Nineteenth Century and the Liberation of Geometry and Algebra / 357 \\ 13-1 The Prince of Mathematicians \\ 13-2 Fourier and Poisson \\ 13-3 Cauchy \\ 13-4 Abel and Galois \\ 13-5 Jacobi and Dirichlet \\ 13-6 Non-Euclidean Geometry \\ 13-7 The Emergence of Algebraic Structure \\ 13-8 The Liberation of Algebra \\ 13-9 Hamilton, Grassmann, Boole, and De Morgan \\ 13-10 Cayley, Sylvester, and Hermite \\ 13-11 Academies, Societies, and Periodicals \\ Problem Studies / 392 \\ 13.1 The Fundamental Theorem of Algebra \\ 13.2 Basic Properties of Congruence \\ 13.3 Gauss and Numbers \\ 13.4 Fourier Series \\ 13.5 Cauchy and Infinite Series \\ 13.6 Group Theory \\ 13.7 Examples of Groups \\ 13.8 Abelian Groups \\ 13.9 Saccheri Quadrilaterals \\ 13.10 The Hypothesis of the Acute Angle \\ 13.11 A Euclidean Model for Hyperbolic Geometry \\ 13.12 Non-Euclidean Geometry and Physical Space \\ 13.13 Systems with a Common Algebraic Structure \\ 13.14 Algebraic Laws \\ 13.15 More on Algebraic Laws \\ 13.16 Complex Numbers as Ordered Pairs of Real Numbers \\ 13.17 Quaternions \\ 13.18 Matrices \\ 13.19 Jordan and Lie Algebras \\ 13.20 Vectors \\ 13.21 An Interesting Algebra \\ 13.22 A Point Algebra \\ 13.23 An Infinite Non-Abelian Group \\ 13.24 The Hamiltonian Game \\ Essay Topics / 403 \\ Bibliography / 403 \\ The Later Nineteenth Century and the Arithmetization of Analysis / 405 \\ 14-1 Sequel to Euclid \\ 14-2 Impossibility of Solving the Three Famous Problems with Euclidean Tools \\ 14-3 Compasses Or Straightedge Alone \\ 14-4 Projective Geometry \\ 14-5 Analytic Geometry \\ 14-6 N-dimensional Geometry \\ 14-7 Differential Geometry \\ 14-8 The Erlanger Programm of Felix Klein \\ 14-9 The Arithmetization of Analysis \\ 14-10 Weierstrass and Riemann \\ 14-11 Cantor, Kronecker, and Poincar{\'e} \\ 14-12 Sonja Kovalevsky and Emmy Noether \\ 14-13 The Prime Numbers \\ Problem Studies / 437 \\ 14.1 The Feuerbach Configuration \\ 14.2 Commandino's Theorem \\ 14.3 The Altitudes of a Tetrahedron \\ 14.4 Space Analogs \\ 14.5 Isogonal Elements \\ 14.6 Impossible Constructions \\ 14.7 Some Approximate Constructions \\ 14.8 Mascheroni Construction Theorem \\ 14.9 Constructions with Straightedge and Rusty Compasses \\ 14.10 Lemoine's Geometrography \\ 14.11 Principle of Duality \\ 14.12 A Self-Dual Postulate Set for Projective Geometry \\ 14.13 Principle of Duality of Trigonometry \\ 14.14 Coordinate Systems \\ 14.15 Line Coordinates \\ 14.16 Dimensionality \\ 14.17 Abridged Notation \\ 14.18 Homogeneous Coordinates \\ 14.19 Plucker's Numbers \\ 14.20 N-dimensional Geometry \\ 14.21 Gaussian Curvature \\ 14.22 The Tractoid \\ 14.23 The Erlanger Programm \\ 14.24 Mysticism and Absurdity in the Early Calculus \\ 14.25 Early Difficulties with Infinite Series \\ 14.26 Some Paradoxes in Elementary Algebra \\ 14.27 Some Paradoxes in Calculus \\ 14.28 A Continuous Curve Having No Tangents \\ 14.29 Algebraic and Transcendental Numbers \\ 14.30 Prime Numbers \\ Essay Topics / 454 \\ Bibliography / 455 \\ Fifteen: Abstraction and the Transition Into the Twentieth Century / 457 \\ 15-1 Logical Shortcomings of Euclid's ``Elements'' \\ 15-2 Axiomatics \\ 15-3 The Evolution of Some Basic Concepts \\ 15-4 Transfinite Numbers \\ 15-5 Topology \\ 15-6 Mathematical Logic \\ 15-7 Antinomies of Set Theory \\ 15-8 Philosophies of Mathematics \\ 15-9 Computers \\ 15-10 The New Math and Bourbaki \\ 15-11 The Tree of Mathematics \\ Problem Studies / 493 \\ 15.1 Tacit Assumptions Made by Euclid \\ 15.2 Three Geometrical Paradoxes \\ 15.3 Dedekind's Continuity Postulate \\ 15.4 A Coordinate Interpretation of Euclid's Postulates \\ 15.5 A Spherical Interpretation of Euclid's Postulates \\ 15.6 Pasch's Postulate \\ 15.7 An Abstract Mathematical System \\ 15.8 Axiomatics \\ 15.9 Associated Hypothetical Propositions \\ 15.10 Intuition Versus Proof \\ 15.11 A Miniature Mathematical System \\ 15.12 A Set of Inconsistent Statements \\ 15.13 A Postulate Set Related to Relativity Theory \\ 15.14 Bees and Hives \\ 15.15 Metric Space \\ 15.16 Equivalent Segments \\ 15.17 Some Denumerable and Nondenumerable Sets \\ 15.18 Polynomials of Heights 1, 2, 3, 4, and 5 \\ 15.19 The Measure of a Denumerable Set of Points \\ 15.20 Transfinite Numbers and Dimension Theory \\ 15.21 Circles and Lines \\ 15.22 Homeomorphic Surfaces \\ 15.23 Sides and Edges \\ 15.24 Paradromic Rings \\ 15.25 Polyhedral Surfaces \\ 15.26 Faces and Vertices of Polyhedral Surfaces \\ 15.27 Hausdorff Space \\ 15.28 Allied Propositions \\ 15.29 Three-Valued Logics \\ 15.30 The Russell Paradox \\ 15.31 A Paradox \\ 15.32 Some Dilemmas and Some Questions \\ 15.33 Recreational Mathematics \\ Essay Topics / 506 \\ Bibliography / 507 \\ General Bibliography / 512 \\ A Chronological Table / 514 \\ Answers and Suggestions for the Solution of the Problem Studies / 522 \\ Index / 553

entry:
@Book{Eves:1983:IHM,
  author =       "Howard Eves",
  title =        "An Introduction to the History of Mathematics",
  publisher =    "Saunders College Publishing",
  address =      "Philadelphia, PA, USA",
  pages =        "xviii + 593",
  year =         "1983",
  ISBN =         "0-03-062064-3",
  ISBN-13 =      "978-0-03-062064-5",
  LCCN =         "QA21.E8",
  bibdate =      "Sat Apr 27 15:49:51 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Rescued and inherited from INSCC discarded books
                 pile.",
  shorttableofcontents = "1: Numeral systems \\
                 2: Babylonian and Egyptian mathematics \\
                 3: Pythagorean mathematics \\
                 4: Duplication, trisection, and quadrature \\
                 5: Euclid and his elements \\
                 6: Greek mathematics after Euclid \\
                 7: Chinese, Hindu, and Arabian mathematics \\
                 8: European mathematics, 500 to 1600 \\
                 9: The dawn of modern mathematics \\
                 10: Analytical geometry and other precalculus
                 developments \\
                 11: The calculus and related concepts \\
                 12: The eighteenth century and the exploitation of the
                 calculus \\
                 13: The early nineteenth century and the liberation of
                 geometry and algebra \\
                 14: The later nineteenth century ad the arithmetization
                 of analysis \\
                 15: Abstraction and the transition into the twentieth
                 century \\
                 Essay Topics \\
                 Bibliography \\
                 General Bibliography \\
                 A Chronological Table \\
                 Answers and Suggestions for the Solution of the Problem
                 Studies \\
                 Index",
  subject =      "Mathematics; History; Math{\'e}matiques; Histoire;
                 Mathematics; Geschichte; Mathematik",
  tableofcontents = "Preface / v \\
                 Introduction / xvi \\
                 Before the Seventeenth Century / 1 \\
                 Numeral Systems / 2 \\
                 1-1 Primitive Counting \\
                 1-2 Number Bases \\
                 1-3 Written Number Systems \\
                 1-4 Simple Grouping Systems \\
                 1-5 Multiplicative Grouping Systems \\
                 1-6 Ciphered Numeral Systems \\
                 1-7 Positional Numeral Systems \\
                 1-8 Early Computing \\
                 1-9 The Hindu-Arabic Numeral System \\
                 1-10 Arbitrary Bases \\
                 Problem Studies / 16 \\
                 1.1 Number Words \\
                 1.2 Written Numbers \\
                 1.3 Alphabetic Greek Numeral System \\
                 1.4 Old and Hypothetical Numeral Systems \\
                 1.5 Finger Numbers \\
                 1.6 Radix Fractions \\
                 1.7 Arithmetic in Other Scales \\
                 1.8 Problems in Scales of Notation \\
                 1.9 Some Recreational Aspects of the Binary Scale \\
                 1.10 Some Number Tricks \\
                 Essay Topics / 20 \\
                 Bibliography / 20 \\
                 Babylonian and Egyptian Mathematics / 22 \\
                 2-1 The Ancient Orient \\
                 Babylonia: \\
                 2-2 Sources \\
                 2-3 Commercial and Agrarian Mathematics \\
                 2-4 Geometry \\
                 2-5 Algebra \\
                 2-6 Plimpton 322 \\
                 Egypt: \\
                 2-7 Sources and Dates \\
                 2-8 Arithmetic and Algebra \\
                 2-9 Geometry \\
                 2-10 A Curious Problem in the Rhind Papyrus \\
                 Problem Studies / 36 \\
                 2.1 Regular Numbers \\
                 2.2 Compound Interest \\
                 2.3 Quadratic Equations \\
                 2.4 Algebraic Geometry \\
                 2.5 The Susa Tablets \\
                 2.6 Cubics \\
                 2.7 Square Root Approximations \\
                 2.8 Duplation and Mediation \\
                 2.9 Unit Fractions \\
                 2.10 The Sylvester Process \\
                 2.11 The Seqt of a Pyramid \\
                 2.12 Egyptian Algebra \\
                 2.13 Egyptian Geometry \\
                 2.14 The Greatest Egyptian Pyramid \\
                 2.15 Some Problems from the Moscow Papyrus \\
                 2.16 The 3, 4, 5 Triangle \\
                 Essay Topics / 43 \\
                 Bibliography / 44 \\
                 Three: Pythagorean Mathematics / 45 \\
                 3-1 Birth of Demonstrative Mathematics \\
                 3-2 Pythagoras and the Pythagoreans \\
                 3-3 Pythagorean Arithmetic \\
                 3-4 Pythagorean Theorem and Pythagorean Triples \\
                 3-5 Discovery of Irrational Magnitudes \\
                 3-6 Algebraic Identities \\
                 3-7 Geometric Solution of Quadratic Equations \\
                 3-8 Transformation of Areas \\
                 3-9 The Regular Solids \\
                 3-10 Postulational Thinking \\
                 Problem Studies / 64 \\
                 3.1 The Practical Problems of Thales \\
                 3.2 Perfect and Amicable Numbers \\
                 3.3 Figurate Numbers \\
                 3.4 Means \\
                 3.5 Dissection Proofs of the Pythagorean Theorem \\
                 3.6 Pythagorean Triples \\
                 3.7 Irrational Numbers \\
                 3.8 Algebraic Identities \\
                 3.9 Geometric Algebra \\
                 3.10 Geometric Solution of Quadratic Equations \\
                 3.11 Transformation of Areas \\
                 3.12 Regular Solids \\
                 3.13 Some Problems Concerning the Regular Solids \\
                 3.14 Golden Section \\
                 3.15 An Interesting Relation \\
                 Essay Topics / 72 \\
                 Bibliography / 72 \\
                 Four: Duplication, Trisection, and Quadrature / 74 \\
                 4-1 The Period from Thales to Euclid \\
                 4-2 Lines of Mathematical Development \\
                 4-3 The Three Famous Problems \\
                 4-4 The Euclidean Tools \\
                 4-5 Duplication of the Cube \\
                 4-6 Trisection of an Angle \\
                 4-7 Quadrature of the Circle \\
                 4-8 A Chronology of $\pi$ \\
                 Problem Studies / 90 \\
                 4.1 Euclidean and Modern Compasses \\
                 4.2 Duplication by Archytas and Menaechmus \\
                 4.3 Duplication by Apollonius and Eratosthenes \\
                 4.4 The Cissoid of Diodes \\
                 4.5 Some Seventeenth-Century Duplications \\
                 4-6 Applications of the Insertion Principle \\
                 4.7 The Conchoid of Nicomedes \\
                 4.8 Trisection by Conics \\
                 4.9 Asymptotic Euclidean Constructions \\
                 4.10 The Quadratrix \\
                 4.11 Approximate Rectification \\
                 4.12 Lunes of Hippocrates \\
                 4.13 Computation of $\pi$ \\
                 4.14 The Snell Refinement \\
                 4.15 Mnemonics for $\pi$ \\
                 Essay Topics / 98 \\
                 Bibliography / 98 \\
                 Five: Euclid and His Elements / 100 \\
                 5-1 Alexandria \\
                 5-2 Euclid \\
                 5-3 Euclid's ``Elements'' \\
                 5-4 Content of the ``Elements'' \\
                 5-5 The Theory of Proportion \\
                 5-6 Regular Polygons \\
                 5-7 Formal Aspect of the ``Elements'' \\
                 5-8 Euclid's Other Works \\
                 Problem Studies / 113 \\
                 5.1 The Euclidean Algorithm \\
                 5.2 Applications of the Euclidean Algorithm \\
                 5.3 The Pythagorean Theorem \\
                 5.4 Euclid's Book II \\
                 5.5 Applications of the Fundamental Theorem of
                 Arithmetic \\
                 5.6 The Eudoxian Theory of Proportion \\
                 5.7 Regular Polygons \\
                 5.8 The Angle-Sum of a Triangle \\
                 5.9 A Deductive Sequence Concerning Areas \\
                 5.10 A Deductive Sequence Concerning Angles \\
                 5-11 Elements \\
                 5.12 Data \\
                 5.13 Constructions Employing Data \\
                 5.14 Divisions \\
                 Essay Topics / 119 \\
                 Bibliography / 119 \\
                 Greek Mathematics After Euclid / 121 \\
                 6-1 Historical Setting \\
                 6-2 Archimedes \\
                 6-3 Eratosthenes \\
                 6-4 Apollonius \\
                 6-5 Hipparchus, Menelaus, Ptolemy, and Greek
                 Trigonometry \\
                 6-6 Heron \\
                 6-7 Ancient Greek Algebra \\
                 6-8 Diophantus \\
                 6-9 Pappus \\
                 6-10 The Commentators \\
                 Problem Studies / 140 \\
                 6.1 Measurements by Aristarchus and Eratosthenes \\
                 6.2 On the Sphere and Cylinder \\
                 6.3 The Problem of the Crown \\
                 6.4 The Arbelos and the Salinon \\
                 6.5 The Theorem of the Broken Chord \\
                 6.6 The Focus--Directrix Property \\
                 6.7 Tangencies \\
                 6.8 Problems from Apollonius \\
                 6.9 Ptolemy's Table of Chords \\
                 6.10 Stereographic Projection \\
                 6.11 Problems from Heron \\
                 6.12 Simultaneous Equations \\
                 6.13 Problems from the ``Greek Anthology'' \\
                 6.14 Type Problems from the ``Greek Anthology'' \\
                 6.15 Diophantus \\
                 6.16 Some Number Theory in the ``Arithmetica'' \\
                 6.17 Problems from Pappus \\
                 6.18 The Centroid Theorems \\
                 6.19 The Trammel Construction of an Ellipse \\
                 6.20 The Theorem of Menelaus \\
                 6.21 More on Means \\
                 Essay Topics / 154 \\
                 Bibliography / 155 \\
                 Chinese, Hindu, and Arabian Mathematics / 156 \\
                 China: \\
                 7-1 Sources and Periods \\
                 7-2 From the Chou to the Tang \\
                 7-3 From the Tang Through the Ming \\
                 India: \\
                 7-4 General Survey \\
                 7-5 Number Computing \\
                 7-6 Arithmetic and Algebra \\
                 7-7 Geometry and Trigonometry \\
                 7-8 Contrast Between Greek and Hindu Mathematics \\
                 Arabia: \\
                 7-9 The Rise of Moslem Culture \\
                 7-10 Arithmetic and Algebra \\
                 7-11 Geometry and Trigonometry \\
                 7-12 Some Etymology \\
                 7-13 The Arabian Contribution \\
                 Problem Studies / 178 \\
                 7.1 Some Problems from the ``Arithmetic in Nine
                 Sections'' \\
                 7.2 The Pythagorean Theorem \\
                 7.3 Magic Squares \\
                 7.4 Some Early Hindu Problems \\
                 7.5 Problems from Mahavira \\
                 7.6 Problems from Bh{\=a}skara \\
                 7.7 Quadratic Surds \\
                 7.8 Indeterminate Equations of the First Degree \\
                 7.9 The Diagonals of a Cyclic Quadrilateral \\
                 7.10 Brahmagupta's Quadrilaterals \\
                 7.11 Tabit Ibn Qorra, Al-karkh{\=\i}, and Nasir
                 Ed-d{\=\i}n \\
                 7.12 Casting Out 9's \\
                 7.13 Casting Out 11's \\
                 7.14 Double False Position \\
                 7.15 Khayyam's Solution of Cubics \\
                 7.16 A Geometric Solution of Cubics \\
                 7.17 Geometrical Constructions on a Sphere \\
                 Essay Topics / 187 \\
                 Bibliography / 188 \\
                 Eight: European Mathematics, 500 to 1600 / 189 \\
                 8-1 The Dark Ages \\
                 8-2 The Period of Transmission \\
                 8-3 Fibonacci and the Thirteenth Century \\
                 8-4 The Fourteenth Century \\
                 8-5 The Fifteenth Century \\
                 8-6 The Early Arithmetics \\
                 8-7 Beginnings of Algebraic Symbolism \\
                 8-8 Cubic and Quartic Equations \\
                 8-9 Fran{\c{c}}ois Vi{\`e}te \\
                 8-10 Other Mathematicians of the Sixteenth Century \\
                 Problem Studies / 209 \\
                 8.1 Problems from the Dark Ages \\
                 8.2 The Fibonacci Sequence \\
                 8.3 Problems from the ``Liber Abaci'' \\
                 8.4 Further Problems of Fibonacci \\
                 8.5 Star-Polygons \\
                 8.6 Jordanus and Cusa \\
                 8.7 D{\"u}rer and Magic Squares of Doubly-Even Order
                 \\
                 8.8 Problems from Regiomontanus \\
                 8.9 Problems from Chuquet \\
                 8.10 Problems from Pacioli \\
                 8.11 Early Commercial Problems \\
                 8.12 The Gelosia and Galley Algorithms \\
                 8.13 Gematria and Arithmography \\
                 8.14 Cubic Equations \\
                 8.15 Quartic Equations \\
                 8-16 Sixteenth-Century Notation \\
                 8.17 Prolems from Vi{\`e}te \\
                 8-18 Problems from Clavius \\
                 8.19 Some Geometry \\
                 Essay Topics / 220 \\
                 Bibliography / 221 \\
                 Part Two: The Seventeenth Century and After the Dawn of
                 Modern Mathematics / 223 \\
                 Nine: The Dawn of Modern Mathematics / 224 \\
                 9-1 The Seventeenth Century \\
                 9-2 Napier \\
                 9-3 Logarithms \\
                 9-4 The Savilian and Lucasian Professorships \\
                 9-5 Harriot and Oughtred \\
                 9-6 Galileo \\
                 9-7 Kepler \\
                 9-8 Desargues \\
                 9-9 Pascal \\
                 Problem Studies / 246 \\
                 9.1 Logarithms \\
                 9.2 Napier and Spherical Trigonometry \\
                 9.3 Napier's Rods \\
                 9.4 The Slide Rule \\
                 9.5 Freely Falling Bodies \\
                 9.6 Sector Compasses \\
                 9.7 Some Simple Paradoxes from Galileo's ``Discorsi''
                 \\
                 9.8 Kepler's Laws \\
                 9.9 Mosaics \\
                 9.10 Proving Theorems by Projection \\
                 9.11 Pascal's Youthful Empirical ``Proof'' \\
                 9.12 Pascal's Theorem \\
                 9.13 Pascal's Triangle \\
                 Essay Topics / 256 \\
                 Bibliography / 256 \\
                 Ten: Analytic Geometry and Other Precalculus
                 Developments / 258 \\
                 10-1 Analytic Geometry \\
                 10-2 Descartes \\
                 10-3 Fermat \\
                 10-4 Roberval and Torricelli \\
                 10-5 Huygens \\
                 10-6 Some Seventeenth-Century Mathematicians of France
                 and Italy \\
                 10-7 Some Seventeenth-Century Mathematicians of Germany
                 and the Low Countries \\
                 10-8 Some Seventeenth-Century British Mathematicians
                 \\
                 Problem Studies / 279 \\
                 10.1 Geometric Algebra \\
                 10.2 Descartes's ``La G{\'e}ometrie'' \\
                 10.3 Descartes's Rule of Signs \\
                 10.4 Problems from Descartes \\
                 10.5 Fermat's Theorems \\
                 10.6 The Problem of the Points \\
                 10.7 Problems from Huygens \\
                 10.8 Higher Plane Curves \\
                 10.9 Recreational Problems from Bachet \\
                 10.10 Some Geometry \\
                 10.11 Computation of Logarithms by Series \\
                 Essay Topics / 285 \\
                 Bibliography / 285 \\
                 Eleven: The Calculus and Related Concepts / 287 \\
                 11-1 Introduction \\
                 11-2 Zeno's Paradoxes \\
                 11-3 Eudoxus' Method of Exhaustion \\
                 11-4 Archimedes' Method of Equilibrium \\
                 11-5 The Beginnings of Integration in Western Europe
                 \\
                 11-6 Cavalieri's Method of Indivisibles \\
                 11-7 The Beginning of Differentiation \\
                 11-8 Wallis and Barrow \\
                 11-9 Newton \\
                 11-10 Leibniz \\
                 Problem Studies / 311 \\
                 11.1 The Method of Exhaustion \\
                 11.2 The Method of Equilibrium \\
                 11.3 Some Archimedean Problems \\
                 11.4 The Method of Indivisibles \\
                 11.5 The Prismoidal Formula \\
                 11.6 Differentiation \\
                 11.7 The Binomial Theorem \\
                 11.8 An Upper Bound for the Roots of a Polynomial
                 Equation \\
                 11.9 Approximate Solution of Equations \\
                 11.10 Algebra of Classes \\
                 Essay Topics / 316 \\
                 Bibliography / 317 \\
                 Twelve: The Eighteenth Century and the Exploitation of
                 the Calculus / 319 \\
                 12-1 Introduction and Apology \\
                 12-2 The Bernoulli Family \\
                 12-3 De Moivre and Probability \\
                 12-4 Taylor and Maclaurin \\
                 12-5 Euler \\
                 12-6 Clairaut, D'Alembert, and Lambert \\
                 12-7 Lagrange \\
                 12-8 Laplace and Legendre \\
                 12-9 Monge and Carnot \\
                 12-10 The Metric System \\
                 12-11 Summary \\
                 Problem Studies / 344 \\
                 12.1 Bernoulli Numbers \\
                 12.2 De Moivre's Formula \\
                 12.3 Distributions \\
                 12.4 Formal Manipulation of Series \\
                 12.5 A Conjecture and a Paradox \\
                 12.6 Euler and an Infinite Series \\
                 12.7 Orbiform Curves \\
                 12.8 Unicursal and Multicursal Graphs \\
                 12.9 Some Differential Equations \\
                 12.10 Hyperbolic Functions \\
                 12.11 Lagrange and Analytic Geometry \\
                 12.12 Buffon's Needle Problem \\
                 12.13 Random Chord in a Circle \\
                 12.14 The Method of Least Squares \\
                 12.15 Some Mongean Geometry \\
                 12.16 Sensed Magnitudes \\
                 12.17 Carnot's Theorem \\
                 Essay Topics / 355 \\
                 Bibliography / 356 \\
                 Thirteen: The Early Nineteenth Century and the
                 Liberation of Geometry and Algebra / 357 \\
                 13-1 The Prince of Mathematicians \\
                 13-2 Fourier and Poisson \\
                 13-3 Cauchy \\
                 13-4 Abel and Galois \\
                 13-5 Jacobi and Dirichlet \\
                 13-6 Non-Euclidean Geometry \\
                 13-7 The Emergence of Algebraic Structure \\
                 13-8 The Liberation of Algebra \\
                 13-9 Hamilton, Grassmann, Boole, and De Morgan \\
                 13-10 Cayley, Sylvester, and Hermite \\
                 13-11 Academies, Societies, and Periodicals \\
                 Problem Studies / 392 \\
                 13.1 The Fundamental Theorem of Algebra \\
                 13.2 Basic Properties of Congruence \\
                 13.3 Gauss and Numbers \\
                 13.4 Fourier Series \\
                 13.5 Cauchy and Infinite Series \\
                 13.6 Group Theory \\
                 13.7 Examples of Groups \\
                 13.8 Abelian Groups \\
                 13.9 Saccheri Quadrilaterals \\
                 13.10 The Hypothesis of the Acute Angle \\
                 13.11 A Euclidean Model for Hyperbolic Geometry \\
                 13.12 Non-Euclidean Geometry and Physical Space \\
                 13.13 Systems with a Common Algebraic Structure \\
                 13.14 Algebraic Laws \\
                 13.15 More on Algebraic Laws \\
                 13.16 Complex Numbers as Ordered Pairs of Real Numbers
                 \\
                 13.17 Quaternions \\
                 13.18 Matrices \\
                 13.19 Jordan and Lie Algebras \\
                 13.20 Vectors \\
                 13.21 An Interesting Algebra \\
                 13.22 A Point Algebra \\
                 13.23 An Infinite Non-Abelian Group \\
                 13.24 The Hamiltonian Game \\
                 Essay Topics / 403 \\
                 Bibliography / 403 \\
                 The Later Nineteenth Century and the Arithmetization of
                 Analysis / 405 \\
                 14-1 Sequel to Euclid \\
                 14-2 Impossibility of Solving the Three Famous Problems
                 with Euclidean Tools \\
                 14-3 Compasses Or Straightedge Alone \\
                 14-4 Projective Geometry \\
                 14-5 Analytic Geometry \\
                 14-6 N-dimensional Geometry \\
                 14-7 Differential Geometry \\
                 14-8 The Erlanger Programm of Felix Klein \\
                 14-9 The Arithmetization of Analysis \\
                 14-10 Weierstrass and Riemann \\
                 14-11 Cantor, Kronecker, and Poincar{\'e} \\
                 14-12 Sonja Kovalevsky and Emmy Noether \\
                 14-13 The Prime Numbers \\
                 Problem Studies / 437 \\
                 14.1 The Feuerbach Configuration \\
                 14.2 Commandino's Theorem \\
                 14.3 The Altitudes of a Tetrahedron \\
                 14.4 Space Analogs \\
                 14.5 Isogonal Elements \\
                 14.6 Impossible Constructions \\
                 14.7 Some Approximate Constructions \\
                 14.8 Mascheroni Construction Theorem \\
                 14.9 Constructions with Straightedge and Rusty
                 Compasses \\
                 14.10 Lemoine's Geometrography \\
                 14.11 Principle of Duality \\
                 14.12 A Self-Dual Postulate Set for Projective Geometry
                 \\
                 14.13 Principle of Duality of Trigonometry \\
                 14.14 Coordinate Systems \\
                 14.15 Line Coordinates \\
                 14.16 Dimensionality \\
                 14.17 Abridged Notation \\
                 14.18 Homogeneous Coordinates \\
                 14.19 Plucker's Numbers \\
                 14.20 N-dimensional Geometry \\
                 14.21 Gaussian Curvature \\
                 14.22 The Tractoid \\
                 14.23 The Erlanger Programm \\
                 14.24 Mysticism and Absurdity in the Early Calculus \\
                 14.25 Early Difficulties with Infinite Series \\
                 14.26 Some Paradoxes in Elementary Algebra \\
                 14.27 Some Paradoxes in Calculus \\
                 14.28 A Continuous Curve Having No Tangents \\
                 14.29 Algebraic and Transcendental Numbers \\
                 14.30 Prime Numbers \\
                 Essay Topics / 454 \\
                 Bibliography / 455 \\
                 Fifteen: Abstraction and the Transition Into the
                 Twentieth Century / 457 \\
                 15-1 Logical Shortcomings of Euclid's ``Elements'' \\
                 15-2 Axiomatics \\
                 15-3 The Evolution of Some Basic Concepts \\
                 15-4 Transfinite Numbers \\
                 15-5 Topology \\
                 15-6 Mathematical Logic \\
                 15-7 Antinomies of Set Theory \\
                 15-8 Philosophies of Mathematics \\
                 15-9 Computers \\
                 15-10 The New Math and Bourbaki \\
                 15-11 The Tree of Mathematics \\
                 Problem Studies / 493 \\
                 15.1 Tacit Assumptions Made by Euclid \\
                 15.2 Three Geometrical Paradoxes \\
                 15.3 Dedekind's Continuity Postulate \\
                 15.4 A Coordinate Interpretation of Euclid's Postulates
                 \\
                 15.5 A Spherical Interpretation of Euclid's Postulates
                 \\
                 15.6 Pasch's Postulate \\
                 15.7 An Abstract Mathematical System \\
                 15.8 Axiomatics \\
                 15.9 Associated Hypothetical Propositions \\
                 15.10 Intuition Versus Proof \\
                 15.11 A Miniature Mathematical System \\
                 15.12 A Set of Inconsistent Statements \\
                 15.13 A Postulate Set Related to Relativity Theory \\
                 15.14 Bees and Hives \\
                 15.15 Metric Space \\
                 15.16 Equivalent Segments \\
                 15.17 Some Denumerable and Nondenumerable Sets \\
                 15.18 Polynomials of Heights 1, 2, 3, 4, and 5 \\
                 15.19 The Measure of a Denumerable Set of Points \\
                 15.20 Transfinite Numbers and Dimension Theory \\
                 15.21 Circles and Lines \\
                 15.22 Homeomorphic Surfaces \\
                 15.23 Sides and Edges \\
                 15.24 Paradromic Rings \\
                 15.25 Polyhedral Surfaces \\
                 15.26 Faces and Vertices of Polyhedral Surfaces \\
                 15.27 Hausdorff Space \\
                 15.28 Allied Propositions \\
                 15.29 Three-Valued Logics \\
                 15.30 The Russell Paradox \\
                 15.31 A Paradox \\
                 15.32 Some Dilemmas and Some Questions \\
                 15.33 Recreational Mathematics \\
                 Essay Topics / 506 \\
                 Bibliography / 507 \\
                 General Bibliography / 512 \\
                 A Chronological Table / 514 \\
                 Answers and Suggestions for the Solution of the Problem
                 Studies / 522 \\
                 Index / 553",
}


