# bibtab

bibtype: book
filename: master.bib
label: Cortada:2019:IHM
author: James W. Cortada
title: IBM: How a Multinational Corporation Struggled for Success and Shaped the Modern World
publisher: pub-MIT
address: pub-MIT:adr
pages: xxii + 723
year: 2019
ISBN: 0-262-03944-3 (hardcover), 0-262-35148-X (e-book) OR 0262039443 (hardcover), 026235148X (ebook)
LCCN: HD9696.2.U6
bibdate: Sat Jun 1 14:22:20 MDT 2019
bibsource: fsz3950.oclc.org:210/WorldCat https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2019.06.01 14:22:20 MDT
series: History of computing
acknowledgement: ack-nhfb
rawauthor: James W. Cortada
rawtitle: {IBM}: How a Multinational Corporation Struggled for Success and Shaped the Modern World
ISBN13:
978-0-262-03944-4 (hardcover), 978-0-262-35148-5 (e-book) OR 9780262039444 (hardcover), 9780262351485 (ebook)

abstract:
This is a history of IBM, a huge multinational firm, from its origins in the 1880s to the present. It demonstrates that this supplier of computers, software and information technology services played a profound role in shaping how other large organizations and economies evolved in the twentieth century. It describes its strategies, expansions, how various parts of the company collaborated and competed within the firm overcoming problems, a nearly fatal period in the early 1990s, and its recurring revivals and successes. The book is unique for several reasons. First, it is a comprehensive volume covering technologies, managerial actions, strategies, sales, the role of customers, and government regulatory and legal issues. Second, it is the only history that covers the post 1980 period down to 2018. (The last major history of IBM was published in the early 1990s.) Third, its emphasis on the role of corporate and sales culture is unique among books concerning IBM. Fourth, this book provides the greatest amount of detail available today about IBM's role in Western and Eastern Europe. The book is also unique because the author brings to the project several perspectives: that of an employee close to much of the critical events of one-third of the company's history, that of a trained historian, and that of an experienced student of the history of computing in business. Thus, he is able to integrate the entire history of the company from its origins to the present, demonstrating, for example, legacies of a prior era still evident in today's company, an ability to connect IBM's behaviors in each decade to those of other large multinational corporations, and to the computing activities of its many thousands of customers

TOC:
Preface / ix I From Birth to Identity: IBM in Its Early Years, 1880s--1945 / 1 1 Origins, 1880s--1914 / 3 2 Thomas J. Watson Sr. and the Creation of IBM, 1914--1924 / 27 3 The Emergence of IBM and the Culture of THINK / 61 4 IBM and the Great Depression / 91 5 IBM in World War II, 1939--1945 / 121 II IBM the Computer Behemoth, 1945--1985 / 147 6 IBM Gets into the Computer Business, 1945--1964 / 149 7 How Customers, IBM, and a New Industry Evolved, 1945--1964 / 177 8 System 360: One of the Greatest Products in History? / 203 9 ``The IBM Way'': How It Worked, 1964--1993 / 233 10 ``The IBM Way'': What the World Saw, 1964--1993 / 257 11 IBM on the Global Stage / 283 12 Two Decades of Antitrust Suits, 1960s--1980s / 325 13 Communist Computers / 353 14 ``A Tool for Modern Times'': IBM and the Personal Computer / 379 III A Time of Crisis, 1985--1994 / 419 15 Storms, Crisis, and Near Death, 1985--1993 / 421 16 IBM's Initial Response, 1985--1993 / 439 17 How IBM Was Rescued, 1993--1994 / 471 IV IBM in the New Century / 501 18 A New IBM, 1995--2012 / 503 19 Hard Times, Again, and Another Transformation / 547 20 THINK: IBM Today and Its Legacy / 579 Author's Note: In the Spirit of Transparency / 619 Notes / 623 Bibliographic Essay / 677 Index / 687

rawabstract:
This is a history of IBM, a huge multinational firm, from its origins in the 1880s to the present. It demonstrates that this supplier of computers, software and information technology services played a profound role in shaping how other large organizations and economies evolved in the twentieth century. It describes its strategies, expansions, how various parts of the company collaborated and competed within the firm overcoming problems, a nearly fatal period in the early 1990s, and its recurring revivals and successes. The book is unique for several reasons. First, it is a comprehensive volume covering technologies, managerial actions, strategies, sales, the role of customers, and government regulatory and legal issues. Second, it is the only history that covers the post 1980 period down to 2018. (The last major history of IBM was published in the early 1990s.) Third, its emphasis on the role of corporate and sales culture is unique among books concerning IBM. Fourth, this book provides the greatest amount of detail available today about IBM's role in Western and Eastern Europe. The book is also unique because the author brings to the project several perspectives: that of an employee close to much of the critical events of one-third of the company's history, that of a trained historian, and that of an experienced student of the history of computing in business. Thus, he is able to integrate the entire history of the company from its origins to the present, demonstrating, for example, legacies of a prior era still evident in today's company, an ability to connect IBM's behaviors in each decade to those of other large multinational corporations, and to the computing activities of its many thousands of customers

rawTOC:
Preface / ix \\ I From Birth to Identity: IBM in Its Early Years, 1880s--1945 / 1 \\ 1 Origins, 1880s--1914 / 3 \\ 2 Thomas J. Watson Sr. and the Creation of IBM, 1914--1924 / 27 \\ 3 The Emergence of IBM and the Culture of THINK / 61 \\ 4 IBM and the Great Depression / 91 \\ 5 IBM in World War II, 1939--1945 / 121 \\ II IBM the Computer Behemoth, 1945--1985 / 147 \\ 6 IBM Gets into the Computer Business, 1945--1964 / 149 \\ 7 How Customers, IBM, and a New Industry Evolved, 1945--1964 / 177 \\ 8 System 360: One of the Greatest Products in History? / 203 \\ 9 ``The IBM Way'': How It Worked, 1964--1993 / 233 \\ 10 ``The IBM Way'': What the World Saw, 1964--1993 / 257 \\ 11 IBM on the Global Stage / 283 \\ 12 Two Decades of Antitrust Suits, 1960s--1980s / 325 \\ 13 Communist Computers / 353 \\ 14 ``A Tool for Modern Times'': IBM and the Personal Computer / 379 \\ III A Time of Crisis, 1985--1994 / 419 \\ 15 Storms, Crisis, and Near Death, 1985--1993 / 421 \\ 16 IBM's Initial Response, 1985--1993 / 439 \\ 17 How IBM Was Rescued, 1993--1994 / 471 \\ IV IBM in the New Century / 501 \\ 18 A New IBM, 1995--2012 / 503 \\ 19 Hard Times, Again, and Another Transformation / 547 \\ 20 THINK: IBM Today and Its Legacy / 579 \\ Author's Note: In the Spirit of Transparency / 619 \\ Notes / 623 \\ Bibliographic Essay / 677 \\ Index / 687

entry:
@Book{Cortada:2019:IHM,
  author =       "James W. Cortada",
  title =        "{IBM}: How a Multinational Corporation Struggled for
                 Success and Shaped the Modern World",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xxii + 723",
  year =         "2019",
  ISBN =         "0-262-03944-3 (hardcover), 0-262-35148-X (e-book)",
  ISBN-13 =      "978-0-262-03944-4 (hardcover), 978-0-262-35148-5
                 (e-book)",
  LCCN =         "HD9696.2.U6",
  bibdate =      "Sat Jun 1 14:22:20 MDT 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "History of computing",
  abstract =     "This is a history of IBM, a huge multinational firm,
                 from its origins in the 1880s to the present. It
                 demonstrates that this supplier of computers, software
                 and information technology services played a profound
                 role in shaping how other large organizations and
                 economies evolved in the twentieth century. It
                 describes its strategies, expansions, how various parts
                 of the company collaborated and competed within the
                 firm overcoming problems, a nearly fatal period in the
                 early 1990s, and its recurring revivals and successes.
                 The book is unique for several reasons. First, it is a
                 comprehensive volume covering technologies, managerial
                 actions, strategies, sales, the role of customers, and
                 government regulatory and legal issues. Second, it is
                 the only history that covers the post 1980 period down
                 to 2018. (The last major history of IBM was published
                 in the early 1990s.) Third, its emphasis on the role of
                 corporate and sales culture is unique among books
                 concerning IBM. Fourth, this book provides the greatest
                 amount of detail available today about IBM's role in
                 Western and Eastern Europe. The book is also unique
                 because the author brings to the project several
                 perspectives: that of an employee close to much of the
                 critical events of one-third of the company's history,
                 that of a trained historian, and that of an experienced
                 student of the history of computing in business. Thus,
                 he is able to integrate the entire history of the
                 company from its origins to the present, demonstrating,
                 for example, legacies of a prior era still evident in
                 today's company, an ability to connect IBM's behaviors
                 in each decade to those of other large multinational
                 corporations, and to the computing activities of its
                 many thousands of customers",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / ix \\
                 I From Birth to Identity: IBM in Its Early Years,
                 1880s--1945 / 1 \\
                 1 Origins, 1880s--1914 / 3 \\
                 2 Thomas J. Watson Sr. and the Creation of IBM,
                 1914--1924 / 27 \\
                 3 The Emergence of IBM and the Culture of THINK / 61
                 \\
                 4 IBM and the Great Depression / 91 \\
                 5 IBM in World War II, 1939--1945 / 121 \\
                 II IBM the Computer Behemoth, 1945--1985 / 147 \\
                 6 IBM Gets into the Computer Business, 1945--1964 / 149
                 \\
                 7 How Customers, IBM, and a New Industry Evolved,
                 1945--1964 / 177 \\
                 8 System 360: One of the Greatest Products in History?
                 / 203 \\
                 9 ``The IBM Way'': How It Worked, 1964--1993 / 233 \\
                 10 ``The IBM Way'': What the World Saw, 1964--1993 /
                 257 \\
                 11 IBM on the Global Stage / 283 \\
                 12 Two Decades of Antitrust Suits, 1960s--1980s / 325
                 \\
                 13 Communist Computers / 353 \\
                 14 ``A Tool for Modern Times'': IBM and the Personal
                 Computer / 379 \\
                 III A Time of Crisis, 1985--1994 / 419 \\
                 15 Storms, Crisis, and Near Death, 1985--1993 / 421 \\
                 16 IBM's Initial Response, 1985--1993 / 439 \\
                 17 How IBM Was Rescued, 1993--1994 / 471 \\
                 IV IBM in the New Century / 501 \\
                 18 A New IBM, 1995--2012 / 503 \\
                 19 Hard Times, Again, and Another Transformation / 547
                 \\
                 20 THINK: IBM Today and Its Legacy / 579 \\
                 Author's Note: In the Spirit of Transparency / 619 \\
                 Notes / 623 \\
                 Bibliographic Essay / 677 \\
                 Index / 687",
}


bibtype: book
filename: master.bib
label: Cotton:1963:CAG
author: F. Albert (Frank Albert) Cotton
title: Chemical Applications of Group Theory
publisher: pub-INTERSCIENCE
address: pub-INTERSCIENCE:adr
pages: ix + 295
year: 1963
LCCN: QD461 .C65
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: F. Albert (Frank Albert) Cotton
rawtitle: Chemical Applications of Group Theory
entry:
@Book{Cotton:1963:CAG,
  author =       "F. Albert (Frank Albert) Cotton",
  title =        "Chemical Applications of Group Theory",
  publisher =    pub-INTERSCIENCE,
  address =      pub-INTERSCIENCE:adr,
  pages =        "ix + 295",
  year =         "1963",
  LCCN =         "QD461 .C65",
  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: Cotton:1966:AIC
author: F. Albert (Frank Albert) Cotton and Geoffrey Wilkinson
title: Advanced Inorganic Chemistry
publisher: pub-INTERSCIENCE
address: pub-INTERSCIENCE:adr
pages: xii + 1136
year: 1966
LCCN: QD151 .C64 1966
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: F. Albert (Frank Albert) Cotton and Geoffrey Wilkinson
rawtitle: Advanced Inorganic Chemistry
entry:
@Book{Cotton:1966:AIC,
  author =       "F. Albert (Frank Albert) Cotton and Geoffrey
                 Wilkinson",
  title =        "Advanced Inorganic Chemistry",
  publisher =    pub-INTERSCIENCE,
  address =      pub-INTERSCIENCE:adr,
  pages =        "xii + 1136",
  year =         "1966",
  LCCN =         "QD151 .C64 1966",
  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: Couffignal:1933:MCL
author: L. Couffignal
publisher: Gauthier-Villars
address: Paris, France
pages: xii + 1136
year: 1933
bibdate: Wed Oct 13 11:19:11 2010
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2010.10.13 11:19:11 ???
note: Extracts reprinted in cite [ 3.2]Randell:1982:ODC. Translated by Mr. R. Basu.
language: French
acknowledgement: ack-nhfb
rawauthor: L. Couffignal
rawnote: Extracts reprinted in \cite[\S 3.2]{Randell:1982:ODC}. Translated by Mr. R. Basu.
title:
Les machines a calculer, leurs principes, leur evolution. (French) [Calculating machines, their principles, their evolution]

rawtitle:
Les machines {\`a} calculer, leurs principes, leur {\'e}volution. ({French}) [{Calculating} machines, their principles, their evolution]

entry:
@Book{Couffignal:1933:MCL,
  author =       "L. Couffignal",
  title =        "Les machines {\`a} calculer, leurs principes, leur
                 {\'e}volution. ({French}) [{Calculating} machines,
                 their principles, their evolution]",
  publisher =    "Gauthier-Villars",
  address =      "Paris, France",
  year =         "1933",
  bibdate =      "Wed Oct 13 11:19:11 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Extracts reprinted in \cite[\S 3.2]{Randell:1982:ODC}.
                 Translated by Mr. R. Basu.",
  acknowledgement = ack-nhfb,
  language =     "French",
}


bibtype: phdthesis
filename: master.bib
label: Couffignal:1938:AMA
author: L. Couffignal
publisher: Gauthier-Villars
school: Faculte des Sciences de Paris
address: Paris, France
pages: xii + 1136
year: 1938
bibdate: Wed Oct 13 11:17:22 2010
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2010.10.13 11:17:22 ???
note: Extracts reprinted in cite [ 2.7]Randell:1982:ODC. Translated by Mr. R. Basu.
language: French
acknowledgement: ack-nhfb
rawauthor: L. Couffignal
rawnote: Extracts reprinted in \cite[\S 2.7]{Randell:1982:ODC}. Translated by Mr. R. Basu.
title:
Sur l'analyse mecanique. Application aux machines a calculer et aux calculs de la mecanique celeste. (French) [On mechanical analysis. Application to calculating machines and to calculation in celestial mechanics]

rawtitle:
Sur l'analyse m{\'e}canique. Application aux machines {\`a} calculer et aux calculs de la m{\'e}canique c{\'e}leste. ({French}) [{On} mechanical analysis. Application to calculating machines and to calculation in celestial mechanics]

entry:
@PhdThesis{Couffignal:1938:AMA,
  author =       "L. Couffignal",
  title =        "Sur l'analyse m{\'e}canique. Application aux machines
                 {\`a} calculer et aux calculs de la m{\'e}canique
                 c{\'e}leste. ({French}) [{On} mechanical analysis.
                 Application to calculating machines and to calculation
                 in celestial mechanics]",
  publisher =    "Gauthier-Villars",
  school =       "Facult{\'e} des Sciences de Paris",
  address =      "Paris, France",
  year =         "1938",
  bibdate =      "Wed Oct 13 11:17:22 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Extracts reprinted in \cite[\S 2.7]{Randell:1982:ODC}.
                 Translated by Mr. R. Basu.",
  acknowledgement = ack-nhfb,
  language =     "French",
}


bibtype: book
filename: master.bib
label: Counihan:1991:F
author: Martin Counihan
title: Fortran 90
publisher: pub-PITMAN
address: pub-PITMAN:adr
pages: 309
year: 1991
ISBN: 0-273-03073-6 OR 0273030736
ISBN13: 978-0-273-03073-7 OR 9780273030737
LCCN: QA76.73.F25 C68 1991
bibdate: Sun May 02 07:48:16 1999
bibtimestamp: 1999.05.02 07:48:16 ???
note: See cite ANSI:ftn92.
acknowledgement: ack-nhfb
rawauthor: Martin Counihan
rawnote: See \cite{ANSI:ftn92}.
rawtitle: {Fortran 90}
bibsource:
https://www.math.utah.edu/pub/tex/bib/fortran3.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

keywords:
Fortran 90 (computer program language); Programming languages; Fortran 90 (Computer program language)

TOC:
1: Introduction 1.1: Fortran 90 / 1 1.2: Programs and Programming / 2 2: What is Fortran 90? 2.1: Program Structure / 5 2.2: Intrinsic Procedures / 6 2.3: Statement Types / 7 2.4: What Fortran 90 Isn't / 7 2.5: New Features in Fortran 90 / 8 Notes / 10 3: Getting Started 3.1: The Character Set / 11 3.2: A Simple Program / 14 3.3: Arithmetic Operators / 18 Exercises 3A / 19 3.4: Names and Other Lexical Tokens / 20 3.5: Fortran Source Form / 21 Exercises 3B / 24 Notes / 25 4: Intrinsic Data Types 4.1: Integers / 26 4.2: Real Numbers / 29 Exercises A / 31 4.3: Simple Form of the Type Declaration Statement / 32 4.4: Kinds Real Numbers / 32 4.5: Complex Numbers / 33 4.6: Logical Data; Logical and Relational Operators / 35 4.7: Characters and Strings / 38 Exercises 4B / 40 Notes / 42 5: Some Intrinsic Procedures 5.1: An Intrinsic Subroutine / 43 5.2: Mathematical Functions / 44 5.3: Numeric Functions / 46 Exercises 5A / 50 Notes / 52 6: More About Characters 6.1: Declaring Character Data / 53 6.2: Character Constants / 54 6.3: Character Operators / 55 6.4: Intrinsic Character Functions / 56 6.5: Substrings / 59 Exercises / 61 Notes / 62 7: Arrays 7.1: Declaring Arrays / 63 7.2: Using Arrays / 65 7.3: Array Constructors / 67 7.4: Array Sections / 68 7.5: Array Sections, Character Strings and Substrings / 70 7.6: Where / 72 7.7: Arrays and Intrinsic Functions / 73 Exercises 7B / 74 8: Execution Control 8.1: The ``CASE'' Construct / 76 8.2: The ``IF'' Construct / 80 Exercises / 81 8.3: The ``DO'' Construct / 82 8.4: Stop / 88 Exercises 8B / 88 Notes / 89 9: Functions and Subroutines (1) 9.1: Functions / 90 Exercises 9A / 93 9.2: Subroutines / 93 9.3: Procedures and Arrays / 96 Exercises 9B / 99 Notes / 100 10: More Intrinsic Procedures; Statement Labels 10.1: Intrinsic Subroutines / 102 10.2: Functions for Use with Arrays / 104 Exercises 10A / 110 10.3: Numeric Inquiry Functions and Floating-Point Manipulation Functions / 110 10.4: Statement Labels and ``GO TO'' / 111 Notes / 114 11: Modules 11.1: Data Modules / 116 Module Procedures / 120 11.3: More About ``USE'' Statements / 124 Exercises / 126 Notes / 127 12: Functions and Subroutines (2) 12.1: Recursive Procedures / 128 Exercises 12A / 130 12.2: Interface Blocks / 131 12.3: Argument Keywords / 132 12.4: More About Arguments: ``PRESENT'' / 133 12.5: Functions / 134 12.6: Operators / 135 12.7: Generic Names / 138 12.8: Parallel Processing / 141 Exercises 12B / 142 Notes / 143 13: The Type Declaration Statement 13.1: General Form of the TDS / 144 13.2: Character Length Selectors / 147 13.3: Attribute Specifications / 149 13.4: Array Specifications / 152 13.5: The Entity Declaration List / 157 13.6: Summary / 158 Exercises 13A / 159 Notes / 161 14: Derived Types 14.1: Derived-Type Definition / 164 14.2: Structure Constructors / 166 14.3: Structure Components / 168 Exercises 14A / 169 14.4: Structures of Structures / 170 Exercises 14B / 171 14.5: Functions and Operators with Derived Types / 172 14.6: Defined Assignment / 174 Exercises 14C / 178 Notes / 180 15: Arrays and Pointers 15.1: Array Element Order, Array Constructors; RESHAPE / 181 15.2: Vector Subscripts / 184 15.3: Allocatable Arrays / 187 Exercises 15A / 190 15.4: LBOUND, SHAPE and SIZE / 190 Exercises 15B / 191 15.5: Simple Pointers / 192 15.6: Pointers as Structures and as Structure Components / 197 15.7: Pointers and Procedures / 204 15.8: Array Pointers / 205 Exercises 15C / 207 Notes / 208 16: Input and Output; Data Format Specifications 16.1: Data Transfer Statements / 209 16.2: The Item List / 210 16.3: List-Directed Input / 212 16.4: List-Directed Output / 216 16.5: Explicit Formats / 217 Exercises 16A / 219 16.6: Data Edit Descriptors and Character Edit Descriptors / 219 16.7: Control Edit Descriptors / 223 Exercises 16B / 225 16.8: Namelists / 226 16.9: Unformatted / 228 16.10: The TRANSFER Function / 229 16.11: Summary / 231 Notes / 232 17: File Handling 17.1: Units, Files and Records / 233 17.2: Opening and Closing Files / 235 17.3: BACKSPACE, ENDFTLE and REWIND / 240 17.4: Control Specifications for / 240 17.5: The ``INQUIRE'' Statement / 242 17.6: Internal Files / 246 Exercises 17A / 248 Notes / 249 18: Bits 18.1: Inside Integers / 250 18.2: Bit Logic / 251 18.3: A Warning / 252 Exercises 18A / 253 19: Programming Conventions and Program Architecture: Putting It All Together 19.1: Coding Conventions / 254 19.2: Towards Fortran 90 / 255 Fortran 90 Recommended Statements / 256 Intrinsic Functions / 257 19.3: Program Unit Structure / 258 19.4: Program Structure / 261 19.5: Final Remarks / 262 Answers to Selected Exercises / 263 Appendices A: Fortran 90 Statements B: Intrinsic Procedures / 286 C: Intrinsic Procedures: Names / 292 D: Argument Keywords in Intrinsic Procedures / 294 E: Edit Descriptors / 297 F: The ASCII Character Set / 301 Index / 304

rawTOC:
1: Introduction \\ 1.1: Fortran 90 / 1 \\ 1.2: Programs and Programming / 2 \\ 2: What is Fortran 90? \\ 2.1: Program Structure / 5 \\ 2.2: Intrinsic Procedures / 6 \\ 2.3: Statement Types / 7 \\ 2.4: What Fortran 90 Isn't / 7 \\ 2.5: New Features in Fortran 90 / 8 \\ Notes / 10 \\ 3: Getting Started \\ 3.1: The Character Set / 11 \\ 3.2: A Simple Program / 14 \\ 3.3: Arithmetic Operators / 18 \\ Exercises 3A / 19 \\ 3.4: Names and Other Lexical Tokens / 20 \\ 3.5: Fortran Source Form / 21 \\ Exercises 3B / 24 \\ Notes / 25 \\ 4: Intrinsic Data Types \\ 4.1: Integers / 26 \\ 4.2: Real Numbers / 29 \\ Exercises A / 31 \\ 4.3: Simple Form of the Type Declaration Statement / 32 \\ 4.4: Kinds Real Numbers / 32 \\ 4.5: Complex Numbers / 33 \\ 4.6: Logical Data; Logical and Relational Operators / 35 \\ 4.7: Characters and Strings / 38 \\ Exercises 4B / 40 \\ Notes / 42 \\ 5: Some Intrinsic Procedures \\ 5.1: An Intrinsic Subroutine / 43 \\ 5.2: Mathematical Functions / 44 \\ 5.3: Numeric Functions / 46 \\ Exercises 5A / 50 \\ Notes / 52 \\ 6: More About Characters \\ 6.1: Declaring Character Data / 53 \\ 6.2: Character Constants / 54 \\ 6.3: Character Operators / 55 \\ 6.4: Intrinsic Character Functions / 56 \\ 6.5: Substrings / 59 \\ Exercises / 61 \\ Notes / 62 \\ 7: Arrays \\ 7.1: Declaring Arrays / 63 \\ 7.2: Using Arrays / 65 \\ 7.3: Array Constructors / 67 \\ 7.4: Array Sections / 68 \\ 7.5: Array Sections, Character Strings and Substrings / 70 \\ 7.6: Where / 72 \\ 7.7: Arrays and Intrinsic Functions / 73 \\ Exercises 7B / 74 \\ 8: Execution Control \\ 8.1: The ``CASE'' Construct / 76 \\ 8.2: The ``IF'' Construct / 80 \\ Exercises / 81 \\ 8.3: The ``DO'' Construct / 82 \\ 8.4: Stop / 88 \\ Exercises 8B / 88 \\ Notes / 89 \\ 9: Functions and Subroutines (1) \\ 9.1: Functions / 90 \\ Exercises 9A / 93 \\ 9.2: Subroutines / 93 \\ 9.3: Procedures and Arrays / 96 \\ Exercises 9B / 99 \\ Notes / 100 \\ 10: More Intrinsic Procedures; Statement Labels \\ 10.1: Intrinsic Subroutines / 102 \\ 10.2: Functions for Use with Arrays / 104 \\ Exercises 10A / 110 \\ 10.3: Numeric Inquiry Functions and Floating-Point Manipulation Functions / 110 \\ 10.4: Statement Labels and ``GO TO'' / 111 \\ Notes / 114 \\ 11: Modules \\ 11.1: Data Modules / 116 \\ Module Procedures / 120 \\ 11.3: More About ``USE'' Statements / 124 \\ Exercises / 126 \\ Notes / 127 \\ 12: Functions and Subroutines (2) \\ 12.1: Recursive Procedures / 128 \\ Exercises 12A / 130 \\ 12.2: Interface Blocks / 131 \\ 12.3: Argument Keywords / 132 \\ 12.4: More About Arguments: ``PRESENT'' / 133 \\ 12.5: Functions / 134 \\ 12.6: Operators / 135 \\ 12.7: Generic Names / 138 \\ 12.8: Parallel Processing / 141 \\ Exercises 12B / 142 \\ Notes / 143 \\ 13: The Type Declaration Statement \\ 13.1: General Form of the TDS / 144 \\ 13.2: Character Length Selectors / 147 \\ 13.3: Attribute Specifications / 149 \\ 13.4: Array Specifications / 152 \\ 13.5: The Entity Declaration List / 157 \\ 13.6: Summary / 158 \\ Exercises 13A / 159 \\ Notes / 161 \\ 14: Derived Types \\ 14.1: Derived-Type Definition / 164 \\ 14.2: Structure Constructors / 166 \\ 14.3: Structure Components / 168 \\ Exercises 14A / 169 \\ 14.4: Structures of Structures / 170 \\ Exercises 14B / 171 \\ 14.5: Functions and Operators with Derived Types / 172 \\ 14.6: Defined Assignment / 174 \\ Exercises 14C / 178 \\ Notes / 180 \\ 15: Arrays and Pointers \\ 15.1: Array Element Order, Array Constructors; RESHAPE / 181 \\ 15.2: Vector Subscripts / 184 \\ 15.3: Allocatable Arrays / 187 \\ Exercises 15A / 190 \\ 15.4: LBOUND, SHAPE and SIZE / 190 \\ Exercises 15B / 191 \\ 15.5: Simple Pointers / 192 \\ 15.6: Pointers as Structures and as Structure Components / 197 \\ 15.7: Pointers and Procedures / 204 \\ 15.8: Array Pointers / 205 \\ Exercises 15C / 207 \\ Notes / 208 \\ 16: Input and Output; Data Format Specifications \\ 16.1: Data Transfer Statements / 209 \\ 16.2: The Item List / 210 \\ 16.3: List-Directed Input / 212 \\ 16.4: List-Directed Output / 216 \\ 16.5: Explicit Formats / 217 \\ Exercises 16A / 219 \\ 16.6: Data Edit Descriptors and Character Edit Descriptors / 219 \\ 16.7: Control Edit Descriptors / 223 \\ Exercises 16B / 225 \\ 16.8: Namelists / 226 \\ 16.9: Unformatted / 228 \\ 16.10: The TRANSFER Function / 229 \\ 16.11: Summary / 231 \\ Notes / 232 \\ 17: File Handling \\ 17.1: Units, Files and Records / 233 \\ 17.2: Opening and Closing Files / 235 \\ 17.3: BACKSPACE, ENDFTLE and REWIND / 240 \\ 17.4: Control Specifications for / 240 \\ 17.5: The ``INQUIRE'' Statement / 242 \\ 17.6: Internal Files / 246 \\ Exercises 17A / 248 \\ Notes / 249 \\ 18: Bits \\ 18.1: Inside Integers / 250 \\ 18.2: Bit Logic / 251 \\ 18.3: A Warning / 252 \\ Exercises 18A / 253 \\ 19: Programming Conventions and Program Architecture: Putting It All Together \\ 19.1: Coding Conventions / 254 \\ 19.2: Towards Fortran 90 / 255 \\ Fortran 90 Recommended Statements / 256 \\ Intrinsic Functions / 257 \\ 19.3: Program Unit Structure / 258 \\ 19.4: Program Structure / 261 \\ 19.5: Final Remarks / 262 \\ Answers to Selected Exercises / 263 \\ Appendices \\ A: Fortran 90 Statements \\ B: Intrinsic Procedures / 286 \\ C: Intrinsic Procedures: Names / 292 \\ D: Argument Keywords in Intrinsic Procedures / 294 \\ E: Edit Descriptors / 297 \\ F: The ASCII Character Set / 301 \\ Index / 304

entry:
@Book{Counihan:1991:F,
  author =       "Martin Counihan",
  title =        "{Fortran 90}",
  publisher =    pub-PITMAN,
  address =      pub-PITMAN:adr,
  pages =        "309",
  year =         "1991",
  ISBN =         "0-273-03073-6",
  ISBN-13 =      "978-0-273-03073-7",
  LCCN =         "QA76.73.F25 C68 1991",
  bibdate =      "Sun May 02 07:48:16 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran3.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See \cite{ANSI:ftn92}.",
  acknowledgement = ack-nhfb,
  keywords =     "Fortran 90 (computer program language); Programming
                 languages; {Fortran 90} (Computer program language)",
  libnote =      "Not yet in my library.",
  tableofcontents = "1: Introduction \\
                 1.1: Fortran 90 / 1 \\
                 1.2: Programs and Programming / 2 \\
                 2: What is Fortran 90? \\
                 2.1: Program Structure / 5 \\
                 2.2: Intrinsic Procedures / 6 \\
                 2.3: Statement Types / 7 \\
                 2.4: What Fortran 90 Isn't / 7 \\
                 2.5: New Features in Fortran 90 / 8 \\
                 Notes / 10 \\
                 3: Getting Started \\
                 3.1: The Character Set / 11 \\
                 3.2: A Simple Program / 14 \\
                 3.3: Arithmetic Operators / 18 \\
                 Exercises 3A / 19 \\
                 3.4: Names and Other Lexical Tokens / 20 \\
                 3.5: Fortran Source Form / 21 \\
                 Exercises 3B / 24 \\
                 Notes / 25 \\
                 4: Intrinsic Data Types \\
                 4.1: Integers / 26 \\
                 4.2: Real Numbers / 29 \\
                 Exercises A / 31 \\
                 4.3: Simple Form of the Type Declaration Statement / 32
                 \\
                 4.4: Kinds Real Numbers / 32 \\
                 4.5: Complex Numbers / 33 \\
                 4.6: Logical Data; Logical and Relational Operators /
                 35 \\
                 4.7: Characters and Strings / 38 \\
                 Exercises 4B / 40 \\
                 Notes / 42 \\
                 5: Some Intrinsic Procedures \\
                 5.1: An Intrinsic Subroutine / 43 \\
                 5.2: Mathematical Functions / 44 \\
                 5.3: Numeric Functions / 46 \\
                 Exercises 5A / 50 \\
                 Notes / 52 \\
                 6: More About Characters \\
                 6.1: Declaring Character Data / 53 \\
                 6.2: Character Constants / 54 \\
                 6.3: Character Operators / 55 \\
                 6.4: Intrinsic Character Functions / 56 \\
                 6.5: Substrings / 59 \\
                 Exercises / 61 \\
                 Notes / 62 \\
                 7: Arrays \\
                 7.1: Declaring Arrays / 63 \\
                 7.2: Using Arrays / 65 \\
                 7.3: Array Constructors / 67 \\
                 7.4: Array Sections / 68 \\
                 7.5: Array Sections, Character Strings and Substrings /
                 70 \\
                 7.6: Where / 72 \\
                 7.7: Arrays and Intrinsic Functions / 73 \\
                 Exercises 7B / 74 \\
                 8: Execution Control \\
                 8.1: The ``CASE'' Construct / 76 \\
                 8.2: The ``IF'' Construct / 80 \\
                 Exercises / 81 \\
                 8.3: The ``DO'' Construct / 82 \\
                 8.4: Stop / 88 \\
                 Exercises 8B / 88 \\
                 Notes / 89 \\
                 9: Functions and Subroutines (1) \\
                 9.1: Functions / 90 \\
                 Exercises 9A / 93 \\
                 9.2: Subroutines / 93 \\
                 9.3: Procedures and Arrays / 96 \\
                 Exercises 9B / 99 \\
                 Notes / 100 \\
                 10: More Intrinsic Procedures; Statement Labels \\
                 10.1: Intrinsic Subroutines / 102 \\
                 10.2: Functions for Use with Arrays / 104 \\
                 Exercises 10A / 110 \\
                 10.3: Numeric Inquiry Functions and Floating-Point
                 Manipulation Functions / 110 \\
                 10.4: Statement Labels and ``GO TO'' / 111 \\
                 Notes / 114 \\
                 11: Modules \\
                 11.1: Data Modules / 116 \\
                 Module Procedures / 120 \\
                 11.3: More About ``USE'' Statements / 124 \\
                 Exercises / 126 \\
                 Notes / 127 \\
                 12: Functions and Subroutines (2) \\
                 12.1: Recursive Procedures / 128 \\
                 Exercises 12A / 130 \\
                 12.2: Interface Blocks / 131 \\
                 12.3: Argument Keywords / 132 \\
                 12.4: More About Arguments: ``PRESENT'' / 133 \\
                 12.5: Functions / 134 \\
                 12.6: Operators / 135 \\
                 12.7: Generic Names / 138 \\
                 12.8: Parallel Processing / 141 \\
                 Exercises 12B / 142 \\
                 Notes / 143 \\
                 13: The Type Declaration Statement \\
                 13.1: General Form of the TDS / 144 \\
                 13.2: Character Length Selectors / 147 \\
                 13.3: Attribute Specifications / 149 \\
                 13.4: Array Specifications / 152 \\
                 13.5: The Entity Declaration List / 157 \\
                 13.6: Summary / 158 \\
                 Exercises 13A / 159 \\
                 Notes / 161 \\
                 14: Derived Types \\
                 14.1: Derived-Type Definition / 164 \\
                 14.2: Structure Constructors / 166 \\
                 14.3: Structure Components / 168 \\
                 Exercises 14A / 169 \\
                 14.4: Structures of Structures / 170 \\
                 Exercises 14B / 171 \\
                 14.5: Functions and Operators with Derived Types / 172
                 \\
                 14.6: Defined Assignment / 174 \\
                 Exercises 14C / 178 \\
                 Notes / 180 \\
                 15: Arrays and Pointers \\
                 15.1: Array Element Order, Array Constructors; RESHAPE
                 / 181 \\
                 15.2: Vector Subscripts / 184 \\
                 15.3: Allocatable Arrays / 187 \\
                 Exercises 15A / 190 \\
                 15.4: LBOUND, SHAPE and SIZE / 190 \\
                 Exercises 15B / 191 \\
                 15.5: Simple Pointers / 192 \\
                 15.6: Pointers as Structures and as Structure
                 Components / 197 \\
                 15.7: Pointers and Procedures / 204 \\
                 15.8: Array Pointers / 205 \\
                 Exercises 15C / 207 \\
                 Notes / 208 \\
                 16: Input and Output; Data Format Specifications \\
                 16.1: Data Transfer Statements / 209 \\
                 16.2: The Item List / 210 \\
                 16.3: List-Directed Input / 212 \\
                 16.4: List-Directed Output / 216 \\
                 16.5: Explicit Formats / 217 \\
                 Exercises 16A / 219 \\
                 16.6: Data Edit Descriptors and Character Edit
                 Descriptors / 219 \\
                 16.7: Control Edit Descriptors / 223 \\
                 Exercises 16B / 225 \\
                 16.8: Namelists / 226 \\
                 16.9: Unformatted / 228 \\
                 16.10: The TRANSFER Function / 229 \\
                 16.11: Summary / 231 \\
                 Notes / 232 \\
                 17: File Handling \\
                 17.1: Units, Files and Records / 233 \\
                 17.2: Opening and Closing Files / 235 \\
                 17.3: BACKSPACE, ENDFTLE and REWIND / 240 \\
                 17.4: Control Specifications for / 240 \\
                 17.5: The ``INQUIRE'' Statement / 242 \\
                 17.6: Internal Files / 246 \\
                 Exercises 17A / 248 \\
                 Notes / 249 \\
                 18: Bits \\
                 18.1: Inside Integers / 250 \\
                 18.2: Bit Logic / 251 \\
                 18.3: A Warning / 252 \\
                 Exercises 18A / 253 \\
                 19: Programming Conventions and Program Architecture:
                 Putting It All Together \\
                 19.1: Coding Conventions / 254 \\
                 19.2: Towards Fortran 90 / 255 \\
                 Fortran 90 Recommended Statements / 256 \\
                 Intrinsic Functions / 257 \\
                 19.3: Program Unit Structure / 258 \\
                 19.4: Program Structure / 261 \\
                 19.5: Final Remarks / 262 \\
                 Answers to Selected Exercises / 263 \\
                 Appendices \\
                 A: Fortran 90 Statements \\
                 B: Intrinsic Procedures / 286 \\
                 C: Intrinsic Procedures: Names / 292 \\
                 D: Argument Keywords in Intrinsic Procedures / 294 \\
                 E: Edit Descriptors / 297 \\
                 F: The ASCII Character Set / 301 \\
                 Index / 304",
}


bibtype: book
filename: master.bib
label: Cowart:2007:SEU
author: Robert Cowart and Brian Knittel
title: Special edition: Using Microsoft Windows Vista
publisher: pub-QUE
address: pub-QUE:adr
pages: xlv + 1458
year: 2007
ISBN: 0-7897-3472-9 (paperback) OR 0789734729 (paperback)
ISBN13: 978-0-7897-3472-3 (paperback) OR 9780789734723 (paperback)
LCCN: QA76.76.O63 C683376 2007
bibdate: Mon Oct 29 18:40:27 MDT 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2007.10.29 18:40:27 MDT
URL: http://www.loc.gov/catdir/toc/ecip074/2006037794.html
subject: Operating systems (Computers); Microsoft Windows (Computer file)
acknowledgement: ack-nhfb
rawauthor: Robert Cowart and Brian Knittel
rawtitle: Special edition: Using {Microsoft Windows Vista}
entry:
@Book{Cowart:2007:SEU,
  author =       "Robert Cowart and Brian Knittel",
  title =        "Special edition: Using {Microsoft Windows Vista}",
  publisher =    pub-QUE,
  address =      pub-QUE:adr,
  pages =        "xlv + 1458",
  year =         "2007",
  ISBN =         "0-7897-3472-9 (paperback)",
  ISBN-13 =      "978-0-7897-3472-3 (paperback)",
  LCCN =         "QA76.76.O63 C683376 2007",
  bibdate =      "Mon Oct 29 18:40:27 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip074/2006037794.html",
  acknowledgement = ack-nhfb,
  subject =      "Operating systems (Computers); Microsoft Windows
                 (Computer file)",
}


bibtype: book
filename: master.bib
label: Cowlishaw:1990:RLP
author: Michael F. Cowlishaw
title: The REXX language: a practical approach to programming
publisher: pub-PH
address: pub-PH:adr
edition: Second
pages: xii + 203
year: 1990
ISBN: 0-13-780651-5 OR 0137806515
ISBN13: 978-0-13-780651-5 OR 9780137806515
LCCN: QA76.73.R24 C69 1990
bibdate: Tue Jun 28 16:07:24 MDT 2005
bibtimestamp: 2005.06.28 16:07:24 MDT
URL: http://vig.prenhall.com/catalog/academic/product/0,1144,0137806515,00.html
subject: REXX (Computer program language)
acknowledgement: ack-nhfb
rawauthor: Michael F. Cowlishaw
rawtitle: The {REXX} language: a practical approach to programming
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/rexx.bib; z3950.loc.gov:7090/Voyager

TOC:
Background What Kind of a Language is REXX? Fundamental Language Concepts Design Principles History Rexx Language Definition Characters and Encodings Structure and General Syntax Expressions and Operators Clauses and Instructions Assignments and Variables Commands to External Environments Keyword Instructions Function Calls Built-in Functions Parsing for ARG, PARSE, and PULL Numbers and Arithmetic Input and Output Streams Conditions and Condition Traps Interactive Tracing Reserved Keywords and Language Extendibility Special Variables Error Numbers and Messages Index

rawTOC:
Background \\ What Kind of a Language is REXX? \\ Fundamental Language Concepts \\ Design Principles \\ History \\ Rexx Language Definition \\ Characters and Encodings \\ Structure and General Syntax \\ Expressions and Operators \\ Clauses and Instructions \\ Assignments and Variables \\ Commands to External Environments \\ Keyword Instructions \\ Function Calls \\ Built-in Functions \\ Parsing for ARG, PARSE, and PULL \\ Numbers and Arithmetic \\ Input and Output Streams \\ Conditions and Condition Traps \\ Interactive Tracing \\ Reserved Keywords and Language Extendibility \\ Special Variables \\ Error Numbers and Messages \\ Index

entry:
@Book{Cowlishaw:1990:RLP,
  author =       "Michael F. Cowlishaw",
  title =        "The {REXX} language: a practical approach to
                 programming",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Second",
  pages =        "xii + 203",
  year =         "1990",
  ISBN =         "0-13-780651-5",
  ISBN-13 =      "978-0-13-780651-5",
  LCCN =         "QA76.73.R24 C69 1990",
  bibdate =      "Tue Jun 28 16:07:24 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/rexx.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://vig.prenhall.com/catalog/academic/product/0,1144,0137806515,00.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "REXX (Computer program language)",
  tableofcontents = "Background \\
                 What Kind of a Language is REXX? \\
                 Fundamental Language Concepts \\
                 Design Principles \\
                 History \\
                 Rexx Language Definition \\
                 Characters and Encodings \\
                 Structure and General Syntax \\
                 Expressions and Operators \\
                 Clauses and Instructions \\
                 Assignments and Variables \\
                 Commands to External Environments \\
                 Keyword Instructions \\
                 Function Calls \\
                 Built-in Functions \\
                 Parsing for ARG, PARSE, and PULL \\
                 Numbers and Arithmetic \\
                 Input and Output Streams \\
                 Conditions and Condition Traps \\
                 Interactive Tracing \\
                 Reserved Keywords and Language Extendibility \\
                 Special Variables \\
                 Error Numbers and Messages \\
                 Index",
}


bibtype: book
filename: master.bib
label: Cox:2015:SBS
author: Trevor J. Cox
title: The sound book: the science of the sonic wonders of the world
publisher: pub-NORTON
address: pub-NORTON:adr
pages: 331
year: 2015
LCCN: QC225.3 .C69 2015
bibdate: Wed Apr 1 17:20:57 MDT 2015
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2015.04.01 17:20:57 MDT
subject: Sounds; Popular works; Noise; Noise; Sounds.
acknowledgement: ack-nhfb
rawauthor: Trevor J. Cox
rawtitle: The sound book: the science of the sonic wonders of the world
ISBN:
0-393-23979-9 (hardcover), 0-393-35058-4 (paperback) OR 0393239799 (hardcover), 0393350584 (paperback)

ISBN13:
978-0-393-23979-9 (hardcover), 978-0-393-35058-6 (paperback) OR 9780393239799 (hardcover), 9780393350586 (paperback)

abstract:
With forays into archaeology, neuroscience, biology, and design, Cox explains how sound is made and altered by the environment, how our body reacts to peculiar noises, and how these mysterious wonders illuminate sound's surprising dynamics in everyday settings, from your bedroom to the opera house. ldots A professor of acoustic engineering provides a tour of the world's most amazing sound phenomena, including creaking glaciers, whispering galleries, stalactite organs, musical roads, humming dunes, seals that sound like alien angels, and a Mayan pyramid that chirps like a bird.

remark:
Published in Great Britain by The Bodley Head under the title `Sonic wonderland: a scientific odyssey of sound'.

TOC:
The most reverberant place in the world Ringing rocks Barking fish Echoes of the past Going round the bend Singing sands The quietest places in the world Placing sound Future wonders

rawabstract:
With forays into archaeology, neuroscience, biology, and design, Cox explains how sound is made and altered by the environment, how our body reacts to peculiar noises, and how these mysterious wonders illuminate sound's surprising dynamics in everyday settings, from your bedroom to the opera house. \ldots{} A professor of acoustic engineering provides a tour of the world's most amazing sound phenomena, including creaking glaciers, whispering galleries, stalactite organs, musical roads, humming dunes, seals that sound like alien angels, and a Mayan pyramid that chirps like a bird.

rawTOC:
The most reverberant place in the world \\ Ringing rocks \\ Barking fish \\ Echoes of the past \\ Going round the bend \\ Singing sands \\ The quietest places in the world \\ Placing sound \\ Future wonders

entry:
@Book{Cox:2015:SBS,
  author =       "Trevor J. Cox",
  title =        "The sound book: the science of the sonic wonders of
                 the world",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "331",
  year =         "2015",
  ISBN =         "0-393-23979-9 (hardcover), 0-393-35058-4 (paperback)",
  ISBN-13 =      "978-0-393-23979-9 (hardcover), 978-0-393-35058-6
                 (paperback)",
  LCCN =         "QC225.3 .C69 2015",
  bibdate =      "Wed Apr 1 17:20:57 MDT 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "With forays into archaeology, neuroscience, biology,
                 and design, Cox explains how sound is made and altered
                 by the environment, how our body reacts to peculiar
                 noises, and how these mysterious wonders illuminate
                 sound's surprising dynamics in everyday settings, from
                 your bedroom to the opera house. \ldots{} A professor
                 of acoustic engineering provides a tour of the world's
                 most amazing sound phenomena, including creaking
                 glaciers, whispering galleries, stalactite organs,
                 musical roads, humming dunes, seals that sound like
                 alien angels, and a Mayan pyramid that chirps like a
                 bird.",
  acknowledgement = ack-nhfb,
  remark =       "Published in Great Britain by The Bodley Head under
                 the title `Sonic wonderland: a scientific odyssey of
                 sound'.",
  subject =      "Sounds; Popular works; Noise; Noise; Sounds.",
  tableofcontents = "The most reverberant place in the world \\
                 Ringing rocks \\
                 Barking fish \\
                 Echoes of the past \\
                 Going round the bend \\
                 Singing sands \\
                 The quietest places in the world \\
                 Placing sound \\
                 Future wonders",
}


bibtype: book
filename: master.bib
label: Craig:1971:DT
author: James Craig
title: Designing with Type
publisher: pub-WATSON-GUPTILL
address: pub-WATSON-GUPTILL:adr
pages: 175
year: 1971
ISBN: 0-8230-1320-0 OR 0823013200
ISBN13: 978-0-8230-1320-3 OR 9780823013203
LCCN: 70-159564
bibdate: Wed Jul 6 13:57:38 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.07.06 13:57:38 ???
acknowledgement: ack-nhfb
rawauthor: James Craig
rawtitle: Designing with Type
subject:
Graphic design (Typography); Caracteres d'imprimerie; Imprimerie; Technique; Graphic design (Typography)

TOC:
1: Origins of the alphabet 2: Laying the groundwork 3: Units of measurement 4: Five families of type 5: Display types 6: Materials for the designer 7: Comping type 8: How do we read? 9: Designing with text type 10: Designing with display type 11: Copyfitting 12: Arranging type on the page 13: Preparing copy for type 14: Design projects for the classroom

rawTOC:
1: Origins of the alphabet \\ 2: Laying the groundwork \\ 3: Units of measurement \\ 4: Five families of type \\ 5: Display types \\ 6: Materials for the designer \\ 7: Comping type \\ 8: How do we read? \\ 9: Designing with text type \\ 10: Designing with display type \\ 11: Copyfitting \\ 12: Arranging type on the page \\ 13: Preparing copy for type \\ 14: Design projects for the classroom

entry:
@Book{Craig:1971:DT,
  author =       "James Craig",
  title =        "Designing with Type",
  publisher =    pub-WATSON-GUPTILL,
  address =      pub-WATSON-GUPTILL:adr,
  pages =        "175",
  year =         "1971",
  ISBN =         "0-8230-1320-0",
  ISBN-13 =      "978-0-8230-1320-3",
  LCCN =         "70-159564",
  bibdate =      "Wed Jul 6 13:57:38 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  comments =     "Spiralbound. Seventh printing, 1978.",
  libnote =      "Not yet in my library.",
  subject =      "Graphic design (Typography); Caract{\`e}res
                 d'imprimerie; Imprimerie; Technique; Graphic design
                 (Typography)",
  tableofcontents = "1: Origins of the alphabet \\
                 2: Laying the groundwork \\
                 3: Units of measurement \\
                 4: Five families of type \\
                 5: Display types \\
                 6: Materials for the designer \\
                 7: Comping type \\
                 8: How do we read? \\
                 9: Designing with text type \\
                 10: Designing with display type \\
                 11: Copyfitting \\
                 12: Arranging type on the page \\
                 13: Preparing copy for type \\
                 14: Design projects for the classroom",
}


bibtype: book
filename: master.bib
label: Craig:2005:VM
author: Iain D. Craig
title: Virtual Machines
publisher: pub-SV
address: pub-SV:adr
pages: xv + 269
year: 2005
ISBN: 1-85233-969-1, 1-84628-246-2 (e-book) OR 1852339691, 1846282462 (ebook)
ISBN13: 978-1-85233-969-2, 978-1-84628-246-1 (e-book) OR 9781852339692, 9781846282461 (ebook)
LCCN: QA76.9 CRA
bibdate: Thu Jul 14 12:01:15 MDT 2005
bibtimestamp: 2005.07.14 12:01:15 MDT
subject: Virtual computer systems; Parallel processing
acknowledgement: ack-nhfb
rawauthor: Iain D. Craig
rawtitle: Virtual Machines
bibsource:
https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; library.ox.ac.uk:210/ADVANCE; z3950.loc.gov:7090/Voyager

abstract:
In this book state transitions are used as a formal technique for the specification of virtual machines throughout and --- in addition --- transitions and state transitions relating to the general operation are included for specification of the virtual machine for the event-based system. Two virtual machines are defined using a simple sequential language, which is then generalised to include object and parallelism. Other themes explored include the implementation of VMs and proposals for future work. Appendices contain high-level specifications of two compilers: one for the simple language that serves as the basic example throughout the book, the other for the event-based language specified in Chapter 6. This book is an essential reference tool for academic and industrial researchers as well as postgraduates in this area.

TOC:
Title Page Copyright Page Preface Acknowledgements Table of Contents 1 Introduction 1.1 Introduction 1.2 Interpreters 1.3 Landin's SEeD Machine 1.4 The Organisation of this Book 1.5 Omissions 2 VMs for Portability: BCPL 2.1 Introduction 2.2 BCPL the Language 2.3 VM Operations 2.4 The OeODE Machine 2.5 OCODE Instructions and their Implementation 2.5.1 Expression Instructions 2.5.2 Load and Store Instructions 2.5.3 Instructions Relating to Routines 2.5.4 Control Instructions 2.5.5 Directives 2.6 The Intcode/Cintcode Machine 3 The Java Virtual Machine 3.1 Introduction 3.2 JVM Organisation: An Overview 3.2.1 The stack 3.2.2 Method areas 3.2.3 The PC register 3.2.4 Other structures 3.3 Class Files 3.4 Object Representation at Runtime 3.5 Initialisation 3.6 Object Deletion 3.7 JVM Termination 3.8 Exception Handling 3.9 Instructions 3.9.1 Data-manipulation instructions 3.9.2 Control instructions 3.9.3 Stack-manipulating instructions 3.9.4 Support for object orientation 3.9.5 Synchronisation 3.10 Concluding Remarks 4 DIY VMs 4.1 Introduction 4.2 ALEX 4.2.1 Language Overview 4.2.2 What the Virtual Machine Must Support 4.2.3 Virtual Machine-Storage Structures 4.2.4 Virtual Machine-Registers 4.2.5 Virtual Machine-Instruction Set 4.2.6 An Example 4.2.7 Implementation 4.2.8 Extensions 4.2.9 Alternatives 4.2.10 Specification 4.3 Issues 4.3.1 Indirect and Relative Jumps 4.3.2 More Data Types 4.3.3 Higher-Order Routines 4.3.4 Primitive Routines 4.4 Concluding Remarks 5 More Stack-Based VMs 5.1 Introduction 5.2 A Simple Object-Oriented Language 5.2.1 Language Overview 5.2.2 Virtual Machine-Storage Structures 5.2.3 Virtual Machine-Registers 5.2.4 Virtual Machine-Instruction Set 5.2.5 Extensions 5.2.6 Alternatives 5.3 A Parallel Language 5.3.1 Language Overview 5.3.2 Virtual Machine-Storage Structures 5.3.3 Virtual Machine-Registers 5.3.4 Virtual Machine-Instruction Set 5.3.5 Implementation 5.3.6 Extensions 5.3.7 Alternatives 5.3.8 Issues 5.4 Concluding Remarks 5.4.1 Some Optimisations 5.4.2 Combining the Languages 6 Case Study: An Event-Driven Language 6.1 Introduction 6.2 The Structure of Rules 6.3 Events 6.4 Execution Cycle 6.5 Interpretation Rules 6.6 VM Specification 6.6.1 States and Notational Conventions 6.6.2 Infra-Rule Transitions 6.6.3 Extra-Rule Transitions 6.6.4 VM-Only Transitions 6.6.5 Introspective Operations 6.7 Rule Equivalences 6.8 Concluding Remarks 7 Register-Based Machines 7.1 Introduction 7.2 The Register-Transfer Model 7.3 Register Machine Organisation 7.4 Parrot-General Organisation 7.5 Parrot Instruction Set 7.5.1 Control instructions 7.5.2 Data management instructions 7.5.3 Register and stack operations 7.6 DIY Register-Based Virtual Machine 7.6.1 Informal Design 7.6.2 Extensions 7.6.3 Transition Rules 7.7 Translating ALEXVM into RTM 7.8 Example Code 7.9 Correctness of the Translation [detailed data not available for remainder] Implementation techniques Open issues Compiling ALEX Harrison machine compilation rules Harrison machine instruction set

rawabstract:
In this book state transitions are used as a formal technique for the specification of virtual machines throughout and --- in addition --- transitions and state transitions relating to the general operation are included for specification of the virtual machine for the event-based system. Two virtual machines are defined using a simple sequential language, which is then generalised to include object and parallelism. Other themes explored include the implementation of VMs and proposals for future work. Appendices contain high-level specifications of two compilers: one for the simple language that serves as the basic example throughout the book, the other for the event-based language specified in Chapter 6. This book is an essential reference tool for academic and industrial researchers as well as postgraduates in this area.

rawTOC:
Title Page \\ Copyright Page \\ Preface \\ Acknowledgements \\ Table of Contents \\ 1 Introduction \\ 1.1 Introduction \\ 1.2 Interpreters \\ 1.3 Landin's SEeD Machine \\ 1.4 The Organisation of this Book \\ 1.5 Omissions \\ 2 VMs for Portability: BCPL \\ 2.1 Introduction \\ 2.2 BCPL the Language \\ 2.3 VM Operations \\ 2.4 The OeODE Machine \\ 2.5 OCODE Instructions and their Implementation \\ 2.5.1 Expression Instructions \\ 2.5.2 Load and Store Instructions \\ 2.5.3 Instructions Relating to Routines \\ 2.5.4 Control Instructions \\ 2.5.5 Directives \\ 2.6 The Intcode/Cintcode Machine \\ 3 The Java Virtual Machine \\ 3.1 Introduction \\ 3.2 JVM Organisation: An Overview \\ 3.2.1 The stack \\ 3.2.2 Method areas \\ 3.2.3 The PC register \\ 3.2.4 Other structures \\ 3.3 Class Files \\ 3.4 Object Representation at Runtime \\ 3.5 Initialisation \\ 3.6 Object Deletion \\ 3.7 JVM Termination \\ 3.8 Exception Handling \\ 3.9 Instructions \\ 3.9.1 Data-manipulation instructions \\ 3.9.2 Control instructions \\ 3.9.3 Stack-manipulating instructions \\ 3.9.4 Support for object orientation \\ 3.9.5 Synchronisation \\ 3.10 Concluding Remarks \\ 4 DIY VMs \\ 4.1 Introduction \\ 4.2 ALEX \\ 4.2.1 Language Overview \\ 4.2.2 What the Virtual Machine Must Support \\ 4.2.3 Virtual Machine-Storage Structures \\ 4.2.4 Virtual Machine-Registers \\ 4.2.5 Virtual Machine-Instruction Set \\ 4.2.6 An Example \\ 4.2.7 Implementation \\ 4.2.8 Extensions \\ 4.2.9 Alternatives \\ 4.2.10 Specification \\ 4.3 Issues \\ 4.3.1 Indirect and Relative Jumps \\ 4.3.2 More Data Types \\ 4.3.3 Higher-Order Routines \\ 4.3.4 Primitive Routines \\ 4.4 Concluding Remarks \\ 5 More Stack-Based VMs \\ 5.1 Introduction \\ 5.2 A Simple Object-Oriented Language \\ 5.2.1 Language Overview \\ 5.2.2 Virtual Machine-Storage Structures \\ 5.2.3 Virtual Machine-Registers \\ 5.2.4 Virtual Machine-Instruction Set \\ 5.2.5 Extensions \\ 5.2.6 Alternatives \\ 5.3 A Parallel Language \\ 5.3.1 Language Overview \\ 5.3.2 Virtual Machine-Storage Structures \\ 5.3.3 Virtual Machine-Registers \\ 5.3.4 Virtual Machine-Instruction Set \\ 5.3.5 Implementation \\ 5.3.6 Extensions \\ 5.3.7 Alternatives \\ 5.3.8 Issues \\ 5.4 Concluding Remarks \\ 5.4.1 Some Optimisations \\ 5.4.2 Combining the Languages \\ 6 Case Study: An Event-Driven Language \\ 6.1 Introduction \\ 6.2 The Structure of Rules \\ 6.3 Events \\ 6.4 Execution Cycle \\ 6.5 Interpretation Rules \\ 6.6 VM Specification \\ 6.6.1 States and Notational Conventions \\ 6.6.2 Infra-Rule Transitions \\ 6.6.3 Extra-Rule Transitions \\ 6.6.4 VM-Only Transitions \\ 6.6.5 Introspective Operations \\ 6.7 Rule Equivalences \\ 6.8 Concluding Remarks \\ 7 Register-Based Machines \\ 7.1 Introduction \\ 7.2 The Register-Transfer Model \\ 7.3 Register Machine Organisation \\ 7.4 Parrot-General Organisation \\ 7.5 Parrot Instruction Set \\ 7.5.1 Control instructions \\ 7.5.2 Data management instructions \\ 7.5.3 Register and stack operations \\ 7.6 DIY Register-Based Virtual Machine \\ 7.6.1 Informal Design \\ 7.6.2 Extensions \\ 7.6.3 Transition Rules \\ 7.7 Translating ALEXVM into RTM \\ 7.8 Example Code \\ 7.9 Correctness of the Translation \\ [detailed data not available for remainder] \\ Implementation techniques \\ Open issues \\ Compiling ALEX \\ Harrison machine compilation rules \\ Harrison machine instruction set

entry:
@Book{Craig:2005:VM,
  author =       "Iain D. Craig",
  title =        "Virtual Machines",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xv + 269",
  year =         "2005",
  ISBN =         "1-85233-969-1, 1-84628-246-2 (e-book)",
  ISBN-13 =      "978-1-85233-969-2, 978-1-84628-246-1 (e-book)",
  LCCN =         "QA76.9 CRA",
  bibdate =      "Thu Jul 14 12:01:15 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/java2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.ox.ac.uk:210/ADVANCE;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "In this book state transitions are used as a formal
                 technique for the specification of virtual machines
                 throughout and --- in addition --- transitions and
                 state transitions relating to the general operation are
                 included for specification of the virtual machine for
                 the event-based system. Two virtual machines are
                 defined using a simple sequential language, which is
                 then generalised to include object and parallelism.
                 Other themes explored include the implementation of VMs
                 and proposals for future work. Appendices contain
                 high-level specifications of two compilers: one for the
                 simple language that serves as the basic example
                 throughout the book, the other for the event-based
                 language specified in Chapter 6. This book is an
                 essential reference tool for academic and industrial
                 researchers as well as postgraduates in this area.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Virtual computer systems; Parallel processing",
  tableofcontents = "Title Page \\
                 Copyright Page \\
                 Preface \\
                 Acknowledgements \\
                 Table of Contents \\
                 1 Introduction \\
                 1.1 Introduction \\
                 1.2 Interpreters \\
                 1.3 Landin's SEeD Machine \\
                 1.4 The Organisation of this Book \\
                 1.5 Omissions \\
                 2 VMs for Portability: BCPL \\
                 2.1 Introduction \\
                 2.2 BCPL the Language \\
                 2.3 VM Operations \\
                 2.4 The OeODE Machine \\
                 2.5 OCODE Instructions and their Implementation \\
                 2.5.1 Expression Instructions \\
                 2.5.2 Load and Store Instructions \\
                 2.5.3 Instructions Relating to Routines \\
                 2.5.4 Control Instructions \\
                 2.5.5 Directives \\
                 2.6 The Intcode/Cintcode Machine \\
                 3 The Java Virtual Machine \\
                 3.1 Introduction \\
                 3.2 JVM Organisation: An Overview \\
                 3.2.1 The stack \\
                 3.2.2 Method areas \\
                 3.2.3 The PC register \\
                 3.2.4 Other structures \\
                 3.3 Class Files \\
                 3.4 Object Representation at Runtime \\
                 3.5 Initialisation \\
                 3.6 Object Deletion \\
                 3.7 JVM Termination \\
                 3.8 Exception Handling \\
                 3.9 Instructions \\
                 3.9.1 Data-manipulation instructions \\
                 3.9.2 Control instructions \\
                 3.9.3 Stack-manipulating instructions \\
                 3.9.4 Support for object orientation \\
                 3.9.5 Synchronisation \\
                 3.10 Concluding Remarks \\
                 4 DIY VMs \\
                 4.1 Introduction \\
                 4.2 ALEX \\
                 4.2.1 Language Overview \\
                 4.2.2 What the Virtual Machine Must Support \\
                 4.2.3 Virtual Machine-Storage Structures \\
                 4.2.4 Virtual Machine-Registers \\
                 4.2.5 Virtual Machine-Instruction Set \\
                 4.2.6 An Example \\
                 4.2.7 Implementation \\
                 4.2.8 Extensions \\
                 4.2.9 Alternatives \\
                 4.2.10 Specification \\
                 4.3 Issues \\
                 4.3.1 Indirect and Relative Jumps \\
                 4.3.2 More Data Types \\
                 4.3.3 Higher-Order Routines \\
                 4.3.4 Primitive Routines \\
                 4.4 Concluding Remarks \\
                 5 More Stack-Based VMs \\
                 5.1 Introduction \\
                 5.2 A Simple Object-Oriented Language \\
                 5.2.1 Language Overview \\
                 5.2.2 Virtual Machine-Storage Structures \\
                 5.2.3 Virtual Machine-Registers \\
                 5.2.4 Virtual Machine-Instruction Set \\
                 5.2.5 Extensions \\
                 5.2.6 Alternatives \\
                 5.3 A Parallel Language \\
                 5.3.1 Language Overview \\
                 5.3.2 Virtual Machine-Storage Structures \\
                 5.3.3 Virtual Machine-Registers \\
                 5.3.4 Virtual Machine-Instruction Set \\
                 5.3.5 Implementation \\
                 5.3.6 Extensions \\
                 5.3.7 Alternatives \\
                 5.3.8 Issues \\
                 5.4 Concluding Remarks \\
                 5.4.1 Some Optimisations \\
                 5.4.2 Combining the Languages \\
                 6 Case Study: An Event-Driven Language \\
                 6.1 Introduction \\
                 6.2 The Structure of Rules \\
                 6.3 Events \\
                 6.4 Execution Cycle \\
                 6.5 Interpretation Rules \\
                 6.6 VM Specification \\
                 6.6.1 States and Notational Conventions \\
                 6.6.2 Infra-Rule Transitions \\
                 6.6.3 Extra-Rule Transitions \\
                 6.6.4 VM-Only Transitions \\
                 6.6.5 Introspective Operations \\
                 6.7 Rule Equivalences \\
                 6.8 Concluding Remarks \\
                 7 Register-Based Machines \\
                 7.1 Introduction \\
                 7.2 The Register-Transfer Model \\
                 7.3 Register Machine Organisation \\
                 7.4 Parrot-General Organisation \\
                 7.5 Parrot Instruction Set \\
                 7.5.1 Control instructions \\
                 7.5.2 Data management instructions \\
                 7.5.3 Register and stack operations \\
                 7.6 DIY Register-Based Virtual Machine \\
                 7.6.1 Informal Design \\
                 7.6.2 Extensions \\
                 7.6.3 Transition Rules \\
                 7.7 Translating ALEXVM into RTM \\
                 7.8 Example Code \\
                 7.9 Correctness of the Translation \\
                 [detailed data not available for remainder] \\
                 Implementation techniques \\
                 Open issues \\
                 Compiling ALEX \\
                 Harrison machine compilation rules \\
                 Harrison machine instruction set",
}


bibtype: book
filename: master.bib
label: Crandall:1991:MSa
author: Richard E. Crandall
title: Mathematica for the Sciences
publisher: pub-AW
address: pub-AW:adr
pages: xiii + 300
year: 1991
ISBN: 0-201-51001-4 OR 0201510014
ISBN13: 978-0-201-51001-0 OR 9780201510010
LCCN: Q172 .C73 1991
bibdate: Wed Dec 15 07:59:15 1993
bibtimestamp: 1993.12.15 07:59:15 ???
acknowledgement: ack-nhfb
rawauthor: Richard E. Crandall
rawtitle: {Mathematica} for the Sciences
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/c/crandall-richard-e.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/mathematica.bib

keywords:
Mathematica (Computer file); Science --- Mathematics --- Data processing; Science --- Use of --- Software

entry:
@Book{Crandall:1991:MSa,
  author =       "Richard E. Crandall",
  title =        "{Mathematica} for the Sciences",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiii + 300",
  year =         "1991",
  ISBN =         "0-201-51001-4",
  ISBN-13 =      "978-0-201-51001-0",
  LCCN =         "Q172 .C73 1991",
  bibdate =      "Wed Dec 15 07:59:15 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/c/crandall-richard-e.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathematica.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Mathematica (Computer file); Science --- Mathematics
                 --- Data processing; Science --- Use of --- Software",
  xxnote =       "See \cite{Crandall:1991:MSb}.",
}


bibtype: book
filename: master.bib
label: Cravens:2007:PSW
author: Gwyneth Cravens
title: Power to save the world: the truth about nuclear energy
publisher: pub-KNOPF
address: pub-KNOPF:adr
pages: xv + 439
year: 2007
ISBN: 0-307-26656-7 OR 0307266567
ISBN13: 978-0-307-26656-9 OR 9780307266569
LCCN: TK9146 .C65 2007
bibdate: Fri Nov 12 14:45:25 MST 2010
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2010.11.12 14:45:25 MST
subject: nuclear engineering; United States; nuclear power plants
acknowledgement: ack-nhfb
rawauthor: Gwyneth Cravens
rawtitle: Power to save the world: the truth about nuclear energy
URL:
http://www.loc.gov/catdir/enhancements/fy0804/2007017611-b.ht; http://www.loc.gov/catdir/enhancements/fy0804/2007017611-d.ht; http://www.loc.gov/catdir/enhancements/fy0804/2007017611-s.ht; http://www.loc.gov/catdir/toc/ecip0716/2007017611.html

TOC:
Part 1. Origins 1. Survival 2. Always look at the whole 3. Ambrosia Lake Part 2. The invisible storm 4. Mother Nature and Fencepost Man 5. Undark 6. Into the strange city Part 3. The hidden world 7. Risk and consequence 8. Going to extremes 9. Tiny beads Part 4. The kingdom of electricity 10. Man's smudge 11. From arrowheads to atoms 12. Barriers 13. Unobtainium Part 5. Closing the circle 14. Ten thousand years 15. The huge factory 16. 32N164W 17. Those who say it can't be done 18. The gigantic crystal Part 6. Borrowing from our children 19. The iron chamber 20. ``Water them anyway'' 21. The power within Notes Glossary Acknowledgments Index

rawTOC:
Part 1. Origins \\ 1. Survival \\ 2. Always look at the whole \\ 3. Ambrosia Lake \\ Part 2. The invisible storm \\ 4. Mother Nature and Fencepost Man \\ 5. Undark \\ 6. Into the strange city \\ Part 3. The hidden world \\ 7. Risk and consequence \\ 8. Going to extremes \\ 9. Tiny beads \\ Part 4. The kingdom of electricity \\ 10. Man's smudge \\ 11. From arrowheads to atoms \\ 12. Barriers \\ 13. Unobtainium \\ Part 5. Closing the circle \\ 14. Ten thousand years \\ 15. The huge factory \\ 16. 32N164W \\ 17. Those who say it can't be done \\ 18. The gigantic crystal \\ Part 6. Borrowing from our children \\ 19. The iron chamber \\ 20. ``Water them anyway'' \\ 21. The power within \\ Notes \\ Glossary \\ Acknowledgments \\ Index

entry:
@Book{Cravens:2007:PSW,
  author =       "Gwyneth Cravens",
  title =        "Power to save the world: the truth about nuclear
                 energy",
  publisher =    pub-KNOPF,
  address =      pub-KNOPF:adr,
  pages =        "xv + 439",
  year =         "2007",
  ISBN =         "0-307-26656-7",
  ISBN-13 =      "978-0-307-26656-9",
  LCCN =         "TK9146 .C65 2007",
  bibdate =      "Fri Nov 12 14:45:25 MST 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0804/2007017611-b.ht;
                 http://www.loc.gov/catdir/enhancements/fy0804/2007017611-d.ht;
                 http://www.loc.gov/catdir/enhancements/fy0804/2007017611-s.ht;
                 http://www.loc.gov/catdir/toc/ecip0716/2007017611.html",
  acknowledgement = ack-nhfb,
  subject =      "nuclear engineering; United States; nuclear power
                 plants",
  tableofcontents = "Part 1. Origins \\
                 1. Survival \\
                 2. Always look at the whole \\
                 3. Ambrosia Lake \\
                 Part 2. The invisible storm \\
                 4. Mother Nature and Fencepost Man \\
                 5. Undark \\
                 6. Into the strange city \\
                 Part 3. The hidden world \\
                 7. Risk and consequence \\
                 8. Going to extremes \\
                 9. Tiny beads \\
                 Part 4. The kingdom of electricity \\
                 10. Man's smudge \\
                 11. From arrowheads to atoms \\
                 12. Barriers \\
                 13. Unobtainium \\
                 Part 5. Closing the circle \\
                 14. Ten thousand years \\
                 15. The huge factory \\
                 16. 32N164W \\
                 17. Those who say it can't be done \\
                 18. The gigantic crystal \\
                 Part 6. Borrowing from our children \\
                 19. The iron chamber \\
                 20. ``Water them anyway'' \\
                 21. The power within \\
                 Notes \\
                 Glossary \\
                 Acknowledgments \\
                 Index",
}


bibtype: book
filename: master.bib
label: Crease:2010:GEB
author: Robert P. Crease
title: The Great Equations: Breakthroughs in Science from Pythagoras to Heisenberg
publisher: pub-NORTON
address: pub-NORTON:adr
pages: 315
year: 2010
ISBN: 0-393-33793-6 OR 0393337936
ISBN13: 978-0-393-33793-8 OR 9780393337938
LCCN: Q175 .C884 2010
bibdate: Mon Mar 8 20:24:04 MST 2010
bibtimestamp: 2010.03.08 20:24:04 MST
subject: equations; history; science; philosophy; mathematicians; biography; scientists
acknowledgement: ack-nhfb
rawauthor: Robert P. Crease
rawtitle: The Great Equations: Breakthroughs in Science from {Pythagoras} to {Heisenberg}
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib; https://www.math.utah.edu/pub/tex/bib/einstein.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; sirsi.library.utoronto.ca:2200/UNICORN

TOC:
1: ``The Basis of Civilization'': The Pythagorean Theorem Interlude. Rules, Proofi, and the Magic of Mathematics 2: ``The Soul of Classical Mechanics'': Newton's Second Law of Motion Interlude. Book of Nature 3: ``The High Point of the Scientific Revolution'': Newton's Law of Universal Gravitation Interlude. That Apple 4: ``The Gold Standard for Mathematical Beauty'': Euler's Equation Interlude. Equations as Icons 5: Scientific Equivalent of Shakespeare: The Second Law of Thermodynamies Interlude. Science of Impossibility 6: ``The Most Significant Event of the 19th Century'': Maxwell's Equations Interlude. Overcoming Anosognosia; or Restoring the Vitality of the Humanities 7: Celebrity Equation: $E = m c^2$ Interlude. Crazy Ideas 8: Golden Egg: Einstein's Equation for General Relativity Interlude. Science Critics 9: ``The Basic Equation of Quantum Theory'': Schrodinger's Equation Interlude. Double Consciousness of Scientists 10: Living with Uncertainty: The Heisenberg Uncertainty Principle Interlude. Yogi and the Quantum Conclusion: Bringing the Strange Home

rawTOC:
1: ``The Basis of Civilization'': The Pythagorean Theorem \\ Interlude. Rules, Proofi, and the Magic of Mathematics \\ 2: ``The Soul of Classical Mechanics'': Newton's Second Law of Motion \\ Interlude. Book of Nature \\ 3: ``The High Point of the Scientific Revolution'': Newton's Law of Universal Gravitation \\ Interlude. That Apple \\ 4: ``The Gold Standard for Mathematical Beauty'': Euler's Equation \\ Interlude. Equations as Icons \\ 5: Scientific Equivalent of Shakespeare: The Second Law of Thermodynamies \\ Interlude. Science of Impossibility \\ 6: ``The Most Significant Event of the 19th Century'': Maxwell's Equations \\ Interlude. Overcoming Anosognosia; or Restoring the Vitality of the Humanities \\ 7: Celebrity Equation: $E = m c^2$ \\ Interlude. Crazy Ideas \\ 8: Golden Egg: Einstein's Equation for General Relativity \\ Interlude. Science Critics \\ 9: ``The Basic Equation of Quantum Theory'': Schr{\"o}dinger's Equation \\ Interlude. Double Consciousness of Scientists \\ 10: Living with Uncertainty: The Heisenberg Uncertainty Principle \\ Interlude. Yogi and the Quantum \\ Conclusion: Bringing the Strange Home

entry:
@Book{Crease:2010:GEB,
  author =       "Robert P. Crease",
  title =        "The Great Equations: Breakthroughs in Science from
                 {Pythagoras} to {Heisenberg}",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "315",
  year =         "2010",
  ISBN =         "0-393-33793-6",
  ISBN-13 =      "978-0-393-33793-8",
  LCCN =         "Q175 .C884 2010",
  bibdate =      "Mon Mar 8 20:24:04 MST 2010",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 sirsi.library.utoronto.ca:2200/UNICORN",
  acknowledgement = ack-nhfb,
  subject =      "equations; history; science; philosophy;
                 mathematicians; biography; scientists",
  tableofcontents = "1: ``The Basis of Civilization'': The Pythagorean
                 Theorem \\
                 Interlude. Rules, Proofi, and the Magic of Mathematics
                 \\
                 2: ``The Soul of Classical Mechanics'': Newton's Second
                 Law of Motion \\
                 Interlude. Book of Nature \\
                 3: ``The High Point of the Scientific Revolution'':
                 Newton's Law of Universal Gravitation \\
                 Interlude. That Apple \\
                 4: ``The Gold Standard for Mathematical Beauty'':
                 Euler's Equation \\
                 Interlude. Equations as Icons \\
                 5: Scientific Equivalent of Shakespeare: The Second Law
                 of Thermodynamies \\
                 Interlude. Science of Impossibility \\
                 6: ``The Most Significant Event of the 19th Century'':
                 Maxwell's Equations \\
                 Interlude. Overcoming Anosognosia; or Restoring the
                 Vitality of the Humanities \\
                 7: Celebrity Equation: $E = m c^2$ \\
                 Interlude. Crazy Ideas \\
                 8: Golden Egg: Einstein's Equation for General
                 Relativity \\
                 Interlude. Science Critics \\
                 9: ``The Basic Equation of Quantum Theory'':
                 Schr{\"o}dinger's Equation \\
                 Interlude. Double Consciousness of Scientists \\
                 10: Living with Uncertainty: The Heisenberg Uncertainty
                 Principle \\
                 Interlude. Yogi and the Quantum \\
                 Conclusion: Bringing the Strange Home",
}


bibtype: book
filename: master.bib
label: Crease:2011:WBH
author: Robert P. Crease
title: World in the balance: the historic quest for an absolute system of measurement
publisher: pub-NORTON
address: pub-NORTON:adr
pages: 317
year: 2011
ISBN: 0-393-07298-3 OR 0393072983
ISBN13: 978-0-393-07298-3 OR 9780393072983
LCCN: QC83 .C74 2011
bibdate: Wed Dec 7 07:19:22 MST 2011
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2011.12.07 07:19:22 MST
subject: Weights and measures; History; Measurement; Metrology
acknowledgement: ack-nhfb
rawauthor: Robert P. Crease
rawtitle: World in the balance: the historic quest for an absolute system of measurement
TOC:
Vitruvian man Ancient China: feet and flutes West Africa: gold weights France: ``realities of life and labor'' Halting steps toward universality ``One of the greatest triumphs of modern civilization'' Metrophilia and metrophobia Surely you're joking, Mr. Duchamp! Dreams of a final standard Universal system: the Si The modern metroscape Au revoir, kilogram

rawTOC:
Vitruvian man \\ Ancient China: feet and flutes \\ West Africa: gold weights \\ France: ``realities of life and labor'' \\ Halting steps toward universality \\ ``One of the greatest triumphs of modern civilization'' \\ Metrophilia and metrophobia \\ Surely you're joking, Mr. Duchamp! \\ Dreams of a final standard \\ Universal system: the Si \\ The modern metroscape \\ Au revoir, kilogram

entry:
@Book{Crease:2011:WBH,
  author =       "Robert P. Crease",
  title =        "World in the balance: the historic quest for an
                 absolute system of measurement",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "317",
  year =         "2011",
  ISBN =         "0-393-07298-3",
  ISBN-13 =      "978-0-393-07298-3",
  LCCN =         "QC83 .C74 2011",
  bibdate =      "Wed Dec 7 07:19:22 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Weights and measures; History; Measurement;
                 Metrology",
  tableofcontents = "Vitruvian man \\
                 Ancient China: feet and flutes \\
                 West Africa: gold weights \\
                 France: ``realities of life and labor'' \\
                 Halting steps toward universality \\
                 ``One of the greatest triumphs of modern civilization''
                 \\
                 Metrophilia and metrophobia \\
                 Surely you're joking, Mr. Duchamp! \\
                 Dreams of a final standard \\
                 Universal system: the Si \\
                 The modern metroscape \\
                 Au revoir, kilogram",
}


bibtype: book
filename: master.bib
label: Crease:2014:QMH
author: Robert P. Crease and Alfred S. Goldhaber
title: The quantum moment: how Planck, Bohr, Einstein, and Heisenberg taught us to love uncertainty
publisher: pub-NORTON
address: pub-NORTON:adr
pages: vii + 332
year: 2014
ISBN: 0-393-06792-0 (hardcover) OR 0393067920 (hardcover)
ISBN13: 978-0-393-06792-7 (hardcover) OR 9780393067927 (hardcover)
LCCN: QC174.123 .C74 2014
bibdate: Mon Dec 29 05:53:52 MST 2014
bibtimestamp: 2014.12.29 05:53:52 MST
subject: Quantum theory; Popular works; Physics
acknowledgement: ack-nhfb
rawauthor: Robert P. Crease and Alfred S. Goldhaber
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib; https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib; https://www.math.utah.edu/pub/bibnet/authors/p/pauli-wolfgang.bib; https://www.math.utah.edu/pub/bibnet/authors/s/schroedinger-erwin.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

abstract:
The authors --- one a philosopher, the other a physicist --- draw on their training and six years of co-teaching to dramatize the quantum's rocky path from scientific theory to public understanding while also exploring the quantum's manifestations in everything from art and sculpture to the prose of John Updike and David Foster Wallace.

TOC:
Introduction / 1 The Newtonian moment / 9 Interlude: The Grand Design / 27 A pixelated world / 33 Interlude: Max Planck introduces the quantum / 47 Quantum leaps / 55 Interlude: Niels Bohr uses quantum leaps to make atoms go / 67 Randomness / 70 Interlude: Albert Einstein shows how God plays dice / 83 The matter of identity: a quantum shoe that hasn't dropped / 86 Interlude: Wolfgang Pauli and the Exclusion Principle, Satyendra Bose, and bosons / 100 Sharks and tigers: schizophrenia / 109 Interlude: Erwin Schrodinger's map, Werner Heisenberg's map / 130 Uncertainty / 137 Interlude: The Uncertainty Principle / 162 Reality manufactured: cubism and complementarity / 165 Interlude: Complementarity, objectivity, and the double-slit experiment / 182 No dice! / 187 Interlude: John Bell and his theorem / 205 Schrodinger's cat / 211 Interlude: the border war / 228 Rabbit hole: the thirst for parallel worlds / 233 Interlude: multiverses / 251 Saving physics / 254 Conclusion: The now moment / 272 Notes / 281 Acknowledgments / 307 Credits / 311 Index / 313

rawabstract:
The authors --- one a philosopher, the other a physicist --- draw on their training and six years of co-teaching to dramatize the quantum's rocky path from scientific theory to public understanding while also exploring the quantum's manifestations in everything from art and sculpture to the prose of John Updike and David Foster Wallace.

rawtitle:
The quantum moment: how {Planck}, {Bohr}, {Einstein}, and {Heisenberg} taught us to love uncertainty

rawTOC:
Introduction / 1 \\ The Newtonian moment / 9 \\ Interlude: The Grand Design / 27 \\ A pixelated world / 33 \\ Interlude: Max Planck introduces the quantum / 47 \\ Quantum leaps / 55 \\ Interlude: Niels Bohr uses quantum leaps to make atoms go / 67 \\ Randomness / 70 \\ Interlude: Albert Einstein shows how God plays dice / 83 \\ The matter of identity: a quantum shoe that hasn't dropped / 86 \\ Interlude: Wolfgang Pauli and the Exclusion Principle, Satyendra Bose, and bosons / 100 \\ Sharks and tigers: schizophrenia / 109 \\ Interlude: Erwin Schr{\"o}dinger's map, Werner Heisenberg's map / 130 \\ Uncertainty / 137 \\ Interlude: The Uncertainty Principle / 162 \\ Reality manufactured: cubism and complementarity / 165 \\ Interlude: Complementarity, objectivity, and the double-slit experiment / 182 \\ No dice! / 187 \\ Interlude: John Bell and his theorem / 205 \\ Schr{\"o}dinger's cat / 211 \\ Interlude: the border war / 228 \\ Rabbit hole: the thirst for parallel worlds / 233 \\ Interlude: multiverses / 251 \\ Saving physics / 254 \\ Conclusion: The now moment / 272 \\ Notes / 281 \\ Acknowledgments / 307 \\ Credits / 311 \\ Index / 313

entry:
@Book{Crease:2014:QMH,
  author =       "Robert P. Crease and Alfred S. Goldhaber",
  title =        "The quantum moment: how {Planck}, {Bohr}, {Einstein},
                 and {Heisenberg} taught us to love uncertainty",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "vii + 332",
  year =         "2014",
  ISBN =         "0-393-06792-0 (hardcover)",
  ISBN-13 =      "978-0-393-06792-7 (hardcover)",
  LCCN =         "QC174.123 .C74 2014",
  bibdate =      "Mon Dec 29 05:53:52 MST 2014",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/p/pauli-wolfgang.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/schroedinger-erwin.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",
  abstract =     "The authors --- one a philosopher, the other a
                 physicist --- draw on their training and six years of
                 co-teaching to dramatize the quantum's rocky path from
                 scientific theory to public understanding while also
                 exploring the quantum's manifestations in everything
                 from art and sculpture to the prose of John Updike and
                 David Foster Wallace.",
  acknowledgement = ack-nhfb,
  subject =      "Quantum theory; Popular works; Physics",
  tableofcontents = "Introduction / 1 \\
                 The Newtonian moment / 9 \\
                 Interlude: The Grand Design / 27 \\
                 A pixelated world / 33 \\
                 Interlude: Max Planck introduces the quantum / 47 \\
                 Quantum leaps / 55 \\
                 Interlude: Niels Bohr uses quantum leaps to make atoms
                 go / 67 \\
                 Randomness / 70 \\
                 Interlude: Albert Einstein shows how God plays dice /
                 83 \\
                 The matter of identity: a quantum shoe that hasn't
                 dropped / 86 \\
                 Interlude: Wolfgang Pauli and the Exclusion Principle,
                 Satyendra Bose, and bosons / 100 \\
                 Sharks and tigers: schizophrenia / 109 \\
                 Interlude: Erwin Schr{\"o}dinger's map, Werner
                 Heisenberg's map / 130 \\
                 Uncertainty / 137 \\
                 Interlude: The Uncertainty Principle / 162 \\
                 Reality manufactured: cubism and complementarity / 165
                 \\
                 Interlude: Complementarity, objectivity, and the
                 double-slit experiment / 182 \\
                 No dice! / 187 \\
                 Interlude: John Bell and his theorem / 205 \\
                 Schr{\"o}dinger's cat / 211 \\
                 Interlude: the border war / 228 \\
                 Rabbit hole: the thirst for parallel worlds / 233 \\
                 Interlude: multiverses / 251 \\
                 Saving physics / 254 \\
                 Conclusion: The now moment / 272 \\
                 Notes / 281 \\
                 Acknowledgments / 307 \\
                 Credits / 311 \\
                 Index / 313",
}


bibtype: book
filename: master.bib
label: Crowther:1974:CLb
author: J. G. (James Gerald) Crowther
booktitle: The Cavendish Laboratory, 1874--1974
title: The Cavendish Laboratory, 1874--1974
publisher: Science History Publications
address: New York, NY, USA
pages: xvi + 464
year: 1974
DOI: https://doi.org/10.1007/978-1-349-01670-9
ISBN: 0-88202-029-3 (hardcover), 1-349-01670-5 (e-book) OR 0882020293 (hardcover), 1349016705 (ebook)
LCCN: QC51.G72 C353 1974
bibdate: Thu Mar 10 11:48:00 MST 2016
bibtimestamp: 2016.03.10 11:48:00 MST
acknowledgement: ack-nhfb
authordates: 1899--
rawauthor: J. G. (James Gerald) Crowther
rawbooktitle: The {Cavendish Laboratory}, 1874--1974
rawtitle: The {Cavendish Laboratory}, 1874--1974
ISBN13:
978-0-88202-029-7 (hardcover), 978-1-349-01670-9 (e-book) OR 9780882020297 (hardcover), 9781349016709 (ebook)

bibsource:
https://www.math.utah.edu/pub/bibnet/authors/r/rutherford-ernest.bib; https://www.math.utah.edu/pub/tex/bib/bjhs.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager

TOC:
List of Illustrations / ix Prefix / xiii Acknowledgments / xv Introduction / 1--22 Founding the Professorship and Laboratory / 23--34 Creating the Cavendish Tradition / 35--46 Building the Laboratory / 47--60 The Early Atmosphere / 61--79 Rayleigh / 80--87 Systematising Teaching and Research / 88--102 J. J. Thomson: Early Days / 103--108 Building on the Foundations / 109--125 Fruition / 126--140 From Outside to Inside the Atom / 141--151 Accommodation and Teaching / 152--159 New Physics, and a New Professor / 160--175 Rutherford's Background / 176--182 The Apotheosis of the Cavendish Laboratory / 183--202 The Rutherford Era / 203--212 Cloud Chambers / 213--224 Engineers and Electricians / 225--235 Russian and Australian Views / 236--248 Individual Genius also Flourished / 249--257 The Cavendish in Transition / 258--268 Bragg / 269--290 The Technicians' Contribution / 291--300 Physicists and Molecular Biology / 301--319 Final Report / 320--328 The Mond / 329--338 `One Good Laboratory Among Many' / 339--357 Current Researches / 358--367 New Instruments / 368--380 A New Line / 381--384 The Depths of Space / 385--401 Finance and Administration / 402--411 The New Cavendish / 412--430 Pippard's View / 431--441 Farewell, and Hail! / 442--446 References / 447--456 Index / 457--464

rawTOC:
List of Illustrations / ix \\ Prefix / xiii \\ Acknowledgments / xv \\ Introduction / 1--22 \\ Founding the Professorship and Laboratory / 23--34 \\ Creating the Cavendish Tradition / 35--46 \\ Building the Laboratory / 47--60 \\ The Early Atmosphere / 61--79 \\ Rayleigh / 80--87 \\ Systematising Teaching and Research / 88--102 \\ J. J. Thomson: Early Days / 103--108 \\ Building on the Foundations / 109--125 \\ Fruition / 126--140 \\ From Outside to Inside the Atom / 141--151 \\ Accommodation and Teaching / 152--159 \\ New Physics, and a New Professor / 160--175 \\ Rutherford's Background / 176--182 \\ The Apotheosis of the Cavendish Laboratory / 183--202 \\ The Rutherford Era / 203--212 \\ Cloud Chambers / 213--224 \\ Engineers and Electricians / 225--235 \\ Russian and Australian Views / 236--248 \\ Individual Genius also Flourished / 249--257 \\ The Cavendish in Transition / 258--268 \\ Bragg / 269--290 \\ The Technicians' Contribution / 291--300 \\ Physicists and Molecular Biology / 301--319 \\ Final Report / 320--328 \\ The Mond / 329--338 \\ `One Good Laboratory Among Many' / 339--357 \\ Current Researches / 358--367 \\ New Instruments / 368--380 \\ A New Line / 381--384 \\ The Depths of Space / 385--401 \\ Finance and Administration / 402--411 \\ The New Cavendish / 412--430 \\ Pippard's View / 431--441 \\ Farewell, and Hail! / 442--446 \\ References / 447--456 \\ Index / 457--464

entry:
@Book{Crowther:1974:CLb,
  author =       "J. G. (James Gerald) Crowther",
  booktitle =    "The {Cavendish Laboratory}, 1874--1974",
  title =        "The {Cavendish Laboratory}, 1874--1974",
  publisher =    "Science History Publications",
  address =      "New York, NY, USA",
  pages =        "xvi + 464",
  year =         "1974",
  DOI =          "https://doi.org/10.1007/978-1-349-01670-9",
  ISBN =         "0-88202-029-3 (hardcover), 1-349-01670-5 (e-book)",
  ISBN-13 =      "978-0-88202-029-7 (hardcover), 978-1-349-01670-9
                 (e-book)",
  LCCN =         "QC51.G72 C353 1974",
  bibdate =      "Thu Mar 10 11:48:00 MST 2016",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/r/rutherford-ernest.bib;
                 https://www.math.utah.edu/pub/tex/bib/bjhs.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "1899--",
  tableofcontents = "List of Illustrations / ix \\
                 Prefix / xiii \\
                 Acknowledgments / xv \\
                 Introduction / 1--22 \\
                 Founding the Professorship and Laboratory / 23--34 \\
                 Creating the Cavendish Tradition / 35--46 \\
                 Building the Laboratory / 47--60 \\
                 The Early Atmosphere / 61--79 \\
                 Rayleigh / 80--87 \\
                 Systematising Teaching and Research / 88--102 \\
                 J. J. Thomson: Early Days / 103--108 \\
                 Building on the Foundations / 109--125 \\
                 Fruition / 126--140 \\
                 From Outside to Inside the Atom / 141--151 \\
                 Accommodation and Teaching / 152--159 \\
                 New Physics, and a New Professor / 160--175 \\
                 Rutherford's Background / 176--182 \\
                 The Apotheosis of the Cavendish Laboratory / 183--202
                 \\
                 The Rutherford Era / 203--212 \\
                 Cloud Chambers / 213--224 \\
                 Engineers and Electricians / 225--235 \\
                 Russian and Australian Views / 236--248 \\
                 Individual Genius also Flourished / 249--257 \\
                 The Cavendish in Transition / 258--268 \\
                 Bragg / 269--290 \\
                 The Technicians' Contribution / 291--300 \\
                 Physicists and Molecular Biology / 301--319 \\
                 Final Report / 320--328 \\
                 The Mond / 329--338 \\
                 `One Good Laboratory Among Many' / 339--357 \\
                 Current Researches / 358--367 \\
                 New Instruments / 368--380 \\
                 A New Line / 381--384 \\
                 The Depths of Space / 385--401 \\
                 Finance and Administration / 402--411 \\
                 The New Cavendish / 412--430 \\
                 Pippard's View / 431--441 \\
                 Farewell, and Hail! / 442--446 \\
                 References / 447--456 \\
                 Index / 457--464",
}


bibtype: book
filename: master.bib
label: Crystal:2004:SE
author: David Crystal
title: The Stories of English
publisher: The Overlook Press
address: New York, NY, USA
pages: vi + 584
year: 2004
LCCN: PE1074.7 .C79 2004
bibdate: Fri May 21 20:34:07 MDT 2021
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2021.05.21 20:34:07 MDT
acknowledgement: ack-nhfb
authordates: (1941--ldots )
rawauthor: David Crystal
rawtitle: The Stories of {English}
ISBN:
1-58567-601-2, 1-58567-719-1 (paperback), 1-4683-0617-0 (e-book) OR 1585676012, 1585677191 (paperback), 1468306170 (ebook)

ISBN13:
978-1-58567-601-9, 978-1-58567-719-1 (paperback), 978-1-4683-0617-0 (e-book) OR 9781585676019, 9781585677191 (paperback), 9781468306170 (ebook)

abstract:
The Stories of English is a history of the language by David Crystal. Crystal turns the history of English on its head and provides an original view of where the richness, creativity, and diversity of the language truly lies --- in the accents and dialects of nonstandard English users all over the world. Whatever their regional, social, or ethnic background, each group has a story worth telling, whether it is in Scotland or Canada, South Africa or the United States --- and Crystal relates the fascinating and sometimes arcane details. Interwoven throughout the central chronological story are accounts of uses of dialect around the world, as well as in classics from The Canterbury Tales to The Lord of the Rings. For the first time, regional speech and writing is placed center stage, giving a sense of the social realities behind the development of the English language. This shift in perspective enables the reader to understand, for the first time, the importance of everyday, previously marginalized voices in our language and provides an argument for the way English should be taught in the future.

subject:
English language; Variation; English-speaking countries; Dialects; Great Britain; History; Anglais (Langue); Pays anglophones; Dialectes; Grande-Bretagne; Histoire; English language; Dialects; Variation; Variation (linguistique); Histoire; 1500--1700 (moderne naissant); 20e siyecle.

TOC:
Introduction The standard story Real story Origins of Old English: Interlude 1: Celtic language puzzle Old English dialects: Interlude 2: Rise and fall of West Saxon Early lexical diversity: Interlude 3: Understanding Danes Stylistic variation in Old English: Interlude 4: Grammatical transition Transition to Middle English: Interlude 5: Two Peterborough Chronicles Trilingual nation: Interlude 6: Lay Subsidy dialects Lexical invasions: Interlude 7: First dialect story Evolving variation: Interlude 8: Well well Dialect age: Interlude 9: Where did the -s ending come from? Emerging standard: Interlude 10: Complaining about change Printing and its consequences: Interlude 11: First English dictionary Early Modern English preoccupations: Interlude 12: Choosing thou or you Linguistic daring: Interlude 13: Avoiding transcriptional anaemia Dialect fallout: Interlude 14: Beggarly portrayal Stabilizing disorder: Interlude 15: Delusions of simplicity Standard rules: Interlude 16: Glottal stops New horizons: Interlude 17: Tracking a change: the case of y'all Linguistic life goes on: Interlude 18: Grammatical heart of nonstandard English And dialect life goes on: Interlude 19: Dialect in Middle Earth Times a-changin' Appendix: Location of the towns and counties of England referred to in this book Notes References Acknowledgements Person Index Subject Index

rawabstract:
The Stories of English is a history of the language by David Crystal. Crystal turns the history of English on its head and provides an original view of where the richness, creativity, and diversity of the language truly lies --- in the accents and dialects of nonstandard English users all over the world. Whatever their regional, social, or ethnic background, each group has a story worth telling, whether it is in Scotland or Canada, South Africa or the United States --- and Crystal relates the fascinating and sometimes arcane details. Interwoven throughout the central chronological story are accounts of uses of dialect around the world, as well as in classics from The Canterbury Tales to The Lord of the Rings. For the first time, regional speech and writing is placed center stage, giving a sense of the social realities behind the development of the English language. This shift in perspective enables the reader to understand, for the first time, the importance of everyday, previously marginalized voices in our language and provides an argument for the way English should be taught in the future.

rawTOC:
Introduction \\ The standard story \\ Real story \\ Origins of Old English: Interlude 1: Celtic language puzzle \\ Old English dialects: Interlude 2: Rise and fall of West Saxon Early lexical diversity: Interlude 3: Understanding Danes \\ Stylistic variation in Old English: Interlude 4: Grammatical transition \\ Transition to Middle English: Interlude 5: Two Peterborough Chronicles \\ Trilingual nation: Interlude 6: Lay Subsidy dialects \\ Lexical invasions: Interlude 7: First dialect story \\ Evolving variation: Interlude 8: Well well \\ Dialect age: Interlude 9: Where did the -s ending come from? \\ Emerging standard: Interlude 10: Complaining about change \\ Printing and its consequences: Interlude 11: First English dictionary \\ Early Modern English preoccupations: Interlude 12: Choosing thou or you \\ Linguistic daring: Interlude 13: Avoiding transcriptional anaemia \\ Dialect fallout: Interlude 14: Beggarly portrayal \\ Stabilizing disorder: Interlude 15: Delusions of simplicity \\ Standard rules: Interlude 16: Glottal stops \\ New horizons: Interlude 17: Tracking a change: the case of y'all \\ Linguistic life goes on: Interlude 18: Grammatical heart of nonstandard English \\ And dialect life goes on: Interlude 19: Dialect in Middle Earth \\ Times a-changin' \\ Appendix: Location of the towns and counties of England referred to in this book \\ Notes \\ References \\ Acknowledgements \\ Person Index \\ Subject Index

entry:
@Book{Crystal:2004:SE,
  author =       "David Crystal",
  title =        "The Stories of {English}",
  publisher =    "The Overlook Press",
  address =      "New York, NY, USA",
  pages =        "vi + 584",
  year =         "2004",
  ISBN =         "1-58567-601-2, 1-58567-719-1 (paperback),
                 1-4683-0617-0 (e-book)",
  ISBN-13 =      "978-1-58567-601-9, 978-1-58567-719-1 (paperback),
                 978-1-4683-0617-0 (e-book)",
  LCCN =         "PE1074.7 .C79 2004",
  bibdate =      "Fri May 21 20:34:07 MDT 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Crystal turns the history of the language on its head
                 and provides a startlingly original view of where the
                 richness, creativity, and diversity of the language
                 truly lies: in the accents and dialects of nonstandard
                 English users all over the globe.",
  abstract =     "The Stories of English is a history of the language by
                 David Crystal. Crystal turns the history of English on
                 its head and provides an original view of where the
                 richness, creativity, and diversity of the language
                 truly lies --- in the accents and dialects of
                 nonstandard English users all over the world. Whatever
                 their regional, social, or ethnic background, each
                 group has a story worth telling, whether it is in
                 Scotland or Canada, South Africa or the United States
                 --- and Crystal relates the fascinating and sometimes
                 arcane details. Interwoven throughout the central
                 chronological story are accounts of uses of dialect
                 around the world, as well as in classics from The
                 Canterbury Tales to The Lord of the Rings. For the
                 first time, regional speech and writing is placed
                 center stage, giving a sense of the social realities
                 behind the development of the English language. This
                 shift in perspective enables the reader to understand,
                 for the first time, the importance of everyday,
                 previously marginalized voices in our language and
                 provides an argument for the way English should be
                 taught in the future.",
  acknowledgement = ack-nhfb,
  author-dates = "(1941--\ldots{})",
  subject =      "English language; Variation; English-speaking
                 countries; Dialects; Great Britain; History; Anglais
                 (Langue); Pays anglophones; Dialectes; Grande-Bretagne;
                 Histoire; English language; Dialects; Variation;
                 Variation (linguistique); Histoire; 1500--1700 (moderne
                 naissant); 20e si{\'y}ecle.",
  tableofcontents = "Introduction \\
                 The standard story \\
                 Real story \\
                 Origins of Old English: Interlude 1: Celtic language
                 puzzle \\
                 Old English dialects: Interlude 2: Rise and fall of
                 West Saxon Early lexical diversity: Interlude 3:
                 Understanding Danes \\
                 Stylistic variation in Old English: Interlude 4:
                 Grammatical transition \\
                 Transition to Middle English: Interlude 5: Two
                 Peterborough Chronicles \\
                 Trilingual nation: Interlude 6: Lay Subsidy dialects
                 \\
                 Lexical invasions: Interlude 7: First dialect story \\
                 Evolving variation: Interlude 8: Well well \\
                 Dialect age: Interlude 9: Where did the -s ending come
                 from? \\
                 Emerging standard: Interlude 10: Complaining about
                 change \\
                 Printing and its consequences: Interlude 11: First
                 English dictionary \\
                 Early Modern English preoccupations: Interlude 12:
                 Choosing thou or you \\
                 Linguistic daring: Interlude 13: Avoiding
                 transcriptional anaemia \\
                 Dialect fallout: Interlude 14: Beggarly portrayal \\
                 Stabilizing disorder: Interlude 15: Delusions of
                 simplicity \\
                 Standard rules: Interlude 16: Glottal stops \\
                 New horizons: Interlude 17: Tracking a change: the case
                 of y'all \\
                 Linguistic life goes on: Interlude 18: Grammatical
                 heart of nonstandard English \\
                 And dialect life goes on: Interlude 19: Dialect in
                 Middle Earth \\
                 Times a-changin' \\
                 Appendix: Location of the towns and counties of England
                 referred to in this book \\
                 Notes \\
                 References \\
                 Acknowledgements \\
                 Person Index \\
                 Subject Index",
}


bibtype: book
filename: master.bib
label: Cuyt:2008:HCF
author: Annie Cuyt and Vigdis B. Petersen and Brigitte Verdonk and Haakon Waadeland and William B. Jones
title: Handbook of Continued Fractions for Special Functions
publisher: pub-SV
address: pub-SV:adr
pages: xx + 440
year: 2008
DOI: https://doi.org/10.1007/978-1-4020-6949-9
ISBN: 1-4020-6948-0 OR 1402069480
ISBN13: 978-1-4020-6948-2 OR 9781402069482
LCCN: QA295 .H275 2008
bibdate: Tue Jun 24 07:17:37 MDT 2008
bibtimestamp: 2008.06.24 07:17:37 MDT
acknowledgement: ack-nhfb
rawauthor: Annie Cuyt and Vigdis B. Petersen and Brigitte Verdonk and Haakon Waadeland and William B. Jones
rawtitle: Handbook of Continued Fractions for Special Functions
bibsource:
https://www.math.utah.edu/pub/tex/bib/elefunt.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager

keywords:
applying the limit process; associated continued fraction; asymptotic series expansion; basic hypergeometric functions; canonical contraction; combination with property; complementary incomplete gamma function; complex error function; confluent hypergeometric series; continued fraction converges; continued fraction representations; fraction approximants; modified approximant; monic orthogonal polynomial sequence; normed field; nth approximant; nth denominator; nth numerator; nth tail; oval sequence theorem; parabola theorem; partial numerators; strong moment distribution function; successive approximants; truncation error bounds

TOC:
Preface / xi Notation / xiii 0 General considerations / 1 0.1 Part one / 1 0.2 Part two / 2 0.3 Part three / 2 Part I: Basic Theory 1 Basics / 9 1.1 Symbols and notation 1.2 Definitions / 10 1.3 Recurrence relations / 13 1.4 Equivalence transformations / 15 1.5 Contractions and extensions / 16 1.6 Continued fractions with prescribed approximants / 18 1.7 Connection between continued fractions and series / 19 1.8 Periodic and limit periodic continued fractions / 21 1.9 Tails of continued fractions / 23 1.10 Continued fractions over normed fields / 26 1.11 Generalisations of continued fractions / 28 2 Continued fraction representation of functions / 29 2.1 Symbols and notation / 29 2.2 Correspondence / 30 2.3 Families of continued fractions / 35 2.4 Correspondence of C-fractions / 39 2.5 Correspondence of P-fractions / 40 2.6 Correspondence of J-fractions and T-fractions / 41 2.7 Correspondence and three-term recurrences / 42 3 Convergence criteria / 45 3.1 Some classical theorems / 45 3.2 Convergence sets and value sets / 47 3.3 Parabola and oval theorems / 49 3.4 Correspondence and uniform convergence / 52 3.5 Periodic and limit periodic continued fractions / 53 3.6 Convergence and minimal solutions / 56 4 Pade approximants / 59 4.1 Definition and notation / 59 4.2 Fundamental properties / 60 4.3 Connection with regular C-fractions / 64 4.4 Connection with P-fractions / 65 4.5 Extension of the Pade table / 67 4.6 Connection with M-fractions and the M-table / 68 4.7 Convergence of Pade approximants / 70 4.8 Formal orthogonality property / 72 5 Moment theory and orthogonal functions / 77 5.1 Moment theory / 77 5.2 Stieltjes transforms / 85 5.3 Construction of solutions / 90 5.4 Orthogonal polynomials / 91 5.5 Monic orthogonal polynomials on $mathbb R$ and J-fractions / 92 5.6 Szego polynomials and PPC-fractions / 100 5.7 Orthogonal Laurent polynomials and APT-fractions / 102 Part II: Numerics 6 Continued fraction construction / 107 6.1 Regular C-fractions / 107 6.2 C-fractions / 113 6.3 S-fractions / 114 6.4 P-fractions / 114 6.5 J-fractions / 120 6.6 M-fractions / 122 6.7 Positive T-fractions / 124 6.8 Thiele fractions / 125 7 Truncation error bounds / 129 7.1 Parabola theorems / 129 7.2 The oval sequence theorem / 131 7.3 The interval sequence theorem / 136 7.4 Specific a priori bounds for S-fractions / 138 7.5 A posteriori truncation error bounds / 140 7.6 Tails and truncation error bounds / 143 7.7 Choice of modification / 143 8 Continued fraction evaluation / 149 8.1 The effect of finite precision arithmetic / 149 8.2 Evaluation of approximants / 152 8.3 The forward recurrence and minimal solutions / 154 8.4 Round-off error in the backward recurrence / 156 Part III: Special Functions 9 On tables and graphs / 163 9.1 Introduction / 163 9.2 Comparative tables / 163 9.3 Reliable graphs / 168 10 Mathematical constants / 175 10.1 Regular continued fractions / 175 10.2 Archimedes' constant, symbol $pi $ / 176 10.3 Euler's number, base of the natural logarithm / 178 10.4 Integer powers and roots of $pi $ and $e$ / 180 10.5 The natural logarithm, $ln (2)$ / 181 10.6 Pythagoras' constant, the square root of two / 183 10.7 The cube root of two / 183 10.8 Euler's constant, symbol $gamma $ / 185 10.9 Golden ratio, symbol $phi $ / 185 10.10 The rabbit constant, symbol $rho $ / 186 10.11 Apery's constant, $zeta (3)$ / 188 10.12 Catalan's constant, symbol $C$ / 189 10.13 Gompertz' constant, symbol $G$ / 190 10.14 Khinchin's constant, symbol $K$ / 190 11 Elementary functions / 193 11.1 The exponential function / 193 11.2 The natural logarithm / 196 11.3 Trigonometric functions / 200 11.4 Inverse trigonometric functions / 204 11.5 Hyperbolic functions / 210 11.6 Inverse hyperbolic functions / 213 11.7 The power function / 217 12 Gamma function and related functions / 221 12.1 Gamma function / 221 12.2 Binet function / 224 12.3 Polygamma functions / 229 12.4 Trigamma function / 232 12.5 Tetragamma function / 235 12.6 Incomplete gamma functions / 238 13 Error function and related integrals / 253 13.1 Error function and Dawson's integral / 253 13.2 Complementary and complex error function / 261 13.3 Repeated integrals / 268 13.4 Fresnel integrals / 269 14 Exponential integrals and related functions / 275 14.7 Exponential integrals / 275 14.2 Related functions / 285 15 Hypergeometric functions / 291 15.1 Definition and basic properties / 291 15.2 Stieltjes transform / 295 15.3 Continued fraction representations / 295 15.4 Pade approximants / 309 15.5 Monotonicity properties / 313 15.6 Hypergeometric series $_pF_q$ / 315 16 Confluent hypergeometric functions / 319 16.1 Kummer functions / 319 16.2 Confluent hypergeometric series $_2F_0$ / 330 16.3 Confluent hypergeometric limit function / 333 16.4 Whittaker functions / 334 16.5 Parabolic cylinder functions / 337 17 Bessel functions / 334 17.7 Bessel functions / 334 17.2 Modified Bessel functions / 356 18 Probability functions / 371 18.1 Definitions and elementary properties / 371 18.2 Normal and log-normal distributions / 373 18.3 Repeated integrals / 377 18.4 Gamma and chi-square distribution / 378 18.5 Beta, $F$- and Student's $t$-distributions / 382 19 Basic hypergeometric functions / 391 19.1 Definition and basic properties / 391 19.2 Continued fraction representations / 395 19.3 Higher order basic hypergeometric functions / 399 Bibliography / 401 Index / 421

shortTOC:
General considerations Part 1, Basic Theory 1. Basics 2. Continued fraction representation of functions 3. Convergence criteria 4. Pade approximants 5. Moment theory and orthogonal functions Part 2, Numerics 6. Continued fraction construction 7. Truncation error bounds 8. Continued fraction evaluation Part 3, Special Functions 9. On tables and graphs 10. Mathematical constants 11. Elementary functions 12. Gamma function and related functions 13. Error function and related integrals 14. Exponential integrals and related functions 15. Hypergeometric functions 16. Confluent hypergeometric functions, 17. Bessel functions 18. Probability functions 19. Basic hypergeometric functions

rawshortTOC:
General considerations \\ Part 1, Basic Theory \\ 1. Basics \\ 2. Continued fraction representation of functions \\ 3. Convergence criteria \\ 4. Pade approximants \\ 5. Moment theory and orthogonal functions \\ Part 2, Numerics \\ 6. Continued fraction construction \\ 7. Truncation error bounds \\ 8. Continued fraction evaluation \\ Part 3, Special Functions \\ 9. On tables and graphs \\ 10. Mathematical constants \\ 11. Elementary functions \\ 12. Gamma function and related functions \\ 13. Error function and related integrals \\ 14. Exponential integrals and related functions \\ 15. Hypergeometric functions \\ 16. Confluent hypergeometric functions, \\ 17. Bessel functions \\ 18. Probability functions \\ 19. Basic hypergeometric functions

rawTOC:
Preface / xi \\ Notation / xiii \\ 0 General considerations \\ / 1 \\ 0.1 Part one / 1 \\ 0.2 Part two / 2 \\ 0.3 Part three / 2 \\ \\ Part I: Basic Theory \\ \\ 1 Basics / 9 \\ 1.1 Symbols and notation \\ 1.2 Definitions / 10 \\ 1.3 Recurrence relations / 13 \\ 1.4 Equivalence transformations / 15 \\ 1.5 Contractions and extensions / 16 \\ 1.6 Continued fractions with prescribed approximants / 18 \\ 1.7 Connection between continued fractions and series / 19 \\ 1.8 Periodic and limit periodic continued fractions / 21 \\ 1.9 Tails of continued fractions / 23 \\ 1.10 Continued fractions over normed fields / 26 \\ 1.11 Generalisations of continued fractions / 28 \\ \\ 2 Continued fraction representation of functions / 29 \\ 2.1 Symbols and notation / 29 \\ 2.2 Correspondence / 30 \\ 2.3 Families of continued fractions / 35 \\ 2.4 Correspondence of C-fractions / 39 \\ 2.5 Correspondence of P-fractions / 40 \\ 2.6 Correspondence of J-fractions and T-fractions / 41 \\ 2.7 Correspondence and three-term recurrences / 42 \\ \\ 3 Convergence criteria / 45 \\ 3.1 Some classical theorems / 45 \\ 3.2 Convergence sets and value sets / 47 \\ 3.3 Parabola and oval theorems / 49 \\ 3.4 Correspondence and uniform convergence / 52 \\ 3.5 Periodic and limit periodic continued fractions / 53 \\ 3.6 Convergence and minimal solutions / 56 \\ \\ 4 Pad{\'e} approximants / 59 \\ 4.1 Definition and notation / 59 \\ 4.2 Fundamental properties / 60 \\ 4.3 Connection with regular C-fractions / 64 \\ 4.4 Connection with P-fractions / 65 \\ 4.5 Extension of the Pad{\'e} table / 67 \\ 4.6 Connection with M-fractions and the M-table / 68 \\ 4.7 Convergence of Pad{\'e} approximants / 70 \\ 4.8 Formal orthogonality property / 72 \\ \\ 5 Moment theory and orthogonal functions / 77 \\ 5.1 Moment theory / 77 \\ 5.2 Stieltjes transforms / 85 \\ 5.3 Construction of solutions / 90 \\ 5.4 Orthogonal polynomials / 91 \\ 5.5 Monic orthogonal polynomials on $\mathbb{R}$ and J-fractions / 92 \\ 5.6 Szeg{\H{o}} polynomials and PPC-fractions / 100 \\ 5.7 Orthogonal Laurent polynomials and APT-fractions / 102 \\ \\ Part II: Numerics \\ \\ 6 Continued fraction construction / 107 \\ 6.1 Regular C-fractions / 107 \\ 6.2 C-fractions / 113 \\ 6.3 S-fractions / 114 \\ 6.4 P-fractions / 114 \\ 6.5 J-fractions / 120 \\ 6.6 M-fractions / 122 \\ 6.7 Positive T-fractions / 124 \\ 6.8 Thiele fractions / 125 \\ \\ 7 Truncation error bounds / 129 \\ 7.1 Parabola theorems / 129 \\ 7.2 The oval sequence theorem / 131 \\ 7.3 The interval sequence theorem / 136 \\ 7.4 Specific a priori bounds for S-fractions / 138 \\ 7.5 A posteriori truncation error bounds / 140 \\ 7.6 Tails and truncation error bounds / 143 \\ 7.7 Choice of modification / 143 \\ \\ 8 Continued fraction evaluation / 149 \\ 8.1 The effect of finite precision arithmetic / 149 \\ 8.2 Evaluation of approximants / 152 \\ 8.3 The forward recurrence and minimal solutions / 154 \\ 8.4 Round-off error in the backward recurrence / 156 \\ \\ Part III: Special Functions \\ \\ 9 On tables and graphs / 163 \\ 9.1 Introduction / 163 \\ 9.2 Comparative tables / 163 \\ 9.3 Reliable graphs / 168 \\ \\ 10 Mathematical constants / 175 \\ 10.1 Regular continued fractions / 175 \\ 10.2 Archimedes' constant, symbol $\pi$ / 176 \\ 10.3 Euler's number, base of the natural logarithm / 178 \\ 10.4 Integer powers and roots of $\pi$ and $e$ / 180 \\ 10.5 The natural logarithm, $\ln(2)$ / 181 \\ 10.6 Pythagoras' constant, the square root of two / 183 \\ 10.7 The cube root of two / 183 \\ 10.8 Euler's constant, symbol $\gamma$ / 185 \\ 10.9 Golden ratio, symbol $\phi$ / 185 \\ 10.10 The rabbit constant, symbol $\rho$ / 186 \\ 10.11 Ap{\'e}ry's constant, $\zeta(3)$ / 188 \\ 10.12 Catalan's constant, symbol $C$ / 189 \\ 10.13 Gompertz' constant, symbol $G$ / 190 \\ 10.14 Khinchin's constant, symbol $K$ / 190 \\ \\ 11 Elementary functions / 193 \\ 11.1 The exponential function / 193 \\ 11.2 The natural logarithm / 196 \\ 11.3 Trigonometric functions / 200 \\ 11.4 Inverse trigonometric functions / 204 \\ 11.5 Hyperbolic functions / 210 \\ 11.6 Inverse hyperbolic functions / 213 \\ 11.7 The power function / 217 \\ \\ 12 Gamma function and related functions / 221 \\ 12.1 Gamma function / 221 \\ 12.2 Binet function / 224 \\ 12.3 Polygamma functions / 229 \\ 12.4 Trigamma function / 232 \\ 12.5 Tetragamma function / 235 \\ 12.6 Incomplete gamma functions / 238 \\ \\ 13 Error function and related integrals / 253 \\ 13.1 Error function and Dawson's integral / 253 \\ 13.2 Complementary and complex error function / 261 \\ 13.3 Repeated integrals / 268 \\ 13.4 Fresnel integrals / 269 \\ \\ 14 Exponential integrals and related functions / 275 \\ 14.7 Exponential integrals / 275 \\ 14.2 Related functions / 285 \\ \\ 15 Hypergeometric functions / 291 \\ 15.1 Definition and basic properties / 291 \\ 15.2 Stieltjes transform / 295 \\ 15.3 Continued fraction representations / 295 \\ 15.4 Pad{\'e} approximants / 309 \\ 15.5 Monotonicity properties / 313 \\ 15.6 Hypergeometric series $_pF_q$ / 315 \\ \\ 16 Confluent hypergeometric functions / 319 \\ 16.1 Kummer functions / 319 \\ 16.2 Confluent hypergeometric series $_2F_0$ / 330 \\ 16.3 Confluent hypergeometric limit function / 333 \\ 16.4 Whittaker functions / 334 \\ 16.5 Parabolic cylinder functions / 337 \\ \\ 17 Bessel functions / 334 \\ 17.7 Bessel functions / 334 \\ 17.2 Modified Bessel functions / 356 \\ \\ 18 Probability functions / 371 \\ 18.1 Definitions and elementary properties / 371 \\ 18.2 Normal and log-normal distributions / 373 \\ 18.3 Repeated integrals / 377 \\ 18.4 Gamma and chi-square distribution / 378 \\ 18.5 Beta, $F$- and Student's $t$-distributions / 382 \\ \\ 19 Basic hypergeometric functions / 391 \\ 19.1 Definition and basic properties / 391 \\ 19.2 Continued fraction representations / 395 \\ 19.3 Higher order basic hypergeometric functions / 399 \\ \\ Bibliography / 401 \\ \\ Index / 421

entry:
@Book{Cuyt:2008:HCF,
  author =       "Annie Cuyt and Vigdis B. Petersen and Brigitte Verdonk
                 and Haakon Waadeland and William B. Jones",
  title =        "Handbook of Continued Fractions for Special
                 Functions",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xx + 440",
  year =         "2008",
  DOI =          "https://doi.org/10.1007/978-1-4020-6949-9",
  ISBN =         "1-4020-6948-0",
  ISBN-13 =      "978-1-4020-6948-2",
  LCCN =         "QA295 .H275 2008",
  bibdate =      "Tue Jun 24 07:17:37 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  keywords =     "applying the limit process; associated continued
                 fraction; asymptotic series expansion; basic
                 hypergeometric functions; canonical contraction;
                 combination with property; complementary incomplete
                 gamma function; complex error function; confluent
                 hypergeometric series; continued fraction converges;
                 continued fraction representations; fraction
                 approximants; modified approximant; monic orthogonal
                 polynomial sequence; normed field; nth approximant; nth
                 denominator; nth numerator; nth tail; oval sequence
                 theorem; parabola theorem; partial numerators; strong
                 moment distribution function; successive approximants;
                 truncation error bounds",
  shorttableofcontents = "General considerations \\
                 Part 1, Basic Theory \\
                 1. Basics \\
                 2. Continued fraction representation of functions \\
                 3. Convergence criteria \\
                 4. Pade approximants \\
                 5. Moment theory and orthogonal functions \\
                 Part 2, Numerics \\
                 6. Continued fraction construction \\
                 7. Truncation error bounds \\
                 8. Continued fraction evaluation \\
                 Part 3, Special Functions \\
                 9. On tables and graphs \\
                 10. Mathematical constants \\
                 11. Elementary functions \\
                 12. Gamma function and related functions \\
                 13. Error function and related integrals \\
                 14. Exponential integrals and related functions \\
                 15. Hypergeometric functions \\
                 16. Confluent hypergeometric functions, \\
                 17. Bessel functions \\
                 18. Probability functions \\
                 19. Basic hypergeometric functions",
  tableofcontents = "Preface / xi \\
                 Notation / xiii \\
                 0 General considerations \\
                 / 1 \\
                 0.1 Part one / 1 \\
                 0.2 Part two / 2 \\
                 0.3 Part three / 2 \\
                 \\
                 Part I: Basic Theory \\
                 \\
                 1 Basics / 9 \\
                 1.1 Symbols and notation \\
                 1.2 Definitions / 10 \\
                 1.3 Recurrence relations / 13 \\
                 1.4 Equivalence transformations / 15 \\
                 1.5 Contractions and extensions / 16 \\
                 1.6 Continued fractions with prescribed approximants /
                 18 \\
                 1.7 Connection between continued fractions and series /
                 19 \\
                 1.8 Periodic and limit periodic continued fractions /
                 21 \\
                 1.9 Tails of continued fractions / 23 \\
                 1.10 Continued fractions over normed fields / 26 \\
                 1.11 Generalisations of continued fractions / 28 \\
                 \\
                 2 Continued fraction representation of functions / 29
                 \\
                 2.1 Symbols and notation / 29 \\
                 2.2 Correspondence / 30 \\
                 2.3 Families of continued fractions / 35 \\
                 2.4 Correspondence of C-fractions / 39 \\
                 2.5 Correspondence of P-fractions / 40 \\
                 2.6 Correspondence of J-fractions and T-fractions / 41
                 \\
                 2.7 Correspondence and three-term recurrences / 42 \\
                 \\
                 3 Convergence criteria / 45 \\
                 3.1 Some classical theorems / 45 \\
                 3.2 Convergence sets and value sets / 47 \\
                 3.3 Parabola and oval theorems / 49 \\
                 3.4 Correspondence and uniform convergence / 52 \\
                 3.5 Periodic and limit periodic continued fractions /
                 53 \\
                 3.6 Convergence and minimal solutions / 56 \\
                 \\
                 4 Pad{\'e} approximants / 59 \\
                 4.1 Definition and notation / 59 \\
                 4.2 Fundamental properties / 60 \\
                 4.3 Connection with regular C-fractions / 64 \\
                 4.4 Connection with P-fractions / 65 \\
                 4.5 Extension of the Pad{\'e} table / 67 \\
                 4.6 Connection with M-fractions and the M-table / 68
                 \\
                 4.7 Convergence of Pad{\'e} approximants / 70 \\
                 4.8 Formal orthogonality property / 72 \\
                 \\
                 5 Moment theory and orthogonal functions / 77 \\
                 5.1 Moment theory / 77 \\
                 5.2 Stieltjes transforms / 85 \\
                 5.3 Construction of solutions / 90 \\
                 5.4 Orthogonal polynomials / 91 \\
                 5.5 Monic orthogonal polynomials on $\mathbb{R}$ and
                 J-fractions / 92 \\
                 5.6 Szeg{\H{o}} polynomials and PPC-fractions / 100 \\
                 5.7 Orthogonal Laurent polynomials and APT-fractions /
                 102 \\
                 \\
                 Part II: Numerics \\
                 \\
                 6 Continued fraction construction / 107 \\
                 6.1 Regular C-fractions / 107 \\
                 6.2 C-fractions / 113 \\
                 6.3 S-fractions / 114 \\
                 6.4 P-fractions / 114 \\
                 6.5 J-fractions / 120 \\
                 6.6 M-fractions / 122 \\
                 6.7 Positive T-fractions / 124 \\
                 6.8 Thiele fractions / 125 \\
                 \\
                 7 Truncation error bounds / 129 \\
                 7.1 Parabola theorems / 129 \\
                 7.2 The oval sequence theorem / 131 \\
                 7.3 The interval sequence theorem / 136 \\
                 7.4 Specific a priori bounds for S-fractions / 138 \\
                 7.5 A posteriori truncation error bounds / 140 \\
                 7.6 Tails and truncation error bounds / 143 \\
                 7.7 Choice of modification / 143 \\
                 \\
                 8 Continued fraction evaluation / 149 \\
                 8.1 The effect of finite precision arithmetic / 149 \\
                 8.2 Evaluation of approximants / 152 \\
                 8.3 The forward recurrence and minimal solutions / 154
                 \\
                 8.4 Round-off error in the backward recurrence / 156
                 \\
                 \\
                 Part III: Special Functions \\
                 \\
                 9 On tables and graphs / 163 \\
                 9.1 Introduction / 163 \\
                 9.2 Comparative tables / 163 \\
                 9.3 Reliable graphs / 168 \\
                 \\
                 10 Mathematical constants / 175 \\
                 10.1 Regular continued fractions / 175 \\
                 10.2 Archimedes' constant, symbol $\pi$ / 176 \\
                 10.3 Euler's number, base of the natural logarithm /
                 178 \\
                 10.4 Integer powers and roots of $\pi$ and $e$ / 180
                 \\
                 10.5 The natural logarithm, $\ln(2)$ / 181 \\
                 10.6 Pythagoras' constant, the square root of two / 183
                 \\
                 10.7 The cube root of two / 183 \\
                 10.8 Euler's constant, symbol $\gamma$ / 185 \\
                 10.9 Golden ratio, symbol $\phi$ / 185 \\
                 10.10 The rabbit constant, symbol $\rho$ / 186 \\
                 10.11 Ap{\'e}ry's constant, $\zeta(3)$ / 188 \\
                 10.12 Catalan's constant, symbol $C$ / 189 \\
                 10.13 Gompertz' constant, symbol $G$ / 190 \\
                 10.14 Khinchin's constant, symbol $K$ / 190 \\
                 \\
                 11 Elementary functions / 193 \\
                 11.1 The exponential function / 193 \\
                 11.2 The natural logarithm / 196 \\
                 11.3 Trigonometric functions / 200 \\
                 11.4 Inverse trigonometric functions / 204 \\
                 11.5 Hyperbolic functions / 210 \\
                 11.6 Inverse hyperbolic functions / 213 \\
                 11.7 The power function / 217 \\
                 \\
                 12 Gamma function and related functions / 221 \\
                 12.1 Gamma function / 221 \\
                 12.2 Binet function / 224 \\
                 12.3 Polygamma functions / 229 \\
                 12.4 Trigamma function / 232 \\
                 12.5 Tetragamma function / 235 \\
                 12.6 Incomplete gamma functions / 238 \\
                 \\
                 13 Error function and related integrals / 253 \\
                 13.1 Error function and Dawson's integral / 253 \\
                 13.2 Complementary and complex error function / 261 \\
                 13.3 Repeated integrals / 268 \\
                 13.4 Fresnel integrals / 269 \\
                 \\
                 14 Exponential integrals and related functions / 275
                 \\
                 14.7 Exponential integrals / 275 \\
                 14.2 Related functions / 285 \\
                 \\
                 15 Hypergeometric functions / 291 \\
                 15.1 Definition and basic properties / 291 \\
                 15.2 Stieltjes transform / 295 \\
                 15.3 Continued fraction representations / 295 \\
                 15.4 Pad{\'e} approximants / 309 \\
                 15.5 Monotonicity properties / 313 \\
                 15.6 Hypergeometric series $_pF_q$ / 315 \\
                 \\
                 16 Confluent hypergeometric functions / 319 \\
                 16.1 Kummer functions / 319 \\
                 16.2 Confluent hypergeometric series $_2F_0$ / 330 \\
                 16.3 Confluent hypergeometric limit function / 333 \\
                 16.4 Whittaker functions / 334 \\
                 16.5 Parabolic cylinder functions / 337 \\
                 \\
                 17 Bessel functions / 334 \\
                 17.7 Bessel functions / 334 \\
                 17.2 Modified Bessel functions / 356 \\
                 \\
                 18 Probability functions / 371 \\
                 18.1 Definitions and elementary properties / 371 \\
                 18.2 Normal and log-normal distributions / 373 \\
                 18.3 Repeated integrals / 377 \\
                 18.4 Gamma and chi-square distribution / 378 \\
                 18.5 Beta, $F$- and Student's $t$-distributions / 382
                 \\
                 \\
                 19 Basic hypergeometric functions / 391 \\
                 19.1 Definition and basic properties / 391 \\
                 19.2 Continued fraction representations / 395 \\
                 19.3 Higher order basic hypergeometric functions / 399
                 \\
                 \\
                 Bibliography / 401 \\
                 \\
                 Index / 421",
}


bibtype: article
filename: master.bib
label: Cybenko:perfect
author: George Cybenko
title: Supercomputer Performance Trends and the Perfect Benchmarks
journal: j-SR
volume: 4
number: 4
pages: 53--60
month: apr
monthnumber: 4
year: 1991
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: George Cybenko
rawtitle: Supercomputer Performance Trends and the {Perfect Benchmarks}
entry:
@Article{Cybenko:perfect,
  author =       "George Cybenko",
  title =        "Supercomputer Performance Trends and the {Perfect
                 Benchmarks}",
  journal =      j-SR,
  volume =       "4",
  number =       "4",
  pages =        "53--60",
  month =        apr,
  year =         "1991",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: daCruz:1987:KFT
author: Frank da Cruz
title: Kermit: a File Transfer Protocol
publisher: pub-DP
address: pub-DP:adr
pages: xvii + 379
year: 1987
ISBN: 0-932376-88-6 OR 0932376886
ISBN13: 978-0-932376-88-6 OR 9780932376886
LCCN: TK5105.5 .D23 1987
bibdate: Tue Dec 14 22:44:57 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:44:57 ???
acknowledgement: ack-nhfb
rawauthor: Frank {da Cruz}
rawtitle: {Kermit}: a File Transfer Protocol
entry:
@Book{daCruz:1987:KFT,
  author =       "Frank {da Cruz}",
  title =        "{Kermit}: a File Transfer Protocol",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  pages =        "xvii + 379",
  year =         "1987",
  ISBN =         "0-932376-88-6",
  ISBN-13 =      "978-0-932376-88-6",
  LCCN =         "TK5105.5 .D23 1987",
  bibdate =      "Tue Dec 14 22:44:57 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: daCruz:1993:UCK
author: Frank da Cruz and Christine M. Gianone
title: Using C-Kermit
publisher: pub-DP
address: pub-DP:adr
pages: xxi + 514
year: 1993
ISBN: 1-55558-108-0 (DP), 0-13-037490-3 (PH) OR 1555581080 (DP), 0130374903 (PH)
ISBN13: 978-1-55558-108-4 (DP), 978-0-13-037490-5 (PH) OR 9781555581084 (DP), 9780130374905 (PH)
LCCN: TK5105.9.D33 1993
bibdate: Thu Aug 14 11:20:13 1997
bibtimestamp: 1997.08.14 11:20:13 ???
note: Available in German translation cite daCruz:1996:CKE.
subject: C-Kermit; Communications software
acknowledgement: ack-nhfb
rawauthor: Frank {da Cruz} and Christine M. Gianone
rawnote: Available in German translation \cite{daCruz:1996:CKE}.
rawtitle: Using {C-Kermit}
bibsource:
https://www.math.utah.edu/pub/tex/bib/internet.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

TOC:
1. Introduction 2. Running C-Kermit 3. Getting Connected 4. Terminal Connection 5. The Basics of File Transfer 6. Solving File Transfer Problems 7. Using a Kermit Server 8. File Transfer Power Tools 9. International Character Sets 10. Transferring Files without the Kermit Protocol 11. Command Files, Macros, and Variables 12. Programming Commands 13. Script Programming 14. Command-Line Options Appendix I: C-Kermit Command Reference Appendix II: A Condensed Guide to Serial Data Communications Appendix III: UNIX C-Kermit Appendix IV: VMS C-Kermit Appendix V: OS/2 C-Kermit Appendix VI: AOS/VS C-Kermit Appendix VII: Other C-Kermit Versions Appendix VIII: Character Set Tables Appendix IX: DOS/UNIX File Conversion Script Appendix X: Hexification Programs Appendix XI: Shift-In/Shift Out Filter

rawTOC:
1. Introduction \\ 2. Running C-Kermit \\ 3. Getting Connected \\ 4. Terminal Connection \\ 5. The Basics of File Transfer \\ 6. Solving File Transfer Problems \\ 7. Using a Kermit Server \\ 8. File Transfer Power Tools \\ 9. International Character Sets \\ 10. Transferring Files without the Kermit Protocol \\ 11. Command Files, Macros, and Variables \\ 12. Programming Commands \\ 13. Script Programming \\ 14. Command-Line Options \\ Appendix I: C-Kermit Command Reference \\ Appendix II: A Condensed Guide to Serial Data Communications \\ Appendix III: UNIX C-Kermit \\ Appendix IV: VMS C-Kermit \\ Appendix V: OS/2 C-Kermit \\ Appendix VI: AOS/VS C-Kermit \\ Appendix VII: Other C-Kermit Versions \\ Appendix VIII: Character Set Tables \\ Appendix IX: DOS/UNIX File Conversion Script \\ Appendix X: Hexification Programs \\ Appendix XI: Shift-In/Shift Out Filter

entry:
@Book{daCruz:1993:UCK,
  author =       "Frank {da Cruz} and Christine M. Gianone",
  title =        "Using {C-Kermit}",
  publisher =    pub-DP # " and " # pub-PH,
  address =      pub-DP:adr # " and " # pub-PH:adr,
  pages =        "xxi + 514",
  year =         "1993",
  ISBN =         "1-55558-108-0 (DP), 0-13-037490-3 (PH)",
  ISBN-13 =      "978-1-55558-108-4 (DP), 978-0-13-037490-5 (PH)",
  LCCN =         "TK5105.9.D33 1993",
  bibdate =      "Thu Aug 14 11:20:13 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/internet.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "Available in German translation
                 \cite{daCruz:1996:CKE}.",
  acknowledgement = ack-nhfb,
  subject =      "C-Kermit; Communications software",
  tableofcontents = "1. Introduction \\
                 2. Running C-Kermit \\
                 3. Getting Connected \\
                 4. Terminal Connection \\
                 5. The Basics of File Transfer \\
                 6. Solving File Transfer Problems \\
                 7. Using a Kermit Server \\
                 8. File Transfer Power Tools \\
                 9. International Character Sets \\
                 10. Transferring Files without the Kermit Protocol \\
                 11. Command Files, Macros, and Variables \\
                 12. Programming Commands \\
                 13. Script Programming \\
                 14. Command-Line Options \\
                 Appendix I: C-Kermit Command Reference \\
                 Appendix II: A Condensed Guide to Serial Data
                 Communications \\
                 Appendix III: UNIX C-Kermit \\
                 Appendix IV: VMS C-Kermit \\
                 Appendix V: OS/2 C-Kermit \\
                 Appendix VI: AOS/VS C-Kermit \\
                 Appendix VII: Other C-Kermit Versions \\
                 Appendix VIII: Character Set Tables \\
                 Appendix IX: DOS/UNIX File Conversion Script \\
                 Appendix X: Hexification Programs \\
                 Appendix XI: Shift-In/Shift Out Filter",
}


bibtype: book
filename: master.bib
label: daCruz:1996:CKE
author: Frank da Cruz and Christine M. Gianone
title: C-Kermit: Einfuhrung und Referenz
publisher: pub-HEINZ-HEISE
address: pub-HEINZ-HEISE:adr
pages: 557
year: 1996
ISBN: 3-88229-023-4 OR 3882290234
ISBN13: 978-3-88229-023-3 OR 9783882290233
bibdate: Thu Aug 14 11:17:19 1997
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 1997.08.14 11:17:19 ???
note: German translation of cite daCruz:1993:UCK.
URL: http://www.emedia.de/bin/bookshop?show=3401&id=
acknowledgement: ack-nhfb
rawauthor: Frank {da Cruz} and Christine M. Gianone
rawnote: German translation of \cite{daCruz:1993:UCK}.
rawtitle: {C-Kermit: Einf{\"u}hrung und Referenz}
entry:
@Book{daCruz:1996:CKE,
  author =       "Frank {da Cruz} and Christine M. Gianone",
  title =        "{C-Kermit: Einf{\"u}hrung und Referenz}",
  publisher =    pub-HEINZ-HEISE,
  address =      pub-HEINZ-HEISE:adr,
  pages =        "557",
  year =         "1996",
  ISBN =         "3-88229-023-4",
  ISBN-13 =      "978-3-88229-023-3",
  LCCN =         "????",
  bibdate =      "Thu Aug 14 11:17:19 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "German translation of \cite{daCruz:1993:UCK}.",
  price =        "88,00 DM",
  URL =          "http://www.emedia.de/bin/bookshop?show=3401&id=",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library",
}


bibtype: book
filename: master.bib
label: daCruz:1997:UCK
author: Frank da Cruz and Christine M. Gianone
title: Using C-Kermit
publisher: pub-DP
address: pub-DP:adr
edition: Second
pages: xxii + 662
year: 1997
ISBN: 1-55558-164-1 OR 1555581641
ISBN13: 978-1-55558-164-0 OR 9781555581640
LCCN: TK5105.9.D33 1997
bibdate: Thu Jan 13 14:33:16 2000
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2000.01.13 14:33:16 ???
acknowledgement: ack-nhfb
rawauthor: Frank {da Cruz} and Christine M. Gianone
rawtitle: Using {C-Kermit}
entry:
@Book{daCruz:1997:UCK,
  author =       "Frank {da Cruz} and Christine M. Gianone",
  title =        "Using {C-Kermit}",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  edition =      "Second",
  pages =        "xxii + 662",
  year =         "1997",
  ISBN =         "1-55558-164-1",
  ISBN-13 =      "978-1-55558-164-0",
  LCCN =         "TK5105.9.D33 1997",
  bibdate =      "Thu Jan 13 14:33:16 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Dahlquist:1974:NM
author: Germund Dahlquist and AA ke Bjorck and Ned Anderson
title: Numerical Methods
publisher: pub-PH
address: pub-PH:adr
pages: xviii + 573
year: 1974
ISBN: 0-13-627315-7 OR 0136273157
ISBN13: 978-0-13-627315-8 OR 9780136273158
LCCN: QA297 .D131 1969
bibdate: Tue Dec 14 22:44:59 1993
bibtimestamp: 1993.12.14 22:44:59 ???
note: Translated by Ned Anderson.
series: Prentice-Hall Series in Automatic Computation
acknowledgement: ack-nhfb
rawauthor: Germund Dahlquist and {\AA}ke Bj{\"o}rck and Ned Anderson
rawnote: Translated by Ned Anderson.
rawtitle: Numerical Methods
bibsource:
https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib; https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/prng.bib

TOC:
Preface / xvii Conventions / xix 1: Some General Principles of Numerical Calculation / 1 1.1. Introduction / 1 1.2. Some Common Ideas and Concepts in Numerical Methods / 2 1.3. Numerical Problems and Algorithms / 13 1.3.1. Definitions / 13 1.3.2. Recursive Formulas; Homer's Rule / 14 1.3.3. An Example of Numerical Instability / 16 2: How to Obtain and Estimate Accuracy in Numerical Calculations / 21 2.1. Basic Concepts in Error Estimation / 21 2.1.1. Introduction / 21 2.1.2. Sources of Error / 22 2.1.3. Absolute and Relative Errors / 23 2.1.4. Rounding and Chopping / 24 2.2 Propagation of Errors / 26 2.2.1. Simple Examples of Error Analysis / 26 2.2.2. The General Formula for Error Propagation; Maximum Error and Standard Error / 29 2.2.3. On the Practical Application of Error Estimation / 34 2.2.4. The Use of Experimental Perturbations / 36 2.2.5. Automatic Control of Accuracy / 37 2.3. Number Systems; Floating and Fixed Representation / 42 2.3.1. The Position System / 42 2.3.2. Floating and Fixed Representation / 43 2.3.3. Floating Decimal Point / 44 2.3.4. Fixed Decimal Point / 46 2.3.5. Round-off Errors in Computation with Floating Arithmetic Operations / 46 2.4. Backward Error Analysis; Condition Numbers / 51 2.4.1. Backward Error Analysis / 51 2.4.2. Condition Numbers for Problems and Algorithms / 53 2.4.3. Geometrical Illustration of Error Analysis / 56 3: Numerical Uses of Series / 60 3.1. Elementary Uses of Series / 60 3.1.1. Simple Examples / 60 3.1.2. Estimating the Remainder / 62 3.1.3. Power Series / 65 3.2. Acceleration of Convergence / 71 3.2.1. Slowly Converging Alternating Series / 71 3.2.2. Slowly Converging Series with Positive Terms / 73 3.2.3. Other Simple Ways to Accelerate Convergence / 74 3.2.4. Ill-Conditioned Series / 75 3.2.5. Numerical Use of Divergent Series / 77 4: Approximation of Functions / 81 4.1. Basic Concepts in Approximation / 81 4.1.1. Introduction / 81 4.1.2. The Idea of a Function Space / 84 4.1.3. Norms and Seminorms / 85 4.1.4. Approximation of Functions as a Geometric Problem in Function Space / 87 4.2. The Approximation of Functions by the Method of Least Squares / 88 4.2.t. Statement of the Problems / 88 4.2.2. Orthogonal Systems / 89 4.2.3. Solution of the Approximation Problem / 92 4.3. Polynomials / 97 4.3.1. Basic Terminology; the Weierstrass Approximation Theorem / 97 4.3.2. Triangle Families of Polynomials / 98 4.3.3. A Triangle Family and Its Application to Interpolation / 99 4.3.4. Equidistant Interpolation and the Runge Phenomenon / 101 4.4. Orthogonal Polynomials and Applications / 104 4.4.1. Tchebycheff Polynomials / 104 4.4.2. Tchebycheff Interpolation and Smoothing / 106 4.4.3. General Theory of Orthogonal Polynomials / 108 4.4.4. Legendre Polynomials and Gram Polynomials / 113 4.5. Complementary Observations on Polynomial Approximation / 117 4.5.1. Summary of the Use of Polynomials / 117 4.5.2. Some Inequalities for $E_n(f)$ with Applications to the Computation of Linear Functionals / 120 4.5.3. Approximation in the Maximum Norm / 124 4.5.4. Economization of Power Series; Standard Functions / 125 4.5.5. Some Statistical Aspects of the Method of Least Squares / 126 4.6. Spline Functions / 131 5: Numerical Linear Algebra / 137 5,1. Introduction / 137 5.2. Basic Concepts of Linear Algebra / 138 5.2.1. Fundamental Definitions / 138 5.2.2. Partitioned Matrices / 140 5.2.3. Linear Vector Spaces / 141 5.2.4. Eigenvalues and Similarity Transformations / 142 5.2.5. Singular-Value Decomposition and Pseudo-Inverse / 143 5.3. Direct Methods for Solving Systems of Linear Equations / 146 5.3.1. Triangular Systems / 146 5.3.2. Gaussian Elimination / 147 5.3.3. Pivoting Strategies / 150 5.3.4. $L U$-Decomposition / 152 5.3.5. Compact Schemes for Gaussian Elimination / 157 5.3.6. Inverse Matrices / 159 5.4. Special Matrices / 162 5.4.1. Symmetric Positive-Definite Matrices / 162 5.4.2. Band Matrices / 165 5.4.3. Large-Scale Linear Systems / 168 5.4.4. Other Sparse Matrices / 169 5.5. Error Analysis for Linear Systems / 174 5.5.1. An Ill-Conditioned Example / 174 5.5.2. Vector and Matrix Norms / 175 5.5.3. Perturbation Analysis / 176 5.5.4. Rounding Errors in Gaussian Elimination / 177 5.5.5. Scaling of Linear Systems / 181 5.5.6. Iterative Improvement of a Solution / 183 5.6. Iterative Methods / 188 5.7. Overdetermined Linear Systems / 196 5.7.1. The Normal Equations / 197 5.7.2. Orthogonalization Methods / 201 5.7.3. Improvement of Least-Squares Solutions / 204 5.7.4. Least-Squares Problems with Linear Constraints / 205 5.8. Computation of Eigenvalues and Eigenvectors / 208 5.8.1. The Power Method / 209 5.8.2. Methods Based on Similarity Transformations / 211 5.8.3. Eigenvalues by Equation Solving / 215 5.8.4. The $Q R$-Algorithm / 216 6: Nonlinear Equations / 218 6.1. Introduction / 218 6.2. Initial Approximations; Starting Methods / 219 6.2.1. Introduction / 219 6.2.2. The Bisection Method / 220 6.3. Newton--Raphson's Method / 222 6.4. The Secant Method / 227 6.4.1. Description of the Method / 227 6.4.2. Error Analysis for the Secant Method / 228 6.4.3. Regula Falsi / 230 6.4.4. Other Related Methods / 230 6.5. General Theory of Iteration Methods / 233 6.6. Error Estimation and Attainable Accuracy in Iteration Methods / 238 6.6.1. Error Estimation / 238 6.6.2. Attainable Accuracy; Termination Criteria / 240 6.7. Multiple Roots / 242 6.8. Algebraic Equations / 243 6.8.1. Introduction / 243 6.8.2. Deflation / 245 6.8.3. Ill-Conditioned Algebraic Equations / 246 6.9. Systems of Nonlinear Equations / 248 6.9.1. Iteration / 249 6.9.2. Newton--Raphson's Method and Some Modifications / 249 6.9.3. Other Methods / 251 7: Finite Differences with Applications to Numerical Integration, Differentiation, and Interpolation / 255 7.1. Difference Operators and Their Simplest Properties / 255 7.2. Simple Methods for Deriving Approximation Formulas and Error Estimates / 263 7.2.1. Statement of the Problems and Some Typical Examples / 263 7.2.2, Repeated Richardson Extrapolation / 269 7.3. Interpolation / 275 7.3.1. Introduction / 275 7.3.2. When is Linear Interpolation Sufficient? / 276 7.3.3. Newton's General Interpolation Formula / 277 7.3.4. Formulas for Equidistant Interpolation / 279 7.3.5. Complementary Remarks on Interpolation / 282 7.3.6. Lagrange's Interpolation Formula / 284 7.3.7. Hermite Interpolation / 285 7.3.8. Inverse Interpolation / 286 7.4. Numerical Integration / 290 7.4.1. The Rectangle Rule, Trapezoidal Rule, and Romberg's Method / 291 7.4.2. The Truncation Error of the Trapezoidal Rule / 293 7.4.3. Some Difficulties and Possibilities in Numerical Integration / 294 7.4.4. The Euler--Maclaurin Summation Formula / 297 7.4.5. Uses of the Euler--Maclaurin Formula / 300 7.4.6. Other Methods for Numerical Integration / 302 7.5. Numerical Differentiation / 307 7.6. The Calculus of Operators / 311 7.6.1. Operator Algebra / 311 7.6.2. Operator Series with Applications / 312 7.7. Functions of Several Variables / 318 7.7.1. Working with One Variable at a Time / 319 7.7.2. Rectangular Grids / 319 7.7.3. Irregular Triangular Grids / 322 8: Differential Equations / 330 8.1. Theoretical Background / 330 8.1.1. Initial-Value Problems for Ordinary Differential Equations / 330 8.1.2. Error Propagation / 333 8.1.3. Other Differential Equation Problems / 337 8.2. Euler's Method, with Repeated Richardson Extrapolation / 338 8.3. Other Methods for Initial-Value Problems in Ordinary Differential Equations / 342 8.3.1. The Modified Midpoint Method / 342 8.3.2. The Power-Series Method / 345 8.3.3. Runge--Kutta Methods / 346 8.3.4. Implicit Methods / 347 8.3.5. Stiff Problems / 349 8.3.6. Control of Step Size / 350 8.3.7. A Finite-Difference Method for a Second-Order Equation / 352 8.4. Orientation on Boundary and Eigenvalue Problems for Ordinary Differential Equations / 359 8.4.1. Introduction / 359 8.4.2. The Shooting Method / 359 8.4.3. The Band Matrix Method / 361 8.4.4. Numerical Example of an Eigenvalue Problem / 363 8.5. Difference Equations / 367 8.5.1. Homogeneous Linear Difference Equations with Constant Coefficients / 368 8.5.2. General Linear Difference Equations / 370 8.5.3. Analysis of a Numerical Method with the Help of a Test Problem / 372 8.5.4. Linear Multistep Methods / 375 8.6. Partial Differential Equations / 383 8.6.1. Introduction / 383 8.6.2. An Example of an Initial-Value Problem / 384 8.6.3. An Example of a Boundary-Value Problem / 389 8.6.4. Methods of Undetermined Coefficients and Variational Methods / 392 8.6.5. Finite-Element Methods / 395 8.6.6. Integral Equations / 397 9: Fourier Methods / 405 9.1. Introduction / 405 9.2. Basic Formulas and Theorems in Fourier Analysis / 406 9.2.1. Functions of One Variable / 406 9.2.2. Functions of Several Variables / 411 9.3. Fast Fourier Analysis / 413 9.3.1. An Important Special Case / 413 9.3.2. Fast Fourier Analysis, General Case / 414 9.4. Periodic Continuation of a Nonperiodic Function / 417 9.5. The Fourier Integral Theorem / 419 10: Optimization / 422 10.1. Statement of the Problem, Definitions, and Normal Form / 422 10.2. The Simplex Method / 426 10.3. Duality / 435 10.4. The Transportation Problem and Some Other Optimization Problems / 436 10.5. Nonlinear Optimization Problems / 438 10.5.1. Basic Concepts and Introductory Examples / 438 10.5.2. Line Search / 440 10.5.3. Algorithms for Unconstrained Optimization / 441 10.5.4. Overdetermined Nonlinear Systems / 443 10.5.5. Constrained Optimization / 444 11: The Monte Carlo Method and Simulation / 448 11.1. Introduction / 448 11.2. Random Digits and Random Numbers / 449 11.3. Applications; Reduction of Variance / 455 11.4. Pseudorandom Numbers / 463 12: Solutions to Problems / 465 13: Bibliography and Published Algorithms / 536 13.1. Introduction / 536 13.2. General Literature in Numerical Analysis / 536 13.3. Tables, Collections of Formulas, and Problems / 539 13.4. Error Analysis and Approximation of Functions / 540 13.5. Linear Algebra and Nonlinear Systems of Equations / 541 13.6. Interpolation, Numerical Integration, and Numerical Treatment of Differential Equations / 543 13.7. Optimization; Simulation / 545 13.8. Reviews, Abstracts and Other Periodicals / 547 13.9. Survey of Published Algorithms / 548 Index by Subject to Algorithms, 1960--1970 / 548 Appendix Tables / 563 Index / 565

shortTOC:
1: Some General Principles of Numerical Calculation / 1 2: How to Obtain and Estimate Accuracy in Numerical Calculations / 21 3: Numerical Uses of Series / 60 4: Approximation of Functions / 81 5: Numerical Linear Algebra / 137 6: Nonlinear Equations / 218 7: Finite Differences with Applications to Numerical Integration, Differentiation, and Interpolation / 255 8: Differential Equations / 330 9: Fourier Methods / 405 10: Optimization / 422 11: The Monte Carlo Method and Simulation / 448 12: Solutions to Problems / 465 13: Bibliography and Published Algorithms / 536 Index by Subject to Algorithms, 1960--1970 / 548 Appendix Tables / 563 Index / 565

rawshortTOC:
1: Some General Principles of Numerical Calculation / 1 \\ 2: How to Obtain and Estimate Accuracy in Numerical Calculations / 21 \\ 3: Numerical Uses of Series / 60 \\ 4: Approximation of Functions / 81 \\ 5: Numerical Linear Algebra / 137 \\ 6: Nonlinear Equations / 218 \\ 7: Finite Differences with Applications to Numerical Integration, Differentiation, and Interpolation / 255 \\ 8: Differential Equations / 330 \\ 9: Fourier Methods / 405 \\ 10: Optimization / 422 \\ 11: The Monte Carlo Method and Simulation / 448 \\ 12: Solutions to Problems / 465 \\ 13: Bibliography and Published Algorithms / 536 \\ Index by Subject to Algorithms, 1960--1970 / 548 \\ Appendix Tables / 563 \\ Index / 565

rawTOC:
Preface / xvii \\ Conventions / xix \\ 1: Some General Principles of Numerical Calculation / 1 \\ 1.1. Introduction / 1 \\ 1.2. Some Common Ideas and Concepts in Numerical Methods / 2 \\ 1.3. Numerical Problems and Algorithms / 13 \\ 1.3.1. Definitions / 13 \\ 1.3.2. Recursive Formulas; Homer's Rule / 14 \\ 1.3.3. An Example of Numerical Instability / 16 \\ 2: How to Obtain and Estimate Accuracy in Numerical Calculations / 21 \\ 2.1. Basic Concepts in Error Estimation / 21 \\ 2.1.1. Introduction / 21 \\ 2.1.2. Sources of Error / 22 \\ 2.1.3. Absolute and Relative Errors / 23 \\ 2.1.4. Rounding and Chopping / 24 \\ 2.2 Propagation of Errors / 26 \\ 2.2.1. Simple Examples of Error Analysis / 26 \\ 2.2.2. The General Formula for Error Propagation; Maximum Error and Standard Error / 29 \\ 2.2.3. On the Practical Application of Error Estimation / 34 \\ 2.2.4. The Use of Experimental Perturbations / 36 \\ 2.2.5. Automatic Control of Accuracy / 37 \\ 2.3. Number Systems; Floating and Fixed Representation / 42 \\ 2.3.1. The Position System / 42 \\ 2.3.2. Floating and Fixed Representation / 43 \\ 2.3.3. Floating Decimal Point / 44 \\ 2.3.4. Fixed Decimal Point / 46 \\ 2.3.5. Round-off Errors in Computation with Floating Arithmetic Operations / 46 \\ 2.4. Backward Error Analysis; Condition Numbers / 51 \\ 2.4.1. Backward Error Analysis / 51 \\ 2.4.2. Condition Numbers for Problems and Algorithms / 53 \\ 2.4.3. Geometrical Illustration of Error Analysis / 56 \\ 3: Numerical Uses of Series / 60 \\ 3.1. Elementary Uses of Series / 60 \\ 3.1.1. Simple Examples / 60 \\ 3.1.2. Estimating the Remainder / 62 \\ 3.1.3. Power Series / 65 \\ 3.2. Acceleration of Convergence / 71 \\ 3.2.1. Slowly Converging Alternating Series / 71 \\ 3.2.2. Slowly Converging Series with Positive Terms / 73 \\ 3.2.3. Other Simple Ways to Accelerate Convergence / 74 \\ 3.2.4. Ill-Conditioned Series / 75 \\ 3.2.5. Numerical Use of Divergent Series / 77 \\ 4: Approximation of Functions / 81 \\ 4.1. Basic Concepts in Approximation / 81 \\ 4.1.1. Introduction / 81 \\ 4.1.2. The Idea of a Function Space / 84 \\ 4.1.3. Norms and Seminorms / 85 \\ 4.1.4. Approximation of Functions as a Geometric Problem in Function Space / 87 \\ 4.2. The Approximation of Functions by the Method of Least Squares / 88 \\ 4.2.t. Statement of the Problems / 88 \\ 4.2.2. Orthogonal Systems / 89 \\ 4.2.3. Solution of the Approximation Problem / 92 \\ 4.3. Polynomials / 97 \\ 4.3.1. Basic Terminology; the Weierstrass Approximation Theorem / 97 \\ 4.3.2. Triangle Families of Polynomials / 98 \\ 4.3.3. A Triangle Family and Its Application to Interpolation / 99 \\ 4.3.4. Equidistant Interpolation and the Runge Phenomenon / 101 \\ 4.4. Orthogonal Polynomials and Applications / 104 \\ 4.4.1. Tchebycheff Polynomials / 104 \\ 4.4.2. Tchebycheff Interpolation and Smoothing / 106 \\ 4.4.3. General Theory of Orthogonal Polynomials / 108 \\ 4.4.4. Legendre Polynomials and Gram Polynomials / 113 \\ 4.5. Complementary Observations on Polynomial Approximation / 117 \\ 4.5.1. Summary of the Use of Polynomials / 117 \\ 4.5.2. Some Inequalities for $E_n(f)$ with Applications to the Computation of Linear Functionals / 120 \\ 4.5.3. Approximation in the Maximum Norm / 124 \\ 4.5.4. Economization of Power Series; Standard Functions / 125 \\ 4.5.5. Some Statistical Aspects of the Method of Least Squares / 126 \\ 4.6. Spline Functions / 131 \\ 5: Numerical Linear Algebra / 137 \\ 5,1. Introduction / 137 \\ 5.2. Basic Concepts of Linear Algebra / 138 \\ 5.2.1. Fundamental Definitions / 138 \\ 5.2.2. Partitioned Matrices / 140 \\ 5.2.3. Linear Vector Spaces / 141 \\ 5.2.4. Eigenvalues and Similarity Transformations / 142 \\ 5.2.5. Singular-Value Decomposition and Pseudo-Inverse / 143 \\ 5.3. Direct Methods for Solving Systems of Linear Equations / 146 \\ 5.3.1. Triangular Systems / 146 \\ 5.3.2. Gaussian Elimination / 147 \\ 5.3.3. Pivoting Strategies / 150 \\ 5.3.4. $L U$-Decomposition / 152 \\ 5.3.5. Compact Schemes for Gaussian Elimination / 157 \\ 5.3.6. Inverse Matrices / 159 \\ 5.4. Special Matrices / 162 \\ 5.4.1. Symmetric Positive-Definite Matrices / 162 \\ 5.4.2. Band Matrices / 165 \\ 5.4.3. Large-Scale Linear Systems / 168 \\ 5.4.4. Other Sparse Matrices / 169 \\ 5.5. Error Analysis for Linear Systems / 174 \\ 5.5.1. An Ill-Conditioned Example / 174 \\ 5.5.2. Vector and Matrix Norms / 175 \\ 5.5.3. Perturbation Analysis / 176 \\ 5.5.4. Rounding Errors in Gaussian Elimination / 177 \\ 5.5.5. Scaling of Linear Systems / 181 \\ 5.5.6. Iterative Improvement of a Solution / 183 \\ 5.6. Iterative Methods / 188 \\ 5.7. Overdetermined Linear Systems / 196 \\ 5.7.1. The Normal Equations / 197 \\ 5.7.2. Orthogonalization Methods / 201 \\ 5.7.3. Improvement of Least-Squares Solutions / 204 \\ 5.7.4. Least-Squares Problems with Linear Constraints / 205 \\ 5.8. Computation of Eigenvalues and Eigenvectors / 208 \\ 5.8.1. The Power Method / 209 \\ 5.8.2. Methods Based on Similarity Transformations / 211 \\ 5.8.3. Eigenvalues by Equation Solving / 215 \\ 5.8.4. The $Q R$-Algorithm / 216 \\ 6: Nonlinear Equations / 218 \\ 6.1. Introduction / 218 \\ 6.2. Initial Approximations; Starting Methods / 219 \\ 6.2.1. Introduction / 219 \\ 6.2.2. The Bisection Method / 220 \\ 6.3. Newton--Raphson's Method / 222 \\ 6.4. The Secant Method / 227 \\ 6.4.1. Description of the Method / 227 \\ 6.4.2. Error Analysis for the Secant Method / 228 \\ 6.4.3. Regula Falsi / 230 \\ 6.4.4. Other Related Methods / 230 \\ 6.5. General Theory of Iteration Methods / 233 \\ 6.6. Error Estimation and Attainable Accuracy in Iteration Methods / 238 \\ 6.6.1. Error Estimation / 238 \\ 6.6.2. Attainable Accuracy; Termination Criteria / 240 \\ 6.7. Multiple Roots / 242 \\ 6.8. Algebraic Equations / 243 \\ 6.8.1. Introduction / 243 \\ 6.8.2. Deflation / 245 \\ 6.8.3. Ill-Conditioned Algebraic Equations / 246 \\ 6.9. Systems of Nonlinear Equations / 248 \\ 6.9.1. Iteration / 249 \\ 6.9.2. Newton--Raphson's Method and Some Modifications / 249 \\ 6.9.3. Other Methods / 251 \\ 7: Finite Differences with Applications to Numerical Integration, Differentiation, and Interpolation / 255 \\ 7.1. Difference Operators and Their Simplest Properties / 255 \\ 7.2. Simple Methods for Deriving Approximation Formulas and Error Estimates / 263 \\ 7.2.1. Statement of the Problems and Some Typical Examples / 263 \\ 7.2.2, Repeated Richardson Extrapolation / 269 \\ 7.3. Interpolation / 275 \\ 7.3.1. Introduction / 275 \\ 7.3.2. When is Linear Interpolation Sufficient? / 276 \\ 7.3.3. Newton's General Interpolation Formula / 277 \\ 7.3.4. Formulas for Equidistant Interpolation / 279 \\ 7.3.5. Complementary Remarks on Interpolation / 282 \\ 7.3.6. Lagrange's Interpolation Formula / 284 \\ 7.3.7. Hermite Interpolation / 285 \\ 7.3.8. Inverse Interpolation / 286 \\ 7.4. Numerical Integration / 290 \\ 7.4.1. The Rectangle Rule, Trapezoidal Rule, and Romberg's Method / 291 \\ 7.4.2. The Truncation Error of the Trapezoidal Rule / 293 \\ 7.4.3. Some Difficulties and Possibilities in Numerical Integration / 294 \\ 7.4.4. The Euler--Maclaurin Summation Formula / 297 \\ 7.4.5. Uses of the Euler--Maclaurin Formula / 300 \\ 7.4.6. Other Methods for Numerical Integration / 302 \\ 7.5. Numerical Differentiation / 307 \\ 7.6. The Calculus of Operators / 311 \\ 7.6.1. Operator Algebra / 311 \\ 7.6.2. Operator Series with Applications / 312 \\ 7.7. Functions of Several Variables / 318 \\ 7.7.1. Working with One Variable at a Time / 319 \\ 7.7.2. Rectangular Grids / 319 \\ 7.7.3. Irregular Triangular Grids / 322 \\ 8: Differential Equations / 330 \\ 8.1. Theoretical Background / 330 \\ 8.1.1. Initial-Value Problems for Ordinary Differential Equations / 330 \\ 8.1.2. Error Propagation / 333 \\ 8.1.3. Other Differential Equation Problems / 337 \\ 8.2. Euler's Method, with Repeated Richardson Extrapolation / 338 \\ 8.3. Other Methods for Initial-Value Problems in Ordinary Differential Equations / 342 \\ 8.3.1. The Modified Midpoint Method / 342 \\ 8.3.2. The Power-Series Method / 345 \\ 8.3.3. Runge--Kutta Methods / 346 \\ 8.3.4. Implicit Methods / 347 \\ 8.3.5. Stiff Problems / 349 \\ 8.3.6. Control of Step Size / 350 \\ 8.3.7. A Finite-Difference Method for a Second-Order Equation / 352 \\ 8.4. Orientation on Boundary and Eigenvalue Problems for Ordinary Differential Equations / 359 \\ 8.4.1. Introduction / 359 \\ 8.4.2. The Shooting Method / 359 \\ 8.4.3. The Band Matrix Method / 361 \\ 8.4.4. Numerical Example of an Eigenvalue Problem / 363 \\ 8.5. Difference Equations / 367 \\ 8.5.1. Homogeneous Linear Difference Equations with Constant Coefficients / 368 \\ 8.5.2. General Linear Difference Equations / 370 \\ 8.5.3. Analysis of a Numerical Method with the Help of a Test Problem / 372 \\ 8.5.4. Linear Multistep Methods / 375 \\ 8.6. Partial Differential Equations / 383 \\ 8.6.1. Introduction / 383 \\ 8.6.2. An Example of an Initial-Value Problem / 384 \\ 8.6.3. An Example of a Boundary-Value Problem / 389 \\ 8.6.4. Methods of Undetermined Coefficients and Variational Methods / 392 \\ 8.6.5. Finite-Element Methods / 395 \\ 8.6.6. Integral Equations / 397 \\ 9: Fourier Methods / 405 \\ 9.1. Introduction / 405 \\ 9.2. Basic Formulas and Theorems in Fourier Analysis / 406 \\ 9.2.1. Functions of One Variable / 406 \\ 9.2.2. Functions of Several Variables / 411 \\ 9.3. Fast Fourier Analysis / 413 \\ 9.3.1. An Important Special Case / 413 \\ 9.3.2. Fast Fourier Analysis, General Case / 414 \\ 9.4. Periodic Continuation of a Nonperiodic Function / 417 \\ 9.5. The Fourier Integral Theorem / 419 \\ 10: Optimization / 422 \\ 10.1. Statement of the Problem, Definitions, and Normal Form / 422 \\ 10.2. The Simplex Method / 426 \\ 10.3. Duality / 435 \\ 10.4. The Transportation Problem and Some Other Optimization Problems / 436 \\ 10.5. Nonlinear Optimization Problems / 438 \\ 10.5.1. Basic Concepts and Introductory Examples / 438 \\ 10.5.2. Line Search / 440 \\ 10.5.3. Algorithms for Unconstrained Optimization / 441 \\ 10.5.4. Overdetermined Nonlinear Systems / 443 \\ 10.5.5. Constrained Optimization / 444 \\ 11: The Monte Carlo Method and Simulation / 448 \\ 11.1. Introduction / 448 \\ 11.2. Random Digits and Random Numbers / 449 \\ 11.3. Applications; Reduction of Variance / 455 \\ 11.4. Pseudorandom Numbers / 463 \\ 12: Solutions to Problems / 465 \\ 13: Bibliography and Published Algorithms / 536 \\ 13.1. Introduction / 536 \\ 13.2. General Literature in Numerical Analysis / 536 \\ 13.3. Tables, Collections of Formulas, and Problems / 539 \\ 13.4. Error Analysis and Approximation of Functions / 540 \\ 13.5. Linear Algebra and Nonlinear Systems of Equations / 541 \\ 13.6. Interpolation, Numerical Integration, and Numerical Treatment of Differential Equations / 543 \\ 13.7. Optimization; Simulation / 545 \\ 13.8. Reviews, Abstracts and Other Periodicals / 547 \\ 13.9. Survey of Published Algorithms / 548 \\ Index by Subject to Algorithms, 1960--1970 / 548 \\ Appendix Tables / 563 \\ Index / 565

entry:
@Book{Dahlquist:1974:NM,
  author =       "Germund Dahlquist and {\AA}ke Bj{\"o}rck and Ned
                 Anderson",
  title =        "Numerical Methods",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xviii + 573",
  year =         "1974",
  ISBN =         "0-13-627315-7",
  ISBN-13 =      "978-0-13-627315-8",
  LCCN =         "QA297 .D131 1969",
  bibdate =      "Tue Dec 14 22:44:59 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Translated by Ned Anderson.",
  series =       "Prentice-Hall Series in Automatic Computation",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1: Some General Principles of Numerical
                 Calculation / 1 \\
                 2: How to Obtain and Estimate Accuracy in Numerical
                 Calculations / 21 \\
                 3: Numerical Uses of Series / 60 \\
                 4: Approximation of Functions / 81 \\
                 5: Numerical Linear Algebra / 137 \\
                 6: Nonlinear Equations / 218 \\
                 7: Finite Differences with Applications to Numerical
                 Integration, Differentiation, and Interpolation / 255
                 \\
                 8: Differential Equations / 330 \\
                 9: Fourier Methods / 405 \\
                 10: Optimization / 422 \\
                 11: The Monte Carlo Method and Simulation / 448 \\
                 12: Solutions to Problems / 465 \\
                 13: Bibliography and Published Algorithms / 536 \\
                 Index by Subject to Algorithms, 1960--1970 / 548 \\
                 Appendix Tables / 563 \\
                 Index / 565",
  tableofcontents = "Preface / xvii \\
                 Conventions / xix \\
                 1: Some General Principles of Numerical Calculation / 1
                 \\
                 1.1. Introduction / 1 \\
                 1.2. Some Common Ideas and Concepts in Numerical
                 Methods / 2 \\
                 1.3. Numerical Problems and Algorithms / 13 \\
                 1.3.1. Definitions / 13 \\
                 1.3.2. Recursive Formulas; Homer's Rule / 14 \\
                 1.3.3. An Example of Numerical Instability / 16 \\
                 2: How to Obtain and Estimate Accuracy in Numerical
                 Calculations / 21 \\
                 2.1. Basic Concepts in Error Estimation / 21 \\
                 2.1.1. Introduction / 21 \\
                 2.1.2. Sources of Error / 22 \\
                 2.1.3. Absolute and Relative Errors / 23 \\
                 2.1.4. Rounding and Chopping / 24 \\
                 2.2 Propagation of Errors / 26 \\
                 2.2.1. Simple Examples of Error Analysis / 26 \\
                 2.2.2. The General Formula for Error Propagation;
                 Maximum Error and Standard Error / 29 \\
                 2.2.3. On the Practical Application of Error Estimation
                 / 34 \\
                 2.2.4. The Use of Experimental Perturbations / 36 \\
                 2.2.5. Automatic Control of Accuracy / 37 \\
                 2.3. Number Systems; Floating and Fixed Representation
                 / 42 \\
                 2.3.1. The Position System / 42 \\
                 2.3.2. Floating and Fixed Representation / 43 \\
                 2.3.3. Floating Decimal Point / 44 \\
                 2.3.4. Fixed Decimal Point / 46 \\
                 2.3.5. Round-off Errors in Computation with Floating
                 Arithmetic Operations / 46 \\
                 2.4. Backward Error Analysis; Condition Numbers / 51
                 \\
                 2.4.1. Backward Error Analysis / 51 \\
                 2.4.2. Condition Numbers for Problems and Algorithms /
                 53 \\
                 2.4.3. Geometrical Illustration of Error Analysis / 56
                 \\
                 3: Numerical Uses of Series / 60 \\
                 3.1. Elementary Uses of Series / 60 \\
                 3.1.1. Simple Examples / 60 \\
                 3.1.2. Estimating the Remainder / 62 \\
                 3.1.3. Power Series / 65 \\
                 3.2. Acceleration of Convergence / 71 \\
                 3.2.1. Slowly Converging Alternating Series / 71 \\
                 3.2.2. Slowly Converging Series with Positive Terms /
                 73 \\
                 3.2.3. Other Simple Ways to Accelerate Convergence / 74
                 \\
                 3.2.4. Ill-Conditioned Series / 75 \\
                 3.2.5. Numerical Use of Divergent Series / 77 \\
                 4: Approximation of Functions / 81 \\
                 4.1. Basic Concepts in Approximation / 81 \\
                 4.1.1. Introduction / 81 \\
                 4.1.2. The Idea of a Function Space / 84 \\
                 4.1.3. Norms and Seminorms / 85 \\
                 4.1.4. Approximation of Functions as a Geometric
                 Problem in Function Space / 87 \\
                 4.2. The Approximation of Functions by the Method of
                 Least Squares / 88 \\
                 4.2.t. Statement of the Problems / 88 \\
                 4.2.2. Orthogonal Systems / 89 \\
                 4.2.3. Solution of the Approximation Problem / 92 \\
                 4.3. Polynomials / 97 \\
                 4.3.1. Basic Terminology; the Weierstrass Approximation
                 Theorem / 97 \\
                 4.3.2. Triangle Families of Polynomials / 98 \\
                 4.3.3. A Triangle Family and Its Application to
                 Interpolation / 99 \\
                 4.3.4. Equidistant Interpolation and the Runge
                 Phenomenon / 101 \\
                 4.4. Orthogonal Polynomials and Applications / 104 \\
                 4.4.1. Tchebycheff Polynomials / 104 \\
                 4.4.2. Tchebycheff Interpolation and Smoothing / 106
                 \\
                 4.4.3. General Theory of Orthogonal Polynomials / 108
                 \\
                 4.4.4. Legendre Polynomials and Gram Polynomials / 113
                 \\
                 4.5. Complementary Observations on Polynomial
                 Approximation / 117 \\
                 4.5.1. Summary of the Use of Polynomials / 117 \\
                 4.5.2. Some Inequalities for $E_n(f)$ with Applications
                 to the Computation of Linear Functionals / 120 \\
                 4.5.3. Approximation in the Maximum Norm / 124 \\
                 4.5.4. Economization of Power Series; Standard
                 Functions / 125 \\
                 4.5.5. Some Statistical Aspects of the Method of Least
                 Squares / 126 \\
                 4.6. Spline Functions / 131 \\
                 5: Numerical Linear Algebra / 137 \\
                 5,1. Introduction / 137 \\
                 5.2. Basic Concepts of Linear Algebra / 138 \\
                 5.2.1. Fundamental Definitions / 138 \\
                 5.2.2. Partitioned Matrices / 140 \\
                 5.2.3. Linear Vector Spaces / 141 \\
                 5.2.4. Eigenvalues and Similarity Transformations / 142
                 \\
                 5.2.5. Singular-Value Decomposition and Pseudo-Inverse
                 / 143 \\
                 5.3. Direct Methods for Solving Systems of Linear
                 Equations / 146 \\
                 5.3.1. Triangular Systems / 146 \\
                 5.3.2. Gaussian Elimination / 147 \\
                 5.3.3. Pivoting Strategies / 150 \\
                 5.3.4. $L U$-Decomposition / 152 \\
                 5.3.5. Compact Schemes for Gaussian Elimination / 157
                 \\
                 5.3.6. Inverse Matrices / 159 \\
                 5.4. Special Matrices / 162 \\
                 5.4.1. Symmetric Positive-Definite Matrices / 162 \\
                 5.4.2. Band Matrices / 165 \\
                 5.4.3. Large-Scale Linear Systems / 168 \\
                 5.4.4. Other Sparse Matrices / 169 \\
                 5.5. Error Analysis for Linear Systems / 174 \\
                 5.5.1. An Ill-Conditioned Example / 174 \\
                 5.5.2. Vector and Matrix Norms / 175 \\
                 5.5.3. Perturbation Analysis / 176 \\
                 5.5.4. Rounding Errors in Gaussian Elimination / 177
                 \\
                 5.5.5. Scaling of Linear Systems / 181 \\
                 5.5.6. Iterative Improvement of a Solution / 183 \\
                 5.6. Iterative Methods / 188 \\
                 5.7. Overdetermined Linear Systems / 196 \\
                 5.7.1. The Normal Equations / 197 \\
                 5.7.2. Orthogonalization Methods / 201 \\
                 5.7.3. Improvement of Least-Squares Solutions / 204 \\
                 5.7.4. Least-Squares Problems with Linear Constraints /
                 205 \\
                 5.8. Computation of Eigenvalues and Eigenvectors / 208
                 \\
                 5.8.1. The Power Method / 209 \\
                 5.8.2. Methods Based on Similarity Transformations /
                 211 \\
                 5.8.3. Eigenvalues by Equation Solving / 215 \\
                 5.8.4. The $Q R$-Algorithm / 216 \\
                 6: Nonlinear Equations / 218 \\
                 6.1. Introduction / 218 \\
                 6.2. Initial Approximations; Starting Methods / 219 \\
                 6.2.1. Introduction / 219 \\
                 6.2.2. The Bisection Method / 220 \\
                 6.3. Newton--Raphson's Method / 222 \\
                 6.4. The Secant Method / 227 \\
                 6.4.1. Description of the Method / 227 \\
                 6.4.2. Error Analysis for the Secant Method / 228 \\
                 6.4.3. Regula Falsi / 230 \\
                 6.4.4. Other Related Methods / 230 \\
                 6.5. General Theory of Iteration Methods / 233 \\
                 6.6. Error Estimation and Attainable Accuracy in
                 Iteration Methods / 238 \\
                 6.6.1. Error Estimation / 238 \\
                 6.6.2. Attainable Accuracy; Termination Criteria / 240
                 \\
                 6.7. Multiple Roots / 242 \\
                 6.8. Algebraic Equations / 243 \\
                 6.8.1. Introduction / 243 \\
                 6.8.2. Deflation / 245 \\
                 6.8.3. Ill-Conditioned Algebraic Equations / 246 \\
                 6.9. Systems of Nonlinear Equations / 248 \\
                 6.9.1. Iteration / 249 \\
                 6.9.2. Newton--Raphson's Method and Some Modifications
                 / 249 \\
                 6.9.3. Other Methods / 251 \\
                 7: Finite Differences with Applications to Numerical
                 Integration, Differentiation, and Interpolation / 255
                 \\
                 7.1. Difference Operators and Their Simplest Properties
                 / 255 \\
                 7.2. Simple Methods for Deriving Approximation Formulas
                 and Error Estimates / 263 \\
                 7.2.1. Statement of the Problems and Some Typical
                 Examples / 263 \\
                 7.2.2, Repeated Richardson Extrapolation / 269 \\
                 7.3. Interpolation / 275 \\
                 7.3.1. Introduction / 275 \\
                 7.3.2. When is Linear Interpolation Sufficient? / 276
                 \\
                 7.3.3. Newton's General Interpolation Formula / 277 \\
                 7.3.4. Formulas for Equidistant Interpolation / 279 \\
                 7.3.5. Complementary Remarks on Interpolation / 282 \\
                 7.3.6. Lagrange's Interpolation Formula / 284 \\
                 7.3.7. Hermite Interpolation / 285 \\
                 7.3.8. Inverse Interpolation / 286 \\
                 7.4. Numerical Integration / 290 \\
                 7.4.1. The Rectangle Rule, Trapezoidal Rule, and
                 Romberg's Method / 291 \\
                 7.4.2. The Truncation Error of the Trapezoidal Rule /
                 293 \\
                 7.4.3. Some Difficulties and Possibilities in Numerical
                 Integration / 294 \\
                 7.4.4. The Euler--Maclaurin Summation Formula / 297 \\
                 7.4.5. Uses of the Euler--Maclaurin Formula / 300 \\
                 7.4.6. Other Methods for Numerical Integration / 302
                 \\
                 7.5. Numerical Differentiation / 307 \\
                 7.6. The Calculus of Operators / 311 \\
                 7.6.1. Operator Algebra / 311 \\
                 7.6.2. Operator Series with Applications / 312 \\
                 7.7. Functions of Several Variables / 318 \\
                 7.7.1. Working with One Variable at a Time / 319 \\
                 7.7.2. Rectangular Grids / 319 \\
                 7.7.3. Irregular Triangular Grids / 322 \\
                 8: Differential Equations / 330 \\
                 8.1. Theoretical Background / 330 \\
                 8.1.1. Initial-Value Problems for Ordinary Differential
                 Equations / 330 \\
                 8.1.2. Error Propagation / 333 \\
                 8.1.3. Other Differential Equation Problems / 337 \\
                 8.2. Euler's Method, with Repeated Richardson
                 Extrapolation / 338 \\
                 8.3. Other Methods for Initial-Value Problems in
                 Ordinary Differential Equations / 342 \\
                 8.3.1. The Modified Midpoint Method / 342 \\
                 8.3.2. The Power-Series Method / 345 \\
                 8.3.3. Runge--Kutta Methods / 346 \\
                 8.3.4. Implicit Methods / 347 \\
                 8.3.5. Stiff Problems / 349 \\
                 8.3.6. Control of Step Size / 350 \\
                 8.3.7. A Finite-Difference Method for a Second-Order
                 Equation / 352 \\
                 8.4. Orientation on Boundary and Eigenvalue Problems
                 for Ordinary Differential Equations / 359 \\
                 8.4.1. Introduction / 359 \\
                 8.4.2. The Shooting Method / 359 \\
                 8.4.3. The Band Matrix Method / 361 \\
                 8.4.4. Numerical Example of an Eigenvalue Problem / 363
                 \\
                 8.5. Difference Equations / 367 \\
                 8.5.1. Homogeneous Linear Difference Equations with
                 Constant Coefficients / 368 \\
                 8.5.2. General Linear Difference Equations / 370 \\
                 8.5.3. Analysis of a Numerical Method with the Help of
                 a Test Problem / 372 \\
                 8.5.4. Linear Multistep Methods / 375 \\
                 8.6. Partial Differential Equations / 383 \\
                 8.6.1. Introduction / 383 \\
                 8.6.2. An Example of an Initial-Value Problem / 384 \\
                 8.6.3. An Example of a Boundary-Value Problem / 389 \\
                 8.6.4. Methods of Undetermined Coefficients and
                 Variational Methods / 392 \\
                 8.6.5. Finite-Element Methods / 395 \\
                 8.6.6. Integral Equations / 397 \\
                 9: Fourier Methods / 405 \\
                 9.1. Introduction / 405 \\
                 9.2. Basic Formulas and Theorems in Fourier Analysis /
                 406 \\
                 9.2.1. Functions of One Variable / 406 \\
                 9.2.2. Functions of Several Variables / 411 \\
                 9.3. Fast Fourier Analysis / 413 \\
                 9.3.1. An Important Special Case / 413 \\
                 9.3.2. Fast Fourier Analysis, General Case / 414 \\
                 9.4. Periodic Continuation of a Nonperiodic Function /
                 417 \\
                 9.5. The Fourier Integral Theorem / 419 \\
                 10: Optimization / 422 \\
                 10.1. Statement of the Problem, Definitions, and Normal
                 Form / 422 \\
                 10.2. The Simplex Method / 426 \\
                 10.3. Duality / 435 \\
                 10.4. The Transportation Problem and Some Other
                 Optimization Problems / 436 \\
                 10.5. Nonlinear Optimization Problems / 438 \\
                 10.5.1. Basic Concepts and Introductory Examples / 438
                 \\
                 10.5.2. Line Search / 440 \\
                 10.5.3. Algorithms for Unconstrained Optimization / 441
                 \\
                 10.5.4. Overdetermined Nonlinear Systems / 443 \\
                 10.5.5. Constrained Optimization / 444 \\
                 11: The Monte Carlo Method and Simulation / 448 \\
                 11.1. Introduction / 448 \\
                 11.2. Random Digits and Random Numbers / 449 \\
                 11.3. Applications; Reduction of Variance / 455 \\
                 11.4. Pseudorandom Numbers / 463 \\
                 12: Solutions to Problems / 465 \\
                 13: Bibliography and Published Algorithms / 536 \\
                 13.1. Introduction / 536 \\
                 13.2. General Literature in Numerical Analysis / 536
                 \\
                 13.3. Tables, Collections of Formulas, and Problems /
                 539 \\
                 13.4. Error Analysis and Approximation of Functions /
                 540 \\
                 13.5. Linear Algebra and Nonlinear Systems of Equations
                 / 541 \\
                 13.6. Interpolation, Numerical Integration, and
                 Numerical Treatment of Differential Equations / 543 \\
                 13.7. Optimization; Simulation / 545 \\
                 13.8. Reviews, Abstracts and Other Periodicals / 547
                 \\
                 13.9. Survey of Published Algorithms / 548 \\
                 Index by Subject to Algorithms, 1960--1970 / 548 \\
                 Appendix Tables / 563 \\
                 Index / 565",
}


bibtype: book
filename: master.bib
label: Dalang:2009:MSP
author: Robert Dalang and Davar Khoshnevisan and Carl Mueller and David Nualart and Yimin Xiao
title: A Minicourse on Stochastic Partial Differential Equations
volume: 1962
publisher: pub-SV
address: pub-SV:adr
pages: xi + 216
year: 2009
ISBN: 3-540-85993-4 (softcover) OR 3540859934 (softcover)
ISBN13: 978-3-540-85993-2 (softcover) OR 9783540859932 (softcover)
LCCN: QA3 .L28 no.1962; QA3.L471
bibdate: Tue Jan 20 16:31:21 MST 2009
bibtimestamp: 2009.01.20 16:31:21 MST
series: ser-LNM
acknowledgement: ack-nhfb
rawauthor: Robert Dalang and Davar Khoshnevisan and Carl Mueller and David Nualart and Yimin Xiao
rawtitle: A Minicourse on Stochastic Partial Differential Equations
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; library.mit.edu:9909/mit01; z3950.loc.gov:7090/Voyager

entry:
@Book{Dalang:2009:MSP,
  author =       "Robert Dalang and Davar Khoshnevisan and Carl Mueller
                 and David Nualart and Yimin Xiao",
  title =        "A Minicourse on Stochastic Partial Differential
                 Equations",
  volume =       "1962",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xi + 216",
  year =         "2009",
  ISBN =         "3-540-85993-4 (softcover)",
  ISBN-13 =      "978-3-540-85993-2 (softcover)",
  LCCN =         "QA3 .L28 no.1962; QA3.L471",
  bibdate =      "Tue Jan 20 16:31:21 MST 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.mit.edu:9909/mit01;
                 z3950.loc.gov:7090/Voyager",
  series =       ser-LNM,
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Daniels:1962:EPC
author: Farrington Daniels and J. W. Williams and Paul Bender and Robert A. Alberty and C. D. Cornwell
title: Experimental Physical Chemistry
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
edition: Sixth
pages: xv + 625
year: 1962
LCCN: QD457 .D2 1962
bibdate: Sat Jul 25 13:55:27 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.07.25 13:55:27 ???
acknowledgement: ack-nhfb
rawauthor: Farrington Daniels and J. W. Williams and Paul Bender and Robert A. Alberty and C. D. Cornwell
rawtitle: Experimental Physical Chemistry
entry:
@Book{Daniels:1962:EPC,
  author =       "Farrington Daniels and J. W. Williams and Paul Bender
                 and Robert A. Alberty and C. D. Cornwell",
  title =        "Experimental Physical Chemistry",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Sixth",
  pages =        "xv + 625",
  year =         "1962",
  LCCN =         "QD457 .D2 1962",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Darwin:2001:JCS
author: Ian Darwin
title: Java Cookbook: Solutions and Examples for Java Developers
publisher: pub-ORA
address: pub-ORA:adr
pages: xxix + 850
month: jun
monthnumber: 6
year: 2001
ISBN: 0-596-00170-3 (paperback) OR 0596001703 (paperback)
ISBN13: 978-0-596-00170-4 (paperback) OR 9780596001704 (paperback)
LCCN: QA76.73.J38 D348 2001
bibdate: Mon Jul 30 06:50:24 MDT 2001
bibtimestamp: 2001.07.30 06:50:24 MDT
URL: http://www.oreilly.com/catalog/9780596001704; http://www.oreilly.com/catalog/javacook
acknowledgement: ack-nhfb
rawauthor: Ian Darwin
rawtitle: {Java} Cookbook: Solutions and Examples for {Java} Developers
bibsource:
https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/ora.bib; http://www.oreilly.com/catalog/

abstract:
Offering Java developers short, focused pieces of code that are easy to incorporate into other programs, this text focuses on things that are useful, tricky, or both. The book's code segments cover all of the dominant APIs and many specialized APIs.

TOC:
1. Getting Started: Compiling, Running, and Debugging 2. Interacting with the Environment 3. Strings and Things 4. Pattern Matching with Regular Expressions 5. Numbers 6. Dates and Times 7. Structuring Data with Java 8. Object-Oriented Techniques 9. Input and Output 10. Directory and Filesystem Operations 11. Programming Serial and Parallel Ports 12. Graphics and Sound 13. Graphical User Interfaces 14. Internationalization and Localization 15. Network Clients 16. Server-Side Java: Sockets 17. Network Clients II: Applets and Web Clients 18. Web Server Java: Servlets and JSP 19. Java and Electronic Mail 20. Database Access 21. XML 22. Distributed Java: RMI 23. Packages and Packaging 24. Threaded Java 25. Introspection, or ``A Class Named Class'' 26. Using Java with Other Languages

rawabstract:
Offering Java developers short, focused pieces of code that are easy to incorporate into other programs, this text focuses on things that are useful, tricky, or both. The book's code segments cover all of the dominant APIs and many specialized APIs.

rawTOC:
1. Getting Started: Compiling, Running, and Debugging \\ 2. Interacting with the Environment \\ 3. Strings and Things \\ 4. Pattern Matching with Regular Expressions \\ 5. Numbers \\ 6. Dates and Times \\ 7. Structuring Data with Java \\ 8. Object-Oriented Techniques \\ 9. Input and Output \\ 10. Directory and Filesystem Operations \\ 11. Programming Serial and Parallel Ports \\ 12. Graphics and Sound \\ 13. Graphical User Interfaces \\ 14. Internationalization and Localization \\ 15. Network Clients \\ 16. Server-Side Java: Sockets \\ 17. Network Clients II: Applets and Web Clients \\ 18. Web Server Java: Servlets and JSP \\ 19. Java and Electronic Mail \\ 20. Database Access \\ 21. XML \\ 22. Distributed Java: RMI \\ 23. Packages and Packaging \\ 24. Threaded Java \\ 25. Introspection, or ``A Class Named Class'' \\ 26. Using Java with Other Languages

entry:
@Book{Darwin:2001:JCS,
  author =       "Ian Darwin",
  title =        "{Java} Cookbook: Solutions and Examples for {Java}
                 Developers",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxix + 850",
  month =        jun,
  year =         "2001",
  ISBN =         "0-596-00170-3 (paperback)",
  ISBN-13 =      "978-0-596-00170-4 (paperback)",
  LCCN =         "QA76.73.J38 D348 2001",
  bibdate =      "Mon Jul 30 06:50:24 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/java2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib;
                 http://www.oreilly.com/catalog/",
  price =        "US\$44.95",
  URL =          "http://www.oreilly.com/catalog/9780596001704;
                 http://www.oreilly.com/catalog/javacook",
  abstract =     "Offering Java developers short, focused pieces of code
                 that are easy to incorporate into other programs, this
                 text focuses on things that are useful, tricky, or
                 both. The book's code segments cover all of the
                 dominant APIs and many specialized APIs.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1. Getting Started: Compiling, Running, and
                 Debugging \\
                 2. Interacting with the Environment \\
                 3. Strings and Things \\
                 4. Pattern Matching with Regular Expressions \\
                 5. Numbers \\
                 6. Dates and Times \\
                 7. Structuring Data with Java \\
                 8. Object-Oriented Techniques \\
                 9. Input and Output \\
                 10. Directory and Filesystem Operations \\
                 11. Programming Serial and Parallel Ports \\
                 12. Graphics and Sound \\
                 13. Graphical User Interfaces \\
                 14. Internationalization and Localization \\
                 15. Network Clients \\
                 16. Server-Side Java: Sockets \\
                 17. Network Clients II: Applets and Web Clients \\
                 18. Web Server Java: Servlets and JSP \\
                 19. Java and Electronic Mail \\
                 20. Database Access \\
                 21. XML \\
                 22. Distributed Java: RMI \\
                 23. Packages and Packaging \\
                 24. Threaded Java \\
                 25. Introspection, or ``A Class Named Class'' \\
                 26. Using Java with Other Languages",
}


bibtype: book
filename: master.bib
label: Davie:RDC81
author: A. J. T. Davie and R. Morrison
title: Recursive Descent Compiling
publisher: pub-ELLIS-HORWOOD
address: pub-ELLIS-HORWOOD:adr
pages: 195
year: 1981
LCCN: QA76.6 .D373
bibdate: Tue Dec 14 22:47:07 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:47:07 ???
series: Ellis Horwood Series in Computers and their Applications, Editor: Brian Meek
acknowledgement: ack-nhfb
rawauthor: A. J. T. Davie and R. Morrison
rawtitle: Recursive Descent Compiling
ISBN:
0-470-27270-8 (Halstead Press), 0-85312-386-1 (Ellis Horwood) OR 0470272708 (Halstead Press), 0853123861 (Ellis Horwood)

ISBN13:
978-0-470-27270-1 (Halstead Press), 978-0-85312-386-6 (Ellis Horwood) OR 9780470272701 (Halstead Press), 9780853123866 (Ellis Horwood)

entry:
@Book{Davie:RDC81,
  author =       "A. J. T. Davie and R. Morrison",
  title =        "Recursive Descent Compiling",
  publisher =    pub-ELLIS-HORWOOD,
  address =      pub-ELLIS-HORWOOD:adr,
  pages =        "195",
  year =         "1981",
  ISBN =         "0-470-27270-8 (Halstead Press), 0-85312-386-1 (Ellis
                 Horwood)",
  ISBN-13 =      "978-0-470-27270-1 (Halstead Press), 978-0-85312-386-6
                 (Ellis Horwood)",
  LCCN =         "QA76.6 .D373",
  bibdate =      "Tue Dec 14 22:47:07 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Ellis Horwood Series in Computers and their
                 Applications, Editor: Brian Meek",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Davis:1965:APC
author: Jeff C. Davis, Jr.
title: Advanced Physical Chemistry: Molecules, Structure, and Spectra
publisher: Ronald Press Company
address: New York, NY, USA
pages: x + 632
year: 1965
LCCN: QD453.D36
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: Jeff C. {Davis, Jr.}
rawtitle: Advanced Physical Chemistry: Molecules, Structure, and Spectra
entry:
@Book{Davis:1965:APC,
  author =       "Jeff C. {Davis, Jr.}",
  title =        "Advanced Physical Chemistry: Molecules, Structure, and
                 Spectra",
  publisher =    "Ronald Press Company",
  address =      "New York, NY, USA",
  pages =        "x + 632",
  year =         "1965",
  LCCN =         "QD453.D36",
  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: Davis:1975:MNI
author: Philip J. Davis and Philip Rabinowitz
title: Methods of numerical integration
publisher: pub-ACADEMIC
address: pub-ACADEMIC:adr
pages: xii + 459
year: 1975
ISBN: 0-12-206350-3 OR 0122063503
ISBN13: 978-0-12-206350-3 OR 9780122063503
LCCN: QA299.3 .D28
bibdate: Sat Dec 24 15:53:15 MST 2005
bibsource: Amazon; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2005.12.24 15:53:15 MST
series: Computer science and applied mathematics
keywords: Numerical integration
acknowledgement: ack-nhfb
rawauthor: Philip J. Davis and Philip Rabinowitz
rawtitle: Methods of numerical integration
entry:
@Book{Davis:1975:MNI,
  author =       "Philip J. Davis and Philip Rabinowitz",
  title =        "Methods of numerical integration",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xii + 459",
  year =         "1975",
  ISBN =         "0-12-206350-3",
  ISBN-13 =      "978-0-12-206350-3",
  LCCN =         "QA299.3 .D28",
  bibdate =      "Sat Dec 24 15:53:15 MST 2005",
  bibsource =    "Amazon;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Computer science and applied mathematics",
  acknowledgement = ack-nhfb,
  bookformat =   "Unknown Binding",
  category =     "Science; Mathematics; Mathematical Analysis",
  DEWEY =        "515/.624",
  idnumber =     "543",
  keywords =     "Numerical integration",
  libnote =      "Not in my library",
}


bibtype: inproceedings
filename: master.bib
label: deBalbine:design
author: Guy de Balbine
title: Design Criteria for the Structuring Engine
crossref: AFIPS:1975:SUJ
pages: ??--??
year: 1975
bibdate: Sat Apr 29 17:51:17 1995
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1995.04.29 17:51:17 ???
acknowledgement: ack-nhfb
rawauthor: Guy de Balbine
rawtitle: Design Criteria for the Structuring Engine
entry:
@InProceedings{deBalbine:design,
  author =       "Guy de Balbine",
  title =        "Design Criteria for the Structuring Engine",
  crossref =     "AFIPS:1975:SUJ",
  pages =        "??--??",
  year =         "1975",
  bibdate =      "Sat Apr 29 17:51:17 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: DeBrosse:2004:SBU
author: Jim DeBrosse and Colin B. Burke
title: The Secret in Building 26: the Untold Story of America's Ultra War Against the U-boat Enigma Codes
publisher: pub-RANDOM-HOUSE
address: pub-RANDOM-HOUSE:adr
pages: xxix + 272
year: 2004
ISBN: 0-375-50807-4, 1-58836-353-8 (e-book), 0-375-75995-6 OR 0375508074, 1588363538 (ebook), 0375759956
LCCN: D810.C88 D43 2004
bibdate: Fri Jan 13 17:17:54 MST 2006
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2006.01.13 17:17:54 MST
acknowledgement: ack-nhfb
rawauthor: Jim DeBrosse and Colin B. Burke
ISBN13:
978-0-375-50807-3, 978-1-58836-353-4 (e-book), 978-0-375-75995-6 OR 9780375508073, 9781588363534 (ebook), 9780375759956

URL:
http://www.loc.gov/catdir/samples/random045/2003058494.html; http://www.randomhouse.com/catalog/display.pperl?isbn=9781588363534

remark:
From the publisher: ``Much has been written about the success of the British ``Ultra'' program in cracking the Germans' Enigma code early in World War II, but few know what really happened in 1942, when the Germans added a fourth rotor to the machine that created the already challenging naval code and plunged Allied intelligence into darkness. Enter one Joe Desch, an unassuming but brilliant engineer at the National Cash Register Company in Dayton, Ohio, who was given the task of creating a machine to break the new Enigma settings. It was an enterprise that rivaled the Manhattan Project for secrecy and complexity---and nearly drove Desch to a breakdown. Under enormous pressure, he succeeded in creating a 5,000-pound electromechanical monster known as the Desch Bombe, which helped turn the tide in the Battle of the Atlantic---but not before a disgruntled co-worker attempted to leak information about the machine to the Nazis. After toiling anonymously---it even took his daughter years to learn of his accomplishments---Desch was awarded the National Medal of Merit, the country's highest civilian honor. In The Secret in Building 26, the entire thrilling story of the final triumph over Enigma is finally told.''

subject:
World War, 1939--1945; Cryptography; Enigma cipher system; United States; History; 20th century; Desch, Joseph

TOC:
Building the perfect machine Guesswork, moxie, and just plain luck Miss Aggie's big blunder Toward an American Bletchley Park A giant leap and a step backward The Turing memo Troubles with Adam and Eve U-boats on the run The WAVES come aboard A well-oiled machine An enemy within? Triumph! New challenges and breakdown Burying the past

rawtitle:
The Secret in {Building 26}: the Untold Story of {America}'s Ultra War Against the {U}-boat {Enigma} Codes

rawTOC:
Building the perfect machine \\ Guesswork, moxie, and just plain luck \\ Miss Aggie's big blunder \\ Toward an American Bletchley Park \\ A giant leap \\ and a step backward \\ The Turing memo \\ Troubles with Adam and Eve \\ U-boats on the run \\ The WAVES come aboard \\ A well-oiled machine \\ An enemy within? \\ Triumph! \\ New challenges \\ and breakdown \\ Burying the past

entry:
@Book{DeBrosse:2004:SBU,
  author =       "Jim DeBrosse and Colin B. Burke",
  title =        "The Secret in {Building 26}: the Untold Story of
                 {America}'s Ultra War Against the {U}-boat {Enigma}
                 Codes",
  publisher =    pub-RANDOM-HOUSE,
  address =      pub-RANDOM-HOUSE:adr,
  pages =        "xxix + 272",
  year =         "2004",
  ISBN =         "0-375-50807-4, 1-58836-353-8 (e-book), 0-375-75995-6",
  ISBN-13 =      "978-0-375-50807-3, 978-1-58836-353-4 (e-book),
                 978-0-375-75995-6",
  LCCN =         "D810.C88 D43 2004",
  bibdate =      "Fri Jan 13 17:17:54 MST 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/samples/random045/2003058494.html;
                 http://www.randomhouse.com/catalog/display.pperl?isbn=9781588363534",
  acknowledgement = ack-nhfb,
  remark =       "From the publisher: ``Much has been written about the
                 success of the British ``Ultra'' program in cracking
                 the Germans' Enigma code early in World War II, but few
                 know what really happened in 1942, when the Germans
                 added a fourth rotor to the machine that created the
                 already challenging naval code and plunged Allied
                 intelligence into darkness.

                 Enter one Joe Desch, an unassuming but brilliant
                 engineer at the National Cash Register Company in
                 Dayton, Ohio, who was given the task of creating a
                 machine to break the new Enigma settings. It was an
                 enterprise that rivaled the Manhattan Project for
                 secrecy and complexity---and nearly drove Desch to a
                 breakdown. Under enormous pressure, he succeeded in
                 creating a 5,000-pound electromechanical monster known
                 as the Desch Bombe, which helped turn the tide in the
                 Battle of the Atlantic---but not before a disgruntled
                 co-worker attempted to leak information about the
                 machine to the Nazis.

                 After toiling anonymously---it even took his daughter
                 years to learn of his accomplishments---Desch was
                 awarded the National Medal of Merit, the country's
                 highest civilian honor. In The Secret in Building 26,
                 the entire thrilling story of the final triumph over
                 Enigma is finally told.''",
  subject =      "World War, 1939--1945; Cryptography; Enigma cipher
                 system; United States; History; 20th century; Desch,
                 Joseph",
  tableofcontents = "Building the perfect machine \\
                 Guesswork, moxie, and just plain luck \\
                 Miss Aggie's big blunder \\
                 Toward an American Bletchley Park \\
                 A giant leap \\
                 and a step backward \\
                 The Turing memo \\
                 Troubles with Adam and Eve \\
                 U-boats on the run \\
                 The WAVES come aboard \\
                 A well-oiled machine \\
                 An enemy within? \\
                 Triumph! \\
                 New challenges \\
                 and breakdown \\
                 Burying the past",
}


bibtype: book
filename: master.bib
label: deBruin:1988:PML
author: R. de Bruin and C. G. van der Laan and J. R. Luyten and H. F. Vogt
title: Publiceren met LaTeX
volume: 19
publisher: pub-CWI
address: pub-CWI:adr
pages: 196
year: 1988
ISBN: 90-6196-357-5 OR 9061963575
ISBN13: 978-90-6196-357-8 OR 9789061963578
LCCN: Z253.4.L38 .P97 1988
MRclass: 68U15, 68-01
bibdate: Tue Dec 14 22:43:17 1993
bibtimestamp: 1993.12.14 22:43:17 ???
language: Dutch
ZMnumber: 0743.68137
acknowledgement: ack-nhfb
rawauthor: R. de Bruin and C. G. {van der Laan} and J. R. Luyten and H. F. Vogt
rawtitle: Publiceren met {\LaTeX}
entry:
@Book{deBruin:1988:PML,
  author =       "R. de Bruin and C. G. {van der Laan} and J. R. Luyten
                 and H. F. Vogt",
  title =        "Publiceren met {\LaTeX}",
  volume =       "19",
  publisher =    pub-CWI,
  address =      pub-CWI:adr,
  pages =        "196",
  year =         "1988",
  ISBN =         "90-6196-357-5",
  ISBN-13 =      "978-90-6196-357-8",
  LCCN =         "Z253.4.L38 .P97 1988",
  MRclass =      "68U15, 68-01",
  bibdate =      "Tue Dec 14 22:43:17 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  ZMnumber =     "0743.68137",
  acknowledgement = ack-nhfb,
  language =     "Dutch",
}


bibtype: book
filename: master.bib
label: DEC:1982:PVC
author: Digital Equipment Corporation
title: Programming in VAX-11 C
publisher: pub-DP
address: pub-DP:adr
pages: 196
month: may
monthnumber: 5
year: 1982
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: {Digital Equipment Corporation}
rawtitle: Programming in {VAX-11 C}
entry:
@Book{DEC:1982:PVC,
  author =       "{Digital Equipment Corporation}",
  title =        "Programming in {VAX-11 C}",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  month =        may,
  year =         "1982",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: DEC:AAH92
author: Digital Equipment Corporation
title: Alpha Architecture Handbook
publisher: pub-DP
address: pub-DP:adr
pages: 196
year: 1992
bibdate: Mon Jan 18 15:08:40 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.01.18 15:08:40 ???
acknowledgement: ack-nhfb
rawauthor: Digital Equipment Corporation
rawtitle: {Alpha} Architecture Handbook
entry:
@Book{DEC:AAH92,
  author =       "Digital Equipment Corporation",
  title =        "{Alpha} Architecture Handbook",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  year =         "1992",
  bibdate =      "Mon Jan 18 15:08:40 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Degering:1951:OCO
editor: Ed F. Degering and Seventy Six Assistant Editors
title: Organic Chemistry: An Outline of the Beginning Course Including Material for Advanced Study
volume: 6
publisher: pub-BARNES-NOBLE
address: pub-BARNES-NOBLE:adr
edition: Sixth
pages: xxv + 422
year: 1951
LCCN: QD256 .D4 1968
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: Revised, 1957.
series: College Outline Series
acknowledgement: ack-nhfb
raweditor: Ed F. Degering and {Seventy Six Assistant Editors}
rawnote: Revised, 1957.
rawtitle: Organic Chemistry: An Outline of the Beginning Course Including Material for Advanced Study
entry:
@Book{Degering:1951:OCO,
  editor =       "Ed F. Degering and {Seventy Six Assistant Editors}",
  title =        "Organic Chemistry: An Outline of the Beginning Course
                 Including Material for Advanced Study",
  volume =       "6",
  publisher =    pub-BARNES-NOBLE,
  address =      pub-BARNES-NOBLE:adr,
  edition =      "Sixth",
  pages =        "xxv + 422",
  year =         "1951",
  LCCN =         "QD256 .D4 1968",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Revised, 1957.",
  series =       "College Outline Series",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: deGrasseTyson:2008:PFR
author: Neil deGrasse Tyson
title: The Pluto files: the rise and fall of America's favorite planet
publisher: pub-NORTON
address: pub-NORTON:adr
pages: xii + 194
year: 2008
ISBN: 0-393-06520-0 (hardcover) OR 0393065200 (hardcover)
ISBN13: 978-0-393-06520-6 (hardcover) OR 9780393065206 (hardcover)
LCCN: QB701 .T97 2009
bibdate: Tue Jan 24 14:06:56 MST 2012
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2012.01.24 14:06:56 MST
subject: Pluto (Dwarf planet)
acknowledgement: ack-nhfb
rawauthor: Neil deGrasse Tyson
rawtitle: The {Pluto} files: the rise and fall of {America}'s favorite planet
TOC:
Preface xi 1 Pluto in Culture 3 2 Pluto in History 21 3 Pluto in Science 33 4 Pluto's Fall from Grace 49 5 Pluto Divides the Nation 95 6 Pluto's Judgment Day 115 7 Pluto the Dwarf Planet 131 8 Pluto in the Elementary School Classroom

rawTOC:
Preface xi \\ 1 Pluto in Culture 3 \\ 2 Pluto in History 21 \\ 3 Pluto in Science 33 \\ 4 Pluto's Fall from Grace 49 \\ 5 Pluto Divides the Nation 95 \\ 6 Pluto's Judgment Day 115 \\ 7 Pluto the Dwarf Planet 131 \\ 8 Pluto in the Elementary School Classroom

entry:
@Book{deGrasseTyson:2008:PFR,
  author =       "Neil deGrasse Tyson",
  title =        "The {Pluto} files: the rise and fall of {America}'s
                 favorite planet",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "xii + 194",
  year =         "2008",
  ISBN =         "0-393-06520-0 (hardcover)",
  ISBN-13 =      "978-0-393-06520-6 (hardcover)",
  LCCN =         "QB701 .T97 2009",
  bibdate =      "Tue Jan 24 14:06:56 MST 2012",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  subject =      "Pluto (Dwarf planet)",
  tableofcontents = "Preface xi \\
                 1 Pluto in Culture 3 \\
                 2 Pluto in History 21 \\
                 3 Pluto in Science 33 \\
                 4 Pluto's Fall from Grace 49 \\
                 5 Pluto Divides the Nation 95 \\
                 6 Pluto's Judgment Day 115 \\
                 7 Pluto the Dwarf Planet 131 \\
                 8 Pluto in the Elementary School Classroom",
}


bibtype: book
filename: master.bib
label: deGrasseTyson:2018:AWU
author: Neil deGrasse Tyson and Avis Lang
title: Accessory to War: the Unspoken Alliance Between Astrophysics and the Military
publisher: pub-NORTON
address: pub-NORTON:adr
pages: xiv + 576
year: 2018
ISBN: 0-393-06444-1 (hardcover) OR 0393064441 (hardcover)
ISBN13: 978-0-393-06444-5 (hardcover) OR 9780393064445 (hardcover)
LCCN: UG1523 .T97 2018
bibdate: Sat Dec 22 16:29:48 MST 2018
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2018.12.22 16:29:48 MST
acknowledgement: ack-nhfb
rawauthor: Neil deGrasse Tyson and Avis Lang
rawtitle: Accessory to War: the Unspoken Alliance Between Astrophysics and the Military
abstract:
An exploration of the age-old complicity between skywatchers and warfighters, from the best-selling author of booktitle Astrophysics for People in a Hurry. In this fascinating foray into the centuries-old relationship between science and military power, acclaimed astrophysicist Neil deGrasse Tyson and writer--researcher Avis Lang examine how the methods and tools of astrophysics have been enlisted in the service of war. The overlap is strong, and the knowledge flows in both directions, say the authors, because astrophysicists and military planners care about many of the same things: multispectral detection, ranging, tracking, imaging, high ground, nuclear fusion, and access to space. Tyson and Lang call it a `curiously complicit' alliance. Spanning early celestial navigation to satellite-enabled warfare, booktitle Accessory to War is a richly researched and provocative examination of the intersection of science, technology, industry, and power that will introduce Tyson's millions of fans to yet another dimension of how the universe has shaped our lives and our world.

subject:
Astronautics, Military; United States; Astrophysics; Military research; Military art and science; Technological innovations; History; Science and state

TOC:
Prologue Situational awareness A time to kill Star power Sea power Arming the eye The ultimate high ground Unseen, undetected, unspoken Detection stories Making war, seeking peace Space power A time to heal

rawabstract:
An exploration of the age-old complicity between skywatchers and warfighters, from the best-selling author of \booktitle{Astrophysics for People in a Hurry}. In this fascinating foray into the centuries-old relationship between science and military power, acclaimed astrophysicist Neil deGrasse Tyson and writer--researcher Avis Lang examine how the methods and tools of astrophysics have been enlisted in the service of war. The overlap is strong, and the knowledge flows in both directions, say the authors, because astrophysicists and military planners care about many of the same things: multispectral detection, ranging, tracking, imaging, high ground, nuclear fusion, and access to space. Tyson and Lang call it a `curiously complicit' alliance. Spanning early celestial navigation to satellite-enabled warfare, \booktitle{Accessory to War} is a richly researched and provocative examination of the intersection of science, technology, industry, and power that will introduce Tyson's millions of fans to yet another dimension of how the universe has shaped our lives and our world.

rawTOC:
Prologue \\ Situational awareness \\ A time to kill \\ Star power \\ Sea power \\ Arming the eye \\ The ultimate high ground \\ Unseen, undetected, unspoken \\ Detection stories \\ Making war, seeking peace \\ Space power \\ A time to heal

entry:
@Book{deGrasseTyson:2018:AWU,
  author =       "Neil deGrasse Tyson and Avis Lang",
  title =        "Accessory to War: the Unspoken Alliance Between
                 Astrophysics and the Military",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "xiv + 576",
  year =         "2018",
  ISBN =         "0-393-06444-1 (hardcover)",
  ISBN-13 =      "978-0-393-06444-5 (hardcover)",
  LCCN =         "UG1523 .T97 2018",
  bibdate =      "Sat Dec 22 16:29:48 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "An exploration of the age-old complicity between
                 skywatchers and warfighters, from the best-selling
                 author of \booktitle{Astrophysics for People in a
                 Hurry}. In this fascinating foray into the
                 centuries-old relationship between science and military
                 power, acclaimed astrophysicist Neil deGrasse Tyson and
                 writer--researcher Avis Lang examine how the methods
                 and tools of astrophysics have been enlisted in the
                 service of war. The overlap is strong, and the
                 knowledge flows in both directions, say the authors,
                 because astrophysicists and military planners care
                 about many of the same things: multispectral detection,
                 ranging, tracking, imaging, high ground, nuclear
                 fusion, and access to space. Tyson and Lang call it a
                 `curiously complicit' alliance. Spanning early
                 celestial navigation to satellite-enabled warfare,
                 \booktitle{Accessory to War} is a richly researched and
                 provocative examination of the intersection of science,
                 technology, industry, and power that will introduce
                 Tyson's millions of fans to yet another dimension of
                 how the universe has shaped our lives and our world.",
  acknowledgement = ack-nhfb,
  subject =      "Astronautics, Military; United States; Astrophysics;
                 Military research; Military art and science;
                 Technological innovations; History; Science and state",
  tableofcontents = "Prologue \\
                 Situational awareness \\
                 A time to kill \\
                 Star power \\
                 Sea power \\
                 Arming the eye \\
                 The ultimate high ground \\
                 Unseen, undetected, unspoken \\
                 Detection stories \\
                 Making war, seeking peace \\
                 Space power \\
                 A time to heal",
}


bibtype: book
filename: master.bib
label: DeGroot:2002:PS
author: Morris H. DeGroot and Mark J. Schervish
title: Probability and Statistics
publisher: pub-AW
address: pub-AW:adr
edition: Third
pages: xv + 816
year: 2002
LCCN: QA273 .D35 2002
bibdate: Mon Oct 26 17:55:42 MDT 2009
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2009.10.26 17:55:42 MDT
subject: probabilities; mathematical statistics
acknowledgement: ack-nhfb
rawauthor: Morris H. DeGroot and Mark J. Schervish
rawtitle: Probability and Statistics
ISBN:
0-201-52488-0, 0-321-20473-5 (paperback), 0-201-71129-X (Solutions manual) OR 0201524880, 0321204735 (paperback), 020171129X (Solutions manual)

ISBN13:
978-0-201-52488-8, 978-0-321-20473-8 (paperback), 978-0-201-71129-5 (Solutions manual) OR 9780201524888, 9780321204738 (paperback), 9780201711295 (Solutions manual)

abstract:
The revision of this well-respected text presents a balanced approach of the classical and Bayesian methods and now includes a new chapter on simulation (including Markov chain Monte Carlo and the Bootstrap), expanded coverage of residual analysis in linear models, and more examples using real data.

TOC:
1: Introduction to probability 2: Conditional probability 3: Random values and distributions 4: Expectation 5: Special distributions 6: Estimation 7: Sampling distributions of estimators 8: Testing hypotheses 9: Categorical data and nonparametric methods 10: Linear statistical models 11: Simulation

rawabstract:
The revision of this well-respected text presents a balanced approach of the classical and Bayesian methods and now includes a new chapter on simulation (including Markov chain Monte Carlo and the Bootstrap), expanded coverage of residual analysis in linear models, and more examples using real data.

rawTOC:
1: Introduction to probability \\ 2: Conditional probability \\ 3: Random values and distributions \\ 4: Expectation \\ 5: Special distributions \\ 6: Estimation \\ 7: Sampling distributions of estimators \\ 8: Testing hypotheses \\ 9: Categorical data and nonparametric methods \\ 10: Linear statistical models \\ 11: Simulation

entry:
@Book{DeGroot:2002:PS,
  author =       "Morris H. DeGroot and Mark J. Schervish",
  title =        "Probability and Statistics",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Third",
  pages =        "xv + 816",
  year =         "2002",
  ISBN =         "0-201-52488-0, 0-321-20473-5 (paperback),
                 0-201-71129-X (Solutions manual)",
  ISBN-13 =      "978-0-201-52488-8, 978-0-321-20473-8 (paperback),
                 978-0-201-71129-5 (Solutions manual)",
  LCCN =         "QA273 .D35 2002",
  bibdate =      "Mon Oct 26 17:55:42 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "The revision of this well-respected text presents a
                 balanced approach of the classical and Bayesian methods
                 and now includes a new chapter on simulation (including
                 Markov chain Monte Carlo and the Bootstrap), expanded
                 coverage of residual analysis in linear models, and
                 more examples using real data.",
  acknowledgement = ack-nhfb,
  subject =      "probabilities; mathematical statistics",
  tableofcontents = "1: Introduction to probability \\
                 2: Conditional probability \\
                 3: Random values and distributions \\
                 4: Expectation \\
                 5: Special distributions \\
                 6: Estimation \\
                 7: Sampling distributions of estimators \\
                 8: Testing hypotheses \\
                 9: Categorical data and nonparametric methods \\
                 10: Linear statistical models \\
                 11: Simulation",
}


bibtype: book
filename: master.bib
label: DeLamarter:1986:BBI
author: Richard Thomas DeLamarter
title: Big Blue: IBM's use and abuse of power
publisher: Dodd, Mead
address: New York, NY, USA
pages: xviii + 393
year: 1986
ISBN: 0-396-08515-6 OR 0396085156
ISBN13: 978-0-396-08515-7 OR 9780396085157
LCCN: HD9696.C64 I4835 1986
bibdate: Fri Jan 24 07:00:35 MST 2014
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2014.01.24 07:00:35 MST
acknowledgement: ack-nhfb
rawauthor: Richard Thomas DeLamarter
rawtitle: {Big Blue}: {IBM}'s use and abuse of power
remark:
An account of the 1970s antitrust suit against IBM, initiated by competitors known as the BUNCH (Burroughs, Univac, NCR, CDC, and Honeywell), and prosecuted by the US government.

subject:
Computer industry; United States; Monopolies; Government policy; IBM (International Business Machines Corporation)

entry:
@Book{DeLamarter:1986:BBI,
  author =       "Richard Thomas DeLamarter",
  title =        "{Big Blue}: {IBM}'s use and abuse of power",
  publisher =    "Dodd, Mead",
  address =      "New York, NY, USA",
  pages =        "xviii + 393",
  year =         "1986",
  ISBN =         "0-396-08515-6",
  ISBN-13 =      "978-0-396-08515-7",
  LCCN =         "HD9696.C64 I4835 1986",
  bibdate =      "Fri Jan 24 07:00:35 MST 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  remark =       "An account of the 1970s antitrust suit against IBM,
                 initiated by competitors known as the BUNCH (Burroughs,
                 Univac, NCR, CDC, and Honeywell), and prosecuted by the
                 US government.",
  subject =      "Computer industry; United States; Monopolies;
                 Government policy; IBM (International Business Machines
                 Corporation)",
}


bibtype: book
filename: master.bib
label: DelZoppo:1976:VP
author: Annette Del Zoppo
title: The Vegreville Pysanka
publisher: Ronald D. Resch
address: Salt Lake City, UT, USA
pages: 16
year: 1976
bibdate: Sat Mar 25 06:34:32 2017
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2017.03.25 06:34:32 ???
acknowledgement: ack-nhfb
rawauthor: Annette {Del Zoppo}
rawtitle: The {Vegreville} Pysanka
remark:
This is a brief story with several photographs by the author of the design, construction, and installation of the Ukrainian Easter egg sculpture in Vegreville, AB, Canada.

entry:
@Book{DelZoppo:1976:VP,
  author =       "Annette {Del Zoppo}",
  title =        "The {Vegreville} Pysanka",
  publisher =    "Ronald D. Resch",
  address =      "Salt Lake City, UT, USA",
  pages =        "16",
  year =         "1976",
  bibdate =      "Sat Mar 25 06:34:32 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  remark =       "This is a brief story with several photographs by the
                 author of the design, construction, and installation of
                 the Ukrainian Easter egg sculpture in Vegreville, AB,
                 Canada.",
}


bibtype: book
filename: master.bib
label: Denbigh:1966:PCE
author: Kenneth Denbigh
title: The Principles of Chemical Equilibrium: With Applications in Chemistry and Chemical Engineering
publisher: pub-CAMBRIDGE
address: pub-CAMBRIDGE:adr
pages: xxi + 494
year: 1966
LCCN: QD501 .D365 1966
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: Kenneth Denbigh
rawtitle: The Principles of Chemical Equilibrium: With Applications in Chemistry and Chemical Engineering
entry:
@Book{Denbigh:1966:PCE,
  author =       "Kenneth Denbigh",
  title =        "The Principles of Chemical Equilibrium: With
                 Applications in Chemistry and Chemical Engineering",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xxi + 494",
  year =         "1966",
  LCCN =         "QD501 .D365 1966",
  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: Dennis:1983:NMU
author: J. E. Dennis, Jr. and Robert B. Schnabel
title: Numerical Methods for Unconstrained Optimization and Nonlinear Equations
publisher: pub-PH
address: pub-PH:adr
pages: xiii + 378
year: 1983
ISBN: 0-13-627216-9 OR 0136272169
ISBN13: 978-0-13-627216-8 OR 9780136272168
LCCN: QA402.5 .D44 1983
bibdate: Tue Dec 14 22:47:13 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:47:13 ???
series: Prentice-Hall Series in Computational Mathematics, Cleve Moler, Advisor
acknowledgement: ack-nhfb
rawauthor: J. E. {Dennis, Jr.} and Robert B. Schnabel
rawtitle: Numerical Methods for Unconstrained Optimization and Nonlinear Equations
entry:
@Book{Dennis:1983:NMU,
  author =       "J. E. {Dennis, Jr.} and Robert B. Schnabel",
  title =        "Numerical Methods for Unconstrained Optimization and
                 Nonlinear Equations",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiii + 378",
  year =         "1983",
  ISBN =         "0-13-627216-9",
  ISBN-13 =      "978-0-13-627216-8",
  LCCN =         "QA402.5 .D44 1983",
  bibdate =      "Tue Dec 14 22:47:13 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Prentice-Hall Series in Computational Mathematics,
                 Cleve Moler, Advisor",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Deogun:2018:SD
author: Daniel Deogun and Dan Bergh Johnsson and Daniel Sawano
title: Secure by Design
publisher: pub-MANNING
address: pub-MANNING:adr
pages: xxx + 368
year: 2019
ISBN: 1-61729-435-7 (paperback), 1-63835-231-3 (e-book) OR 1617294357 (paperback), 1638352313 (ebook)
LCCN: QA76.754 .D464 2018
bibdate: Tue May 6 09:36:40 MDT 2025
bibsource: fsz3950.oclc.org:210/WorldCat
bibtimestamp: 2025.05.06 09:36:40 MDT
note: Foreword by Daniel Terhorst-North.
URL: https://www.manning.com/books/secure-by-design
subject: Computer software; Development
acknowledgement: ack-nhfb
rawauthor: Daniel Deogun and Dan Bergh Johnsson and Daniel Sawano
rawnote: Foreword by Daniel Terhorst-North.
rawtitle: Secure by Design
ISBN13:
978-1-61729-435-8 (paperback), 978-1-63835-231-0 (e-book) OR 9781617294358 (paperback), 9781638352310 (ebook)

abstract:
Secure by Design teaches you principles and best practices for writing highly secure software. At the code level, you'll discover security-promoting constructs like safe error handling, secure validation, and domain primitives. You'll also master security-centric techniques you can apply throughout your build-test-deploy pipeline, including the unique concerns of modern microservices and cloud-native designs.

TOC:
Intro Secure by Design Brief contents Contents Front matter Foreword Preface Acknowledgments About this book Who should read this book How this book is organized: A roadmap About the code LiveBook discussion forum About the authors About the cover illustration Part 1 Introduction 1 Why design matters for security 1.1 Security is a concern, not a feature 1.1.1 The robbery of Ost-Gotha Bank, 1854 1.1.2 Security features and concerns 1.1.3 Categorizing security concerns: CIA-T 1.2 Defining design 1.3 The traditional approach to software security and its shortcomings 1.3.1 Explicitly thinking about security 1.3.2 Everyone is a security expert 1.3.3 Knowing all and the unknowable 1.4 Driving security through design 1.4.1 Making the user secure by design 1.4.2 The advantages of the design approach 1.4.3 Staying eclectic 1.5 Dealing with strings, XML, and a billion laughs 1.5.1 Extensible Markup Language (XML) 1.5.2 Internal XML entities in a nutshell 1.5.3 The Billion Laughs attack 1.5.4 Configuring the XML parser 1.5.5 Applying a design mindset 1.5.6 Applying operational constraints 1.5.7 Achieving security in depth Summary 2 Intermission: The anti-Hamlet 2.1 An online bookstore with business integrity issues 2.1.1 The inner workings of the accounts receivable ledger 2.1.2 How the inventory system tracks books in the store 2.1.3 Shipping anti-books 2.1.4 Systems living the same lie 2.1.5 A do-it-yourself discount voucher 2.2 Shallow modeling 2.2.1 How shallow models emerge 2.2.2 The dangers of implicit concepts 2.3 Deep modeling 2.3.1 How deep models emerge 2.3.2 Make the implicit explicit Summary Part 2 Fundamentals 3 Core concepts of Domain-Driven Design3.1 Models as tools for deeper insight 3.1.1 Models are simplifications 3.1.2 Models are strict 3.1.3 Models capture deep understanding 3.1.4 Making a model means choosing one 3.1.5 The model forms the ubiquitous language 3.2 Building blocks for your model 3.2.1 Entities 3.2.2 Value objects 3.2.3 Aggregates 3.3 Bounded contexts 3.3.1 Semantics of the ubiquitous language 3.3.2 The relationship between language, model, and bounded context 3.3.3 Identifying the bounded context 3.4 Interactions between contexts 3.4.1 Sharing a model in two contexts 3.4.2 Drawing a context map Summary 4 Code constructs promoting security 4.1 Immutability 4.1.1 An ordinary webshop 4.2 Failing fast using contracts 4.2.1 Checking preconditions for method arguments 4.2.2 Upholding invariants in constructors 4.2.3 Failing for bad state 4.3 Validation 4.3.1 Checking the origin of data 4.3.2 Checking the size of data 4.3.3 Checking lexical content of data 4.3.4 Checking the data syntax 4.3.5 Checking the data semantics Summary 5 Domain primitives 5.1 Domain primitives and invariants 5.1.1 Domain primitives as the smallest building blocks 5.1.2 Context boundaries define meaning 5.1.3 Building your domain primitive library 5.1.4 Hardening APIs with your domain primitive library 5.1.5 Avoid exposing your domain publicly 5.2 Read-once objects 5.2.1 Detecting unintentional use 5.2.2 Avoiding leaks caused by evolving code 5.3 Standing on the shoulders of domain primitives 5.3.1 The risk with overcluttered entity methods 5.3.2 Decluttering entities 5.3.3 When to use domain primitives in entities 5.4 Taint analysis Summary 6 Ensuring integrity of state 6.1 Managing state using entities 6.2 Consistent on creation6.2.1 The perils of no-arg constructors 6.2.2 ORM frameworks and no-arg constructors 6.2.3 All mandatory fields as constructor arguments 6.2.4 Construction with a fluent interface 6.2.5 Catching advanced constraints in code 6.2.6 The builder pattern for upholding advanced constraints 6.2.7 ORM frameworks and advanced constraints 6.2.8 Which construction to use when 6.3 Integrity of entities 6.3.1 Getter and setter methods 6.3.2 Avoid sharing mutable objects 6.3.3 Securing the integrity of collections Summary 7 Reducing complexity of state 7.1 Partially immutable entities 7.2 Entity state objects 7.2.1 Upholding entity state rules 7.2.2 Implementing entity state as a separate object 7.3 Entity snapshots 7.3.1 Entities represented with immutable objects 7.3.2 Changing the state of the underlying entity 7.3.3 When to use snapshots 7.4 Entity relay 7.4.1 Splitting the state graph into phases 7.4.2 When to form an entity relay Summary 8 Leveraging your delivery pipeline for security 8.1 Using a delivery pipeline 8.2 Securing your design using unit tests 8.2.1 Understanding the domain rules 8.2.2 Testing normal behavior 8.2.3 Testing boundary behavior 8.2.4 Testing with invalid input Testing with input that causes eventual harm 8.2.5 Testing the extreme 8.3 Verifying feature toggles 8.3.1 The perils of slippery toggles 8.3.2 Feature toggling as a development tool 8.3.3 Taming the toggles 8.3.4 Dealing with combinatory complexity 8.3.5 Toggles are subject to auditing 8.4 Automated security tests 8.4.1 Security tests are only tests 8.4.2 Working with security tests 8.4.3 Leveraging infrastructure as code 8.4.4 Putting it into practice 8.5 Testing for availability 8.5.1 Estimating the headroom8.5.2 Exploiting domain rules 8.6 Validating configuration 8.6.1 Causes for configuration-related security flaws 8.6.2 Automated tests as your safety net 8.6.3 Knowing your defaults and verifying them Summary 9 Handling failures securely 9.1 Using exceptions to deal with failure 9.1.1 Throwing exceptions 9.1.2 Handling exceptions 9.1.3 Dealing with exception payload 9.2 Handling failures without exceptions 9.2.1 Failures aren't exceptional 9.2.2 Designing for failures 9.3 Designing for availability 9.3.1 Resilience 9.3.2 Responsiveness 9.3.3 Circuit breakers and timeouts Always specify a timeout 9.3.4 Bulkheads 9.4 Handling bad data Cross-site scripting and second-order attacks 9.4.1 Don't repair data before validation 9.4.2 Never echo input verbatim Summary 10 Benefits of cloud thinking 10.1 The twelve-factor app and cloud-native concepts 10.2 Storing configuration in the environment 10.2.1 Don't put environment configuration in code 10.2.2 Never store secrets in resource files 10.2.3 Placing configuration in the environment 10.3 Separate processes 10.3.1 Deploying and running are separate things 10.3.2 Processing instances don't hold state 10.3.3 Security benefits 10.4 Avoid logging to file 10.4.1 Confidentiality 10.4.2 Integrity 10.4.3 Availability 10.4.4 Logging as a service 10.5 Admin processes 10.5.1 The security risk of overlooked admin tasks 10.5.2 Admin tasks as first-class citizens Admin of log files 10.6 Service discovery and load balancing 10.6.1 Centralized load balancing 10.6.2 Client-side load balancing 10.6.3 Embracing change 10.7 The three R's of enterprise security 10.7.1 Increase change to reduce risk 10.7.2 Rotate 10.7.3 Repave 10.7.4 Repair Summary11 Intermission: An insurance policy for free 11.1 Over-the-counter insurance policies 11.2 Separating services 11.3 A new payment type 11.4 A crashed car, a late payment, and a court case 11.5 Understanding what went wrong 11.6 Seeing the entire picture 11.7 A note on microservices architecture Summary Part 3 Applying the fundamentals 12 Guidance in legacy code 12.1 Determining where to apply domain primitives in legacy code 12.2 Ambiguous parameter lists 12.2.1 The direct approach 12.2.2 The discovery approach 12.2.3 The new API approach 12.3 Logging unchecked strings 12.3.1 Identifying logging of unchecked strings 12.3.2 Identifying implicit data leakage 12.4 Defensive code constructs 12.4.1 Code that doesn't trust itself 12.4.2 Contracts and domain primitives to the rescue 12.4.3 Overlenient use of Optional 12.5 DRY misapplied-not focusing on ideas, but on text 12.5.1 A false positive that shouldn't be DRY'd away 12.5.2 The problem of collecting repeated pieces of code 12.5.3 The good DRY 12.5.4 A false negative 12.6 Insufficient validation in domain types 12.7 Only testing the good enough 12.8 Partial domain primitives No double money 12.8.1 Implicit, contextual currency 12.8.2 A U.S. dollar is not a Slovenian tolar 12.8.3 Encompassing a conceptual whole Summary 13 Guidance on microservices 13.1 What's a microservice? 13.1.1 Independent runtimes 13.1.2 Independent updates 13.1.3 Designed for down 13.2 Each service is a bounded context 13.2.1 The importance of designing your API 13.2.2 Splitting monoliths 13.2.3 Semantics and evolving services 13.3 Sensitive data across services 13.3.1 CIA-T in a microservice architecture 13.3.2 Thinking ``sensitive'' 13.4 Logging in microservices 13.4.1 Integrity of aggregated log data ldots 

rawabstract:
Secure by Design teaches you principles and best practices for writing highly secure software. At the code level, you'll discover security-promoting constructs like safe error handling, secure validation, and domain primitives. You'll also master security-centric techniques you can apply throughout your build-test-deploy pipeline, including the unique concerns of modern microservices and cloud-native designs.

shortTOC:
Part 1: Introduction 1: Why design matters for security 2: Intermission: the anti-Hamlet Part 2: Fundamentals 3: Core concepts of Domain-Driven Design 4: Code constructs promoting security 5: Domain primitives 6: Ensuring integrity of state 7: Reducing complexity of state 8: Leveraging your delivery pipeline for security 9: Handling failures securely 10: Benefits of cloud thinking 11: Intermission: an insurance policy for free Part 3: Applying the Fundamentals 12: Guidance in legacy code 13: Guidance on microservices 14: A final word: don't forget about security!

rawshortTOC:
Part 1: Introduction \\ 1: Why design matters for security \\ 2: Intermission: the anti-Hamlet \\ Part 2: Fundamentals \\ 3: Core concepts of Domain-Driven Design \\ 4: Code constructs promoting security \\ 5: Domain primitives \\ 6: Ensuring integrity of state \\ 7: Reducing complexity of state \\ 8: Leveraging your delivery pipeline for security \\ 9: Handling failures securely \\ 10: Benefits of cloud thinking \\ 11: Intermission: an insurance policy for free \\ Part 3: Applying the Fundamentals \\ 12: Guidance in legacy code \\ 13: Guidance on microservices \\ 14: A final word: don't forget about security!

rawTOC:
Intro \\ Secure by Design \\ Brief contents \\ Contents \\ Front matter \\ Foreword \\ Preface \\ Acknowledgments \\ About this book \\ Who should read this book \\ How this book is organized: A roadmap \\ About the code \\ LiveBook discussion forum \\ About the authors \\ About the cover illustration \\ Part 1 Introduction \\ 1 Why design matters for security \\ 1.1 Security is a concern, not a feature \\ 1.1.1 The robbery of {\"O}st-G{\"o}tha Bank, 1854 \\ 1.1.2 Security features and concerns \\ 1.1.3 Categorizing security concerns: CIA-T \\ 1.2 Defining design \\ 1.3 The traditional approach to software security and its shortcomings \\ 1.3.1 Explicitly thinking about security \\ 1.3.2 Everyone is a security expert \\ 1.3.3 Knowing all and the unknowable \\ 1.4 Driving security through design \\ 1.4.1 Making the user secure by design \\ 1.4.2 The advantages of the design approach \\ 1.4.3 Staying eclectic \\ 1.5 Dealing with strings, XML, and a billion laughs \\ 1.5.1 Extensible Markup Language (XML) \\ 1.5.2 Internal XML entities in a nutshell \\ 1.5.3 The Billion Laughs attack \\ 1.5.4 Configuring the XML parser \\ 1.5.5 Applying a design mindset \\ 1.5.6 Applying operational constraints \\ 1.5.7 Achieving security in depth \\ Summary \\ 2 Intermission: The anti-Hamlet \\ 2.1 An online bookstore with business integrity issues \\ 2.1.1 The inner workings of the accounts receivable ledger \\ 2.1.2 How the inventory system tracks books in the store \\ 2.1.3 Shipping anti-books \\ 2.1.4 Systems living the same lie \\ 2.1.5 A do-it-yourself discount voucher \\ 2.2 Shallow modeling \\ 2.2.1 How shallow models emerge \\ 2.2.2 The dangers of implicit concepts \\ 2.3 Deep modeling \\ 2.3.1 How deep models emerge \\ 2.3.2 Make the implicit explicit \\ Summary \\ Part 2 Fundamentals \\ 3 Core concepts of Domain-Driven Design3.1 Models as tools for deeper insight \\ 3.1.1 Models are simplifications \\ 3.1.2 Models are strict \\ 3.1.3 Models capture deep understanding \\ 3.1.4 Making a model means choosing one \\ 3.1.5 The model forms the ubiquitous language \\ 3.2 Building blocks for your model \\ 3.2.1 Entities \\ 3.2.2 Value objects \\ 3.2.3 Aggregates \\ 3.3 Bounded contexts \\ 3.3.1 Semantics of the ubiquitous language \\ 3.3.2 The relationship between language, model, and bounded context \\ 3.3.3 Identifying the bounded context \\ 3.4 Interactions between contexts \\ 3.4.1 Sharing a model in two contexts \\ 3.4.2 Drawing a context map \\ Summary \\ 4 Code constructs promoting security \\ 4.1 Immutability \\ 4.1.1 An ordinary webshop \\ 4.2 Failing fast using contracts \\ 4.2.1 Checking preconditions for method arguments \\ 4.2.2 Upholding invariants in constructors \\ 4.2.3 Failing for bad state \\ 4.3 Validation \\ 4.3.1 Checking the origin of data \\ 4.3.2 Checking the size of data \\ 4.3.3 Checking lexical content of data \\ 4.3.4 Checking the data syntax \\ 4.3.5 Checking the data semantics \\ Summary \\ 5 Domain primitives \\ 5.1 Domain primitives and invariants \\ 5.1.1 Domain primitives as the smallest building blocks \\ 5.1.2 Context boundaries define meaning \\ 5.1.3 Building your domain primitive library \\ 5.1.4 Hardening APIs with your domain primitive library \\ 5.1.5 Avoid exposing your domain publicly \\ 5.2 Read-once objects \\ 5.2.1 Detecting unintentional use \\ 5.2.2 Avoiding leaks caused by evolving code \\ 5.3 Standing on the shoulders of domain primitives \\ 5.3.1 The risk with overcluttered entity methods \\ 5.3.2 Decluttering entities \\ 5.3.3 When to use domain primitives in entities \\ 5.4 Taint analysis \\ Summary \\ 6 Ensuring integrity of state \\ 6.1 Managing state using entities \\ 6.2 Consistent on creation6.2.1 The perils of no-arg constructors \\ 6.2.2 ORM frameworks and no-arg constructors \\ 6.2.3 All mandatory fields as constructor arguments \\ 6.2.4 Construction with a fluent interface \\ 6.2.5 Catching advanced constraints in code \\ 6.2.6 The builder pattern for upholding advanced constraints \\ 6.2.7 ORM frameworks and advanced constraints \\ 6.2.8 Which construction to use when \\ 6.3 Integrity of entities \\ 6.3.1 Getter and setter methods \\ 6.3.2 Avoid sharing mutable objects \\ 6.3.3 Securing the integrity of collections \\ Summary \\ 7 Reducing complexity of state \\ 7.1 Partially immutable entities \\ 7.2 Entity state objects \\ 7.2.1 Upholding entity state rules \\ 7.2.2 Implementing entity state as a separate object \\ 7.3 Entity snapshots \\ 7.3.1 Entities represented with immutable objects \\ 7.3.2 Changing the state of the underlying entity \\ 7.3.3 When to use snapshots \\ 7.4 Entity relay \\ 7.4.1 Splitting the state graph into phases \\ 7.4.2 When to form an entity relay \\ Summary \\ 8 Leveraging your delivery pipeline for security \\ 8.1 Using a delivery pipeline \\ 8.2 Securing your design using unit tests \\ 8.2.1 Understanding the domain rules \\ 8.2.2 Testing normal behavior \\ 8.2.3 Testing boundary behavior \\ 8.2.4 Testing with invalid input \\ Testing with input that causes eventual harm \\ 8.2.5 Testing the extreme \\ 8.3 Verifying feature toggles \\ 8.3.1 The perils of slippery toggles \\ 8.3.2 Feature toggling as a development tool \\ 8.3.3 Taming the toggles \\ 8.3.4 Dealing with combinatory complexity \\ 8.3.5 Toggles are subject to auditing \\ 8.4 Automated security tests \\ 8.4.1 Security tests are only tests \\ 8.4.2 Working with security tests \\ 8.4.3 Leveraging infrastructure as code \\ 8.4.4 Putting it into practice \\ 8.5 Testing for availability \\ 8.5.1 Estimating the headroom8.5.2 Exploiting domain rules \\ 8.6 Validating configuration \\ 8.6.1 Causes for configuration-related security flaws \\ 8.6.2 Automated tests as your safety net \\ 8.6.3 Knowing your defaults and verifying them \\ Summary \\ 9 Handling failures securely \\ 9.1 Using exceptions to deal with failure \\ 9.1.1 Throwing exceptions \\ 9.1.2 Handling exceptions \\ 9.1.3 Dealing with exception payload \\ 9.2 Handling failures without exceptions \\ 9.2.1 Failures aren't exceptional \\ 9.2.2 Designing for failures \\ 9.3 Designing for availability \\ 9.3.1 Resilience \\ 9.3.2 Responsiveness \\ 9.3.3 Circuit breakers and timeouts \\ Always specify a timeout \\ 9.3.4 Bulkheads \\ 9.4 Handling bad data \\ Cross-site scripting and second-order attacks \\ 9.4.1 Don't repair data before validation \\ 9.4.2 Never echo input verbatim \\ Summary \\ 10 Benefits of cloud thinking \\ 10.1 The twelve-factor app and cloud-native concepts \\ 10.2 Storing configuration in the environment \\ 10.2.1 Don't put environment configuration in code \\ 10.2.2 Never store secrets in resource files \\ 10.2.3 Placing configuration in the environment \\ 10.3 Separate processes \\ 10.3.1 Deploying and running are separate things \\ 10.3.2 Processing instances don't hold state \\ 10.3.3 Security benefits \\ 10.4 Avoid logging to file \\ 10.4.1 Confidentiality \\ 10.4.2 Integrity \\ 10.4.3 Availability \\ 10.4.4 Logging as a service \\ 10.5 Admin processes \\ 10.5.1 The security risk of overlooked admin tasks \\ 10.5.2 Admin tasks as first-class citizens \\ Admin of log files \\ 10.6 Service discovery and load balancing \\ 10.6.1 Centralized load balancing \\ 10.6.2 Client-side load balancing \\ 10.6.3 Embracing change \\ 10.7 The three R's of enterprise security \\ 10.7.1 Increase change to reduce risk \\ 10.7.2 Rotate \\ 10.7.3 Repave \\ 10.7.4 Repair \\ Summary11 Intermission: An insurance policy for free \\ 11.1 Over-the-counter insurance policies \\ 11.2 Separating services \\ 11.3 A new payment type \\ 11.4 A crashed car, a late payment, and a court case \\ 11.5 Understanding what went wrong \\ 11.6 Seeing the entire picture \\ 11.7 A note on microservices architecture \\ Summary \\ Part 3 Applying the fundamentals \\ 12 Guidance in legacy code \\ 12.1 Determining where to apply domain primitives in legacy code \\ 12.2 Ambiguous parameter lists \\ 12.2.1 The direct approach \\ 12.2.2 The discovery approach \\ 12.2.3 The new API approach \\ 12.3 Logging unchecked strings \\ 12.3.1 Identifying logging of unchecked strings \\ 12.3.2 Identifying implicit data leakage \\ 12.4 Defensive code constructs \\ 12.4.1 Code that doesn't trust itself \\ 12.4.2 Contracts and domain primitives to the rescue \\ 12.4.3 Overlenient use of Optional \\ 12.5 DRY misapplied-not focusing on ideas, but on text \\ 12.5.1 A false positive that shouldn't be DRY'd away \\ 12.5.2 The problem of collecting repeated pieces of code \\ 12.5.3 The good DRY \\ 12.5.4 A false negative \\ 12.6 Insufficient validation in domain types \\ 12.7 Only testing the good enough \\ 12.8 Partial domain primitives \\ No double money \\ 12.8.1 Implicit, contextual currency \\ 12.8.2 A U.S. dollar is not a Slovenian tolar \\ 12.8.3 Encompassing a conceptual whole \\ Summary \\ 13 Guidance on microservices \\ 13.1 What's a microservice? \\ 13.1.1 Independent runtimes \\ 13.1.2 Independent updates \\ 13.1.3 Designed for down \\ 13.2 Each service is a bounded context \\ 13.2.1 The importance of designing your API \\ 13.2.2 Splitting monoliths \\ 13.2.3 Semantics and evolving services \\ 13.3 Sensitive data across services \\ 13.3.1 CIA-T in a microservice architecture \\ 13.3.2 Thinking ``sensitive'' \\ 13.4 Logging in microservices \\ 13.4.1 Integrity of aggregated log data \\ \ldots{}

entry:
@Book{Deogun:2018:SD,
  author =       "Daniel Deogun and Dan Bergh Johnsson and Daniel
                 Sawano",
  title =        "Secure by Design",
  publisher =    pub-MANNING,
  address =      pub-MANNING:adr,
  pages =        "xxx + 368",
  year =         "2019",
  ISBN =         "1-61729-435-7 (paperback), 1-63835-231-3 (e-book)",
  ISBN-13 =      "978-1-61729-435-8 (paperback), 978-1-63835-231-0
                 (e-book)",
  LCCN =         "QA76.754 .D464 2018",
  bibdate =      "Tue May 6 09:36:40 MDT 2025",
  bibsource =    "fsz3950.oclc.org:210/WorldCat",
  note =         "Foreword by Daniel Terhorst-North.",
  URL =          "https://www.manning.com/books/secure-by-design",
  abstract =     "Secure by Design teaches you principles and best
                 practices for writing highly secure software. At the
                 code level, you'll discover security-promoting
                 constructs like safe error handling, secure validation,
                 and domain primitives. You'll also master
                 security-centric techniques you can apply throughout
                 your build-test-deploy pipeline, including the unique
                 concerns of modern microservices and cloud-native
                 designs.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Part 1: Introduction \\
                 1: Why design matters for security \\
                 2: Intermission: the anti-Hamlet \\
                 Part 2: Fundamentals \\
                 3: Core concepts of Domain-Driven Design \\
                 4: Code constructs promoting security \\
                 5: Domain primitives \\
                 6: Ensuring integrity of state \\
                 7: Reducing complexity of state \\
                 8: Leveraging your delivery pipeline for security \\
                 9: Handling failures securely \\
                 10: Benefits of cloud thinking \\
                 11: Intermission: an insurance policy for free \\
                 Part 3: Applying the Fundamentals \\
                 12: Guidance in legacy code \\
                 13: Guidance on microservices \\
                 14: A final word: don't forget about security!",
  subject =      "Computer software; Development",
  tableofcontents = "Intro \\
                 Secure by Design \\
                 Brief contents \\
                 Contents \\
                 Front matter \\
                 Foreword \\
                 Preface \\
                 Acknowledgments \\
                 About this book \\
                 Who should read this book \\
                 How this book is organized: A roadmap \\
                 About the code \\
                 LiveBook discussion forum \\
                 About the authors \\
                 About the cover illustration \\
                 Part 1 Introduction \\
                 1 Why design matters for security \\
                 1.1 Security is a concern, not a feature \\
                 1.1.1 The robbery of {\"O}st-G{\"o}tha Bank, 1854 \\
                 1.1.2 Security features and concerns \\
                 1.1.3 Categorizing security concerns: CIA-T \\
                 1.2 Defining design \\
                 1.3 The traditional approach to software security and
                 its shortcomings \\
                 1.3.1 Explicitly thinking about security \\
                 1.3.2 Everyone is a security expert \\
                 1.3.3 Knowing all and the unknowable \\
                 1.4 Driving security through design \\
                 1.4.1 Making the user secure by design \\
                 1.4.2 The advantages of the design approach \\
                 1.4.3 Staying eclectic \\
                 1.5 Dealing with strings, XML, and a billion laughs \\
                 1.5.1 Extensible Markup Language (XML) \\
                 1.5.2 Internal XML entities in a nutshell \\
                 1.5.3 The Billion Laughs attack \\
                 1.5.4 Configuring the XML parser \\
                 1.5.5 Applying a design mindset \\
                 1.5.6 Applying operational constraints \\
                 1.5.7 Achieving security in depth \\
                 Summary \\
                 2 Intermission: The anti-Hamlet \\
                 2.1 An online bookstore with business integrity issues
                 \\
                 2.1.1 The inner workings of the accounts receivable
                 ledger \\
                 2.1.2 How the inventory system tracks books in the
                 store \\
                 2.1.3 Shipping anti-books \\
                 2.1.4 Systems living the same lie \\
                 2.1.5 A do-it-yourself discount voucher \\
                 2.2 Shallow modeling \\
                 2.2.1 How shallow models emerge \\
                 2.2.2 The dangers of implicit concepts \\
                 2.3 Deep modeling \\
                 2.3.1 How deep models emerge \\
                 2.3.2 Make the implicit explicit \\
                 Summary \\
                 Part 2 Fundamentals \\
                 3 Core concepts of Domain-Driven Design3.1 Models as
                 tools for deeper insight \\
                 3.1.1 Models are simplifications \\
                 3.1.2 Models are strict \\
                 3.1.3 Models capture deep understanding \\
                 3.1.4 Making a model means choosing one \\
                 3.1.5 The model forms the ubiquitous language \\
                 3.2 Building blocks for your model \\
                 3.2.1 Entities \\
                 3.2.2 Value objects \\
                 3.2.3 Aggregates \\
                 3.3 Bounded contexts \\
                 3.3.1 Semantics of the ubiquitous language \\
                 3.3.2 The relationship between language, model, and
                 bounded context \\
                 3.3.3 Identifying the bounded context \\
                 3.4 Interactions between contexts \\
                 3.4.1 Sharing a model in two contexts \\
                 3.4.2 Drawing a context map \\
                 Summary \\
                 4 Code constructs promoting security \\
                 4.1 Immutability \\
                 4.1.1 An ordinary webshop \\
                 4.2 Failing fast using contracts \\
                 4.2.1 Checking preconditions for method arguments \\
                 4.2.2 Upholding invariants in constructors \\
                 4.2.3 Failing for bad state \\
                 4.3 Validation \\
                 4.3.1 Checking the origin of data \\
                 4.3.2 Checking the size of data \\
                 4.3.3 Checking lexical content of data \\
                 4.3.4 Checking the data syntax \\
                 4.3.5 Checking the data semantics \\
                 Summary \\
                 5 Domain primitives \\
                 5.1 Domain primitives and invariants \\
                 5.1.1 Domain primitives as the smallest building blocks
                 \\
                 5.1.2 Context boundaries define meaning \\
                 5.1.3 Building your domain primitive library \\
                 5.1.4 Hardening APIs with your domain primitive library
                 \\
                 5.1.5 Avoid exposing your domain publicly \\
                 5.2 Read-once objects \\
                 5.2.1 Detecting unintentional use \\
                 5.2.2 Avoiding leaks caused by evolving code \\
                 5.3 Standing on the shoulders of domain primitives \\
                 5.3.1 The risk with overcluttered entity methods \\
                 5.3.2 Decluttering entities \\
                 5.3.3 When to use domain primitives in entities \\
                 5.4 Taint analysis \\
                 Summary \\
                 6 Ensuring integrity of state \\
                 6.1 Managing state using entities \\
                 6.2 Consistent on creation6.2.1 The perils of no-arg
                 constructors \\
                 6.2.2 ORM frameworks and no-arg constructors \\
                 6.2.3 All mandatory fields as constructor arguments \\
                 6.2.4 Construction with a fluent interface \\
                 6.2.5 Catching advanced constraints in code \\
                 6.2.6 The builder pattern for upholding advanced
                 constraints \\
                 6.2.7 ORM frameworks and advanced constraints \\
                 6.2.8 Which construction to use when \\
                 6.3 Integrity of entities \\
                 6.3.1 Getter and setter methods \\
                 6.3.2 Avoid sharing mutable objects \\
                 6.3.3 Securing the integrity of collections \\
                 Summary \\
                 7 Reducing complexity of state \\
                 7.1 Partially immutable entities \\
                 7.2 Entity state objects \\
                 7.2.1 Upholding entity state rules \\
                 7.2.2 Implementing entity state as a separate object
                 \\
                 7.3 Entity snapshots \\
                 7.3.1 Entities represented with immutable objects \\
                 7.3.2 Changing the state of the underlying entity \\
                 7.3.3 When to use snapshots \\
                 7.4 Entity relay \\
                 7.4.1 Splitting the state graph into phases \\
                 7.4.2 When to form an entity relay \\
                 Summary \\
                 8 Leveraging your delivery pipeline for security \\
                 8.1 Using a delivery pipeline \\
                 8.2 Securing your design using unit tests \\
                 8.2.1 Understanding the domain rules \\
                 8.2.2 Testing normal behavior \\
                 8.2.3 Testing boundary behavior \\
                 8.2.4 Testing with invalid input \\
                 Testing with input that causes eventual harm \\
                 8.2.5 Testing the extreme \\
                 8.3 Verifying feature toggles \\
                 8.3.1 The perils of slippery toggles \\
                 8.3.2 Feature toggling as a development tool \\
                 8.3.3 Taming the toggles \\
                 8.3.4 Dealing with combinatory complexity \\
                 8.3.5 Toggles are subject to auditing \\
                 8.4 Automated security tests \\
                 8.4.1 Security tests are only tests \\
                 8.4.2 Working with security tests \\
                 8.4.3 Leveraging infrastructure as code \\
                 8.4.4 Putting it into practice \\
                 8.5 Testing for availability \\
                 8.5.1 Estimating the headroom8.5.2 Exploiting domain
                 rules \\
                 8.6 Validating configuration \\
                 8.6.1 Causes for configuration-related security flaws
                 \\
                 8.6.2 Automated tests as your safety net \\
                 8.6.3 Knowing your defaults and verifying them \\
                 Summary \\
                 9 Handling failures securely \\
                 9.1 Using exceptions to deal with failure \\
                 9.1.1 Throwing exceptions \\
                 9.1.2 Handling exceptions \\
                 9.1.3 Dealing with exception payload \\
                 9.2 Handling failures without exceptions \\
                 9.2.1 Failures aren't exceptional \\
                 9.2.2 Designing for failures \\
                 9.3 Designing for availability \\
                 9.3.1 Resilience \\
                 9.3.2 Responsiveness \\
                 9.3.3 Circuit breakers and timeouts \\
                 Always specify a timeout \\
                 9.3.4 Bulkheads \\
                 9.4 Handling bad data \\
                 Cross-site scripting and second-order attacks \\
                 9.4.1 Don't repair data before validation \\
                 9.4.2 Never echo input verbatim \\
                 Summary \\
                 10 Benefits of cloud thinking \\
                 10.1 The twelve-factor app and cloud-native concepts
                 \\
                 10.2 Storing configuration in the environment \\
                 10.2.1 Don't put environment configuration in code \\
                 10.2.2 Never store secrets in resource files \\
                 10.2.3 Placing configuration in the environment \\
                 10.3 Separate processes \\
                 10.3.1 Deploying and running are separate things \\
                 10.3.2 Processing instances don't hold state \\
                 10.3.3 Security benefits \\
                 10.4 Avoid logging to file \\
                 10.4.1 Confidentiality \\
                 10.4.2 Integrity \\
                 10.4.3 Availability \\
                 10.4.4 Logging as a service \\
                 10.5 Admin processes \\
                 10.5.1 The security risk of overlooked admin tasks \\
                 10.5.2 Admin tasks as first-class citizens \\
                 Admin of log files \\
                 10.6 Service discovery and load balancing \\
                 10.6.1 Centralized load balancing \\
                 10.6.2 Client-side load balancing \\
                 10.6.3 Embracing change \\
                 10.7 The three R's of enterprise security \\
                 10.7.1 Increase change to reduce risk \\
                 10.7.2 Rotate \\
                 10.7.3 Repave \\
                 10.7.4 Repair \\
                 Summary11 Intermission: An insurance policy for free
                 \\
                 11.1 Over-the-counter insurance policies \\
                 11.2 Separating services \\
                 11.3 A new payment type \\
                 11.4 A crashed car, a late payment, and a court case
                 \\
                 11.5 Understanding what went wrong \\
                 11.6 Seeing the entire picture \\
                 11.7 A note on microservices architecture \\
                 Summary \\
                 Part 3 Applying the fundamentals \\
                 12 Guidance in legacy code \\
                 12.1 Determining where to apply domain primitives in
                 legacy code \\
                 12.2 Ambiguous parameter lists \\
                 12.2.1 The direct approach \\
                 12.2.2 The discovery approach \\
                 12.2.3 The new API approach \\
                 12.3 Logging unchecked strings \\
                 12.3.1 Identifying logging of unchecked strings \\
                 12.3.2 Identifying implicit data leakage \\
                 12.4 Defensive code constructs \\
                 12.4.1 Code that doesn't trust itself \\
                 12.4.2 Contracts and domain primitives to the rescue
                 \\
                 12.4.3 Overlenient use of Optional \\
                 12.5 DRY misapplied-not focusing on ideas, but on text
                 \\
                 12.5.1 A false positive that shouldn't be DRY'd away
                 \\
                 12.5.2 The problem of collecting repeated pieces of
                 code \\
                 12.5.3 The good DRY \\
                 12.5.4 A false negative \\
                 12.6 Insufficient validation in domain types \\
                 12.7 Only testing the good enough \\
                 12.8 Partial domain primitives \\
                 No double money \\
                 12.8.1 Implicit, contextual currency \\
                 12.8.2 A U.S. dollar is not a Slovenian tolar \\
                 12.8.3 Encompassing a conceptual whole \\
                 Summary \\
                 13 Guidance on microservices \\
                 13.1 What's a microservice? \\
                 13.1.1 Independent runtimes \\
                 13.1.2 Independent updates \\
                 13.1.3 Designed for down \\
                 13.2 Each service is a bounded context \\
                 13.2.1 The importance of designing your API \\
                 13.2.2 Splitting monoliths \\
                 13.2.3 Semantics and evolving services \\
                 13.3 Sensitive data across services \\
                 13.3.1 CIA-T in a microservice architecture \\
                 13.3.2 Thinking ``sensitive'' \\
                 13.4 Logging in microservices \\
                 13.4.1 Integrity of aggregated log data \\
                 \ldots{}",
}


bibtype: book
filename: master.bib
label: Derbyshire:2003:POH
author: John Derbyshire
title: Prime obsession: Bernhard Riemann and the greatest unsolved problem in mathematics
publisher: Joseph Henry Press
address: Washington, DC, USA
pages: xv + 422
year: 2003
DOI: https://doi.org/10.17226/10532
ISBN: 0-309-08549-7 OR 0309085497
ISBN13: 978-0-309-08549-6 OR 9780309085496
LCCN: QA246 .D47 2003
bibdate: Wed Apr 5 12:16:56 MDT 2006
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; melvyl.cdlib.org:210/CDL90
bibtimestamp: 2006.04.05 12:16:56 MDT
subject: Riemann, Bernhard; Numbers, Prime; Series
acknowledgement: ack-nhfb
subjectdates: 1826--1866
rawauthor: John Derbyshire
rawtitle: Prime obsession: {Bernhard Riemann} and the greatest unsolved problem in mathematics
URL:
http://www.loc.gov/catdir/toc/fy038/2002156310.html; https://www.nap.edu/catalog/10532/prime-obsession-bernhard-riemann-and-the-greatest-unsolved-problem-in

abstract:
In August 1859, Bernhard Riemann, a little-known 32-year old mathematician, presented a paper to the Berlin Academy titled: ``On the Number of Prime Numbers Less Than a Given Quantity.'' In the middle of that paper, Riemann made an incidental remark a guess, a hypothesis. What he tossed out to the assembled mathematicians that day has proven to be almost cruelly compelling to countless scholars in the ensuing years. Today, after 150 years of careful research and exhaustive study, the question remains. Is the hypothesis true or false? Riemann's basic inquiry, the primary topic of his paper, concerned a straightforward but nevertheless important matter of arithmetic defining a precise formula to track and identify the occurrence of prime numbers. But it is that incidental remark the Riemann Hypothesis that is the truly astonishing legacy of his 1859 paper. Because Riemann was able to see beyond the pattern of the primes to discern traces of something mysterious and mathematically elegant shrouded in the shadows subtle variations in the distribution of those prime numbers. Brilliant for its clarity, astounding for its potential consequences, the Hypothesis took on enormous importance in mathematics. Indeed, the successful solution to this puzzle would herald a revolution in prime number theory. Proving or disproving it became the greatest challenge of the age. It has become clear that the Riemann Hypothesis, whose resolution seems to hang tantalizingly just beyond our grasp, holds the key to a variety of scientific and mathematical investigations. The making and breaking of modern codes, which depend on the properties of the prime numbers, have roots in the Hypothesis. In a series of extraordinary developments during the 1970s, it emerged that even the physics of the atomic nucleus is connected in ways not yet fully understood to this strange conundrum. Hunting down the solution to the Riemann Hypothesis.

TOC:
Part I. The Prime Number Theorem 1: Card Trick 2: The Soil, the Crop 3: The Prime Number Theorem 4: On the Shoulders of Giants 5: Riemann's Zeta Function 6: The Great Fusion 7: The Golden Key, and an Improved Prime Number Theorem 8: Not Altogether Unworthy 9: Domain Stretching 10: A Proof and a Turning Point Part II. The Riemann Hypothesis 11: Nine Zulu Queens Ruled China 12: Hilbert's Eighth Problem 13: The Argument Ant and the Value Ant 14: In the Grip of an Obsession 15: Big Oh and Mobius Mu 16: Climbing the Critical Line 17: A Little Algebra 18: Number Theory Meets Quantum Mechanics 19: Turning the Golden Key 20: The Riemann Operator and Other Approaches 21: The Error Term 22: Either It's True, or Else It Isn't Appendix: The Riemann Hypothesis in Song

rawabstract:
In August 1859, Bernhard Riemann, a little-known 32-year old mathematician, presented a paper to the Berlin Academy titled: ``On the Number of Prime Numbers Less Than a Given Quantity.'' In the middle of that paper, Riemann made an incidental remark a guess, a hypothesis. What he tossed out to the assembled mathematicians that day has proven to be almost cruelly compelling to countless scholars in the ensuing years. Today, after 150 years of careful research and exhaustive study, the question remains. Is the hypothesis true or false? Riemann's basic inquiry, the primary topic of his paper, concerned a straightforward but nevertheless important matter of arithmetic defining a precise formula to track and identify the occurrence of prime numbers. But it is that incidental remark the Riemann Hypothesis that is the truly astonishing legacy of his 1859 paper. Because Riemann was able to see beyond the pattern of the primes to discern traces of something mysterious and mathematically elegant shrouded in the shadows subtle variations in the distribution of those prime numbers. Brilliant for its clarity, astounding for its potential consequences, the Hypothesis took on enormous importance in mathematics. Indeed, the successful solution to this puzzle would herald a revolution in prime number theory. Proving or disproving it became the greatest challenge of the age. It has become clear that the Riemann Hypothesis, whose resolution seems to hang tantalizingly just beyond our grasp, holds the key to a variety of scientific and mathematical investigations. The making and breaking of modern codes, which depend on the properties of the prime numbers, have roots in the Hypothesis. In a series of extraordinary developments during the 1970s, it emerged that even the physics of the atomic nucleus is connected in ways not yet fully understood to this strange conundrum. Hunting down the solution to the Riemann Hypothesis.

rawTOC:
Part I. The Prime Number Theorem \\ 1: Card Trick \\ 2: The Soil, the Crop \\ 3: The Prime Number Theorem \\ 4: On the Shoulders of Giants \\ 5: Riemann's Zeta Function \\ 6: The Great Fusion \\ 7: The Golden Key, and an Improved Prime Number Theorem \\ 8: Not Altogether Unworthy \\ 9: Domain Stretching \\ 10: A Proof and a Turning Point \\ Part II. The Riemann Hypothesis \\ 11: Nine Zulu Queens Ruled China \\ 12: Hilbert's Eighth Problem \\ 13: The Argument Ant and the Value Ant \\ 14: In the Grip of an Obsession \\ 15: Big Oh and M{\"o}bius Mu \\ 16: Climbing the Critical Line \\ 17: A Little Algebra \\ 18: Number Theory Meets Quantum Mechanics \\ 19: Turning the Golden Key \\ 20: The Riemann Operator and Other Approaches \\ 21: The Error Term \\ 22: Either It's True, or Else It Isn't \\ Appendix: The Riemann Hypothesis in Song

entry:
@Book{Derbyshire:2003:POH,
  author =       "John Derbyshire",
  title =        "Prime obsession: {Bernhard Riemann} and the greatest
                 unsolved problem in mathematics",
  publisher =    "Joseph Henry Press",
  address =      "Washington, DC, USA",
  pages =        "xv + 422",
  year =         "2003",
  DOI =          "https://doi.org/10.17226/10532",
  ISBN =         "0-309-08549-7",
  ISBN-13 =      "978-0-309-08549-6",
  LCCN =         "QA246 .D47 2003",
  bibdate =      "Wed Apr 5 12:16:56 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  URL =          "http://www.loc.gov/catdir/toc/fy038/2002156310.html;
                 https://www.nap.edu/catalog/10532/prime-obsession-bernhard-riemann-and-the-greatest-unsolved-problem-in",
  abstract =     "In August 1859, Bernhard Riemann, a little-known
                 32-year old mathematician, presented a paper to the
                 Berlin Academy titled: ``On the Number of Prime Numbers
                 Less Than a Given Quantity.'' In the middle of that
                 paper, Riemann made an incidental remark a guess, a
                 hypothesis. What he tossed out to the assembled
                 mathematicians that day has proven to be almost cruelly
                 compelling to countless scholars in the ensuing years.
                 Today, after 150 years of careful research and
                 exhaustive study, the question remains. Is the
                 hypothesis true or false? Riemann's basic inquiry, the
                 primary topic of his paper, concerned a straightforward
                 but nevertheless important matter of arithmetic
                 defining a precise formula to track and identify the
                 occurrence of prime numbers. But it is that incidental
                 remark the Riemann Hypothesis that is the truly
                 astonishing legacy of his 1859 paper. Because Riemann
                 was able to see beyond the pattern of the primes to
                 discern traces of something mysterious and
                 mathematically elegant shrouded in the shadows subtle
                 variations in the distribution of those prime numbers.
                 Brilliant for its clarity, astounding for its potential
                 consequences, the Hypothesis took on enormous
                 importance in mathematics. Indeed, the successful
                 solution to this puzzle would herald a revolution in
                 prime number theory. Proving or disproving it became
                 the greatest challenge of the age. It has become clear
                 that the Riemann Hypothesis, whose resolution seems to
                 hang tantalizingly just beyond our grasp, holds the key
                 to a variety of scientific and mathematical
                 investigations. The making and breaking of modern
                 codes, which depend on the properties of the prime
                 numbers, have roots in the Hypothesis. In a series of
                 extraordinary developments during the 1970s, it emerged
                 that even the physics of the atomic nucleus is
                 connected in ways not yet fully understood to this
                 strange conundrum. Hunting down the solution to the
                 Riemann Hypothesis.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Riemann, Bernhard; Numbers, Prime; Series",
  subject-dates = "1826--1866",
  tableofcontents = "Part I. The Prime Number Theorem \\
                 1: Card Trick \\
                 2: The Soil, the Crop \\
                 3: The Prime Number Theorem \\
                 4: On the Shoulders of Giants \\
                 5: Riemann's Zeta Function \\
                 6: The Great Fusion \\
                 7: The Golden Key, and an Improved Prime Number Theorem
                 \\
                 8: Not Altogether Unworthy \\
                 9: Domain Stretching \\
                 10: A Proof and a Turning Point \\
                 Part II. The Riemann Hypothesis \\
                 11: Nine Zulu Queens Ruled China \\
                 12: Hilbert's Eighth Problem \\
                 13: The Argument Ant and the Value Ant \\
                 14: In the Grip of an Obsession \\
                 15: Big Oh and M{\"o}bius Mu \\
                 16: Climbing the Critical Line \\
                 17: A Little Algebra \\
                 18: Number Theory Meets Quantum Mechanics \\
                 19: Turning the Golden Key \\
                 20: The Riemann Operator and Other Approaches \\
                 21: The Error Term \\
                 22: Either It's True, or Else It Isn't \\
                 Appendix: The Riemann Hypothesis in Song",
}


bibtype: book
filename: master.bib
label: DeRespinis:2012:ISG
title: The IBM style guide: conventions for writers and editors
publisher: IBM Press/Pearson
address: Upper Saddle River, NJ, USA
pages: xxvi + 389
year: 2012
ISBN: 0-13-210130-0 (paperback) OR 0132101300 (paperback)
ISBN13: 978-0-13-210130-1 (paperback) OR 9780132101301 (paperback)
LCCN: T11 .I15 2012
bibdate: Fri Apr 13 10:09:33 MDT 2012
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2012.04.13 10:09:33 MDT
acknowledgement: ack-nhfb
rawtitle: The {IBM} style guide: conventions for writers and editors
author:
Francis DeRespinis and Peter Hayward and Jana Jenkins and Amy Laird and Leslie McDonald and Eric Radzinski

subject:
Technical writing; Handbooks, manuals, etc; English language; Technical English; Electronic data processing documentation

TOC:
Language and grammar Punctuation Formatting and organization Structure References Numbers and measurements Computer interfaces Writing for diverse audiences Glossaries Indexes

rawauthor:
Francis DeRespinis and Peter Hayward and Jana Jenkins and Amy Laird and Leslie McDonald and Eric Radzinski

rawTOC:
Language and grammar \\ Punctuation \\ Formatting and organization \\ Structure \\ References \\ Numbers and measurements \\ Computer interfaces \\ Writing for diverse audiences \\ Glossaries \\ Indexes

entry:
@Book{DeRespinis:2012:ISG,
  author =       "Francis DeRespinis and Peter Hayward and Jana Jenkins
                 and Amy Laird and Leslie McDonald and Eric Radzinski",
  title =        "The {IBM} style guide: conventions for writers and
                 editors",
  publisher =    "IBM Press/Pearson",
  address =      "Upper Saddle River, NJ, USA",
  pages =        "xxvi + 389",
  year =         "2012",
  ISBN =         "0-13-210130-0 (paperback)",
  ISBN-13 =      "978-0-13-210130-1 (paperback)",
  LCCN =         "T11 .I15 2012",
  bibdate =      "Fri Apr 13 10:09:33 MDT 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Technical writing; Handbooks, manuals, etc; English
                 language; Technical English; Electronic data processing
                 documentation",
  tableofcontents = "Language and grammar \\
                 Punctuation \\
                 Formatting and organization \\
                 Structure \\
                 References \\
                 Numbers and measurements \\
                 Computer interfaces \\
                 Writing for diverse audiences \\
                 Glossaries \\
                 Indexes",
}


bibtype: book
filename: master.bib
label: Dershowitz:1997:CC
author: Nachum Dershowitz and Edward M. Reingold
title: Calendrical Calculations
publisher: pub-CAMBRIDGE
address: pub-CAMBRIDGE:adr
pages: xxi + 307
year: 1997
LCCN: CE12.D47 1997
bibdate: Wed Dec 09 12:45:55 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.12.09 12:45:55 ???
acknowledgement: ack-nhfb
rawauthor: Nachum Dershowitz and Edward M. Reingold
rawtitle: Calendrical Calculations
ISBN:
0-521-56474-3 (paperback), 0-521-56413-1 (hardcover) OR 0521564743 (paperback), 0521564131 (hardcover)

ISBN13:
978-0-521-56474-8 (paperback), 978-0-521-56413-7 (hardcover) OR 9780521564748 (paperback), 9780521564137 (hardcover)

TOC:
Introduction Part I. Arithmetical Calendars The Gregorian calendar The ISO calendar The Julian calendar The Coptic and Ethiopic calendars The Islamic calendar The Persian calendar The Baha'i calendar The Hebrew calendar The Mayan calendar The Old Hindu calendars Part II. Astronomical Calendars Time and astronomy The French Revolutionary calendar The Chinese calendar The Modern Hindu calendars

rawTOC:
Introduction \\ Part I. Arithmetical Calendars \\ The Gregorian calendar \\ The ISO calendar \\ The Julian calendar \\ The Coptic and Ethiopic calendars \\ The Islamic calendar \\ The Persian calendar \\ The Baha'i calendar \\ The Hebrew calendar \\ The Mayan calendar \\ The Old Hindu calendars \\ Part II. Astronomical Calendars \\ Time and astronomy \\ The French Revolutionary calendar \\ The Chinese calendar \\ The Modern Hindu calendars

entry:
@Book{Dershowitz:1997:CC,
  author =       "Nachum Dershowitz and Edward M. Reingold",
  title =        "Calendrical Calculations",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xxi + 307",
  year =         "1997",
  ISBN =         "0-521-56474-3 (paperback), 0-521-56413-1 (hardcover)",
  ISBN-13 =      "978-0-521-56474-8 (paperback), 978-0-521-56413-7
                 (hardcover)",
  LCCN =         "CE12.D47 1997",
  bibdate =      "Wed Dec 09 12:45:55 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction \\
                 Part I. Arithmetical Calendars \\
                 The Gregorian calendar \\
                 The ISO calendar \\
                 The Julian calendar \\
                 The Coptic and Ethiopic calendars \\
                 The Islamic calendar \\
                 The Persian calendar \\
                 The Baha'i calendar \\
                 The Hebrew calendar \\
                 The Mayan calendar \\
                 The Old Hindu calendars \\
                 Part II. Astronomical Calendars \\
                 Time and astronomy \\
                 The French Revolutionary calendar \\
                 The Chinese calendar \\
                 The Modern Hindu calendars",
}


bibtype: book
filename: master.bib
label: DesJardins:2010:MCC
author: Julie Des Jardins
title: The Madame Curie complex: the hidden history of women in science
publisher: Feminist Press at the City University of New York
address: New York, NY, USA
pages: 312 + 8
year: 2010
ISBN: 1-55861-613-6 (paperback), 1-55861-655-1 (e-book) OR 1558616136 (paperback), 1558616551 (ebook)
LCCN: Q141 .D44 2010
bibdate: Thu Nov 20 06:10:19 MST 2014
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2014.11.20 06:10:19 MST
series: Women writing science
acknowledgement: ack-nhfb
rawauthor: Julie {Des Jardins}
rawtitle: The {Madame Curie} complex: the hidden history of women in science
ISBN13:
978-1-55861-613-4 (paperback), 978-1-55861-655-4 (e-book) OR 9781558616134 (paperback), 9781558616554 (ebook)

URL:
http://catdir.loc.gov/catdir/enhancements/fy1008/2009037794-b.html; http://catdir.loc.gov/catdir/enhancements/fy1008/2009037794-d.html

abstract:
The booktitle Madame Curie Complex gives fresh insight into the barriers and successes for women in science, and sheds light on the way our cultural ideas of gender have shaped the profession.

subject:
Spouses; Sex role; United States; History; Women in engineering; Women in science; Women engineers; Biography; Women scientists; Sex role; Spouses; Women engineers; Women in engineering; Women in science; Women scientists

TOC:
Introduction: Through the Lives of Women Scientists / 1 I. Assistants, housekeepers, and interchangeable parts: women scientists and professionalization, 1880--1940 / 11 1. Madame Curie's American tours: women and science in the 1920s / 23 2. Making science domestic and domesticity scientific: the ambiguous life and ambidextrous work of Lillian Gilbreth / 53 3. To embrace or decline marriage and family: Annie Jump Cannon and the women of the Harvard Observatory, 1880--1940 / 88 II. The cult of masculinity in the age of heroic science, 1941--1962 / 117 4. Those science made invisible: finding the women of the Manhattan Project / 130 5. Maria Goeppert Mayer and Rosalind Franklin: the politics of partners and prizes in the heroic age of science / 157 III. American women and science in transition, 1962-- / 201 6. Generational divides: Rosalyn Sussman Yalow, Evelyn Fox Keller, Barbara McClintock, and feminism after 1963 / 219 7. The lady trimates and feminist science?: Jane Goodall, Dian Fossey, and Birute Galdikas / 253 Conclusion: Apes, corn, and silent springs: a women's tradition of science? / 285 Acknowledgments / 295 Index / 297

rawabstract:
The \booktitle{Madame Curie Complex} gives fresh insight into the barriers and successes for women in science, and sheds light on the way our cultural ideas of gender have shaped the profession.

rawTOC:
Introduction: Through the Lives of Women Scientists / 1 \\ I. Assistants, housekeepers, and interchangeable parts: women scientists and professionalization, 1880--1940 / 11 \\ 1. Madame Curie's American tours: women and science in the 1920s / 23 \\ 2. Making science domestic and domesticity scientific: the ambiguous life and ambidextrous work of Lillian Gilbreth / 53 \\ 3. To embrace or decline marriage and family: Annie Jump Cannon and the women of the Harvard Observatory, 1880--1940 / 88 \\ II. The cult of masculinity in the age of heroic science, 1941--1962 / 117 \\ 4. Those science made invisible: finding the women of the Manhattan Project / 130 \\ 5. Maria Goeppert Mayer and Rosalind Franklin: the politics of partners and prizes in the heroic age of science / 157 \\ III. American women and science in transition, 1962-- / 201 \\ 6. Generational divides: Rosalyn Sussman Yalow, Evelyn Fox Keller, Barbara McClintock, and feminism after 1963 / 219 \\ 7. The lady trimates and feminist science?: Jane Goodall, Dian Fossey, and Birute Galdikas / 253 \\ Conclusion: Apes, corn, and silent springs: a women's tradition of science? / 285 \\ Acknowledgments / 295 \\ Index / 297

entry:
@Book{DesJardins:2010:MCC,
  author =       "Julie {Des Jardins}",
  title =        "The {Madame Curie} complex: the hidden history of
                 women in science",
  publisher =    "Feminist Press at the City University of New York",
  address =      "New York, NY, USA",
  pages =        "312 + 8",
  year =         "2010",
  ISBN =         "1-55861-613-6 (paperback), 1-55861-655-1 (e-book)",
  ISBN-13 =      "978-1-55861-613-4 (paperback), 978-1-55861-655-4
                 (e-book)",
  LCCN =         "Q141 .D44 2010",
  bibdate =      "Thu Nov 20 06:10:19 MST 2014",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Women writing science",
  URL =          "http://catdir.loc.gov/catdir/enhancements/fy1008/2009037794-b.html;
                 http://catdir.loc.gov/catdir/enhancements/fy1008/2009037794-d.html",
  abstract =     "The \booktitle{Madame Curie Complex} gives fresh
                 insight into the barriers and successes for women in
                 science, and sheds light on the way our cultural ideas
                 of gender have shaped the profession.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Femmes scientifiques; Biographies; Femmes
                 ing{\'e}nieurs; R{\^o}le selon le sexe; {\'E}tats-Unis;
                 Histoire.",
  subject =      "Spouses; Sex role; United States; History; Women in
                 engineering; Women in science; Women engineers;
                 Biography; Women scientists; Sex role; Spouses; Women
                 engineers; Women in engineering; Women in science;
                 Women scientists",
  tableofcontents = "Introduction: Through the Lives of Women Scientists
                 / 1 \\
                 I. Assistants, housekeepers, and interchangeable parts:
                 women scientists and professionalization, 1880--1940 /
                 11 \\
                 1. Madame Curie's American tours: women and science in
                 the 1920s / 23 \\
                 2. Making science domestic and domesticity scientific:
                 the ambiguous life and ambidextrous work of Lillian
                 Gilbreth / 53 \\
                 3. To embrace or decline marriage and family: Annie
                 Jump Cannon and the women of the Harvard Observatory,
                 1880--1940 / 88 \\
                 II. The cult of masculinity in the age of heroic
                 science, 1941--1962 / 117 \\
                 4. Those science made invisible: finding the women of
                 the Manhattan Project / 130 \\
                 5. Maria Goeppert Mayer and Rosalind Franklin: the
                 politics of partners and prizes in the heroic age of
                 science / 157 \\
                 III. American women and science in transition, 1962-- /
                 201 \\
                 6. Generational divides: Rosalyn Sussman Yalow, Evelyn
                 Fox Keller, Barbara McClintock, and feminism after 1963
                 / 219 \\
                 7. The lady trimates and feminist science?: Jane
                 Goodall, Dian Fossey, and Birute Galdikas / 253 \\
                 Conclusion: Apes, corn, and silent springs: a women's
                 tradition of science? / 285 \\
                 Acknowledgments / 295 \\
                 Index / 297",
}


bibtype: book
filename: master.bib
label: Devitt:1993:CMV
author: John S. Devitt
title: Calculus with Maple V
publisher: pub-BROOKS-COLE
address: pub-BROOKS-COLE:adr
pages: xxii + 502
year: 1993
ISBN: 0-534-16362-9 OR 0534163629
ISBN13: 978-0-534-16362-4 OR 9780534163624
LCCN: QA303.5.D37 D48 1993
bibdate: Tue Dec 14 22:47:21 1993
bibtimestamp: 1993.12.14 22:47:21 ???
acknowledgement: ack-nhfb
rawauthor: John S. Devitt
rawtitle: Calculus with {Maple V}
bibsource:
https://www.math.utah.edu/pub/tex/bib/maple-extract.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

TOC:
1 The Basics and Interactive Computing / 1 1.1 Introduction / 1 1.1.1 Some Pointers to Better User-Machine Communication 1.1.2 A Sample Session / 3 1.1.3 Basic Objectives / 6 1.1.4 Expressions and Equations / 6 1.1.5 Graphical Representations / 9 1.2 Plotting as an Aid to Understanding Inequalities / 12 1.2.1 More on Inequalities / 15 1.2.2 Type 1 Inequalities / 15 1.2.3 Type 2 Inequalities / 20 1.3 Equations Involving Two Variables / 22 1.3.1 Equations of Straight Lines / 23 1.3.2 Distances Between Points / 26 1.3.3 Solving an Algebraic Equation Step by Step / 27 1.3.4 Quadratic Equations and Their Graphs / 29 1.3.5 Solving a Quadratic / 30 1.3.6 Equations Involving $x^2$ and $y^2$ / 31 1.4 Functions / 36 1.4.1 Defining a Function / 36 1.4.2 Using Functions / 37 1.4.3 Restricted Domains / 39 1.4.4 Finding Domains of Functions / 40 1.4.5 Absolute Values / 42 1.4.6 Step Functions / 43 1.4.7 Even Functions / 44 1.4.8 Odd functions / 44 1.4.9 Constant Functions / 45 1.5 New Functions from Old / 45 1.5.1 Arithmetic Operations / 46 1.5.2 Composition of Functions / 46 Exercise Set 1 / 48 2 Limits / 57 / 98 2.1 Introduction / 57 2.2 Limit Computations in Maple / 61 2.3 Some Limit Computations / 62 2.3.1 Ratios of Polynomials / 62 2.3.2 Obscure Common Factors / 66 2.3.3 Limits That Are Bounded but Do Not Exist / 69 2.3.4 Unbounded Functions / 69 2.4 A Formal Definition of a Limit / 70 2.4.1 Computing $delta $ / 71 2.5 Properties of Limits / 77 2.6 The Squeeze Theorem / 81 2.7 Continuity / 83 2.7.1 One-Sided Limits / 85 2.7.2 Combining Continuous Functions / 88 2.8 The Intermediate Value Theorem / 89 2.9 Exact Computations Versus Approximations / 92 Exercise Set 2 / 93 3 Derivatives 3.1 Introduction / 98 3.1.1 Interpretations of the Derivative / 101 3.1.2 Leibnitz Notation / 110 3.2 Differentials / 112 3.3 Differentiation Formulas / 114 3.3.1 Some Fundamental Examples / 115 3.3.2 Constants / 116 3.3.3 Pure Powers / 117 3.3.4 Laws for Addition and Multiplication / 122 3.3.5 Derivatives of $ 1 / g(x)$ / 126 3.3.6 Summary / 128 3.4 Expressions versus Functions / 130 3.5 Trigonometric Functions / 131 3.5.1 Limits of Trigonometric Functions / 131 3.5.2 Derivatives of Trigonometric Functions / 135 3.6 The Chain Rule / 137 3.6.1 Compositions Involving More Than Two Functions / 146 3.6.2 Summary / 147 3.7 Derivatives of Exponentials and Logarithms / 148 3.7.1 Logarithms as Inverse Exponential Functions / 150 3.8 Implicit Derivatives / 152 3.8.1 Treating x and y as Functions oft / 156 3.8.2 Related Rates / 158 3.9 A Derivation of Newton's Formula / 163 Exercise Set 3 / 167 4 Optimal Solutions and Extreme Values / 173 / 227 4.1 Maximums and Minimums / 173 4.1.1 Optimizations in Maple / 179 4.1.2 Local Maximums and Minimums / 179 4.1.3 The Extreme Value Theorem / 187 4.1.4 Summary / 188 4.2 The Mean Value Theorem / 188 4.2.1 The Average Slope / 190 4.3 Monotonic Functions / 197 4.3.1 The First Derivative Test / 198 4.4 Concavity and Points of Inflection / 202 4.5 Asymptotes / 209 4.6 Applied Maximum and Minimum Problems Exercise Set 4 / 223 5 Integration 5.1 Introduction / 227 5.2 Summations / 228 5.2.1 Summations and Area Under a Curve / 231 5.2.2 Rules for Combining Sums / 232 5.2.3 Formulas for Specific Sums / 234 5.2.4 Discovering Formulas / 235 5.3 Area / 239 5.3.1 An Underestimate of the Area / 239 5.3.2 An Overestimate of the Area / 242 5.3.3 Better Estimates / 243 5.4 The Definite Integral / 245 5.4.1 Curves Above the Axis / 246 5.4.2 Curves Below the Axis / 247 5.4.3 Curves That Cross the Axis / 249 5.5 Shortcuts in Computation / 250 5.5.1 The Basic Manipulations / 250 5.5.2 Order Relationships / 254 5.6 The Fundamental Theorem of Calculus / 260 5.6.1 Indefinite Integrals / 265 5.7 Applications of the Fundamental Theorem / 268 Exercise Set 5 / 273 6 Applications of Integration / 278 / 313 6.1 Areas Between Curves / 278 6.2 Volume / 285 6.3 Solids of Revolution / 288 6.4 Generalized Cross Sections / 294 6.5 Cylindrical Shells / 298 6.5.1 Visualizing Cylinders / 301 6.5.2 Cylindrical Decompositions Off the Axis / 303 6.6 Work / 305 Exercise Set 6 / 309 7 Integration Techniques 7.1 Introduction / 313 7.2 Changing Variables / 314 7.2.1 Using a Change of Variables to Integrate / 316 7.2.2 Summary / 316 7.2.3 Additional Examples / 317 7.2.4 The Effective Use of Change of Variables / 318 7.2.5 Definite Integrals / 321 7.3 Integration by Parts / 326 7.3.1 Applications of Integration by Parts / 328 7.3.2 Definite Integrals / 331 7.3.3 Reduction Formulas / 333 7.4 Trigonometric Substitutions / 334 7.4.1 Mixtures of Sines and Cosines / 338 7.4.2 Identities for Secant and Tangent / 339 7.4.3 Integrating Secant / 342 7.4.4 Sums and Differences of Angles / 344 7.5 Square Roots of Quadratics / 344 7.6 Partial Fraction Decompositions / 352 7.6.1 Computing a Partial Fraction Decomposition / 352 7.6.2 Patterns for Partial Fractions / 354 7.6.3 Integrals with Quadratics in the Denominator / 356 7.6.4 Partial Fractions in Action / 357 7.7 Numerical Approximations / 361 7.7.1 The Trapezoidal Rule / 361 7.7.2 Simpson's Rule / 366 Exercise Set 7 / 373 8 More Applications of Integration / 380 8.1 Volumes Through Integration / 380 8.1.1 Visualizing Stacks of Disks / 385 8.1.2 Variations on Volume / 388 8.2 Cylindrical Shells / 396 8.3 Arc Length / 398 8.4 Surface Area / 405 Exercise Set 8 / 409 9 Parametric Equations 9.1 Introduction / 413 9.2 Parametric Curves / 413 9.2.1 Finding Cartesian Representations / 415 9.3 Tangents and Areas Revisited / 420 9.3.1 Second Derivatives / 424 9.3.2 Areas / 426 9.4 Arc Length and Surface Area Revisited / 427 9.4.1 Arc Length / 428 9.4.2 Surface Area / 429 9.5 Polar Coordinates / 430 9.5.1 Curve Sketching in Polar Coordinates / 431 9.5.2 Tangent Lines and Polar Coordinates / 432 9.6 Areas in Polar Coordinates / 435 9.7 Arc Lengths in Polar Coordinates / 436 Exercise Set 9 / 440 10 Sequences and Series / 446 10.1 Introduction / 446 10.2 Sequences / 446 10.2.1 Recurrence Relations / 447 10.2.2 Asymptotic Behavior of Sequences / 449 10.3 Series / 451 10.3.1 Arithmetic on Series / 456 10.4 Testing for Convergence and Divergence / 457 10.4.1 The Integral Test / 457 10.4.2 Comparison Tests / 460 10.4.3 Ratio Tests / 463 10.4.4 The Root Test / 465 10.5 Alternating Series / 465 10.6 Power Series / 468 10.7 Constructing Power Series / 471 10.7.1 Algebraic Manipulations of Power Series / 472 10.7.2 Constructing Coefficients / 477 10.7.3 Taylor Series / 480 10.8 Approximations / 481 10.8.1 Error Analysis / 483 Exercise Set 10 / 488 A The Computing Environment / 495 A.1 The Student Package / 495 A.2 Production Notes / 498

rawTOC:
1 The Basics and Interactive Computing / 1 \\ 1.1 Introduction / 1 \\ 1.1.1 Some Pointers to Better User-Machine Communication \\ 1.1.2 A Sample Session / 3 \\ 1.1.3 Basic Objectives / 6 \\ 1.1.4 Expressions and Equations / 6 \\ 1.1.5 Graphical Representations / 9 \\ 1.2 Plotting as an Aid to Understanding Inequalities / 12 \\ 1.2.1 More on Inequalities / 15 \\ 1.2.2 Type 1 Inequalities / 15 \\ 1.2.3 Type 2 Inequalities / 20 \\ 1.3 Equations Involving Two Variables / 22 \\ 1.3.1 Equations of Straight Lines / 23 \\ 1.3.2 Distances Between Points / 26 \\ 1.3.3 Solving an Algebraic Equation Step by Step / 27 \\ 1.3.4 Quadratic Equations and Their Graphs / 29 \\ 1.3.5 Solving a Quadratic / 30 \\ 1.3.6 Equations Involving $x^2$ and $y^2$ / 31 \\ 1.4 Functions / 36 \\ 1.4.1 Defining a Function / 36 \\ 1.4.2 Using Functions / 37 \\ 1.4.3 Restricted Domains / 39 \\ 1.4.4 Finding Domains of Functions / 40 \\ 1.4.5 Absolute Values / 42 \\ 1.4.6 Step Functions / 43 \\ 1.4.7 Even Functions / 44 \\ 1.4.8 Odd functions / 44 \\ 1.4.9 Constant Functions / 45 \\ 1.5 New Functions from Old / 45 \\ 1.5.1 Arithmetic Operations / 46 \\ 1.5.2 Composition of Functions / 46 \\ Exercise Set 1 / 48 \\ 2 Limits / 57 \\ / 98 \\ 2.1 Introduction / 57 \\ 2.2 Limit Computations in Maple / 61 \\ 2.3 Some Limit Computations / 62 \\ 2.3.1 Ratios of Polynomials / 62 \\ 2.3.2 Obscure Common Factors / 66 \\ 2.3.3 Limits That Are Bounded but Do Not Exist / 69 \\ 2.3.4 Unbounded Functions / 69 \\ 2.4 A Formal Definition of a Limit / 70 \\ 2.4.1 Computing $\delta$ / 71 \\ 2.5 Properties of Limits / 77 \\ 2.6 The Squeeze Theorem / 81 \\ 2.7 Continuity / 83 \\ 2.7.1 One-Sided Limits / 85 \\ 2.7.2 Combining Continuous Functions / 88 \\ 2.8 The Intermediate Value Theorem / 89 \\ 2.9 Exact Computations Versus Approximations / 92 \\ Exercise Set 2 / 93 \\ 3 Derivatives \\ 3.1 Introduction / 98 \\ 3.1.1 Interpretations of the Derivative / 101 \\ 3.1.2 Leibnitz Notation / 110 \\ 3.2 Differentials / 112 \\ 3.3 Differentiation Formulas / 114 \\ 3.3.1 Some Fundamental Examples / 115 \\ 3.3.2 Constants / 116 \\ 3.3.3 Pure Powers / 117 \\ 3.3.4 Laws for Addition and Multiplication / 122 \\ 3.3.5 Derivatives of $ 1 / g(x)$ / 126 \\ 3.3.6 Summary / 128 \\ 3.4 Expressions versus Functions / 130 \\ 3.5 Trigonometric Functions / 131 \\ 3.5.1 Limits of Trigonometric Functions / 131 \\ 3.5.2 Derivatives of Trigonometric Functions / 135 \\ 3.6 The Chain Rule / 137 \\ 3.6.1 Compositions Involving More Than Two Functions / 146 \\ 3.6.2 Summary / 147 \\ 3.7 Derivatives of Exponentials and Logarithms / 148 \\ 3.7.1 Logarithms as Inverse Exponential Functions / 150 \\ 3.8 Implicit Derivatives / 152 \\ 3.8.1 Treating x and y as Functions oft / 156 \\ 3.8.2 Related Rates / 158 \\ 3.9 A Derivation of Newton's Formula / 163 \\ Exercise Set 3 / 167 \\ 4 Optimal Solutions and Extreme Values / 173 \\ / 227 \\ 4.1 Maximums and Minimums / 173 \\ 4.1.1 Optimizations in Maple / 179 \\ 4.1.2 Local Maximums and Minimums / 179 \\ 4.1.3 The Extreme Value Theorem / 187 \\ 4.1.4 Summary / 188 \\ 4.2 The Mean Value Theorem / 188 \\ 4.2.1 The Average Slope / 190 \\ 4.3 Monotonic Functions / 197 \\ 4.3.1 The First Derivative Test / 198 \\ 4.4 Concavity and Points of Inflection / 202 \\ 4.5 Asymptotes / 209 \\ 4.6 Applied Maximum and Minimum Problems \\ Exercise Set 4 / 223 \\ 5 Integration \\ 5.1 Introduction / 227 \\ 5.2 Summations / 228 \\ 5.2.1 Summations and Area Under a Curve / 231 \\ 5.2.2 Rules for Combining Sums / 232 \\ 5.2.3 Formulas for Specific Sums / 234 \\ 5.2.4 Discovering Formulas / 235 \\ 5.3 Area / 239 \\ 5.3.1 An Underestimate of the Area / 239 \\ 5.3.2 An Overestimate of the Area / 242 \\ 5.3.3 Better Estimates / 243 \\ 5.4 The Definite Integral / 245 \\ 5.4.1 Curves Above the Axis / 246 \\ 5.4.2 Curves Below the Axis / 247 \\ 5.4.3 Curves That Cross the Axis / 249 \\ 5.5 Shortcuts in Computation / 250 \\ 5.5.1 The Basic Manipulations / 250 \\ 5.5.2 Order Relationships / 254 \\ 5.6 The Fundamental Theorem of Calculus / 260 \\ 5.6.1 Indefinite Integrals / 265 \\ 5.7 Applications of the Fundamental Theorem / 268 \\ Exercise Set 5 / 273 \\ 6 Applications of Integration / 278 \\ / 313 \\ 6.1 Areas Between Curves / 278 \\ 6.2 Volume / 285 \\ 6.3 Solids of Revolution / 288 \\ 6.4 Generalized Cross Sections / 294 \\ 6.5 Cylindrical Shells / 298 \\ 6.5.1 Visualizing Cylinders / 301 \\ 6.5.2 Cylindrical Decompositions Off the Axis / 303 \\ 6.6 Work / 305 \\ Exercise Set 6 / 309 \\ 7 Integration Techniques \\ 7.1 Introduction / 313 \\ 7.2 Changing Variables / 314 \\ 7.2.1 Using a Change of Variables to Integrate / 316 \\ 7.2.2 Summary / 316 \\ 7.2.3 Additional Examples / 317 \\ 7.2.4 The Effective Use of Change of Variables / 318 \\ 7.2.5 Definite Integrals / 321 \\ 7.3 Integration by Parts / 326 \\ 7.3.1 Applications of Integration by Parts / 328 \\ 7.3.2 Definite Integrals / 331 \\ 7.3.3 Reduction Formulas / 333 \\ 7.4 Trigonometric Substitutions / 334 \\ 7.4.1 Mixtures of Sines and Cosines / 338 \\ 7.4.2 Identities for Secant and Tangent / 339 \\ 7.4.3 Integrating Secant / 342 \\ 7.4.4 Sums and Differences of Angles / 344 \\ 7.5 Square Roots of Quadratics / 344 \\ 7.6 Partial Fraction Decompositions / 352 \\ 7.6.1 Computing a Partial Fraction Decomposition / 352 \\ 7.6.2 Patterns for Partial Fractions / 354 \\ 7.6.3 Integrals with Quadratics in the Denominator / 356 \\ 7.6.4 Partial Fractions in Action / 357 \\ 7.7 Numerical Approximations / 361 \\ 7.7.1 The Trapezoidal Rule / 361 \\ 7.7.2 Simpson's Rule / 366 \\ Exercise Set 7 / 373 \\ 8 More Applications of Integration / 380 \\ 8.1 Volumes Through Integration / 380 \\ 8.1.1 Visualizing Stacks of Disks / 385 \\ 8.1.2 Variations on Volume / 388 \\ 8.2 Cylindrical Shells / 396 \\ 8.3 Arc Length / 398 \\ 8.4 Surface Area / 405 \\ Exercise Set 8 / 409 \\ 9 Parametric Equations \\ 9.1 Introduction / 413 \\ 9.2 Parametric Curves / 413 \\ 9.2.1 Finding Cartesian Representations / 415 \\ 9.3 Tangents and Areas Revisited / 420 \\ 9.3.1 Second Derivatives / 424 \\ 9.3.2 Areas / 426 \\ 9.4 Arc Length and Surface Area Revisited / 427 \\ 9.4.1 Arc Length / 428 \\ 9.4.2 Surface Area / 429 \\ 9.5 Polar Coordinates / 430 \\ 9.5.1 Curve Sketching in Polar Coordinates / 431 \\ 9.5.2 Tangent Lines and Polar Coordinates / 432 \\ 9.6 Areas in Polar Coordinates / 435 \\ 9.7 Arc Lengths in Polar Coordinates / 436 \\ Exercise Set 9 / 440 \\ 10 Sequences and Series / 446 \\ 10.1 Introduction / 446 \\ 10.2 Sequences / 446 \\ 10.2.1 Recurrence Relations / 447 \\ 10.2.2 Asymptotic Behavior of Sequences / 449 \\ 10.3 Series / 451 \\ 10.3.1 Arithmetic on Series / 456 \\ 10.4 Testing for Convergence and Divergence / 457 \\ 10.4.1 The Integral Test / 457 \\ 10.4.2 Comparison Tests / 460 \\ 10.4.3 Ratio Tests / 463 \\ 10.4.4 The Root Test / 465 \\ 10.5 Alternating Series / 465 \\ 10.6 Power Series / 468 \\ 10.7 Constructing Power Series / 471 \\ 10.7.1 Algebraic Manipulations of Power Series / 472 \\ 10.7.2 Constructing Coefficients / 477 \\ 10.7.3 Taylor Series / 480 \\ 10.8 Approximations / 481 \\ 10.8.1 Error Analysis / 483 \\ Exercise Set 10 / 488 \\ A The Computing Environment / 495 \\ A.1 The Student Package / 495 \\ A.2 Production Notes / 498

entry:
@Book{Devitt:1993:CMV,
  author =       "John S. Devitt",
  title =        "Calculus with {Maple V}",
  publisher =    pub-BROOKS-COLE,
  address =      pub-BROOKS-COLE:adr,
  pages =        "xxii + 502",
  year =         "1993",
  ISBN =         "0-534-16362-9",
  ISBN-13 =      "978-0-534-16362-4",
  LCCN =         "QA303.5.D37 D48 1993",
  bibdate =      "Tue Dec 14 22:47:21 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "1 The Basics and Interactive Computing / 1 \\
                 1.1 Introduction / 1 \\
                 1.1.1 Some Pointers to Better User-Machine
                 Communication \\
                 1.1.2 A Sample Session / 3 \\
                 1.1.3 Basic Objectives / 6 \\
                 1.1.4 Expressions and Equations / 6 \\
                 1.1.5 Graphical Representations / 9 \\
                 1.2 Plotting as an Aid to Understanding Inequalities /
                 12 \\
                 1.2.1 More on Inequalities / 15 \\
                 1.2.2 Type 1 Inequalities / 15 \\
                 1.2.3 Type 2 Inequalities / 20 \\
                 1.3 Equations Involving Two Variables / 22 \\
                 1.3.1 Equations of Straight Lines / 23 \\
                 1.3.2 Distances Between Points / 26 \\
                 1.3.3 Solving an Algebraic Equation Step by Step / 27
                 \\
                 1.3.4 Quadratic Equations and Their Graphs / 29 \\
                 1.3.5 Solving a Quadratic / 30 \\
                 1.3.6 Equations Involving $x^2$ and $y^2$ / 31 \\
                 1.4 Functions / 36 \\
                 1.4.1 Defining a Function / 36 \\
                 1.4.2 Using Functions / 37 \\
                 1.4.3 Restricted Domains / 39 \\
                 1.4.4 Finding Domains of Functions / 40 \\
                 1.4.5 Absolute Values / 42 \\
                 1.4.6 Step Functions / 43 \\
                 1.4.7 Even Functions / 44 \\
                 1.4.8 Odd functions / 44 \\
                 1.4.9 Constant Functions / 45 \\
                 1.5 New Functions from Old / 45 \\
                 1.5.1 Arithmetic Operations / 46 \\
                 1.5.2 Composition of Functions / 46 \\
                 Exercise Set 1 / 48 \\
                 2 Limits / 57 \\
                 / 98 \\
                 2.1 Introduction / 57 \\
                 2.2 Limit Computations in Maple / 61 \\
                 2.3 Some Limit Computations / 62 \\
                 2.3.1 Ratios of Polynomials / 62 \\
                 2.3.2 Obscure Common Factors / 66 \\
                 2.3.3 Limits That Are Bounded but Do Not Exist / 69 \\
                 2.3.4 Unbounded Functions / 69 \\
                 2.4 A Formal Definition of a Limit / 70 \\
                 2.4.1 Computing $\delta$ / 71 \\
                 2.5 Properties of Limits / 77 \\
                 2.6 The Squeeze Theorem / 81 \\
                 2.7 Continuity / 83 \\
                 2.7.1 One-Sided Limits / 85 \\
                 2.7.2 Combining Continuous Functions / 88 \\
                 2.8 The Intermediate Value Theorem / 89 \\
                 2.9 Exact Computations Versus Approximations / 92 \\
                 Exercise Set 2 / 93 \\
                 3 Derivatives \\
                 3.1 Introduction / 98 \\
                 3.1.1 Interpretations of the Derivative / 101 \\
                 3.1.2 Leibnitz Notation / 110 \\
                 3.2 Differentials / 112 \\
                 3.3 Differentiation Formulas / 114 \\
                 3.3.1 Some Fundamental Examples / 115 \\
                 3.3.2 Constants / 116 \\
                 3.3.3 Pure Powers / 117 \\
                 3.3.4 Laws for Addition and Multiplication / 122 \\
                 3.3.5 Derivatives of $ 1 / g(x)$ / 126 \\
                 3.3.6 Summary / 128 \\
                 3.4 Expressions versus Functions / 130 \\
                 3.5 Trigonometric Functions / 131 \\
                 3.5.1 Limits of Trigonometric Functions / 131 \\
                 3.5.2 Derivatives of Trigonometric Functions / 135 \\
                 3.6 The Chain Rule / 137 \\
                 3.6.1 Compositions Involving More Than Two Functions /
                 146 \\
                 3.6.2 Summary / 147 \\
                 3.7 Derivatives of Exponentials and Logarithms / 148
                 \\
                 3.7.1 Logarithms as Inverse Exponential Functions / 150
                 \\
                 3.8 Implicit Derivatives / 152 \\
                 3.8.1 Treating x and y as Functions oft / 156 \\
                 3.8.2 Related Rates / 158 \\
                 3.9 A Derivation of Newton's Formula / 163 \\
                 Exercise Set 3 / 167 \\
                 4 Optimal Solutions and Extreme Values / 173 \\
                 / 227 \\
                 4.1 Maximums and Minimums / 173 \\
                 4.1.1 Optimizations in Maple / 179 \\
                 4.1.2 Local Maximums and Minimums / 179 \\
                 4.1.3 The Extreme Value Theorem / 187 \\
                 4.1.4 Summary / 188 \\
                 4.2 The Mean Value Theorem / 188 \\
                 4.2.1 The Average Slope / 190 \\
                 4.3 Monotonic Functions / 197 \\
                 4.3.1 The First Derivative Test / 198 \\
                 4.4 Concavity and Points of Inflection / 202 \\
                 4.5 Asymptotes / 209 \\
                 4.6 Applied Maximum and Minimum Problems \\
                 Exercise Set 4 / 223 \\
                 5 Integration \\
                 5.1 Introduction / 227 \\
                 5.2 Summations / 228 \\
                 5.2.1 Summations and Area Under a Curve / 231 \\
                 5.2.2 Rules for Combining Sums / 232 \\
                 5.2.3 Formulas for Specific Sums / 234 \\
                 5.2.4 Discovering Formulas / 235 \\
                 5.3 Area / 239 \\
                 5.3.1 An Underestimate of the Area / 239 \\
                 5.3.2 An Overestimate of the Area / 242 \\
                 5.3.3 Better Estimates / 243 \\
                 5.4 The Definite Integral / 245 \\
                 5.4.1 Curves Above the Axis / 246 \\
                 5.4.2 Curves Below the Axis / 247 \\
                 5.4.3 Curves That Cross the Axis / 249 \\
                 5.5 Shortcuts in Computation / 250 \\
                 5.5.1 The Basic Manipulations / 250 \\
                 5.5.2 Order Relationships / 254 \\
                 5.6 The Fundamental Theorem of Calculus / 260 \\
                 5.6.1 Indefinite Integrals / 265 \\
                 5.7 Applications of the Fundamental Theorem / 268 \\
                 Exercise Set 5 / 273 \\
                 6 Applications of Integration / 278 \\
                 / 313 \\
                 6.1 Areas Between Curves / 278 \\
                 6.2 Volume / 285 \\
                 6.3 Solids of Revolution / 288 \\
                 6.4 Generalized Cross Sections / 294 \\
                 6.5 Cylindrical Shells / 298 \\
                 6.5.1 Visualizing Cylinders / 301 \\
                 6.5.2 Cylindrical Decompositions Off the Axis / 303 \\
                 6.6 Work / 305 \\
                 Exercise Set 6 / 309 \\
                 7 Integration Techniques \\
                 7.1 Introduction / 313 \\
                 7.2 Changing Variables / 314 \\
                 7.2.1 Using a Change of Variables to Integrate / 316
                 \\
                 7.2.2 Summary / 316 \\
                 7.2.3 Additional Examples / 317 \\
                 7.2.4 The Effective Use of Change of Variables / 318
                 \\
                 7.2.5 Definite Integrals / 321 \\
                 7.3 Integration by Parts / 326 \\
                 7.3.1 Applications of Integration by Parts / 328 \\
                 7.3.2 Definite Integrals / 331 \\
                 7.3.3 Reduction Formulas / 333 \\
                 7.4 Trigonometric Substitutions / 334 \\
                 7.4.1 Mixtures of Sines and Cosines / 338 \\
                 7.4.2 Identities for Secant and Tangent / 339 \\
                 7.4.3 Integrating Secant / 342 \\
                 7.4.4 Sums and Differences of Angles / 344 \\
                 7.5 Square Roots of Quadratics / 344 \\
                 7.6 Partial Fraction Decompositions / 352 \\
                 7.6.1 Computing a Partial Fraction Decomposition / 352
                 \\
                 7.6.2 Patterns for Partial Fractions / 354 \\
                 7.6.3 Integrals with Quadratics in the Denominator /
                 356 \\
                 7.6.4 Partial Fractions in Action / 357 \\
                 7.7 Numerical Approximations / 361 \\
                 7.7.1 The Trapezoidal Rule / 361 \\
                 7.7.2 Simpson's Rule / 366 \\
                 Exercise Set 7 / 373 \\
                 8 More Applications of Integration / 380 \\
                 8.1 Volumes Through Integration / 380 \\
                 8.1.1 Visualizing Stacks of Disks / 385 \\
                 8.1.2 Variations on Volume / 388 \\
                 8.2 Cylindrical Shells / 396 \\
                 8.3 Arc Length / 398 \\
                 8.4 Surface Area / 405 \\
                 Exercise Set 8 / 409 \\
                 9 Parametric Equations \\
                 9.1 Introduction / 413 \\
                 9.2 Parametric Curves / 413 \\
                 9.2.1 Finding Cartesian Representations / 415 \\
                 9.3 Tangents and Areas Revisited / 420 \\
                 9.3.1 Second Derivatives / 424 \\
                 9.3.2 Areas / 426 \\
                 9.4 Arc Length and Surface Area Revisited / 427 \\
                 9.4.1 Arc Length / 428 \\
                 9.4.2 Surface Area / 429 \\
                 9.5 Polar Coordinates / 430 \\
                 9.5.1 Curve Sketching in Polar Coordinates / 431 \\
                 9.5.2 Tangent Lines and Polar Coordinates / 432 \\
                 9.6 Areas in Polar Coordinates / 435 \\
                 9.7 Arc Lengths in Polar Coordinates / 436 \\
                 Exercise Set 9 / 440 \\
                 10 Sequences and Series / 446 \\
                 10.1 Introduction / 446 \\
                 10.2 Sequences / 446 \\
                 10.2.1 Recurrence Relations / 447 \\
                 10.2.2 Asymptotic Behavior of Sequences / 449 \\
                 10.3 Series / 451 \\
                 10.3.1 Arithmetic on Series / 456 \\
                 10.4 Testing for Convergence and Divergence / 457 \\
                 10.4.1 The Integral Test / 457 \\
                 10.4.2 Comparison Tests / 460 \\
                 10.4.3 Ratio Tests / 463 \\
                 10.4.4 The Root Test / 465 \\
                 10.5 Alternating Series / 465 \\
                 10.6 Power Series / 468 \\
                 10.7 Constructing Power Series / 471 \\
                 10.7.1 Algebraic Manipulations of Power Series / 472
                 \\
                 10.7.2 Constructing Coefficients / 477 \\
                 10.7.3 Taylor Series / 480 \\
                 10.8 Approximations / 481 \\
                 10.8.1 Error Analysis / 483 \\
                 Exercise Set 10 / 488 \\
                 A The Computing Environment / 495 \\
                 A.1 The Student Package / 495 \\
                 A.2 Production Notes / 498",
}


bibtype: book
filename: master.bib
label: Devlin:2000:MGH
author: Keith Devlin
title: The Math Gene: How Mathematical Thinking Evolved and Why Numbers Are Like Gossip
publisher: pub-BASIC-BOOKS
address: pub-BASIC-BOOKS:adr
pages: xvii + 328
year: 2000
ISBN: 0-465-01618-9 OR 0465016189
ISBN13: 978-0-465-01618-1 OR 9780465016181
LCCN: QA141.5 .D49 2000
bibdate: Tue Jul 10 16:51:20 2001
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2001.07.10 16:51:20 ???
acknowledgement: ack-nhfb
rawauthor: Keith Devlin
rawtitle: The Math Gene: How Mathematical Thinking Evolved and Why Numbers Are Like Gossip
abstract:
Explains how our innate pattern-making abilities allow us to perform mathematical reasoning. Why is math so hard? And why, despite this difficulty, are some people so good at it? If there's some inborn capacity for mathematical thinking --- which there must be, otherwise no one could do it --- why can't we all do it well? Keith Devlin has answers to all these difficult questions, and in giving them shows us how mathematical ability evolved, why it's a part of language ability, and how we can make better use of this innate talent. He also offers a breathtakingly new theory of language development --- that language evolved in two stages, and its main purpose was not communication --- to show that the ability to think mathematically arose out of the same symbol-manipulating ability that was so crucial to the emergence of true language. Why, then, can't we do math as well as we can speak? The answer, says Devlin, is that we can and do --- we just don't recognize when we're using mathematical reasoning.

TOC:
1: A mind for mathematics 2: In the beginning is number 3: Everybody counts 4: What is this thing called mathematics? 5: Do mathematicians have different brains? 6: Born to speak 7: The brain that grew and learned to talk 8: Out of our minds 9: Where demons lurk and mathematicians work 10: Roads not taken

rawabstract:
Explains how our innate pattern-making abilities allow us to perform mathematical reasoning. Why is math so hard? And why, despite this difficulty, are some people so good at it? If there's some inborn capacity for mathematical thinking --- which there must be, otherwise no one could do it --- why can't we all do it well? Keith Devlin has answers to all these difficult questions, and in giving them shows us how mathematical ability evolved, why it's a part of language ability, and how we can make better use of this innate talent. He also offers a breathtakingly new theory of language development --- that language evolved in two stages, and its main purpose was not communication --- to show that the ability to think mathematically arose out of the same symbol-manipulating ability that was so crucial to the emergence of true language. Why, then, can't we do math as well as we can speak? The answer, says Devlin, is that we can and do --- we just don't recognize when we're using mathematical reasoning.

rawTOC:
1: A mind for mathematics \\ 2: In the beginning is number \\ 3: Everybody counts \\ 4: What is this thing called mathematics? \\ 5: Do mathematicians have different brains? \\ 6: Born to speak \\ 7: The brain that grew and learned to talk \\ 8: Out of our minds \\ 9: Where demons lurk and mathematicians work \\ 10: Roads not taken

entry:
@Book{Devlin:2000:MGH,
  author =       "Keith Devlin",
  title =        "The Math Gene: How Mathematical Thinking Evolved and
                 Why Numbers Are Like Gossip",
  publisher =    pub-BASIC-BOOKS,
  address =      pub-BASIC-BOOKS:adr,
  pages =        "xvii + 328",
  year =         "2000",
  ISBN =         "0-465-01618-9",
  ISBN-13 =      "978-0-465-01618-1",
  LCCN =         "QA141.5 .D49 2000",
  bibdate =      "Tue Jul 10 16:51:20 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Explains how our innate pattern-making abilities allow
                 us to perform mathematical reasoning. Why is math so
                 hard? And why, despite this difficulty, are some people
                 so good at it? If there's some inborn capacity for
                 mathematical thinking --- which there must be,
                 otherwise no one could do it --- why can't we all do it
                 well? Keith Devlin has answers to all these difficult
                 questions, and in giving them shows us how mathematical
                 ability evolved, why it's a part of language ability,
                 and how we can make better use of this innate talent.
                 He also offers a breathtakingly new theory of language
                 development --- that language evolved in two stages,
                 and its main purpose was not communication --- to show
                 that the ability to think mathematically arose out of
                 the same symbol-manipulating ability that was so
                 crucial to the emergence of true language. Why, then,
                 can't we do math as well as we can speak? The answer,
                 says Devlin, is that we can and do --- we just don't
                 recognize when we're using mathematical reasoning.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: A mind for mathematics \\
                 2: In the beginning is number \\
                 3: Everybody counts \\
                 4: What is this thing called mathematics? \\
                 5: Do mathematicians have different brains? \\
                 6: Born to speak \\
                 7: The brain that grew and learned to talk \\
                 8: Out of our minds \\
                 9: Where demons lurk and mathematicians work \\
                 10: Roads not taken",
}


bibtype: book
filename: master.bib
label: Devlin:2002:MPS
author: Keith Devlin
title: The Millennium Problems: the Seven Greatest Unsolved Mathematical Puzzles of Our Time
publisher: Basic Books
address: New York, NY, USA
pages: x + 237
year: 2002
LCCN: QA93 .D485 2002
bibdate: Fri Oct 17 10:10:24 2003
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2003.10.17 10:10:24 ???
acknowledgement: ack-nhfb
rawauthor: Keith Devlin
rawtitle: The Millennium Problems: the Seven Greatest Unsolved Mathematical Puzzles of Our Time
ISBN:
0-465-01729-0 (hardcover), 0-465-01730-4 (paperback), 2-00-353546-8 OR 0465017290 (hardcover), 0465017304 (paperback), 2003535468

ISBN13:
978-0-465-01729-4 (hardcover), 978-0-465-01730-0 (paperback), 978-2-00-353546-8 OR 9780465017294 (hardcover), 9780465017300 (paperback), 9782003535468

abstract:
In 2000, the Clay Foundation of Cambridge, Massachusetts, announced a historic competition: Whoever could solve any of seven extraordinarily difficult mathematical problems, and have the solution acknowledged as correct by the experts, would receive $1 million in prize money. There was some precedent for doing this: In 1900 David Hilbert, one of the greatest mathematicians of his day, proposed twenty-three problems, now known as the Hilbert Problems, that set much of the agenda for mathematics in the twentieth century. The Millennium Problems are likely to acquire similar stature, and their solution (or lack of one) will play a strong role in determining the course of mathematics in the current century. They encompass many of the most fascinating areas of pure and applied mathematics, from topology and number theory to particle physics, cryptography, computing and even aircraft design. Keith Devlin, renowned expositor of mathematics, tells here what the seven problems are, how they came about, and what they mean for math and science. These problems are the brass rings held out to today's mathematicians, glittering and just out of reach. In the hands of Devlin, `the Math Guy' from NPR's Weekend Edition, each Millennium Problem becomes a fascinating window onto the deepest and toughest questions in the field. For mathematicians, physicists, engineers, and everyone else with an interest in mathematics' cutting edge, The Millennium Problems is the definitive account of a subject that will have a very long shelf life.

TOC:
Preface / vii 0: The gauntlet is thrown / 1 1: The music of the primes: the Riemann Hypothesis / 19 Appendix 1: Euclid's proof that there are infinitely many primes / 53 Appendix 2: How do mathematicians work out infinite sums? / 55 Appendix 3: How Euler discovered the Zeta Function 2: The fields we are made of: Yang--Mills theory and the Mass Gap Hypothesis / 59 Appendix. Group theory: the mathematics of symmetry / 97 3: When computers fail: The P vs. NP problem / 105 4: Making waves: The Navier--Stokes Equations / 131 5: The mathematics of smooth behavior: The Poincare Conjecture / 157 6: Knowing when the equation can't be solved: The Birch and Swinnerton-Dyer Conjecture / 189 Appendix: Notation for infinite sums and products / 209 7: Geometry without pictures: The Hodge Conjecture / 211 Further Reading / 229 Index / 231

rawabstract:
In 2000, the Clay Foundation of Cambridge, Massachusetts, announced a historic competition: Whoever could solve any of seven extraordinarily difficult mathematical problems, and have the solution acknowledged as correct by the experts, would receive \$1 million in prize money. There was some precedent for doing this: In 1900 David Hilbert, one of the greatest mathematicians of his day, proposed twenty-three problems, now known as the Hilbert Problems, that set much of the agenda for mathematics in the twentieth century. The Millennium Problems are likely to acquire similar stature, and their solution (or lack of one) will play a strong role in determining the course of mathematics in the current century. They encompass many of the most fascinating areas of pure and applied mathematics, from topology and number theory to particle physics, cryptography, computing and even aircraft design. Keith Devlin, renowned expositor of mathematics, tells here what the seven problems are, how they came about, and what they mean for math and science. These problems are the brass rings held out to today's mathematicians, glittering and just out of reach. In the hands of Devlin, `the Math Guy' from NPR's Weekend Edition, each Millennium Problem becomes a fascinating window onto the deepest and toughest questions in the field. For mathematicians, physicists, engineers, and everyone else with an interest in mathematics' cutting edge, The Millennium Problems is the definitive account of a subject that will have a very long shelf life.

rawTOC:
Preface / vii \\ 0: The gauntlet is thrown / 1 \\ 1: The music of the primes: the Riemann Hypothesis / 19 \\ Appendix 1: Euclid's proof that there are infinitely many primes / 53 \\ Appendix 2: How do mathematicians work out infinite sums? / 55 \\ Appendix 3: How Euler discovered the Zeta Function 2: The fields we are made of: Yang--Mills theory and the Mass Gap Hypothesis / 59 \\ Appendix. Group theory: the mathematics of symmetry / 97 \\ 3: When computers fail: The P vs. NP problem / 105 \\ 4: Making waves: The Navier--Stokes Equations / 131 \\ 5: The mathematics of smooth behavior: The Poincar{\'e} Conjecture / 157 \\ 6: Knowing when the equation can't be solved: The Birch and Swinnerton-Dyer Conjecture / 189 \\ Appendix: Notation for infinite sums and products / 209 \\ 7: Geometry without pictures: The Hodge Conjecture / 211 \\ Further Reading / 229 \\ Index / 231

entry:
@Book{Devlin:2002:MPS,
  author =       "Keith Devlin",
  title =        "The Millennium Problems: the Seven Greatest Unsolved
                 Mathematical Puzzles of Our Time",
  publisher =    "Basic Books",
  address =      "New York, NY, USA",
  pages =        "x + 237",
  year =         "2002",
  ISBN =         "0-465-01729-0 (hardcover), 0-465-01730-4 (paperback),
                 2-00-353546-8",
  ISBN-13 =      "978-0-465-01729-4 (hardcover), 978-0-465-01730-0
                 (paperback), 978-2-00-353546-8",
  LCCN =         "QA93 .D485 2002",
  bibdate =      "Fri Oct 17 10:10:24 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$26.00",
  abstract =     "In 2000, the Clay Foundation of Cambridge,
                 Massachusetts, announced a historic competition:
                 Whoever could solve any of seven extraordinarily
                 difficult mathematical problems, and have the solution
                 acknowledged as correct by the experts, would receive
                 \$1 million in prize money. There was some precedent
                 for doing this: In 1900 David Hilbert, one of the
                 greatest mathematicians of his day, proposed
                 twenty-three problems, now known as the Hilbert
                 Problems, that set much of the agenda for mathematics
                 in the twentieth century. The Millennium Problems are
                 likely to acquire similar stature, and their solution
                 (or lack of one) will play a strong role in determining
                 the course of mathematics in the current century. They
                 encompass many of the most fascinating areas of pure
                 and applied mathematics, from topology and number
                 theory to particle physics, cryptography, computing and
                 even aircraft design. Keith Devlin, renowned expositor
                 of mathematics, tells here what the seven problems are,
                 how they came about, and what they mean for math and
                 science. These problems are the brass rings held out to
                 today's mathematicians, glittering and just out of
                 reach. In the hands of Devlin, `the Math Guy' from
                 NPR's Weekend Edition, each Millennium Problem becomes
                 a fascinating window onto the deepest and toughest
                 questions in the field. For mathematicians, physicists,
                 engineers, and everyone else with an interest in
                 mathematics' cutting edge, The Millennium Problems is
                 the definitive account of a subject that will have a
                 very long shelf life.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / vii \\
                 0: The gauntlet is thrown / 1 \\
                 1: The music of the primes: the Riemann Hypothesis / 19
                 \\
                 Appendix 1: Euclid's proof that there are infinitely
                 many primes / 53 \\
                 Appendix 2: How do mathematicians work out infinite
                 sums? / 55 \\
                 Appendix 3: How Euler discovered the Zeta Function 2:
                 The fields we are made of: Yang--Mills theory and the
                 Mass Gap Hypothesis / 59 \\
                 Appendix. Group theory: the mathematics of symmetry /
                 97 \\
                 3: When computers fail: The P vs. NP problem / 105 \\
                 4: Making waves: The Navier--Stokes Equations / 131 \\
                 5: The mathematics of smooth behavior: The Poincar{\'e}
                 Conjecture / 157 \\
                 6: Knowing when the equation can't be solved: The Birch
                 and Swinnerton-Dyer Conjecture / 189 \\
                 Appendix: Notation for infinite sums and products / 209
                 \\
                 7: Geometry without pictures: The Hodge Conjecture /
                 211 \\
                 Further Reading / 229 \\
                 Index / 231",
}


bibtype: book
filename: master.bib
label: Devlin:2008:UGP
author: Keith J. Devlin
publisher: pub-BASIC-BOOKS
address: pub-BASIC-BOOKS:adr
pages: x + 191
year: 2008
ISBN: 0-465-00910-7 OR 0465009107
ISBN13: 978-0-465-00910-7 OR 9780465009107
LCCN: QA273 .D455 2008
bibdate: Tue Nov 11 14:00:48 MST 2008
bibtimestamp: 2008.11.11 14:00:48 MST
series: Basic ideas
subject: Probabilities; Pascal, Blaise; Correspondence; Fermat, Pierre de; Mathematicians; France
acknowledgement: ack-nhfb
subjectdates: 1623--1662; 1601--1665
rawauthor: Keith J. Devlin
title:
The unfinished game: Pascal, Fermat, and the seventeenth-century letter that made the world modern: a tale of how mathematics is really done

bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; sirsi.library.utoronto.ca:2200/UNICORN; z3950.gbv.de:20011/gvk

TOC:
Monday, August 24, 1654 A problem worthy of great minds On the shoulders of a giant A man of slight build The great amateur Terrible confusions Out of the gaming rooms Into the everyday world The chance of your life The measure of our ignorance

rawtitle:
The unfinished game: {Pascal}, {Fermat}, and the seventeenth-century letter that made the world modern: a tale of how mathematics is really done

rawTOC:
Monday, August 24, 1654 \\ A problem worthy of great minds \\ On the shoulders of a giant \\ A man of slight build \\ The great amateur \\ Terrible confusions \\ Out of the gaming rooms \\ Into the everyday world \\ The chance of your life \\ The measure of our ignorance

entry:
@Book{Devlin:2008:UGP,
  author =       "Keith J. Devlin",
  title =        "The unfinished game: {Pascal}, {Fermat}, and the
                 seventeenth-century letter that made the world modern:
                 a tale of how mathematics is really done",
  publisher =    pub-BASIC-BOOKS,
  address =      pub-BASIC-BOOKS:adr,
  pages =        "x + 191",
  year =         "2008",
  ISBN =         "0-465-00910-7",
  ISBN-13 =      "978-0-465-00910-7",
  LCCN =         "QA273 .D455 2008",
  bibdate =      "Tue Nov 11 14:00:48 MST 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 sirsi.library.utoronto.ca:2200/UNICORN;
                 z3950.gbv.de:20011/gvk",
  price =        "US\$24.95",
  series =       "Basic ideas",
  acknowledgement = ack-nhfb,
  subject =      "Probabilities; Pascal, Blaise; Correspondence; Fermat,
                 Pierre de; Mathematicians; France",
  subject-dates = "1623--1662; 1601--1665",
  tableofcontents = "Monday, August 24, 1654 \\
                 A problem worthy of great minds \\
                 On the shoulders of a giant \\
                 A man of slight build \\
                 The great amateur \\
                 Terrible confusions \\
                 Out of the gaming rooms \\
                 Into the everyday world \\
                 The chance of your life \\
                 The measure of our ignorance",
}


bibtype: book
filename: master.bib
label: Devlin:2011:MNF
author: Keith J. Devlin
title: The man of numbers: Fibonacci's arithmetic revolution
publisher: pub-WALKER
address: pub-WALKER:adr
pages: viii + 183 + 8
year: 2011
ISBN: 0-8027-7812-7 (hardcover) OR 0802778127 (hardcover)
ISBN13: 978-0-8027-7812-3 (hardcover) OR 9780802778123 (hardcover)
LCCN: QA29.F5 D48 2011
bibdate: Sat Jul 16 09:27:27 MDT 2011
bibtimestamp: 2011.07.16 09:27:27 MDT
subject: Fibonacci, Leonardo; mathematicians; biography; Fibonacci numbers; mathematics in nature
acknowledgement: ack-nhfb
subjectdates: ca. 1170--ca. 1240
rawauthor: Keith J. Devlin
rawtitle: The man of numbers: {Fibonacci}'s arithmetic revolution
bibsource:
fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/fibquart.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

TOC:
Your days are numbered A bridge of numbers A child of Pisa A mathematical journey Sources Liber abbaci Fame The Fibonacci aftermath Whose revolution? Fibonacci's legacy: in stone, parchment, and rabbits

rawTOC:
Your days are numbered \\ A bridge of numbers \\ A child of Pisa \\ A mathematical journey \\ Sources \\ Liber abbaci \\ Fame \\ The Fibonacci aftermath \\ Whose revolution? \\ Fibonacci's legacy: in stone, parchment, and rabbits

entry:
@Book{Devlin:2011:MNF,
  author =       "Keith J. Devlin",
  title =        "The man of numbers: {Fibonacci}'s arithmetic
                 revolution",
  publisher =    pub-WALKER,
  address =      pub-WALKER:adr,
  pages =        "viii + 183 + 8",
  year =         "2011",
  ISBN =         "0-8027-7812-7 (hardcover)",
  ISBN-13 =      "978-0-8027-7812-3 (hardcover)",
  LCCN =         "QA29.F5 D48 2011",
  bibdate =      "Sat Jul 16 09:27:27 MDT 2011",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Fibonacci, Leonardo; mathematicians; biography;
                 Fibonacci numbers; mathematics in nature",
  subject-dates = "ca. 1170--ca. 1240",
  tableofcontents = "Your days are numbered \\
                 A bridge of numbers \\
                 A child of Pisa \\
                 A mathematical journey \\
                 Sources \\
                 Liber abbaci \\
                 Fame \\
                 The Fibonacci aftermath \\
                 Whose revolution? \\
                 Fibonacci's legacy: in stone, parchment, and rabbits",
}


bibtype: book
filename: master.bib
label: Devore:2008:PSE
author: Jay L. Devore
title: Probability and Statistics for Engineering and the Sciences
publisher: Thomson / Brooks / Cole
address: Belmont, CA, USA
edition: Seventh
pages: xvi + 720
year: 2008
ISBN: 0-495-38217-5 OR 0495382175
ISBN13: 978-0-495-38217-1 OR 9780495382171
LCCN: QA273 .D46 2008
bibdate: Fri Sep 6 06:23:00 MDT 2013
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2013.09.06 06:23:00 MDT
subject: Probabilities; Mathematical statistics
acknowledgement: ack-nhfb
rawauthor: Jay L. Devore
rawtitle: Probability and Statistics for Engineering and the Sciences
URL:
http://www.loc.gov/catdir/enhancements/fy1104/2006932557-b.html; http://www.loc.gov/catdir/enhancements/fy1104/2006932557-d.html; http://www.loc.gov/catdir/enhancements/fy1212/2006932557-t.html

TOC:
1. OVERVIEW AND DESCRIPTIVE STATISTICS Populations, Samples, and Processes Pictorial and Tabular Methods in Descriptive Statistics Measures of Location Measures of Variability 2. PROBABILITY Sample Spaces and Events Axioms, Interpretations, and Properties of Probability Counting Techniques Conditional Probability Independence 3. DISCRETE RANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS Random Variables Probability Distributions for Discrete Random Variables Expected Values of Discrete Random Variables The Binomial Probability Distribution Hypergeometric and Negative Binomial Distributions The Poisson Probability Distribution 4. CONTINUOUS RANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS Continuous Random Variables and Probability Density Functions Cumulative Distribution Functions and Expected Values The Normal Distribution The Exponential and Gamma Distribution Other Continuous Distributions Probability Plots 5. JOINT PROBABILITY DISTRIBUTIONS AND RANDOM SAMPLES Jointly Distributed Random Variables Expected Values, Covariance, and Correlation Statistics and Their Distributions The Distribution of the Sample Mean The Distribution of a Linear Combination 6. POINT ESTIMATION Some General Concepts of Point Estimation Methods of Point Estimation 7. STATISTICAL INTERVALS BASED ON A SINGLE SAMPLE Basic Properties of Confidence Intervals Large-Sample Confidence Intervals for a Population Mean and Proportion Intervals Based on a Normal Population Distribution Confidence Intervals for the Variance and Standard Deviation of a Normal Population 8. TESTS OF HYPOTHESES BASED ON A SINGLE SAMPLE Hypothesis and Test Procedures Tests About a Population Mean Tests Concerning a Population Proportion $P$-Values Some Comments on Selecting a Test 9. INFERENCES BASED ON TWO SAMPLES $z$ Tests and Confidence Intervals for a Difference Between Two Population Means The Two-Sample $t$ Test and Confidence Interval Analysis of Paired Data Inferences Concerning a Difference Between Population Proportions Inferences Concerning Two Population Variances 10. THE ANALYSIS OF VARIANCE Single-Factor ANOVA Multiple Comparisons in ANOVA More on Single-Factor ANOVA 11. MULTIFACTOR ANALYSIS OF VARIANCE Two-Factor ANOVA with $K_ij = 1$ Two-Factor ANOVA with $K_ij > 1$ Three-Factor ANOVA $2^p$ Factorial Experiments 12. SIMPLE LINEAR REGRESSION AND CORRELATION The Simple Linear Regression Model Estimating Model Parameters Inferences About the Slope Parameter $beta _1$ Inferences Concerning $mu _Y cdot x^*$ and the Prediction of Future $Y$ Values Correlation 13. NONLINEAR AND MULTIPLE REGRESSION Aptness of the Model and Model Checking Regression with Transformed Variables Polynomial Regression Multiple Regression Analysis Other Issues in Multiple Regression 14. GOODNESS-OF-FIT TESTS AND CATEGORICAL DATA ANALYSIS Goodness-of-Fit Tests When Category Probabilities are Completely Specified Goodness of Fit for Composite Hypotheses Two-Way Contingency Tables 15. DISTRIBUTION-FREE PROCEDURES The Wilcoxon Signed-Rank Test The Wilcoxon Rank-Sum Test Distribution-Free Confidence Intervals Distribution-Free ANOVA 16. QUALITY CONTROL METHODS General Comments on Control Charts Control Charts fort Process Location Control Charts for Process Variation Control Charts for Attributes CUSUM Procedures Acceptance Sampling APPENDIX TABLES Cumulative Binomial Probabilities Cumulative Poisson Probabilities Standard Normal Curve Areas The Incomplete Gamma Function Critical Values for $t$ Distributions Tolerance Critical Values for Normal Population Distributions Critical Values for Chi-Squared Distributions $t$ Curve Tail Areas Critical Values for $F$ Distributions Critical Values for Studentized Range Distributions Chi-Squared Curve Tail Areas Critical Values for the Ryan--Joiner Test of Normality Critical Values for the Wilcoxon Signed-Rank Test Critical Values for the Wilcoxon Rank-Sum Test Critical Values for the Wilcoxon Signed-Rank Interval Critical Values for the Wilcoxon Rank-Sum Interval $beta $ Curves for $t$ Tests Answers to Odd-Numbered Exercises Index

rawTOC:
1. OVERVIEW AND DESCRIPTIVE STATISTICS \\ Populations, Samples, and Processes \\ Pictorial and Tabular Methods in Descriptive Statistics \\ Measures of Location \\ Measures of Variability \\ \\ 2. PROBABILITY \\ Sample Spaces and Events \\ Axioms, Interpretations, and Properties of Probability \\ Counting Techniques \\ Conditional Probability \\ Independence \\ \\ 3. DISCRETE RANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS \\ Random Variables \\ Probability Distributions for Discrete Random Variables \\ Expected Values of Discrete Random Variables \\ The Binomial Probability Distribution \\ Hypergeometric and Negative Binomial Distributions \\ The Poisson Probability Distribution \\ \\ 4. CONTINUOUS RANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS \\ Continuous Random Variables and Probability Density Functions \\ Cumulative Distribution Functions and Expected Values \\ The Normal Distribution \\ The Exponential and Gamma Distribution \\ Other Continuous Distributions \\ Probability Plots \\ \\ 5. JOINT PROBABILITY DISTRIBUTIONS AND RANDOM SAMPLES \\ Jointly Distributed Random Variables \\ Expected Values, Covariance, and Correlation \\ Statistics and Their Distributions \\ The Distribution of the Sample Mean \\ The Distribution of a Linear Combination \\ \\ 6. POINT ESTIMATION \\ Some General Concepts of Point Estimation \\ Methods of Point Estimation \\ \\ 7. STATISTICAL INTERVALS BASED ON A SINGLE SAMPLE \\ Basic Properties of Confidence Intervals \\ Large-Sample Confidence Intervals for a Population Mean and Proportion \\ Intervals Based on a Normal Population Distribution \\ Confidence Intervals for the Variance and Standard Deviation of a Normal Population \\ \\ 8. TESTS OF HYPOTHESES BASED ON A SINGLE SAMPLE \\ Hypothesis and Test Procedures \\ Tests About a Population Mean \\ Tests Concerning a Population Proportion \\ $P$-Values \\ Some Comments on Selecting a Test \\ \\ 9. INFERENCES BASED ON TWO SAMPLES \\ $z$ Tests and Confidence Intervals for a Difference Between Two Population Means \\ The Two-Sample $t$ Test and Confidence Interval \\ Analysis of Paired Data \\ Inferences Concerning a Difference Between Population Proportions \\ Inferences Concerning Two Population Variances \\ \\ 10. THE ANALYSIS OF VARIANCE \\ Single-Factor ANOVA \\ Multiple Comparisons in ANOVA \\ More on Single-Factor ANOVA \\ \\ 11. MULTIFACTOR ANALYSIS OF VARIANCE \\ Two-Factor ANOVA with $K_{ij} = 1$ \\ Two-Factor ANOVA with $K_{ij} > 1$ \\ Three-Factor ANOVA \\ $2^p$ Factorial Experiments \\ \\ 12. SIMPLE LINEAR REGRESSION AND CORRELATION \\ The Simple Linear Regression Model \\ Estimating Model Parameters \\ Inferences About the Slope Parameter $\beta_1$ \\ Inferences Concerning $\mu_{Y \cdot x^*}$ and the Prediction of Future $Y$ Values \\ Correlation \\ \\ 13. NONLINEAR AND MULTIPLE REGRESSION \\ Aptness of the Model and Model Checking \\ Regression with Transformed Variables \\ Polynomial Regression \\ Multiple Regression Analysis \\ Other Issues in Multiple Regression \\ \\ 14. GOODNESS-OF-FIT TESTS AND CATEGORICAL DATA ANALYSIS \\ Goodness-of-Fit Tests When Category Probabilities are Completely Specified \\ Goodness of Fit for Composite Hypotheses \\ Two-Way Contingency Tables \\ \\ 15. DISTRIBUTION-FREE PROCEDURES \\ The Wilcoxon Signed-Rank Test \\ The Wilcoxon Rank-Sum Test \\ Distribution-Free Confidence Intervals \\ Distribution-Free ANOVA \\ \\ 16. QUALITY CONTROL METHODS \\ General Comments on Control Charts \\ Control Charts fort Process Location \\ Control Charts for Process Variation \\ Control Charts for Attributes \\ CUSUM Procedures \\ Acceptance Sampling \\ \\ APPENDIX TABLES \\ Cumulative Binomial Probabilities \\ Cumulative Poisson Probabilities \\ Standard Normal Curve Areas \\ The Incomplete Gamma Function \\ Critical Values for $t$ Distributions \\ Tolerance Critical Values for Normal Population Distributions \\ Critical Values for Chi-Squared Distributions \\ $t$ Curve Tail Areas \\ Critical Values for $F$ Distributions \\ Critical Values for Studentized Range Distributions \\ Chi-Squared Curve Tail Areas \\ Critical Values for the Ryan--Joiner Test of Normality \\ Critical Values for the Wilcoxon Signed-Rank Test \\ Critical Values for the Wilcoxon Rank-Sum Test \\ Critical Values for the Wilcoxon Signed-Rank Interval \\ Critical Values for the Wilcoxon Rank-Sum Interval \\ $\beta$ Curves for $t$ Tests \\ Answers to Odd-Numbered Exercises \\ Index

entry:
@Book{Devore:2008:PSE,
  author =       "Jay L. Devore",
  title =        "Probability and Statistics for Engineering and the
                 Sciences",
  publisher =    "Thomson\slash Brooks\slash Cole",
  address =      "Belmont, CA, USA",
  edition =      "Seventh",
  pages =        "xvi + 720",
  year =         "2008",
  ISBN =         "0-495-38217-5",
  ISBN-13 =      "978-0-495-38217-1",
  LCCN =         "QA273 .D46 2008",
  bibdate =      "Fri Sep 6 06:23:00 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy1104/2006932557-b.html;
                 http://www.loc.gov/catdir/enhancements/fy1104/2006932557-d.html;
                 http://www.loc.gov/catdir/enhancements/fy1212/2006932557-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Probabilities; Mathematical statistics",
  tableofcontents = "1. OVERVIEW AND DESCRIPTIVE STATISTICS \\
                 Populations, Samples, and Processes \\
                 Pictorial and Tabular Methods in Descriptive Statistics
                 \\
                 Measures of Location \\
                 Measures of Variability \\
                 \\
                 2. PROBABILITY \\
                 Sample Spaces and Events \\
                 Axioms, Interpretations, and Properties of Probability
                 \\
                 Counting Techniques \\
                 Conditional Probability \\
                 Independence \\
                 \\
                 3. DISCRETE RANDOM VARIABLES AND PROBABILITY
                 DISTRIBUTIONS \\
                 Random Variables \\
                 Probability Distributions for Discrete Random Variables
                 \\
                 Expected Values of Discrete Random Variables \\
                 The Binomial Probability Distribution \\
                 Hypergeometric and Negative Binomial Distributions \\
                 The Poisson Probability Distribution \\
                 \\
                 4. CONTINUOUS RANDOM VARIABLES AND PROBABILITY
                 DISTRIBUTIONS \\
                 Continuous Random Variables and Probability Density
                 Functions \\
                 Cumulative Distribution Functions and Expected Values
                 \\
                 The Normal Distribution \\
                 The Exponential and Gamma Distribution \\
                 Other Continuous Distributions \\
                 Probability Plots \\
                 \\
                 5. JOINT PROBABILITY DISTRIBUTIONS AND RANDOM SAMPLES
                 \\
                 Jointly Distributed Random Variables \\
                 Expected Values, Covariance, and Correlation \\
                 Statistics and Their Distributions \\
                 The Distribution of the Sample Mean \\
                 The Distribution of a Linear Combination \\
                 \\
                 6. POINT ESTIMATION \\
                 Some General Concepts of Point Estimation \\
                 Methods of Point Estimation \\
                 \\
                 7. STATISTICAL INTERVALS BASED ON A SINGLE SAMPLE \\
                 Basic Properties of Confidence Intervals \\
                 Large-Sample Confidence Intervals for a Population Mean
                 and Proportion \\
                 Intervals Based on a Normal Population Distribution \\
                 Confidence Intervals for the Variance and Standard
                 Deviation of a Normal Population \\
                 \\
                 8. TESTS OF HYPOTHESES BASED ON A SINGLE SAMPLE \\
                 Hypothesis and Test Procedures \\
                 Tests About a Population Mean \\
                 Tests Concerning a Population Proportion \\
                 $P$-Values \\
                 Some Comments on Selecting a Test \\
                 \\
                 9. INFERENCES BASED ON TWO SAMPLES \\
                 $z$ Tests and Confidence Intervals for a Difference
                 Between Two Population Means \\
                 The Two-Sample $t$ Test and Confidence Interval \\
                 Analysis of Paired Data \\
                 Inferences Concerning a Difference Between Population
                 Proportions \\
                 Inferences Concerning Two Population Variances \\
                 \\
                 10. THE ANALYSIS OF VARIANCE \\
                 Single-Factor ANOVA \\
                 Multiple Comparisons in ANOVA \\
                 More on Single-Factor ANOVA \\
                 \\
                 11. MULTIFACTOR ANALYSIS OF VARIANCE \\
                 Two-Factor ANOVA with $K_{ij} = 1$ \\
                 Two-Factor ANOVA with $K_{ij} > 1$ \\
                 Three-Factor ANOVA \\
                 $2^p$ Factorial Experiments \\
                 \\
                 12. SIMPLE LINEAR REGRESSION AND CORRELATION \\
                 The Simple Linear Regression Model \\
                 Estimating Model Parameters \\
                 Inferences About the Slope Parameter $\beta_1$ \\
                 Inferences Concerning $\mu_{Y \cdot x^*}$ and the
                 Prediction of Future $Y$ Values \\
                 Correlation \\
                 \\
                 13. NONLINEAR AND MULTIPLE REGRESSION \\
                 Aptness of the Model and Model Checking \\
                 Regression with Transformed Variables \\
                 Polynomial Regression \\
                 Multiple Regression Analysis \\
                 Other Issues in Multiple Regression \\
                 \\
                 14. GOODNESS-OF-FIT TESTS AND CATEGORICAL DATA ANALYSIS
                 \\
                 Goodness-of-Fit Tests When Category Probabilities are
                 Completely Specified \\
                 Goodness of Fit for Composite Hypotheses \\
                 Two-Way Contingency Tables \\
                 \\
                 15. DISTRIBUTION-FREE PROCEDURES \\
                 The Wilcoxon Signed-Rank Test \\
                 The Wilcoxon Rank-Sum Test \\
                 Distribution-Free Confidence Intervals \\
                 Distribution-Free ANOVA \\
                 \\
                 16. QUALITY CONTROL METHODS \\
                 General Comments on Control Charts \\
                 Control Charts fort Process Location \\
                 Control Charts for Process Variation \\
                 Control Charts for Attributes \\
                 CUSUM Procedures \\
                 Acceptance Sampling \\
                 \\
                 APPENDIX TABLES \\
                 Cumulative Binomial Probabilities \\
                 Cumulative Poisson Probabilities \\
                 Standard Normal Curve Areas \\
                 The Incomplete Gamma Function \\
                 Critical Values for $t$ Distributions \\
                 Tolerance Critical Values for Normal Population
                 Distributions \\
                 Critical Values for Chi-Squared Distributions \\
                 $t$ Curve Tail Areas \\
                 Critical Values for $F$ Distributions \\
                 Critical Values for Studentized Range Distributions \\
                 Chi-Squared Curve Tail Areas \\
                 Critical Values for the Ryan--Joiner Test of Normality
                 \\
                 Critical Values for the Wilcoxon Signed-Rank Test \\
                 Critical Values for the Wilcoxon Rank-Sum Test \\
                 Critical Values for the Wilcoxon Signed-Rank Interval
                 \\
                 Critical Values for the Wilcoxon Rank-Sum Interval \\
                 $\beta$ Curves for $t$ Tests \\
                 Answers to Odd-Numbered Exercises \\
                 Index",
}


bibtype: book
filename: master.bib
label: DeWolk:2019:ADS
author: Roland De Wolk
title: American disruptor: the scandalous life of Leland Stanford
publisher: pub-U-CALIFORNIA-PRESS
address: pub-U-CALIFORNIA-PRESS:adr
pages: xvii + 299 + 23
year: 2019
DOI: https://doi.org/10.1525/9780520973565
ISBN: 0-520-30547-7 (hardcover), 0-520-97356-9 (e-book) OR 0520305477 (hardcover), 0520973569 (ebook)
LCCN: E664.S78 D4 2019
bibdate: Tue May 11 12:51:36 MDT 2021
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2021.05.11 12:51:36 MDT
subject: Stanford, Leland; Businesspeople; California; Biography; Governors; Legislators; United States
acknowledgement: ack-nhfb
authordates: 1953--
subjectdates: 1824--1893
rawauthor: Roland {De Wolk}
rawtitle: {American} disruptor: the scandalous life of {Leland Stanford}
ISBN13:
978-0-520-30547-2 (hardcover), 978-0-520-97356-5 (e-book) OR 9780520305472 (hardcover), 9780520973565 (ebook)

abstract:
The life of Leland Stanford reads like a tall tale of the Old West. Born in a country tavern in upstate New York, Stanford followed the Gold Rush to California, became a successful businessman, and invested in railroads. He then made headway into politics, becoming governor of California and later a US senator. As president of the Central Pacific Railroad, Stanford brought the locomotive Jupiter to preside over the completion of the first transcontinental railroad, which led contemporaries to liken him to the namesake Roman god. He then founded one of the most prestigious universities in the world. Stanford lived large and bold, amassing an astonishing fortune, only to die on the brink of bankruptcy. In American Disruptor, Roland De Wolk balances the accomplishments of this quintessential self-made American man with the darker aspects of his life. He shows how Stanford used high public office to steal taxpayer money, only to squander it on mansions, racehorses, jewels, and vast landholdings. Even the eponymous university in Silicon Valley that bears his name, created from the largest private university endowment of all time, was born of tragedy, a memorial to Stanford's fifteen-year-old son who died from typhoid fever. Following his death, his wife struggled to keep the fledgling university afloat, only to be murdered under mysterious circumstances. Although deeply conservative in belief and style, Leland Stanford's life was one of almost unparalleled risk, failure, and reward. Richly detailed and deeply researched, American Disruptor helps restore his rightful place as an architect of modern America.

TOC:
Acknowledgments Prologue: Fell Redemption 1. Start-Up 2. Everything Ventured 3. Crossing 4. The Gold under the Mountain 5. Ditching and Hitching 6. ``The Road Must Be Built'' 7. ``Egyptian Kings and Dynasties Shall Be Forgotten'' 8. Dungeons and Depredations 9. Living Up to the Landscape 10. Command and Control 11. ``The Machine of Steam on the Road of Iron'' 12. Unmasked 13. Gone Dark 14. Ingeniously Contrived Devices 15. Deposed 16. The Fundamental Standard 17. Sex and Socialism 18. ``God Forgive Me My Sins. Am I Prepared to Meet My Dear Ones?'' Requiem: American Disruptor Notes Bibliographical Note Bibliography Index About the Author

rawabstract:
The life of Leland Stanford reads like a tall tale of the Old West. Born in a country tavern in upstate New York, Stanford followed the Gold Rush to California, became a successful businessman, and invested in railroads. He then made headway into politics, becoming governor of California and later a US senator. As president of the Central Pacific Railroad, Stanford brought the locomotive Jupiter to preside over the completion of the first transcontinental railroad, which led contemporaries to liken him to the namesake Roman god. He then founded one of the most prestigious universities in the world. Stanford lived large and bold, amassing an astonishing fortune, only to die on the brink of bankruptcy. In American Disruptor, Roland De Wolk balances the accomplishments of this quintessential self-made American man with the darker aspects of his life. He shows how Stanford used high public office to steal taxpayer money, only to squander it on mansions, racehorses, jewels, and vast landholdings. Even the eponymous university in Silicon Valley that bears his name, created from the largest private university endowment of all time, was born of tragedy, a memorial to Stanford's fifteen-year-old son who died from typhoid fever. Following his death, his wife struggled to keep the fledgling university afloat, only to be murdered under mysterious circumstances. Although deeply conservative in belief and style, Leland Stanford's life was one of almost unparalleled risk, failure, and reward. Richly detailed and deeply researched, American Disruptor helps restore his rightful place as an architect of modern America.

rawTOC:
Acknowledgments \\ Prologue: Fell Redemption \\ 1. Start-Up \\ 2. Everything Ventured \\ 3. Crossing \\ 4. The Gold under the Mountain \\ 5. Ditching and Hitching \\ 6. ``The Road Must Be Built'' \\ 7. ``Egyptian Kings and Dynasties Shall Be Forgotten'' \\ 8. Dungeons and Depredations \\ 9. Living Up to the Landscape \\ 10. Command and Control \\ 11. ``The Machine of Steam on the Road of Iron'' \\ 12. Unmasked \\ 13. Gone Dark \\ 14. Ingeniously Contrived Devices \\ 15. Deposed \\ 16. The Fundamental Standard \\ 17. Sex and Socialism \\ 18. ``God Forgive Me My Sins. Am I Prepared to Meet My Dear Ones?'' \\ Requiem: American Disruptor \\ Notes \\ Bibliographical Note \\ Bibliography \\ Index \\ About the Author

entry:
@Book{DeWolk:2019:ADS,
  author =       "Roland {De Wolk}",
  title =        "{American} disruptor: the scandalous life of {Leland
                 Stanford}",
  publisher =    pub-U-CALIFORNIA-PRESS,
  address =      pub-U-CALIFORNIA-PRESS:adr,
  pages =        "xvii + 299 + 23",
  year =         "2019",
  DOI =          "https://doi.org/10.1525/9780520973565",
  ISBN =         "0-520-30547-7 (hardcover), 0-520-97356-9 (e-book)",
  ISBN-13 =      "978-0-520-30547-2 (hardcover), 978-0-520-97356-5
                 (e-book)",
  LCCN =         "E664.S78 D4 2019",
  bibdate =      "Tue May 11 12:51:36 MDT 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "The life of Leland Stanford reads like a tall tale of
                 the Old West. Born in a country tavern in upstate New
                 York, Stanford followed the Gold Rush to California,
                 became a successful businessman, and invested in
                 railroads. He then made headway into politics, becoming
                 governor of California and later a US senator. As
                 president of the Central Pacific Railroad, Stanford
                 brought the locomotive Jupiter to preside over the
                 completion of the first transcontinental railroad,
                 which led contemporaries to liken him to the namesake
                 Roman god. He then founded one of the most prestigious
                 universities in the world. Stanford lived large and
                 bold, amassing an astonishing fortune, only to die on
                 the brink of bankruptcy. In American Disruptor, Roland
                 De Wolk balances the accomplishments of this
                 quintessential self-made American man with the darker
                 aspects of his life. He shows how Stanford used high
                 public office to steal taxpayer money, only to squander
                 it on mansions, racehorses, jewels, and vast
                 landholdings. Even the eponymous university in Silicon
                 Valley that bears his name, created from the largest
                 private university endowment of all time, was born of
                 tragedy, a memorial to Stanford's fifteen-year-old son
                 who died from typhoid fever. Following his death, his
                 wife struggled to keep the fledgling university afloat,
                 only to be murdered under mysterious circumstances.
                 Although deeply conservative in belief and style,
                 Leland Stanford's life was one of almost unparalleled
                 risk, failure, and reward. Richly detailed and deeply
                 researched, American Disruptor helps restore his
                 rightful place as an architect of modern America.",
  acknowledgement = ack-nhfb,
  author-dates = "1953--",
  subject =      "Stanford, Leland; Businesspeople; California;
                 Biography; Governors; Legislators; United States",
  subject-dates = "1824--1893",
  tableofcontents = "Acknowledgments \\
                 Prologue: Fell Redemption \\
                 1. Start-Up \\
                 2. Everything Ventured \\
                 3. Crossing \\
                 4. The Gold under the Mountain \\
                 5. Ditching and Hitching \\
                 6. ``The Road Must Be Built'' \\
                 7. ``Egyptian Kings and Dynasties Shall Be Forgotten''
                 \\
                 8. Dungeons and Depredations \\
                 9. Living Up to the Landscape \\
                 10. Command and Control \\
                 11. ``The Machine of Steam on the Road of Iron'' \\
                 12. Unmasked \\
                 13. Gone Dark \\
                 14. Ingeniously Contrived Devices \\
                 15. Deposed \\
                 16. The Fundamental Standard \\
                 17. Sex and Socialism \\
                 18. ``God Forgive Me My Sins. Am I Prepared to Meet My
                 Dear Ones?'' \\
                 Requiem: American Disruptor \\
                 Notes \\
                 Bibliographical Note \\
                 Bibliography \\
                 Index \\
                 About the Author",
}


bibtype: book
filename: master.bib
label: Diamond:2008:HDS
author: Harold G. Diamond and H. (Heini) Halberstam and William F. Galway
title: A higher-dimensional sieve method: with procedures for computing sieve functions
volume: 177
publisher: pub-CAMBRIDGE
address: pub-CAMBRIDGE:adr
pages: xxi + 266
year: 2008
ISBN: 0-521-89487-5 (hardcover) OR 0521894875 (hardcover)
ISBN13: 978-0-521-89487-6 (hardcover) OR 9780521894876 (hardcover)
LCCN: QA246 .D53 2008
bibdate: Sat Apr 23 09:33:38 MDT 2011
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2011.04.23 09:33:38 MDT
series: Cambridge tracts in mathematics
URL: http://www.math.uiuc.edu/SieveTheoryBook
subject: sieves (mathematics)
acknowledgement: ack-nhfb
rawauthor: Harold G. Diamond and H. (Heini) Halberstam and William F. Galway
rawtitle: A higher-dimensional sieve method: with procedures for computing sieve functions
note:
The Mathematica package of sieve-related functions described in Appendix 1, as well as a list of comments and corrigenda, will be maintained at path =http://www.math.uiuc.edu/SieveTheoryBook=.

rawnote:
The Mathematica package of sieve-related functions described in Appendix 1, as well as a list of comments and corrigenda, will be maintained at \path=http://www.math.uiuc.edu/SieveTheoryBook=.

entry:
@Book{Diamond:2008:HDS,
  author =       "Harold G. Diamond and H. (Heini) Halberstam and
                 William F. Galway",
  title =        "A higher-dimensional sieve method: with procedures for
                 computing sieve functions",
  volume =       "177",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xxi + 266",
  year =         "2008",
  ISBN =         "0-521-89487-5 (hardcover)",
  ISBN-13 =      "978-0-521-89487-6 (hardcover)",
  LCCN =         "QA246 .D53 2008",
  bibdate =      "Sat Apr 23 09:33:38 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "The Mathematica package of sieve-related functions
                 described in Appendix 1, as well as a list of comments
                 and corrigenda, will be maintained at
                 \path=http://www.math.uiuc.edu/SieveTheoryBook=.",
  series =       "Cambridge tracts in mathematics",
  URL =          "http://www.math.uiuc.edu/SieveTheoryBook",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "sieves (mathematics)",
}


bibtype: book
filename: master.bib
label: Dickson:2003:SSC
author: Paul Dickson
title: Sputnik: the Shock of the Century
publisher: Berkley Books
address: New York, NY, USA
pages: 310
year: 2003
ISBN: 0-425-18843-4 OR 0425188434
ISBN13: 978-0-425-18843-9 OR 9780425188439
LCCN: TL796.5.S652.S664; TL796.5.S652.S664 2003
bibdate: Mon Mar 8 20:01:59 MST 2010
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; library.mit.edu:9909/mit01
bibtimestamp: 2010.03.08 20:01:59 MST
remark: Originally published: New York: Walker Pub., 2001.
acknowledgement: ack-nhfb
rawauthor: Paul Dickson
rawtitle: {Sputnik}: the Shock of the Century
subject:
Sputnik satellites; 20th Century history; artificial satellites, Russian; political aspects; astronautics and state; United States; public opinion; politics and government

TOC:
Introduction 1: Sputnik night 2: Gravity fighters 3: Vengeance rocket 4: An open sky 5: The birth of Sputnik 6: Red Monday 7: Dog days 8: American birds 9: Ike scores 10: Sputnik's legacy Epilogue Appendix: Sputnik's long, lexical orbit

rawTOC:
Introduction \\1: Sputnik night \\ 2: Gravity fighters \\ 3: Vengeance rocket \\ 4: An open sky \\ 5: The birth of Sputnik \\ 6: Red Monday \\ 7: Dog days \\ 8: American birds \\ 9: Ike scores \\ 10: Sputnik's legacy \\ Epilogue \\ Appendix: Sputnik's long, lexical orbit

entry:
@Book{Dickson:2003:SSC,
  author =       "Paul Dickson",
  title =        "{Sputnik}: the Shock of the Century",
  publisher =    "Berkley Books",
  address =      "New York, NY, USA",
  pages =        "310",
  year =         "2003",
  ISBN =         "0-425-18843-4",
  ISBN-13 =      "978-0-425-18843-9",
  LCCN =         "TL796.5.S652.S664; TL796.5.S652.S664 2003",
  bibdate =      "Mon Mar 8 20:01:59 MST 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.mit.edu:9909/mit01",
  acknowledgement = ack-nhfb,
  remark =       "Originally published: New York: Walker Pub., 2001.",
  subject =      "Sputnik satellites; 20th Century history; artificial
                 satellites, Russian; political aspects; astronautics
                 and state; United States; public opinion; politics and
                 government",
  tableofcontents = "Introduction \\1: Sputnik night \\
                 2: Gravity fighters \\
                 3: Vengeance rocket \\
                 4: An open sky \\
                 5: The birth of Sputnik \\
                 6: Red Monday \\
                 7: Dog days \\
                 8: American birds \\
                 9: Ike scores \\
                 10: Sputnik's legacy \\
                 Epilogue \\
                 Appendix: Sputnik's long, lexical orbit",
}


bibtype: article
filename: master.bib
label: Dijkstra:goto-harmful
author: Edsger Wybe Dijkstra
title: Go to statement considered harmful
journal: j-CACM
volume: 11
number: 3
pages: 147--148
month: mar
monthnumber: 3
year: 1968
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: Edsger Wybe Dijkstra
rawtitle: Go to statement considered harmful
note:
This paper inspired scores of others, published mainly in SIGPLAN Notices up to the mid-1980s. The best-known is cite Knuth:goto.

rawnote:
This paper inspired scores of others, published mainly in SIGPLAN Notices up to the mid-1980s. The best-known is \cite{Knuth:goto}.

entry:
@Article{Dijkstra:goto-harmful,
  author =       "Edsger Wybe Dijkstra",
  title =        "Go to statement considered harmful",
  journal =      j-CACM,
  volume =       "11",
  number =       "3",
  pages =        "147--148",
  month =        mar,
  year =         "1968",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "This paper inspired scores of others, published mainly
                 in SIGPLAN Notices up to the mid-1980s. The best-known
                 is \cite{Knuth:goto}.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Diller:1993:LLL
author: Antoni Diller
title: LaTeX Line by Line: Tips and Techniques for Document Processing
publisher: pub-WILEY
address: pub-WILEY:adr
pages: xiii + 291
year: 1993
ISBN: 0-471-93471-2 (softcover) OR 0471934712 (softcover)
ISBN13: 978-0-471-93471-4 (softcover) OR 9780471934714 (softcover)
LCCN: Z253.4.L38 D55 1993
note: Optionally accompanied by disk with examples, ISBN 0-471-93797-5.
series: Wiley Professional Computing
acknowledgement: ack-bnb
rawauthor: Antoni Diller
rawnote: Optionally accompanied by disk with examples, ISBN 0-471-93797-5.
rawtitle: {\LaTeX} Line by Line: Tips and Techniques for Document Processing
bibsource:
https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/texbook1.bib; https://www.math.utah.edu/pub/tex/bib/texbook3.bib

TOC:
1: Why use it? 2: Getting Started and Basic Principles 3: Fancy Prose (and Poetry) 4: Displaying Information 5: Bibliographies and Indexes 6: Formatting Articles, Reports, Books and Letters 7: Basic Mathematical Formatting 8: Further Ideas in Mathematical Formatting 9: Examples of Mathematical Formatting 10: Pictures 11: Two-column Output

rawTOC:
1: Why use it? \\ 2: Getting Started and Basic Principles \\ 3: Fancy Prose (and Poetry) \\ 4: Displaying Information \\ 5: Bibliographies and Indexes \\ 6: Formatting Articles, Reports, Books and Letters \\ 7: Basic Mathematical Formatting \\ 8: Further Ideas in Mathematical Formatting \\ 9: Examples of Mathematical Formatting \\ 10: Pictures \\ 11: Two-column Output

entry:
@Book{Diller:1993:LLL,
  author =       "Antoni Diller",
  title =        "{\LaTeX} Line by Line: Tips and Techniques for
                 Document Processing",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xiii + 291",
  year =         "1993",
  ISBN =         "0-471-93471-2 (softcover)",
  ISBN-13 =      "978-0-471-93471-4 (softcover)",
  LCCN =         "Z253.4.L38 D55 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook1.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  note =         "Optionally accompanied by disk with examples, ISBN
                 0-471-93797-5.",
  price =        "US\$29.95",
  series =       "Wiley Professional Computing",
  acknowledgement = ack-bnb,
  tableofcontents = "1: Why use it? \\
                 2: Getting Started and Basic Principles \\
                 3: Fancy Prose (and Poetry) \\
                 4: Displaying Information \\
                 5: Bibliographies and Indexes \\
                 6: Formatting Articles, Reports, Books and Letters \\
                 7: Basic Mathematical Formatting \\
                 8: Further Ideas in Mathematical Formatting \\
                 9: Examples of Mathematical Formatting \\
                 10: Pictures \\
                 11: Two-column Output",
}


bibtype: book
filename: master.bib
label: Dodd:1997:ASG
title: The ACS Style Guide: a Manual for Authors and Editors
publisher: pub-ACS
address: pub-ACS:adr
edition: Second
pages: xi + 460
year: 1997
LCCN: QD8.5.A25 1997
bibdate: Sat Dec 24 15:01:30 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2005.12.24 15:01:30 ???
acknowledgement: ack-nhfb
rawtitle: The {ACS} Style Guide: a Manual for Authors and Editors
editor:
Janet S. Dodd and Marvin Coyner and Madeleine Jacobs and Barbara Friedman Polansky and K. Barbara Schowen and David Weisgerber and Larry James Winn

ISBN:
0-8412-3461-2 (hardcover), 0-8412-3462-0 (paperback) OR 0841234612 (hardcover), 0841234620 (paperback)

ISBN13:
978-0-8412-3461-1 (hardcover), 978-0-8412-3462-8 (paperback) OR 9780841234611 (hardcover), 9780841234628 (paperback)

keywords:
Chemical literature --- Authorship --- Handbooks,, manuals, etc, English language --- Style --- Handbooks, manuals,, etc, Authorship --- Style manuals

TOC:
Writing a scientific paper Communicating in other formats: posters, letters to the editor, and press releases Grammar, punctuation, and spelling Editorial style Numbers, mathematics, and units of measure References Names and numbers for chemical compounds Conventions in chemistry Illustrations and tables Peer review Copyright and permissions Making effective oral presentations ACS publications ACS divisions Ethical guidelines to publication of chemical research The chemist's code of conduct Proofreader's marks

raweditor:
Janet S. Dodd and Marvin Coyner and Madeleine Jacobs and Barbara Friedman Polansky and K. Barbara Schowen and David Weisgerber and Larry James Winn

rawTOC:
Writing a scientific paper \\ Communicating in other formats: posters, letters to the editor, and press releases \\ Grammar, punctuation, and spelling \\ Editorial style \\ Numbers, mathematics, and units of measure \\ References \\ Names and numbers for chemical compounds \\ Conventions in chemistry \\ Illustrations and tables \\ Peer review \\ Copyright and permissions \\ Making effective oral presentations \\ ACS publications \\ ACS divisions \\ Ethical guidelines to publication of chemical research \\ The chemist's code of conduct \\ Proofreader's marks

entry:
@Book{Dodd:1997:ASG,
  editor =       "Janet S. Dodd and Marvin Coyner and Madeleine Jacobs
                 and Barbara Friedman Polansky and K. Barbara Schowen
                 and David Weisgerber and Larry James Winn",
  title =        "The {ACS} Style Guide: a Manual for Authors and
                 Editors",
  publisher =    pub-ACS,
  address =      pub-ACS:adr,
  edition =      "Second",
  pages =        "xi + 460",
  year =         "1997",
  ISBN =         "0-8412-3461-2 (hardcover), 0-8412-3462-0 (paperback)",
  ISBN-13 =      "978-0-8412-3461-1 (hardcover), 978-0-8412-3462-8
                 (paperback)",
  LCCN =         "QD8.5.A25 1997",
  bibdate =      "Sat Dec 24 15:01:30 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$27.50",
  acknowledgement = ack-nhfb,
  DEWEY =        "808/.06654 21",
  idnumber =     "510",
  keywords =     "Chemical literature --- Authorship --- Handbooks,,
                 manuals, etc, English language --- Style --- Handbooks,
                 manuals,, etc, Authorship --- Style manuals",
  tableofcontents = "Writing a scientific paper \\
                 Communicating in other formats: posters, letters to the
                 editor, and press releases \\
                 Grammar, punctuation, and spelling \\
                 Editorial style \\
                 Numbers, mathematics, and units of measure \\
                 References \\
                 Names and numbers for chemical compounds \\
                 Conventions in chemistry \\
                 Illustrations and tables \\
                 Peer review \\
                 Copyright and permissions \\
                 Making effective oral presentations \\
                 ACS publications \\
                 ACS divisions \\
                 Ethical guidelines to publication of chemical research
                 \\
                 The chemist's code of conduct \\
                 Proofreader's marks",
}


bibtype: book
filename: master.bib
label: Dollhoff:16B79
author: Terry Dollhoff
title: 16-Bit Microprocessor Architecture
publisher: pub-RESTON
address: pub-RESTON:adr
pages: xii + 471
year: 1979
ISBN: 0-8359-7001-9 OR 0835970019
ISBN13: 978-0-8359-7001-3 OR 9780835970013
LCCN: QA76.5 .D65 1979
bibdate: Tue Dec 14 22:47:30 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:47:30 ???
acknowledgement: ack-nhfb
rawauthor: Terry Dollhoff
rawtitle: 16-Bit Microprocessor Architecture
entry:
@Book{Dollhoff:16B79,
  author =       "Terry Dollhoff",
  title =        "16-Bit Microprocessor Architecture",
  publisher =    pub-RESTON,
  address =      pub-RESTON:adr,
  pages =        "xii + 471",
  year =         "1979",
  ISBN =         "0-8359-7001-9",
  ISBN-13 =      "978-0-8359-7001-3",
  LCCN =         "QA76.5 .D65 1979",
  bibdate =      "Tue Dec 14 22:47:30 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Dolnick:2011:CUI
author: Edward Dolnick
title: The Clockwork Universe: Isaac Newton, the Royal Society, and the Birth of the Modern World
publisher: pub-HARPERCOLLINS
address: pub-HARPERCOLLINS:adr
pages: xviii + 378
year: 2011
ISBN: 0-06-171951-X OR 006171951X
ISBN13: 978-0-06-171951-6 OR 9780061719516
LCCN: Q127.E8 D65 2011
bibdate: Mon Jun 13 16:38:27 MDT 2011
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2011.06.13 16:38:27 MDT
subject: Science; Europe; History; 17th century; Newton, Isaac; Sir; Religion and science
acknowledgement: ack-nhfb
subjectdates: 1642--1727
rawauthor: Edward Dolnick
rawtitle: The Clockwork Universe: {Isaac Newton}, the {Royal Society}, and the Birth of the Modern World
TOC:
London, 1660 Satan's claws The end of the world ``When spotted death ran arm'd through every street'' Melancholy streets Fire God at His drawing table The idea that unlocked the world Euclid and unicorns The boys' club To the barricades! Dogs and rascals A dose of poison Of mites and men A play without an audience All in pieces Never seen until this moment Flies as big as a lamb From earthworms to angels The parade of the horribles ``Shuddering before the beautiful'' Patterns made with ideas God's strange cryptography The secret plan Tears of joy Walrus with a golden nose Cracking the cosmic safe The view from the crow's nest Sputnik in orbit, 1687 Hidden in plain sight Two rocks and a rope A fly on the wall ``Euclid alone has looked on beauty bare'' Here be monsters! Barricaded against the beast Out of the whirlpool All men are created equal The miracle years All mystery banished Talking dogs and unsuspected powers The world in close-up When the cable snaps The best of all possible feuds Battle's end The apple and the moon A visit to Cambridge Newton bears down Trouble with Mr. Hooke The system of the world Only three people Just crazy enough In search of God Conclusion

rawTOC:
London, 1660 \\ Satan's claws \\ The end of the world \\ ``When spotted death ran arm'd through every street'' \\ Melancholy streets \\ Fire \\ God at His drawing table \\ The idea that unlocked the world \\ Euclid and unicorns \\ The boys' club \\ To the barricades! \\ Dogs and rascals \\ A dose of poison \\ Of mites and men \\ A play without an audience \\ All in pieces \\ Never seen until this moment \\ Flies as big as a lamb \\ From earthworms to angels \\ The parade of the horribles \\ ``Shuddering before the beautiful'' \\ Patterns made with ideas \\ God's strange cryptography \\ The secret plan \\ Tears of joy \\ Walrus with a golden nose \\ Cracking the cosmic safe \\ The view from the crow's nest \\ Sputnik in orbit, 1687 \\ Hidden in plain sight \\ Two rocks and a rope \\ A fly on the wall \\ ``Euclid alone has looked on beauty bare'' \\ Here be monsters! \\ Barricaded against the beast \\ Out of the whirlpool \\ All men are created equal \\ The miracle years \\ All mystery banished \\ Talking dogs and unsuspected powers \\ The world in close-up \\ When the cable snaps \\ The best of all possible feuds \\ Battle's end \\ The apple and the moon \\ A visit to Cambridge \\ Newton bears down \\ Trouble with Mr. Hooke \\ The system of the world \\ Only three people \\ Just crazy enough \\ In search of God \\ Conclusion

entry:
@Book{Dolnick:2011:CUI,
  author =       "Edward Dolnick",
  title =        "The Clockwork Universe: {Isaac Newton}, the {Royal
                 Society}, and the Birth of the Modern World",
  publisher =    pub-HARPERCOLLINS,
  address =      pub-HARPERCOLLINS:adr,
  pages =        "xviii + 378",
  year =         "2011",
  ISBN =         "0-06-171951-X",
  ISBN-13 =      "978-0-06-171951-6",
  LCCN =         "Q127.E8 D65 2011",
  bibdate =      "Mon Jun 13 16:38:27 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Science; Europe; History; 17th century; Newton, Isaac;
                 Sir; Religion and science",
  subject-dates = "1642--1727",
  tableofcontents = "London, 1660 \\
                 Satan's claws \\
                 The end of the world \\
                 ``When spotted death ran arm'd through every street''
                 \\
                 Melancholy streets \\
                 Fire \\
                 God at His drawing table \\
                 The idea that unlocked the world \\
                 Euclid and unicorns \\
                 The boys' club \\
                 To the barricades! \\
                 Dogs and rascals \\
                 A dose of poison \\
                 Of mites and men \\
                 A play without an audience \\
                 All in pieces \\
                 Never seen until this moment \\
                 Flies as big as a lamb \\
                 From earthworms to angels \\
                 The parade of the horribles \\
                 ``Shuddering before the beautiful'' \\
                 Patterns made with ideas \\
                 God's strange cryptography \\
                 The secret plan \\
                 Tears of joy \\
                 Walrus with a golden nose \\
                 Cracking the cosmic safe \\
                 The view from the crow's nest \\
                 Sputnik in orbit, 1687 \\
                 Hidden in plain sight \\
                 Two rocks and a rope \\
                 A fly on the wall \\
                 ``Euclid alone has looked on beauty bare'' \\
                 Here be monsters! \\
                 Barricaded against the beast \\
                 Out of the whirlpool \\
                 All men are created equal \\
                 The miracle years \\
                 All mystery banished \\
                 Talking dogs and unsuspected powers \\
                 The world in close-up \\
                 When the cable snaps \\
                 The best of all possible feuds \\
                 Battle's end \\
                 The apple and the moon \\
                 A visit to Cambridge \\
                 Newton bears down \\
                 Trouble with Mr. Hooke \\
                 The system of the world \\
                 Only three people \\
                 Just crazy enough \\
                 In search of God \\
                 Conclusion",
}


bibtype: book
filename: master.bib
label: Dongarra:1979:LUG
author: J. J. Dongarra and J. R. Bunch and C. B. Moler and G. W. Stewart
title: LINPACK Users' Guide
publisher: pub-SIAM
address: pub-SIAM:adr
pages: 320
year: 1979
DOI: https://doi.org/10.1137/1.9781611971811
ISBN: 0-89871-172-X (paperback) OR 089871172X (paperback)
ISBN13: 978-0-89871-172-1 (paperback) OR 9780898711721 (paperback)
LCCN: QA76.73 .L22 L5 1979; QA184 .L56 1982; QA214 .L56 1979
bibdate: Mon Dec 13 15:18:20 1993
bibtimestamp: 1993.12.13 15:18:20 ???
acknowledgement: ack-nhfb
rawauthor: J. J. Dongarra and J. R. Bunch and C. B. Moler and G. W. Stewart
rawtitle: {LINPACK} Users' Guide
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/d/dongarra-jack-j.bib; https://www.math.utah.edu/pub/bibnet/authors/m/moler-cleve-b.bib; https://www.math.utah.edu/pub/bibnet/authors/s/stewart-gilbert-w.bib; https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib; https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; https://www.math.utah.edu/pub/tex/bib/gnu.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
The authors of this carefully structured guide are the principal developers of LINPACK, a unique package of Fortran subroutines for analyzing and solving various systems of simultaneous linear algebraic equations and linear least squares problems. This guide supports both the casual user of LINPACK who simply requires a library subroutine, and the specialist who wishes to modify or extend the code to handle special problems. It is also recommended for classroom work.

keywords:
book, Cholesky decomposition, cond, downd, linpack, lud, lud, math, nla, qrd, qrd, soft, software, survey, svd, svd, upd, updating

subject:
LINPACK (Computer system); Equations, Simultaneous; Data processing; Matrices; Data processing; LINPACK (Computer system); LINPACK (Systeme d'ordinateur); Equations simultanees; Informatique

TOC:
General matrices Band matrices Positive definite matrices Positive definite band matrices Symmetric indefinite matrices Triangular matrices Tridiagonal matrices The Cholesky decomposition The $QR$ decomposition Updating $QR$ and Cholesky decompositions The singular value decomposition References Basic linear algebra subprograms Timing data Program listings BLA listings

rawabstract:
The authors of this carefully structured guide are the principal developers of LINPACK, a unique package of Fortran subroutines for analyzing and solving various systems of simultaneous linear algebraic equations and linear least squares problems. This guide supports both the casual user of LINPACK who simply requires a library subroutine, and the specialist who wishes to modify or extend the code to handle special problems. It is also recommended for classroom work.

rawTOC:
General matrices \\ Band matrices \\ Positive definite matrices \\ Positive definite band matrices \\ Symmetric indefinite matrices \\ Triangular matrices \\ Tridiagonal matrices \\ The Cholesky decomposition \\ The $QR$ decomposition \\ Updating $QR$ and Cholesky decompositions \\ The singular value decomposition \\ References \\ Basic linear algebra subprograms \\ Timing data \\ Program listings \\ BLA listings

entry:
@Book{Dongarra:1979:LUG,
  author =       "J. J. Dongarra and J. R. Bunch and C. B. Moler and G.
                 W. Stewart",
  title =        "{LINPACK} Users' Guide",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "320",
  year =         "1979",
  DOI =          "https://doi.org/10.1137/1.9781611971811",
  ISBN =         "0-89871-172-X (paperback)",
  ISBN-13 =      "978-0-89871-172-1 (paperback)",
  LCCN =         "QA76.73 .L22 L5 1979; QA184 .L56 1982; QA214 .L56
                 1979",
  bibdate =      "Mon Dec 13 15:18:20 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dongarra-jack-j.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/moler-cleve-b.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/stewart-gilbert-w.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/gnu.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "The authors of this carefully structured guide are the
                 principal developers of LINPACK, a unique package of
                 Fortran subroutines for analyzing and solving various
                 systems of simultaneous linear algebraic equations and
                 linear least squares problems. This guide supports both
                 the casual user of LINPACK who simply requires a
                 library subroutine, and the specialist who wishes to
                 modify or extend the code to handle special problems.
                 It is also recommended for classroom work.",
  acknowledgement = ack-nhfb,
  GWS-number =   "B2",
  keywords =     "book, Cholesky decomposition, cond, downd, linpack,
                 lud, lud, math, nla, qrd, qrd, soft, software, survey,
                 svd, svd, upd, updating",
  subject =      "LINPACK (Computer system); Equations, Simultaneous;
                 Data processing; Matrices; Data processing; LINPACK
                 (Computer system); LINPACK (Syst{\`e}me d'ordinateur);
                 {\'E}quations simultan{\'e}es; Informatique",
  tableofcontents = "General matrices \\
                 Band matrices \\
                 Positive definite matrices \\
                 Positive definite band matrices \\
                 Symmetric indefinite matrices \\
                 Triangular matrices \\
                 Tridiagonal matrices \\
                 The Cholesky decomposition \\
                 The $QR$ decomposition \\
                 Updating $QR$ and Cholesky decompositions \\
                 The singular value decomposition \\
                 References \\
                 Basic linear algebra subprograms \\
                 Timing data \\
                 Program listings \\
                 BLA listings",
  xxauthor =     "J. J. Dongarra and C. B. Moler and J. R. Bunch and G.
                 W. Stewart",
}


bibtype: book
filename: master.bib
label: Dongarra:1991:SLS
author: Jack J. Dongarra and Iain S. Duff and Danny C. Sorensen and Henk A. van der Vorst
title: Solving Linear Systems on Vector and Shared Memory Computers
publisher: pub-SIAM
address: pub-SIAM:adr
pages: x + 256
year: 1991
ISBN: 0-89871-270-X OR 089871270X
ISBN13: 978-0-89871-270-4 OR 9780898712704
LCCN: QA184 .S65 1991
bibdate: Mon Oct 26 07:30:53 1998
bibtimestamp: 1998.10.26 07:30:53 ???
acknowledgement: ack-nhfb
rawauthor: Jack J. Dongarra and Iain S. Duff and Danny C. Sorensen and Henk A. {van der Vorst}
rawtitle: Solving Linear Systems on Vector and Shared Memory Computers
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/d/dongarra-jack-j.bib; https://www.math.utah.edu/pub/bibnet/authors/d/duff-iain-s.bib; https://www.math.utah.edu/pub/bibnet/authors/v/vandervorst-henk-a.bib; https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/numana1990.bib; https://www.math.utah.edu/pub/tex/bib/texbook2.bib; MathSciNet database

TOC:
Introduction / 1 1 Vector and Parallel Processing / 3 1.1 Traditional Computers and Their Limitations / 3 1.2 Parallelism within a Single Processor / 4 1.2.1 Multiple Functional Units / 4 1.2.2 Pipelining / 4 1.2.3 Overlapping / 6 1.2.4 RISC / 7 1.2.5 VLIW / 8 1.2.6 Vector Instructions / 8 1.2.7 Chaining / 9 1.2.8 Memory-to-Memory and Register-to-Register Organizations / 10 1.2.9 Register Set / 10 1.2.10 Stripmining / 11 1.2.11 Reconfigurable Vector Registers / 11 1.2.12 Memory Organization / 12 1.3 Data Organization / 14 1.3.1 Main Memory / 14 1.3.2 Cache / 16 1.3.3 Local Memory / 18 1.4 Memory Management / 18 1.5 Parallelism through Multiple Pipes or Multiple Processors / 21 1.6 Interconnection Topology / 22 1.6.1 Crossbar Switch / 23 1.6.2 Timeshared Bus / 24 1.6.3 Ring Connection / 25 1.6.4 Mesh Connection / 25 1.6.5 Hypercube / 26 1.6.6 Multistaged Network / 27 1.7 Programming Techniques / 29 2 Overview of Current High-Performance Computers / 33 2.1 Supercomputers / 33 2.2 Mini-Supercomputers / 36 2.3 Vector Mainframes / 37 2.4 Novel Parallel Processors / 37 3 Implementation Details and Overhead / 43 3.1 Parallel Decomposition and Data Dependency Graphs / 43 3.2 Synchronization / 46 3.3 Load Balancing / 48 3.4 Recurrence / 49 3.5 Indirect Addressing / 51 4 Performance: Analysis, Modeling, and Measurements / 53 4.1 Amdahl's Law / 54 4.1.1 Simple Case of Amdahl's Law / 54 4.1.2 General Form of Amdahl's Law / 55 4.2 Vector Speed and Vector Length / 56 4.3 Amdahl's Law-Parallel Processing / 57 4.3.1 A Simple Model / 60 4.3.2 Gustafson's Model / 60 4.4 Examples of $(r_infty , n_1/2)$-values for Various Computers / 60 4.4.1 CRAY-1 and CRAY-2 (one processor) / 62 4.4.2 CRAY X-MP (one processor; clock cycle time 8.5 nsec) / 63 4.4.3 CYBER 205 (2-pipe) and ETA-10P (single processor) / 63 4.4.4 IBM 3090/VF (1 processor; clock cycle time 18.5 nsec) / 64 4.4.5 NEC SX/2 / 65 4.4.6 Convex C-1 and Convex C-210 / 66 4.4.7 Alliant FX/80 / 66 4.4.8 General Observations / 68 4.5 LINPACK Benchmark / 68 4.5.1 Description of the Benchmark / 69 4.5.2 Calls to the BLAS / 69 4.5.3 Asymptotic Performance / 75 5 Building Blocks in Linear Algebra / 75 5.1 Basic Linear Algebra Subprograms / 75 5.1.1 Level 1 BLAS / 76 5.1.2 Level 2 BLAS / 77 5.1.3 Level 3 BLAS / 78 5.2 Levels of Parallelism / 81 5.2.1 Vector Computers / 81 5.2.2 Parallel Processors with Shared Memory / 82 5.2.3 Parallel-Vector Computers / 83 5.2.4 Clusters of Parallel Vector Processors / 84 5.3 Basic Factorizations of Linear Algebra / 84 5.3.1 Point Algorithm: Gaussian Elimination with Partial Pivoting / 84 5.3.2 Special Matrices / 86 5.4 Blocked Algorithms: Matrix-Vector and Matrix-Matrix Versions / 89 5.4.1 Right-Looking Algorithm / 90 5.4.2 Left-Looking Algorithm / 92 5.4.3 Crout Algorithm / 98 5.4.4 Typical Performance of Blocked LU Decomposition / 94 5.4.5 Blocked Symmetric Indefinite Factorization / 95 5.4.6 Typical Performance of Blocked Symmetric Indefinite Factorization. / 98 5.5 Linear Least Squares / 98 5.5.1 Householder Method / 99 5.5.2 Blocked Householder Method / 100 5.5.3 Typical Performance of the Blocked Householder Factorization / 101 5.6 Organization of the Modules / 102 5.6.1 Matrix--Vector Product / 102 5.6.2 Matrix--Matrix Product / 103 5.6.3 Typical Performance for Parallel Processing / 104 5.6.4 Benefits / 105 5.7 LAPACK / 106 6 Direct Solution of Sparse Linear Systems / 109 6.1 Introduction to Direct Methods for Sparse Linear Systems / 111 6.1.1 Three Approaches / 111 6.1.2 Description of Sparse Data Structure / 112 6.1.3 Manipulation of Sparse Data Structure / 114 6.2 General Sparse Matrix Methods / 116 6.3 Methods for Symmetric Matrices and Band Systems / 124 6.3.1 The Clique Concept in Gaussian Elimination / 125 6.3.2 Code Performance and Symmetry / 128 6.4 Frontal Methods / 130 6.4.1 Organization / 130 6.4.2 Vector Performance / 132 6.5 Multifrontal Methods / 135 6.5.1 Performance on Vector Machines / 139 6.5.2 Performance on Parallel Machines / 139 6.6 Other Approaches for Exploitation of Parallelism / 141 6.7 Software / 141 6.8 Brief Summary / 142 7 Iterative Solution of Sparse Linear Systems / 143 7.1 Iterative Methods / 145 7.1.1 Conjugate Gradient / 145 7.1.2 Least Squares Conjugate Gradients / 148 7.1.3 Biconjugate Gradients / 150 7.1.4 Conjugate Gradient Squared / 152 7.1.5 GMRES and GMRES(m) / 154 7.1.6 Adaptive Chebychev / 156 7.2 Vector and Parallel Aspects / 158 7.2.1 General Remarks / 158 7.2.2 Sparse Matrix-Vector Multiplication / 160 7.2.3 Performance of the Unpreconditioned Methods / 164 7.3 Preconditioning / 165 7.3.1 General Aspects / 165 7.3.2 Efficient Implementations / 168 7.3.3 Partial Vectorization / 170 7.3.4 Reordering the Unknowns / 172 7.3.5 Changing the Order of Computation / 174 7.3.6 Some Other Vectorizable Preconditioners / 180 7.3.7 Parallel Aspects / 183 7.4 Experiences with Parallelism / 186 7.4.1 General Remarks / 186 7.4.2 Overlapping Local Preconditioners / 186 7.4.3 Repeated Twisted Factorization / 188 7.4.4 Twisted and Nested Twisted Factorization / 189 7.4.5 Hyperplane Ordering / 189 A Acquiring Mathematical Software / 191 B Glossary / 197 C Information on Various High-Performance Computers / 213 D Level 1, 2, and 3 BLAS Quick Reference / 221 E Operation Counts for Various BLAS and Decompositions / 227 Index / 247

rawTOC:
Introduction / 1 \\ 1 Vector and Parallel Processing / 3 \\ 1.1 Traditional Computers and Their Limitations / 3 \\ 1.2 Parallelism within a Single Processor / 4 \\ 1.2.1 Multiple Functional Units / 4 \\ 1.2.2 Pipelining / 4 \\ 1.2.3 Overlapping / 6 \\ 1.2.4 RISC / 7 \\ 1.2.5 VLIW / 8 \\ 1.2.6 Vector Instructions / 8 \\ 1.2.7 Chaining / 9 \\ 1.2.8 Memory-to-Memory and Register-to-Register Organizations / 10 \\ 1.2.9 Register Set / 10 \\ 1.2.10 Stripmining / 11 \\ 1.2.11 Reconfigurable Vector Registers / 11 \\ 1.2.12 Memory Organization / 12 \\ 1.3 Data Organization / 14 \\ 1.3.1 Main Memory / 14 \\ 1.3.2 Cache / 16 \\ 1.3.3 Local Memory / 18 \\ 1.4 Memory Management / 18 \\ 1.5 Parallelism through Multiple Pipes or Multiple Processors / 21 \\ 1.6 Interconnection Topology / 22 \\ 1.6.1 Crossbar Switch / 23 \\ 1.6.2 Timeshared Bus / 24 \\ 1.6.3 Ring Connection / 25 \\ 1.6.4 Mesh Connection / 25 \\ 1.6.5 Hypercube / 26 \\ 1.6.6 Multistaged Network / 27 \\ 1.7 Programming Techniques / 29 \\ 2 Overview of Current High-Performance Computers / 33 \\ 2.1 Supercomputers / 33 \\ 2.2 Mini-Supercomputers / 36 \\ 2.3 Vector Mainframes / 37 \\ 2.4 Novel Parallel Processors / 37 \\ 3 Implementation Details and Overhead / 43 \\ 3.1 Parallel Decomposition and Data Dependency Graphs / 43 \\ 3.2 Synchronization / 46 \\ 3.3 Load Balancing / 48 \\ 3.4 Recurrence / 49 \\ 3.5 Indirect Addressing / 51 \\ 4 Performance: Analysis, Modeling, and Measurements / 53 \\ 4.1 Amdahl's Law / 54 \\ 4.1.1 Simple Case of Amdahl's Law / 54 \\ 4.1.2 General Form of Amdahl's Law / 55 \\ 4.2 Vector Speed and Vector Length / 56 \\ 4.3 Amdahl's Law-Parallel Processing / 57 \\ 4.3.1 A Simple Model / 60 \\ 4.3.2 Gustafson's Model / 60 \\ 4.4 Examples of $(r_\infty, n_{1/2})$-values for Various Computers / 60 \\ 4.4.1 CRAY-1 and CRAY-2 (one processor) / 62 \\ 4.4.2 CRAY X-MP (one processor; clock cycle time 8.5 nsec) / 63 \\ 4.4.3 CYBER 205 (2-pipe) and ETA-10P (single processor) / 63 \\ 4.4.4 IBM 3090/VF (1 processor; clock cycle time 18.5 nsec) / 64 \\ 4.4.5 NEC SX/2 / 65 \\ 4.4.6 Convex C-1 and Convex C-210 / 66 \\ 4.4.7 Alliant FX/80 / 66 \\ 4.4.8 General Observations / 68 \\ 4.5 LINPACK Benchmark / 68 \\ 4.5.1 Description of the Benchmark / 69 \\ 4.5.2 Calls to the BLAS / 69 \\ 4.5.3 Asymptotic Performance / 75 \\ 5 Building Blocks in Linear Algebra / 75 \\ 5.1 Basic Linear Algebra Subprograms / 75 \\ 5.1.1 Level 1 BLAS / 76 \\ 5.1.2 Level 2 BLAS / 77 \\ 5.1.3 Level 3 BLAS / 78 \\ 5.2 Levels of Parallelism / 81 \\ 5.2.1 Vector Computers / 81 \\ 5.2.2 Parallel Processors with Shared Memory / 82 \\ 5.2.3 Parallel-Vector Computers / 83 \\ 5.2.4 Clusters of Parallel Vector Processors / 84 \\ 5.3 Basic Factorizations of Linear Algebra / 84 \\ 5.3.1 Point Algorithm: Gaussian Elimination with Partial Pivoting / 84 \\ 5.3.2 Special Matrices / 86 \\ 5.4 Blocked Algorithms: Matrix-Vector and Matrix-Matrix Versions / 89 \\ 5.4.1 Right-Looking Algorithm / 90 \\ 5.4.2 Left-Looking Algorithm / 92 \\ 5.4.3 Crout Algorithm / 98 \\ 5.4.4 Typical Performance of Blocked LU Decomposition / 94 \\ 5.4.5 Blocked Symmetric Indefinite Factorization / 95 \\ 5.4.6 Typical Performance of Blocked Symmetric Indefinite Factorization. / 98 \\ 5.5 Linear Least Squares / 98 \\ 5.5.1 Householder Method / 99 \\ 5.5.2 Blocked Householder Method / 100 \\ 5.5.3 Typical Performance of the Blocked Householder Factorization / 101 \\ 5.6 Organization of the Modules / 102 \\ 5.6.1 Matrix--Vector Product / 102 \\ 5.6.2 Matrix--Matrix Product / 103 \\ 5.6.3 Typical Performance for Parallel Processing / 104 \\ 5.6.4 Benefits / 105 \\ 5.7 LAPACK / 106 \\ 6 Direct Solution of Sparse Linear Systems / 109 \\ 6.1 Introduction to Direct Methods for Sparse Linear Systems / 111 \\ 6.1.1 Three Approaches / 111 \\ 6.1.2 Description of Sparse Data Structure / 112 \\ 6.1.3 Manipulation of Sparse Data Structure / 114 \\ 6.2 General Sparse Matrix Methods / 116 \\ 6.3 Methods for Symmetric Matrices and Band Systems / 124 \\ 6.3.1 The Clique Concept in Gaussian Elimination / 125 \\ 6.3.2 Code Performance and Symmetry / 128 \\ 6.4 Frontal Methods / 130 \\ 6.4.1 Organization / 130 \\ 6.4.2 Vector Performance / 132 \\ 6.5 Multifrontal Methods / 135 \\ 6.5.1 Performance on Vector Machines / 139 \\ 6.5.2 Performance on Parallel Machines / 139 \\ 6.6 Other Approaches for Exploitation of Parallelism / 141 \\ 6.7 Software / 141 \\ 6.8 Brief Summary / 142 \\ 7 Iterative Solution of Sparse Linear Systems / 143 \\ 7.1 Iterative Methods / 145 \\ 7.1.1 Conjugate Gradient / 145 \\ 7.1.2 Least Squares Conjugate Gradients / 148 \\ 7.1.3 Biconjugate Gradients / 150 \\ 7.1.4 Conjugate Gradient Squared / 152 \\ 7.1.5 GMRES and GMRES(m) / 154 \\ 7.1.6 Adaptive Chebychev / 156 \\ 7.2 Vector and Parallel Aspects / 158 \\ 7.2.1 General Remarks / 158 \\ 7.2.2 Sparse Matrix-Vector Multiplication / 160 \\ 7.2.3 Performance of the Unpreconditioned Methods / 164 \\ 7.3 Preconditioning / 165 \\ 7.3.1 General Aspects / 165 \\ 7.3.2 Efficient Implementations / 168 \\ 7.3.3 Partial Vectorization / 170 \\ 7.3.4 Reordering the Unknowns / 172 \\ 7.3.5 Changing the Order of Computation / 174 \\ 7.3.6 Some Other Vectorizable Preconditioners / 180 \\ 7.3.7 Parallel Aspects / 183 \\ 7.4 Experiences with Parallelism / 186 \\ 7.4.1 General Remarks / 186 \\ 7.4.2 Overlapping Local Preconditioners / 186 \\ 7.4.3 Repeated Twisted Factorization / 188 \\ 7.4.4 Twisted and Nested Twisted Factorization / 189 \\ 7.4.5 Hyperplane Ordering / 189 \\ A Acquiring Mathematical Software / 191 \\ B Glossary / 197 \\ C Information on Various High-Performance Computers / 213 \\ D Level 1, 2, and 3 BLAS Quick Reference / 221 \\ E Operation Counts for Various BLAS and Decompositions / 227 \\ Index / 247

entry:
@Book{Dongarra:1991:SLS,
  author =       "Jack J. Dongarra and Iain S. Duff and Danny C.
                 Sorensen and Henk A. {van der Vorst}",
  title =        "Solving Linear Systems on Vector and Shared Memory
                 Computers",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "x + 256",
  year =         "1991",
  ISBN =         "0-89871-270-X",
  ISBN-13 =      "978-0-89871-270-4",
  LCCN =         "QA184 .S65 1991",
  bibdate =      "Mon Oct 26 07:30:53 1998",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dongarra-jack-j.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/d/duff-iain-s.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/v/vandervorst-henk-a.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction / 1 \\
                 1 Vector and Parallel Processing / 3 \\
                 1.1 Traditional Computers and Their Limitations / 3 \\
                 1.2 Parallelism within a Single Processor / 4 \\
                 1.2.1 Multiple Functional Units / 4 \\
                 1.2.2 Pipelining / 4 \\
                 1.2.3 Overlapping / 6 \\
                 1.2.4 RISC / 7 \\
                 1.2.5 VLIW / 8 \\
                 1.2.6 Vector Instructions / 8 \\
                 1.2.7 Chaining / 9 \\
                 1.2.8 Memory-to-Memory and Register-to-Register
                 Organizations / 10 \\
                 1.2.9 Register Set / 10 \\
                 1.2.10 Stripmining / 11 \\
                 1.2.11 Reconfigurable Vector Registers / 11 \\
                 1.2.12 Memory Organization / 12 \\
                 1.3 Data Organization / 14 \\
                 1.3.1 Main Memory / 14 \\
                 1.3.2 Cache / 16 \\
                 1.3.3 Local Memory / 18 \\
                 1.4 Memory Management / 18 \\
                 1.5 Parallelism through Multiple Pipes or Multiple
                 Processors / 21 \\
                 1.6 Interconnection Topology / 22 \\
                 1.6.1 Crossbar Switch / 23 \\
                 1.6.2 Timeshared Bus / 24 \\
                 1.6.3 Ring Connection / 25 \\
                 1.6.4 Mesh Connection / 25 \\
                 1.6.5 Hypercube / 26 \\
                 1.6.6 Multistaged Network / 27 \\
                 1.7 Programming Techniques / 29 \\
                 2 Overview of Current High-Performance Computers / 33
                 \\
                 2.1 Supercomputers / 33 \\
                 2.2 Mini-Supercomputers / 36 \\
                 2.3 Vector Mainframes / 37 \\
                 2.4 Novel Parallel Processors / 37 \\
                 3 Implementation Details and Overhead / 43 \\
                 3.1 Parallel Decomposition and Data Dependency Graphs /
                 43 \\
                 3.2 Synchronization / 46 \\
                 3.3 Load Balancing / 48 \\
                 3.4 Recurrence / 49 \\
                 3.5 Indirect Addressing / 51 \\
                 4 Performance: Analysis, Modeling, and Measurements /
                 53 \\
                 4.1 Amdahl's Law / 54 \\
                 4.1.1 Simple Case of Amdahl's Law / 54 \\
                 4.1.2 General Form of Amdahl's Law / 55 \\
                 4.2 Vector Speed and Vector Length / 56 \\
                 4.3 Amdahl's Law-Parallel Processing / 57 \\
                 4.3.1 A Simple Model / 60 \\
                 4.3.2 Gustafson's Model / 60 \\
                 4.4 Examples of $(r_\infty, n_{1/2})$-values for
                 Various Computers / 60 \\
                 4.4.1 CRAY-1 and CRAY-2 (one processor) / 62 \\
                 4.4.2 CRAY X-MP (one processor; clock cycle time 8.5
                 nsec) / 63 \\
                 4.4.3 CYBER 205 (2-pipe) and ETA-10P (single processor)
                 / 63 \\
                 4.4.4 IBM 3090/VF (1 processor; clock cycle time 18.5
                 nsec) / 64 \\
                 4.4.5 NEC SX/2 / 65 \\
                 4.4.6 Convex C-1 and Convex C-210 / 66 \\
                 4.4.7 Alliant FX/80 / 66 \\
                 4.4.8 General Observations / 68 \\
                 4.5 LINPACK Benchmark / 68 \\
                 4.5.1 Description of the Benchmark / 69 \\
                 4.5.2 Calls to the BLAS / 69 \\
                 4.5.3 Asymptotic Performance / 75 \\
                 5 Building Blocks in Linear Algebra / 75 \\
                 5.1 Basic Linear Algebra Subprograms / 75 \\
                 5.1.1 Level 1 BLAS / 76 \\
                 5.1.2 Level 2 BLAS / 77 \\
                 5.1.3 Level 3 BLAS / 78 \\
                 5.2 Levels of Parallelism / 81 \\
                 5.2.1 Vector Computers / 81 \\
                 5.2.2 Parallel Processors with Shared Memory / 82 \\
                 5.2.3 Parallel-Vector Computers / 83 \\
                 5.2.4 Clusters of Parallel Vector Processors / 84 \\
                 5.3 Basic Factorizations of Linear Algebra / 84 \\
                 5.3.1 Point Algorithm: Gaussian Elimination with
                 Partial Pivoting / 84 \\
                 5.3.2 Special Matrices / 86 \\
                 5.4 Blocked Algorithms: Matrix-Vector and Matrix-Matrix
                 Versions / 89 \\
                 5.4.1 Right-Looking Algorithm / 90 \\
                 5.4.2 Left-Looking Algorithm / 92 \\
                 5.4.3 Crout Algorithm / 98 \\
                 5.4.4 Typical Performance of Blocked LU Decomposition /
                 94 \\
                 5.4.5 Blocked Symmetric Indefinite Factorization / 95
                 \\
                 5.4.6 Typical Performance of Blocked Symmetric
                 Indefinite Factorization. / 98 \\
                 5.5 Linear Least Squares / 98 \\
                 5.5.1 Householder Method / 99 \\
                 5.5.2 Blocked Householder Method / 100 \\
                 5.5.3 Typical Performance of the Blocked Householder
                 Factorization / 101 \\
                 5.6 Organization of the Modules / 102 \\
                 5.6.1 Matrix--Vector Product / 102 \\
                 5.6.2 Matrix--Matrix Product / 103 \\
                 5.6.3 Typical Performance for Parallel Processing / 104
                 \\
                 5.6.4 Benefits / 105 \\
                 5.7 LAPACK / 106 \\
                 6 Direct Solution of Sparse Linear Systems / 109 \\
                 6.1 Introduction to Direct Methods for Sparse Linear
                 Systems / 111 \\
                 6.1.1 Three Approaches / 111 \\
                 6.1.2 Description of Sparse Data Structure / 112 \\
                 6.1.3 Manipulation of Sparse Data Structure / 114 \\
                 6.2 General Sparse Matrix Methods / 116 \\
                 6.3 Methods for Symmetric Matrices and Band Systems /
                 124 \\
                 6.3.1 The Clique Concept in Gaussian Elimination / 125
                 \\
                 6.3.2 Code Performance and Symmetry / 128 \\
                 6.4 Frontal Methods / 130 \\
                 6.4.1 Organization / 130 \\
                 6.4.2 Vector Performance / 132 \\
                 6.5 Multifrontal Methods / 135 \\
                 6.5.1 Performance on Vector Machines / 139 \\
                 6.5.2 Performance on Parallel Machines / 139 \\
                 6.6 Other Approaches for Exploitation of Parallelism /
                 141 \\
                 6.7 Software / 141 \\
                 6.8 Brief Summary / 142 \\
                 7 Iterative Solution of Sparse Linear Systems / 143 \\
                 7.1 Iterative Methods / 145 \\
                 7.1.1 Conjugate Gradient / 145 \\
                 7.1.2 Least Squares Conjugate Gradients / 148 \\
                 7.1.3 Biconjugate Gradients / 150 \\
                 7.1.4 Conjugate Gradient Squared / 152 \\
                 7.1.5 GMRES and GMRES(m) / 154 \\
                 7.1.6 Adaptive Chebychev / 156 \\
                 7.2 Vector and Parallel Aspects / 158 \\
                 7.2.1 General Remarks / 158 \\
                 7.2.2 Sparse Matrix-Vector Multiplication / 160 \\
                 7.2.3 Performance of the Unpreconditioned Methods / 164
                 \\
                 7.3 Preconditioning / 165 \\
                 7.3.1 General Aspects / 165 \\
                 7.3.2 Efficient Implementations / 168 \\
                 7.3.3 Partial Vectorization / 170 \\
                 7.3.4 Reordering the Unknowns / 172 \\
                 7.3.5 Changing the Order of Computation / 174 \\
                 7.3.6 Some Other Vectorizable Preconditioners / 180 \\
                 7.3.7 Parallel Aspects / 183 \\
                 7.4 Experiences with Parallelism / 186 \\
                 7.4.1 General Remarks / 186 \\
                 7.4.2 Overlapping Local Preconditioners / 186 \\
                 7.4.3 Repeated Twisted Factorization / 188 \\
                 7.4.4 Twisted and Nested Twisted Factorization / 189
                 \\
                 7.4.5 Hyperplane Ordering / 189 \\
                 A Acquiring Mathematical Software / 191 \\
                 B Glossary / 197 \\
                 C Information on Various High-Performance Computers /
                 213 \\
                 D Level 1, 2, and 3 BLAS Quick Reference / 221 \\
                 E Operation Counts for Various BLAS and Decompositions
                 / 227 \\
                 Index / 247",
}


