# bibtab

bibtype: book
filename: master.bib
label: Harbison:2002:CRM
author: Samuel P. Harbison III and Guy L. Steele Jr.
title: C --- a Reference Manual
publisher: pub-PH
address: pub-PH:adr
edition: Fifth
pages: xviii + 533
year: 2002
LCCN: QA76.73.C15 H38 2002
bibdate: Sat Mar 30 08:29:26 2002
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2002.03.30 08:29:26 ???
URL: http://www.CAReferenceManual.com/; http://www.phptr.com/ptrbooks/ptr_013089592X.html
acknowledgement: ack-nhfb
rawauthor: Samuel P. {Harbison III} and Guy L. {Steele Jr.}
rawtitle: {C} --- a Reference Manual
ISBN:
0-13-089592-X (paperback), 7-115-16188-7 (paperback) OR 013089592X (paperback), 7115161887 (paperback)

ISBN13:
978-0-13-089592-9 (paperback), 978-7-115-16188-8 (paperback) OR 9780130895929 (paperback), 9787115161888 (paperback)

abstract:
This reference manual provides a complete description of the C language, the run-time libraries, and a style of C programming that emphasises correctness, portability, and maintainability.

TOC:
Part 1: C Language 1: Introduction 2: Lexical Elements 3: C Preprocessor 4: Declarations 5: Types 6: Conversions and Representations 7: Expressions 8: Statements 9: Functions Part 2: C Libraries 10: Introduction to the Libraries 11: Standard Language Additions 12: Character Processing 13: String Processing 14: Memory Functions 15: Input/Output Facilities 16: General Utilities 17: Mathematical Functions 18: Time and Date Functions 19: Control Functions 20: Locale 21: Extended Integer Types 22: Floating-Point Environment 23: Complex Arithmetic 24: Wide and Multibyte Facilities A: ASCII Character Set B: Syntax C: Answers to the Exercises

rawabstract:
This reference manual provides a complete description of the C language, the run-time libraries, and a style of C programming that emphasises correctness, portability, and maintainability.

rawTOC:
Part 1: C Language \\ 1: Introduction \\ 2: Lexical Elements \\ 3: C Preprocessor \\ 4: Declarations \\ 5: Types \\ 6: Conversions and Representations \\ 7: Expressions \\ 8: Statements \\ 9: Functions \\ Part 2: C Libraries \\ 10: Introduction to the Libraries \\ 11: Standard Language Additions \\ 12: Character Processing \\ 13: String Processing \\ 14: Memory Functions \\ 15: Input/Output Facilities \\ 16: General Utilities \\ 17: Mathematical Functions \\ 18: Time and Date Functions \\ 19: Control Functions \\ 20: Locale \\ 21: Extended Integer Types \\ 22: Floating-Point Environment \\ 23: Complex Arithmetic \\ 24: Wide and Multibyte Facilities \\ A: ASCII Character Set \\ B: Syntax \\ C: Answers to the Exercises

entry:
@Book{Harbison:2002:CRM,
  author =       "Samuel P. {Harbison III} and Guy L. {Steele Jr.}",
  title =        "{C} --- a Reference Manual",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Fifth",
  pages =        "xviii + 533",
  year =         "2002",
  ISBN =         "0-13-089592-X (paperback), 7-115-16188-7 (paperback)",
  ISBN-13 =      "978-0-13-089592-9 (paperback), 978-7-115-16188-8
                 (paperback)",
  LCCN =         "QA76.73.C15 H38 2002",
  bibdate =      "Sat Mar 30 08:29:26 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$45.00",
  URL =          "http://www.CAReferenceManual.com/;
                 http://www.phptr.com/ptrbooks/ptr_013089592X.html",
  abstract =     "This reference manual provides a complete description
                 of the C language, the run-time libraries, and a style
                 of C programming that emphasises correctness,
                 portability, and maintainability.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Part 1: C Language \\
                 1: Introduction \\
                 2: Lexical Elements \\
                 3: C Preprocessor \\
                 4: Declarations \\
                 5: Types \\
                 6: Conversions and Representations \\
                 7: Expressions \\
                 8: Statements \\
                 9: Functions \\
                 Part 2: C Libraries \\
                 10: Introduction to the Libraries \\
                 11: Standard Language Additions \\
                 12: Character Processing \\
                 13: String Processing \\
                 14: Memory Functions \\
                 15: Input/Output Facilities \\
                 16: General Utilities \\
                 17: Mathematical Functions \\
                 18: Time and Date Functions \\
                 19: Control Functions \\
                 20: Locale \\
                 21: Extended Integer Types \\
                 22: Floating-Point Environment \\
                 23: Complex Arithmetic \\
                 24: Wide and Multibyte Facilities \\
                 A: ASCII Character Set \\
                 B: Syntax \\
                 C: Answers to the Exercises",
}


bibtype: book
filename: master.bib
label: Hardy:1940:MA
author: G. H. (Godfrey Harold) Hardy
title: A Mathematician's Apology
publisher: pub-CAMBRIDGE
address: pub-CAMBRIDGE:adr
pages: 153
year: 1940
DOI: https://doi.org/10.1017/CBO9781139644112
ISBN: 0-521-42706-1 OR 0521427061
ISBN13: 978-0-521-42706-7 OR 9780521427067
LCCN: QA7.H3 1992
bibdate: Wed Aug 14 06:24:50 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1996.08.14 06:24:50 ???
note: With a long foreword by C. P. Snow. Reprinted 1994.
acknowledgement: ack-nhfb
rawauthor: G. H. (Godfrey Harold) Hardy
rawnote: With a long foreword by C. P. Snow. Reprinted 1994.
rawtitle: A Mathematician's Apology
entry:
@Book{Hardy:1940:MA,
  author =       "G. H. (Godfrey Harold) Hardy",
  title =        "A Mathematician's Apology",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "153",
  year =         "1940",
  DOI =          "https://doi.org/10.1017/CBO9781139644112",
  ISBN =         "0-521-42706-1",
  ISBN-13 =      "978-0-521-42706-7",
  LCCN =         "QA7.H3 1992",
  bibdate =      "Wed Aug 14 06:24:50 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "With a long foreword by C. P. Snow. Reprinted 1994.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Harnwell:1933:EAP
author: G. P. (Gaylord Probasco) Harnwell and J. J. (John Jacob) Livingood
title: Experimental Atomic Physics
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
pages: xiii + 472
year: 1933
LCCN: QC173 .H38
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: G. P. (Gaylord Probasco) Harnwell and J. J. (John Jacob) Livingood
rawtitle: Experimental Atomic Physics
entry:
@Book{Harnwell:1933:EAP,
  author =       "G. P. (Gaylord Probasco) Harnwell and J. J. (John
                 Jacob) Livingood",
  title =        "Experimental Atomic Physics",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xiii + 472",
  year =         "1933",
  LCCN =         "QC173 .H38",
  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: Harold:1999:J
author: Elliotte Rusty Harold
title: Java I/O
publisher: pub-ORA
address: pub-ORA:adr
pages: xxvi + 568
year: 1999
ISBN: 1-56592-485-1 OR 1565924851
ISBN13: 978-1-56592-485-7 OR 9781565924857
LCCN: QA76.73.J38 H372 1999
bibdate: Wed Jul 07 07:31:19 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1999.07.07 07:31:19 ???
URL: http://metalab.unc.edu/javafaq/books/javaio/; http://www.oreilly.com/catalog/javaio/
acknowledgement: ack-nhfb
rawauthor: Elliotte Rusty Harold
rawtitle: {Java I/O}
entry:
@Book{Harold:1999:J,
  author =       "Elliotte Rusty Harold",
  title =        "{Java I/O}",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxvi + 568",
  year =         "1999",
  ISBN =         "1-56592-485-1",
  ISBN-13 =      "978-1-56592-485-7",
  LCCN =         "QA76.73.J38 H372 1999",
  bibdate =      "Wed Jul 07 07:31:19 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$32.95",
  URL =          "http://metalab.unc.edu/javafaq/books/javaio/;
                 http://www.oreilly.com/catalog/javaio/",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Harold:2004:XND
author: Elliotte Rusty Harold and W. Scott Means
title: XML in a Nutshell: [a Desktop Quick Reference]
publisher: pub-ORA
address: pub-ORA:adr
edition: Third
pages: xix + 689
year: 2004
ISBN: 0-596-00764-7 OR 0596007647
ISBN13: 978-0-596-00764-5 OR 9780596007645
LCCN: QA76.76.H94; Internet; QA76.76.H94 H36 2004eb; QA76.76.H94 H36 2004
bibdate: Fri Jun 30 15:37:25 MDT 2006
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; melvyl.cdlib.org:210/CDL90
bibtimestamp: 2006.06.30 15:37:25 MDT
series: In a nutshell
remark: Covers XML 1.1 and XInclude..
subject: XML (Document markup language)
acknowledgement: ack-nhfb
rawauthor: Elliotte Rusty Harold and W. Scott Means
rawtitle: {XML} in a Nutshell: [a Desktop Quick Reference]
abstract:
This third edition of the authoritative booktitle XML in a Nutshell provides developers with a comprehensive guide to the XML space. Serious users of XML will find coverage of just about everything they need, including syntax from Unicode characters to document structures, details of DTD and XML Schema creation, XSLT transformations, and APIs used for processing XML documents. Whether you're a web designer using XML to generate web pages and PDF files, or a C++ programmer using REST or SOAP to transmit data between systems, booktitle XML in a Nutshell thoroughly explains the basic rules that all XML documents --- and all XML documents --- and all XML document creators --- must follow.

TOC:
Part I. XML concepts Introducing XML XML fundamentals Document type definitions (DTDs) Namespaces Internationalization Part II. Narrative-like documents XML as a document format XML on the Web XSL transformations (XSLT) XPath XLinks XPointers XInclude Cascading Style Sheets (CSS) XSL formatting objects (XSL-FO) Resource directory description language (RDDL) Part III. Record-like documents XML as a data format XML schemas Programming models Document object model (DOM) Simple API for XML (SAX) Part IV. Reference XML reference Schemas reference XPath reference XSLT reference DOM reference SAX reference Character sets

rawabstract:
This third edition of the authoritative \booktitle{XML in a Nutshell} provides developers with a comprehensive guide to the XML space. Serious users of XML will find coverage of just about everything they need, including syntax from Unicode characters to document structures, details of DTD and XML Schema creation, XSLT transformations, and APIs used for processing XML documents. Whether you're a web designer using XML to generate web pages and PDF files, or a C++ programmer using REST or SOAP to transmit data between systems, \booktitle{XML in a Nutshell} thoroughly explains the basic rules that all XML documents --- and all XML documents --- and all XML document creators --- must follow.

rawTOC:
Part I. XML concepts \\ Introducing XML \\ XML fundamentals \\ Document type definitions (DTDs) \\ Namespaces \\ Internationalization \\ Part II. Narrative-like documents \\ XML as a document format \\ XML on the Web \\ XSL transformations (XSLT) \\ XPath \\ XLinks \\ XPointers \\ XInclude \\ Cascading Style Sheets (CSS) \\ XSL formatting objects (XSL-FO) \\ Resource directory description language (RDDL) \\ Part III. Record-like documents \\ XML as a data format \\ XML schemas \\ Programming models \\ Document object model (DOM) \\ Simple API for XML (SAX) \\ Part IV. Reference \\ XML reference \\ Schemas reference \\ XPath reference \\ XSLT reference \\ DOM reference \\ SAX reference \\ Character sets

entry:
@Book{Harold:2004:XND,
  author =       "Elliotte Rusty Harold and W. Scott Means",
  title =        "{XML} in a Nutshell: [a Desktop Quick Reference]",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  edition =      "Third",
  pages =        "xix + 689",
  year =         "2004",
  ISBN =         "0-596-00764-7",
  ISBN-13 =      "978-0-596-00764-5",
  LCCN =         "QA76.76.H94; Internet; QA76.76.H94 H36 2004eb;
                 QA76.76.H94 H36 2004",
  bibdate =      "Fri Jun 30 15:37:25 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  series =       "In a nutshell",
  abstract =     "This third edition of the authoritative \booktitle{XML
                 in a Nutshell} provides developers with a comprehensive
                 guide to the XML space. Serious users of XML will find
                 coverage of just about everything they need, including
                 syntax from Unicode characters to document structures,
                 details of DTD and XML Schema creation, XSLT
                 transformations, and APIs used for processing XML
                 documents. Whether you're a web designer using XML to
                 generate web pages and PDF files, or a C++ programmer
                 using REST or SOAP to transmit data between systems,
                 \booktitle{XML in a Nutshell} thoroughly explains the
                 basic rules that all XML documents --- and all XML
                 documents --- and all XML document creators --- must
                 follow.",
  acknowledgement = ack-nhfb,
  remark =       "Covers XML 1.1 and XInclude..",
  subject =      "XML (Document markup language)",
  tableofcontents = "Part I. XML concepts \\
                 Introducing XML \\
                 XML fundamentals \\
                 Document type definitions (DTDs) \\
                 Namespaces \\
                 Internationalization \\
                 Part II. Narrative-like documents \\
                 XML as a document format \\
                 XML on the Web \\
                 XSL transformations (XSLT) \\
                 XPath \\
                 XLinks \\
                 XPointers \\
                 XInclude \\
                 Cascading Style Sheets (CSS) \\
                 XSL formatting objects (XSL-FO) \\
                 Resource directory description language (RDDL) \\
                 Part III. Record-like documents \\
                 XML as a data format \\
                 XML schemas \\
                 Programming models \\
                 Document object model (DOM) \\
                 Simple API for XML (SAX) \\
                 Part IV. Reference \\
                 XML reference \\
                 Schemas reference \\
                 XPath reference \\
                 XSLT reference \\
                 DOM reference \\
                 SAX reference \\
                 Character sets",
}


bibtype: book
filename: master.bib
label: Harrington:1983:CGP
author: Steven Harrington
title: Computer Graphics: a Programming Approach
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
pages: xv + 448
year: 1983
ISBN: 0-07-026751-0 OR 0070267510
ISBN13: 978-0-07-026751-0 OR 9780070267510
LCCN: T385 .H34 1983
bibdate: Tue Dec 14 23:42:22 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 23:42:22 ???
acknowledgement: ack-nhfb
rawauthor: Steven Harrington
rawtitle: Computer Graphics: a Programming Approach
TOC:
Geometry and line generation Graphics primitives Polygons Transformations Segments Windowing and clipping Interaction Three dimensions Three-dimensional clipping Hidden surfaces and lines Shading Curves Appendixes Index

rawTOC:
Geometry and line generation \\ Graphics primitives \\ Polygons \\ Transformations \\ Segments \\ Windowing and clipping \\ Interaction \\ Three dimensions \\ Three-dimensional clipping \\ Hidden surfaces and lines \\ Shading \\ Curves \\ Appendixes \\ Index

entry:
@Book{Harrington:1983:CGP,
  author =       "Steven Harrington",
  title =        "Computer Graphics: a Programming Approach",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xv + 448",
  year =         "1983",
  ISBN =         "0-07-026751-0",
  ISBN-13 =      "978-0-07-026751-0",
  LCCN =         "T385 .H34 1983",
  bibdate =      "Tue Dec 14 23:42:22 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$21.95",
  acknowledgement = ack-nhfb,
  tableofcontents = "Geometry and line generation \\
                 Graphics primitives \\
                 Polygons \\
                 Transformations \\
                 Segments \\
                 Windowing and clipping \\
                 Interaction \\
                 Three dimensions \\
                 Three-dimensional clipping \\
                 Hidden surfaces and lines \\
                 Shading \\
                 Curves \\
                 Appendixes \\
                 Index",
}


bibtype: book
filename: master.bib
label: Harrington:1987:CGP
author: Steven Harrington
title: Computer Graphics: A Programming Approach
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
edition: Second
pages: xiv + 466
year: 1987
ISBN: 0-07-026753-7 OR 0070267537
ISBN13: 978-0-07-026753-4 OR 9780070267534
LCCN: T385 .H34 1987
bibdate: Tue Dec 14 22:55:04 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:55:04 ???
acknowledgement: ack-nhfb
rawauthor: Steven Harrington
rawtitle: Computer Graphics: {A} Programming Approach
entry:
@Book{Harrington:1987:CGP,
  author =       "Steven Harrington",
  title =        "Computer Graphics: {A} Programming Approach",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Second",
  pages =        "xiv + 466",
  year =         "1987",
  ISBN =         "0-07-026753-7",
  ISBN-13 =      "978-0-07-026753-4",
  LCCN =         "T385 .H34 1987",
  bibdate =      "Tue Dec 14 22:55:04 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$38.95",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Harris:1988:RT
author: Errol E. Harris
title: The reality of time
publisher: State University of New York Press
address: Albany, NY, USA
pages: xii + 204
year: 1988
ISBN: 0-88706-860-X, 0-88706-861-8 (paperback) OR 088706860X, 0887068618 (paperback)
ISBN13: 978-0-88706-860-7, 978-0-88706-861-4 (paperback) OR 9780887068607, 9780887068614 (paperback)
LCCN: BD638 .H277 1988
bibdate: Tue Dec 11 18:22:10 MST 2012
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2012.12.11 18:22:10 MST
series: SUNY series in philosophy
subject: Time
acknowledgement: ack-nhfb
rawauthor: Errol E. Harris
rawtitle: The reality of time
remark:
An expanded version of the Gilbert Ryle lectures, delivered at Trent University, Peterborough, Ontario, in Canada, in 1984.

TOC:
Introduction: the nature and vindication of metaphysics Metaphysical problems of time Physical time Biological time Psychological time Historical time Dialectic in history Evolution and Omega

rawTOC:
Introduction: the nature and vindication of metaphysics \\ Metaphysical problems of time \\ Physical time \\ Biological time \\ Psychological time \\ Historical time \\ Dialectic in history \\ Evolution and Omega

entry:
@Book{Harris:1988:RT,
  author =       "Errol E. Harris",
  title =        "The reality of time",
  publisher =    "State University of New York Press",
  address =      "Albany, NY, USA",
  pages =        "xii + 204",
  year =         "1988",
  ISBN =         "0-88706-860-X, 0-88706-861-8 (paperback)",
  ISBN-13 =      "978-0-88706-860-7, 978-0-88706-861-4 (paperback)",
  LCCN =         "BD638 .H277 1988",
  bibdate =      "Tue Dec 11 18:22:10 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "SUNY series in philosophy",
  acknowledgement = ack-nhfb,
  remark =       "An expanded version of the Gilbert Ryle lectures,
                 delivered at Trent University, Peterborough, Ontario,
                 in Canada, in 1984.",
  subject =      "Time",
  tableofcontents = "Introduction: the nature and vindication of
                 metaphysics \\
                 Metaphysical problems of time \\
                 Physical time \\
                 Biological time \\
                 Psychological time \\
                 Historical time \\
                 Dialectic in history \\
                 Evolution and Omega",
}


bibtype: book
filename: master.bib
label: Harris:1992:DCM
author: Kent Harris
title: Discovering Calculus with Maple
publisher: pub-WILEY
address: pub-WILEY:adr
pages: 192
year: 1992
ISBN: 0-471-55156-2 OR 0471551562
ISBN13: 978-0-471-55156-0 OR 9780471551560
LCCN: QA303.5.D37 H37 1992
bibdate: Tue Dec 14 22:55:05 1993
bibtimestamp: 1993.12.14 22:55:05 ???
acknowledgement: ack-nhfb
rawauthor: Kent Harris
rawtitle: Discovering Calculus with {Maple}
bibsource:
https://www.math.utah.edu/pub/tex/bib/maple-extract.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
This substantially illustrated manual describes how to use Maple as an investigative tool to explore calculus concepts numerically, graphically, symbolically and verbally. Every chapter begins with Maple commands employed in the chapter, an introduction to the mathematical concepts being covered, worked examples in Maple worksheet format, followed by thought-provoking exercises and extensive discovery projects to encourage readers to investigate ideas on their own.

TOC:
Getting Started Functions and Limits Differentiation Applications of the Derivative Integration Applications of the Definite Integral Logarithmic and Exponential Functions Inverse Trigonometric and Hyperbolic Functions Integration Exact and Approximate Improper Integrals: Sequences and Infinite Series Analytic Geometry Polar Coordinates and Parametric Equations Vectors and Three Dimensional Space Vector Functions Partial Derivatives Multiple Integrals Topics in Vector Calculus Second-Order Differential Equations References Index

rawabstract:
This substantially illustrated manual describes how to use Maple as an investigative tool to explore calculus concepts numerically, graphically, symbolically and verbally. Every chapter begins with Maple commands employed in the chapter, an introduction to the mathematical concepts being covered, worked examples in Maple worksheet format, followed by thought-provoking exercises and extensive discovery projects to encourage readers to investigate ideas on their own.

rawTOC:
Getting Started \\ Functions and Limits \\ Differentiation \\ Applications of the Derivative \\ Integration \\ Applications of the Definite Integral \\ Logarithmic and Exponential Functions \\ Inverse Trigonometric and Hyperbolic Functions \\ Integration Exact and Approximate \\ Improper Integrals: Sequences and Infinite Series \\ Analytic Geometry \\ Polar Coordinates and Parametric Equations \\ Vectors and Three Dimensional Space \\ Vector Functions \\ Partial Derivatives \\ Multiple Integrals \\ Topics in Vector Calculus \\ Second-Order Differential Equations \\ References \\ Index

entry:
@Book{Harris:1992:DCM,
  author =       "Kent Harris",
  title =        "Discovering Calculus with {Maple}",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "192",
  year =         "1992",
  ISBN =         "0-471-55156-2",
  ISBN-13 =      "978-0-471-55156-0",
  LCCN =         "QA303.5.D37 H37 1992",
  bibdate =      "Tue Dec 14 22:55:05 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "This substantially illustrated manual describes how to
                 use Maple as an investigative tool to explore calculus
                 concepts numerically, graphically, symbolically and
                 verbally. Every chapter begins with Maple commands
                 employed in the chapter, an introduction to the
                 mathematical concepts being covered, worked examples in
                 Maple worksheet format, followed by thought-provoking
                 exercises and extensive discovery projects to encourage
                 readers to investigate ideas on their own.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "Getting Started \\
                 Functions and Limits \\
                 Differentiation \\
                 Applications of the Derivative \\
                 Integration \\
                 Applications of the Definite Integral \\
                 Logarithmic and Exponential Functions \\
                 Inverse Trigonometric and Hyperbolic Functions \\
                 Integration Exact and Approximate \\
                 Improper Integrals: Sequences and Infinite Series \\
                 Analytic Geometry \\
                 Polar Coordinates and Parametric Equations \\
                 Vectors and Three Dimensional Space \\
                 Vector Functions \\
                 Partial Derivatives \\
                 Multiple Integrals \\
                 Topics in Vector Calculus \\
                 Second-Order Differential Equations \\
                 References \\
                 Index",
}


bibtype: book
filename: master.bib
label: Harris:2007:DDC
author: David Money Harris and Sarah L. Harris
title: Digital Design and Computer Architecture
publisher: pub-MORGAN-KAUFMANN
address: pub-MORGAN-KAUFMANN:adr
pages: xxii + 569
year: 2007
ISBN: 0-12-370497-9 OR 0123704979
ISBN13: 978-0-12-370497-9 OR 9780123704979
LCCN: TK7868.D5 H34 2007
bibdate: Mon Oct 26 09:53:53 MDT 2009
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2009.10.26 09:53:53 MDT
subject: Digital electronics; Logic design; Computer architecture
acknowledgement: ack-nhfb
rawauthor: David Money Harris and Sarah L. Harris
rawtitle: Digital Design and Computer Architecture
URL:
http://www.loc.gov/catdir/enhancements/fy0703/2006030554-d.html; http://www.loc.gov/catdir/toc/ecip071/2006030554.html

TOC:
In Praise of Digital Design and Computer Architecture About the Authors Title page Copyright page Table of contents Preface 1: From zero to one 2: Combinational logic design 3: Sequential logic design 4: Hardware description languages 5: Digital building blocks 6: Architecture 7: Microarchitecture 8: Memory systems Appendix A: Digital system implementation Appendix B: MIPS instructions Further Reading Index

rawTOC:
In Praise of Digital Design and Computer Architecture \\ About the Authors \\ Title page \\ Copyright page \\ Table of contents \\ Preface \\ 1: From zero to one \\ 2: Combinational logic design \\ 3: Sequential logic design \\ 4: Hardware description languages \\ 5: Digital building blocks \\ 6: Architecture \\ 7: Microarchitecture \\ 8: Memory systems \\ Appendix A: Digital system implementation \\ Appendix B: MIPS instructions \\ Further Reading \\ Index

entry:
@Book{Harris:2007:DDC,
  author =       "David Money Harris and Sarah L. Harris",
  title =        "Digital Design and Computer Architecture",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  pages =        "xxii + 569",
  year =         "2007",
  ISBN =         "0-12-370497-9",
  ISBN-13 =      "978-0-12-370497-9",
  LCCN =         "TK7868.D5 H34 2007",
  bibdate =      "Mon Oct 26 09:53:53 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0703/2006030554-d.html;
                 http://www.loc.gov/catdir/toc/ecip071/2006030554.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Digital electronics; Logic design; Computer
                 architecture",
  tableofcontents = "In Praise of Digital Design and Computer
                 Architecture \\
                 About the Authors \\
                 Title page \\
                 Copyright page \\
                 Table of contents \\
                 Preface \\
                 1: From zero to one \\
                 2: Combinational logic design \\
                 3: Sequential logic design \\
                 4: Hardware description languages \\
                 5: Digital building blocks \\
                 6: Architecture \\
                 7: Microarchitecture \\
                 8: Memory systems \\
                 Appendix A: Digital system implementation \\
                 Appendix B: MIPS instructions \\
                 Further Reading \\
                 Index",
}


bibtype: book
filename: master.bib
label: Harrison:1998:ETT
author: Mark Harrison and Michael McLennan
title: Effective Tcl / Tk Programming: Writing Better Programs with Tcl and Tk
publisher: pub-AW
address: pub-AW:adr
pages: xv + 405
year: 1998
ISBN: 0-201-63474-0 OR 0201634740
ISBN13: 978-0-201-63474-7 OR 9780201634747
LCCN: QA76.73.T44H37 1998
bibdate: Fri Dec 19 10:57:35 1997
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1997.12.19 10:57:35 ???
acknowledgement: ack-nhfb
rawauthor: Mark Harrison and Michael McLennan
rawtitle: Effective {Tcl\slash Tk} Programming: Writing Better Programs with {Tcl} and {Tk}
abstract:
You need a graphical user interface, and it needs to run on multiple platforms. You don't have much time, and you're not a wizard with X/Motif, the Win32 GUI, or the Mac GUI. The project seems impossible, but with Tcl/Tk it's simple and fun. Throughout the book the authors develop numerous applications and a library of reusable components. Learn from their approach, follow their strategies, and steal their code for your own applications! But don't bother retyping all the examples. You can download all the source code at the Effective Tcl/Tk Programming Web site: http://www.awl.com/cseng/books/efftcl.

TOC:
1: Building Tcl/Tk Applications 2: Packing, Gridding, and Placing Windows 3: Handling Events 4: Using the Canvas Widget 5: Using the Text Widget 6: Top-level Windows 7: Interacting with Other Programs 8: Delivering Tcl/Tk Applications 9: Developing Cross-platform Applications Appendix A: Getting Started with Tcl/Tk

rawabstract:
You need a graphical user interface, and it needs to run on multiple platforms. You don't have much time, and you're not a wizard with X/Motif, the Win32 GUI, or the Mac GUI. The project seems impossible, but with Tcl/Tk it's simple and fun. Throughout the book the authors develop numerous applications and a library of reusable components. Learn from their approach, follow their strategies, and steal their code for your own applications! But don't bother retyping all the examples. You can download all the source code at the Effective Tcl/Tk Programming Web site: http://www.awl.com/cseng/books/efftcl.

rawTOC:
1: Building Tcl/Tk Applications \\ 2: Packing, Gridding, and Placing Windows \\ 3: Handling Events \\ 4: Using the Canvas Widget \\ 5: Using the Text Widget \\ 6: Top-level Windows \\ 7: Interacting with Other Programs \\ 8: Delivering Tcl/Tk Applications \\ 9: Developing Cross-platform Applications \\ Appendix A: Getting Started with Tcl/Tk

entry:
@Book{Harrison:1998:ETT,
  author =       "Mark Harrison and Michael McLennan",
  title =        "Effective {Tcl\slash Tk} Programming: Writing Better
                 Programs with {Tcl} and {Tk}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xv + 405",
  year =         "1998",
  ISBN =         "0-201-63474-0",
  ISBN-13 =      "978-0-201-63474-7",
  LCCN =         "QA76.73.T44H37 1998",
  bibdate =      "Fri Dec 19 10:57:35 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$38.50",
  abstract =     "You need a graphical user interface, and it needs to
                 run on multiple platforms. You don't have much time,
                 and you're not a wizard with X/Motif, the Win32 GUI, or
                 the Mac GUI. The project seems impossible, but with
                 Tcl/Tk it's simple and fun. Throughout the book the
                 authors develop numerous applications and a library of
                 reusable components. Learn from their approach, follow
                 their strategies, and steal their code for your own
                 applications! But don't bother retyping all the
                 examples. You can download all the source code at the
                 Effective Tcl/Tk Programming Web site:
                 http://www.awl.com/cseng/books/efftcl.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Building Tcl/Tk Applications \\
                 2: Packing, Gridding, and Placing Windows \\
                 3: Handling Events \\
                 4: Using the Canvas Widget \\
                 5: Using the Text Widget \\
                 6: Top-level Windows \\
                 7: Interacting with Other Programs \\
                 8: Delivering Tcl/Tk Applications \\
                 9: Developing Cross-platform Applications \\
                 Appendix A: Getting Started with Tcl/Tk",
}


bibtype: book
filename: master.bib
label: Harrison:2000:AQM
author: Walter A. (Walter Ashley) Harrison
title: Applied Quantum Mechanics
publisher: pub-WORLD-SCI
address: pub-WORLD-SCI:adr
pages: xvi + 353
year: 2000
DOI: https://doi.org/10.1142/4485
LCCN: QC174.12 .H377 2000
bibdate: Fri Nov 28 14:05:09 MST 2014
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2014.11.28 14:05:09 MST
URL: http://www.worldscientific.com/worldscibooks/10.1142/4485
acknowledgement: ack-nhfb
authordates: 1930--
rawauthor: Walter A. (Walter Ashley) Harrison
rawtitle: Applied Quantum Mechanics
ISBN:
981-02-4375-8 (hardcover), 981-02-4394-4 (paperback) OR 9810243758 (hardcover), 9810243944 (paperback)

ISBN13:
978-981-02-4375-3 (hardcover), 978-981-02-4394-4 (paperback) OR 9789810243753 (hardcover), 9789810243944 (paperback)

abstract:
The book covers those parts of quantum theory which may be necessary for a modern engineer. It focuses on the approximations and concepts which allow estimates of the entire range of properties of nuclei, atoms, molecules, and solids, as well as the behavior of lasers and other quantum-optic devices. It may well prove useful also to graduate students in physics, whose courses on quantum theory tend not to include any of these applications. The material has been the basis of a course taught to graduate engineering students for the past four years at Stanford University.

subject:
Quantum theory; Theorie quantique; Kwantummechanica.; Mecanica quantica.; Quantenmechanik.; Kwantummechanica; Mecanica quantica; Quantenmechanik.; Quantenphysik.; Quantum theory.

TOC:
Summary Author Biography Table of Contents I. The Basic Approach 1: Foundations 1.1: The Premise / 2 1.2: Schroedinger's Equation / 3 1.3: Light waves / 9 1.4: New Meaning for Potentials / 10 1.5: Measurement / 12 1.6: Eigenstates / 13 1.7: Boundary conditions / 16 1.8: Sound Waves / 17 2: Simple Cases 2.1: Free Electrons in One Dimension / 19 2.2: Free Electron in Three Dimensions / 21 2.3: Quantum Slabs, Wires, and Dots / 24 2.4: Circularly and Spherically-Symmetric Systems / 31 2.5: The Harmonic Oscillator / 39 3: Hamiltonian Mechanics 3.1: The Lagrangian / 45 3.2: Hamilton's Equations / 46 3.3: Including the Vector Potential / 48 II. Electronic Structure 4: Atoms 4.1: The Hydrogen Atom / 53 4.2: Many-Electron Atoms / 56 4.3: Pseudopotentials / 62 4.4: Nuclear Structure / 65 5: Molecules 5.1: The Li$_2$ Molecule / 69 5.2: The Variational Method / 73 5.3: Molecular Orbitals / 68 5.4: Perturbation Theory / 79 5.5: N$_2$, CO, and CO$_2$ / 81 6: Crystals 6.1: The Linear Chain / 88 6.2: Free-Electron Bands and Tight-Binding Parameters / 92 6.3: Metallic, Ionic, and Covalent Solids / 98 III. Time Dependence 7: Transitions 7.1: A Pair of Coupled States / 105 7.2: Fermi's Golden Rule / 106 7.3: Scattering in One and Three Dimensions / 109 8: Tunneling 8.1: Transmission in a 1-D Chain / 112 8.2: More General Barriers / 115 8.3: Tunneling Systems / 120 8.4: Tunneling Resonance / 121 9: Transition Rates 9.1: Second-Order Coupling / 125 9.2: Carrier Emission and Capture / 128 9.3: Time-Dependent Perturbations / 128 9.4: Optical Transitions / 130 9.5: Beta-Ray Emission from Nuclei / 135 IV. Statistical Physics 10: Statistical Mechanics 10.1: Distribution Functions / 140 10.2: Phonon and Photon Statistics / 145 10.3: Bosons / 147 10.4: Symmetry Under Interchange / 149 10.5: Fermions / 153 11: Transport Theory 11.1: Time-Dependent Distributions / 158 11.2: The Boltzmann Equation / 159 11.3: Conductivity, etc. / 162 12: Noise 12.1: Classical Noise / 164 12.2: Quantum Noise and van-der-Waals Interaction / 165 12.3: Shot Noise / 167 12.4: Other Sources / 170 V. Electrons and Phonons 13: Energy Bands 13.1: The Empty-Core Pseudopotential / 174 13.2: A Band Calculation / 178 13.3: Diffraction / 184 13.4: Scattering by Impurities / 185 13.5: Semiconductor Energy Bands / 186 14: Electron Dynamics 14.1: Dynamics of Packets / 189 14.2: Effective Masses and Donor States / 192 14.3: The Dynamics of Holes / 194 15: Lattice Vibrations 15.1: The Spectrum / 197 15.2: The Classical-Vibration Hamiltonian / 201 15.3: The Electron-Phonon Interaction / 203 VI. Quantum Optics 16: Operators 16.1: Annihilation and Creation Operators for Electrons / 207 16.2: Stepping Operators / 212 16.3: Angular Momentum / 216 17: Phonons 17.1: Annihilation and Creation Operators for Phonons / 220 17.2: Phonon Emission and Absorption / 223 17.3: Polaron Self-Energy / 225 17.4: Electron-Electron and Nucleon-Nucleon Interactions / 228 18: Photons 18.1: Photons and the Electron-Photon Interaction / 232 18.2: Excitation of Atoms / 235 18.3: The Three-Level Laser / 239 18.4: Interband Transitions / 241 19: Coherent States 19.1: Coherence in a Harmonic Oscillator / 247 19.2: A Driven Classical Oscillator / 249 19.3: A Driven Quantum Oscillator / 251 19.4: Coherent Light / 254 19.5: Electromagnetically-Induced Transparency / 256 VII. Many-Body Effects 20: Coulomb Effects 20.1: Coulomb Shifts / 260 20.2: Screening / 263 21: Cooperative Phenomena 21.1: Localization and Symmetry Breaking / 270 21.2: The Hubbard Hamiltonian / 275 21.3: Peierls Distortions / 281 21.4: Superconductivity / 282 22: Magnetism 22.1: Free Electrons in a Magnetic Field / 287 22.2: Magnetism of Atoms / 292 22.3: Magnetic Susceptibility / 295 22.4: Ferromagnetism / 298 22.5: Spin-Orbit Coupling / 301 23: Shake-Off Excitations 23.1: Adiabatic and Sudden Approximations / 306 23.2: Vibrational Excitations / 309 23.3: Electronic and Auger processes / 315 23.4: Inelastic Processes / 316 Epilogue / 322 Exercises / 323 References / 343 Subject Index / 345

rawabstract:
The book covers those parts of quantum theory which may be necessary for a modern engineer. It focuses on the approximations and concepts which allow estimates of the entire range of properties of nuclei, atoms, molecules, and solids, as well as the behavior of lasers and other quantum-optic devices. It may well prove useful also to graduate students in physics, whose courses on quantum theory tend not to include any of these applications. The material has been the basis of a course taught to graduate engineering students for the past four years at Stanford University.

shortTOC:
I. The Basic Approach 1: Foundations / 2 2: Simple cases / 19 3: Hamiltonian mechanics / 45 II. Electronic Structure 4: Atoms / 53 5: Molecules / 69 6: Crystals / 88 III. Time Dependence 7: Transitions / 105 8: Tunneling / 112 9: Transition rates / 125 IV. Statistical Physics 10: Statistical mechanics / 140 11: Transport theory / 158 12: Noise / 164 V. Electrons and Phonons 13: Energy bands / 174 14: Electron dynamics / 189 15: Lattice vibrations / 197 VI. Quantum Optics 16: Operators / 207 17: Phonons / 220 18: Photons / 232 19: Coherent states / 247 VII. Many-Body Effects 20: Coulomb effects / 260 21: Comparative phenomena / 270 22: Magnetism / 287 23: Shake-off excitations / 306 Epilog / 322 Exercises / 323 References / 343 Subject Index / 345

rawshortTOC:
I. The Basic Approach \\ 1: Foundations / 2 \\ 2: Simple cases / 19 \\ 3: Hamiltonian mechanics / 45 \\ II. Electronic Structure \\ 4: Atoms / 53 \\ 5: Molecules / 69 \\ 6: Crystals / 88 \\ III. Time Dependence \\ 7: Transitions / 105 \\ 8: Tunneling / 112 \\ 9: Transition rates / 125 \\ IV. Statistical Physics \\ 10: Statistical mechanics / 140 \\ 11: Transport theory / 158 \\ 12: Noise / 164 \\ V. Electrons and Phonons \\ 13: Energy bands / 174 \\ 14: Electron dynamics / 189 \\ 15: Lattice vibrations / 197 \\ VI. Quantum Optics \\ 16: Operators / 207 \\ 17: Phonons / 220 \\ 18: Photons / 232 \\ 19: Coherent states / 247 \\ VII. Many-Body Effects \\ 20: Coulomb effects / 260 \\ 21: Comparative phenomena / 270 \\ 22: Magnetism / 287 \\ 23: Shake-off excitations / 306 \\ Epilog / 322 \\ Exercises / 323 \\ References / 343 \\ Subject Index / 345

rawTOC:
Summary \\ Author Biography \\ Table of Contents \\ I. The Basic Approach \\ 1: Foundations \\ 1.1: The Premise / 2 \\ 1.2: Schroedinger's Equation / 3 \\ 1.3: Light waves / 9 \\ 1.4: New Meaning for Potentials / 10 \\ 1.5: Measurement / 12 \\ 1.6: Eigenstates / 13 \\ 1.7: Boundary conditions / 16 \\ 1.8: Sound Waves / 17 \\ 2: Simple Cases \\ 2.1: Free Electrons in One Dimension / 19 \\ 2.2: Free Electron in Three Dimensions / 21 \\ 2.3: Quantum Slabs, Wires, and Dots / 24 \\ 2.4: Circularly and Spherically-Symmetric Systems / 31 \\ 2.5: The Harmonic Oscillator / 39 \\ 3: Hamiltonian Mechanics \\ 3.1: The Lagrangian / 45 \\ 3.2: Hamilton's Equations / 46 \\ 3.3: Including the Vector Potential / 48 \\ II. Electronic Structure \\ 4: Atoms \\ 4.1: The Hydrogen Atom / 53 \\ 4.2: Many-Electron Atoms / 56 \\ 4.3: Pseudopotentials / 62 \\ 4.4: Nuclear Structure / 65 \\ 5: Molecules \\ 5.1: The Li$_2$ Molecule / 69 \\ 5.2: The Variational Method / 73 \\ 5.3: Molecular Orbitals / 68 \\ 5.4: Perturbation Theory / 79 \\ 5.5: N$_2$, CO, and CO$_2$ / 81 \\ 6: Crystals \\ 6.1: The Linear Chain / 88 \\ 6.2: Free-Electron Bands and Tight-Binding Parameters / 92 \\ 6.3: Metallic, Ionic, and Covalent Solids / 98 \\ III. Time Dependence \\ 7: Transitions \\ 7.1: A Pair of Coupled States / 105 \\ 7.2: Fermi's Golden Rule / 106 \\ 7.3: Scattering in One and Three Dimensions / 109 \\ 8: Tunneling \\ 8.1: Transmission in a 1-D Chain / 112 \\ 8.2: More General Barriers / 115 \\ 8.3: Tunneling Systems / 120 \\ 8.4: Tunneling Resonance / 121 \\ 9: Transition Rates \\ 9.1: Second-Order Coupling / 125 \\ 9.2: Carrier Emission and Capture / 128 \\ 9.3: Time-Dependent Perturbations / 128 \\ 9.4: Optical Transitions / 130 \\ 9.5: Beta-Ray Emission from Nuclei / 135 \\ IV. Statistical Physics \\ 10: Statistical Mechanics \\ 10.1: Distribution Functions / 140 \\ 10.2: Phonon and Photon Statistics / 145 \\ 10.3: Bosons / 147 \\ 10.4: Symmetry Under Interchange / 149 \\ 10.5: Fermions / 153 \\ 11: Transport Theory \\ 11.1: Time-Dependent Distributions / 158 \\ 11.2: The Boltzmann Equation / 159 \\ 11.3: Conductivity, etc. / 162 \\ 12: Noise \\ 12.1: Classical Noise / 164 \\ 12.2: Quantum Noise and van-der-Waals Interaction / 165 \\ 12.3: Shot Noise / 167 \\ 12.4: Other Sources / 170 \\ V. Electrons and Phonons \\ 13: Energy Bands \\ 13.1: The Empty-Core Pseudopotential / 174 \\ 13.2: A Band Calculation / 178 \\ 13.3: Diffraction / 184 \\ 13.4: Scattering by Impurities / 185 \\ 13.5: Semiconductor Energy Bands / 186 \\ 14: Electron Dynamics \\ 14.1: Dynamics of Packets / 189 \\ 14.2: Effective Masses and Donor States / 192 \\ 14.3: The Dynamics of Holes / 194 \\ 15: Lattice Vibrations \\ 15.1: The Spectrum / 197 \\ 15.2: The Classical-Vibration Hamiltonian / 201 \\ 15.3: The Electron-Phonon Interaction / 203 \\ VI. Quantum Optics \\ 16: Operators \\ 16.1: Annihilation and Creation Operators for Electrons / 207 \\ 16.2: Stepping Operators / 212 \\ 16.3: Angular Momentum / 216 \\ 17: Phonons \\ 17.1: Annihilation and Creation Operators for Phonons / 220 \\ 17.2: Phonon Emission and Absorption / 223 \\ 17.3: Polaron Self-Energy / 225 \\ 17.4: Electron-Electron and Nucleon-Nucleon Interactions / 228 \\ 18: Photons \\ 18.1: Photons and the Electron-Photon Interaction / 232 \\ 18.2: Excitation of Atoms / 235 \\ 18.3: The Three-Level Laser / 239 \\ 18.4: Interband Transitions / 241 \\ 19: Coherent States \\ 19.1: Coherence in a Harmonic Oscillator / 247 \\ 19.2: A Driven Classical Oscillator / 249 \\ 19.3: A Driven Quantum Oscillator / 251 \\ 19.4: Coherent Light / 254 \\ 19.5: Electromagnetically-Induced Transparency / 256 \\ VII. Many-Body Effects \\ 20: Coulomb Effects \\ 20.1: Coulomb Shifts / 260 \\ 20.2: Screening / 263 \\ 21: Cooperative Phenomena \\ 21.1: Localization and Symmetry Breaking / 270 \\ 21.2: The Hubbard Hamiltonian / 275 \\ 21.3: Peierls Distortions / 281 \\ 21.4: Superconductivity / 282 \\ 22: Magnetism \\ 22.1: Free Electrons in a Magnetic Field / 287 \\ 22.2: Magnetism of Atoms / 292 \\ 22.3: Magnetic Susceptibility / 295 \\ 22.4: Ferromagnetism / 298 \\ 22.5: Spin-Orbit Coupling / 301 \\ 23: Shake-Off Excitations \\ 23.1: Adiabatic and Sudden Approximations / 306 \\ 23.2: Vibrational Excitations / 309 \\ 23.3: Electronic and Auger processes / 315 \\ 23.4: Inelastic Processes / 316 \\ Epilogue / 322 \\ Exercises / 323 \\ References / 343 \\ Subject Index / 345

entry:
@Book{Harrison:2000:AQM,
  author =       "Walter A. (Walter Ashley) Harrison",
  title =        "Applied Quantum Mechanics",
  publisher =    pub-WORLD-SCI,
  address =      pub-WORLD-SCI:adr,
  pages =        "xvi + 353",
  year =         "2000",
  DOI =          "https://doi.org/10.1142/4485",
  ISBN =         "981-02-4375-8 (hardcover), 981-02-4394-4 (paperback)",
  ISBN-13 =      "978-981-02-4375-3 (hardcover), 978-981-02-4394-4
                 (paperback)",
  LCCN =         "QC174.12 .H377 2000",
  bibdate =      "Fri Nov 28 14:05:09 MST 2014",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://www.worldscientific.com/worldscibooks/10.1142/4485",
  abstract =     "The book covers those parts of quantum theory which
                 may be necessary for a modern engineer. It focuses on
                 the approximations and concepts which allow estimates
                 of the entire range of properties of nuclei, atoms,
                 molecules, and solids, as well as the behavior of
                 lasers and other quantum-optic devices. It may well
                 prove useful also to graduate students in physics,
                 whose courses on quantum theory tend not to include any
                 of these applications. The material has been the basis
                 of a course taught to graduate engineering students for
                 the past four years at Stanford University.",
  acknowledgement = ack-nhfb,
  author-dates = "1930--",
  libnote =      "Not yet in my library.",
  shorttableofcontents = "I. The Basic Approach \\
                 1: Foundations / 2 \\
                 2: Simple cases / 19 \\
                 3: Hamiltonian mechanics / 45 \\
                 II. Electronic Structure \\
                 4: Atoms / 53 \\
                 5: Molecules / 69 \\
                 6: Crystals / 88 \\
                 III. Time Dependence \\
                 7: Transitions / 105 \\
                 8: Tunneling / 112 \\
                 9: Transition rates / 125 \\
                 IV. Statistical Physics \\
                 10: Statistical mechanics / 140 \\
                 11: Transport theory / 158 \\
                 12: Noise / 164 \\
                 V. Electrons and Phonons \\
                 13: Energy bands / 174 \\
                 14: Electron dynamics / 189 \\
                 15: Lattice vibrations / 197 \\
                 VI. Quantum Optics \\
                 16: Operators / 207 \\
                 17: Phonons / 220 \\
                 18: Photons / 232 \\
                 19: Coherent states / 247 \\
                 VII. Many-Body Effects \\
                 20: Coulomb effects / 260 \\
                 21: Comparative phenomena / 270 \\
                 22: Magnetism / 287 \\
                 23: Shake-off excitations / 306 \\
                 Epilog / 322 \\
                 Exercises / 323 \\
                 References / 343 \\
                 Subject Index / 345",
  subject =      "Quantum theory; Th{\'e}orie quantique;
                 Kwantummechanica.; Mec{\^a}nica qu{\^a}ntica.;
                 Quantenmechanik.; Kwantummechanica; Mec{\^a}nica
                 qu{\^a}ntica; Quantenmechanik.; Quantenphysik.; Quantum
                 theory.",
  tableofcontents = "Summary \\
                 Author Biography \\
                 Table of Contents \\
                 I. The Basic Approach \\
                 1: Foundations \\
                 1.1: The Premise / 2 \\
                 1.2: Schroedinger's Equation / 3 \\
                 1.3: Light waves / 9 \\
                 1.4: New Meaning for Potentials / 10 \\
                 1.5: Measurement / 12 \\
                 1.6: Eigenstates / 13 \\
                 1.7: Boundary conditions / 16 \\
                 1.8: Sound Waves / 17 \\
                 2: Simple Cases \\
                 2.1: Free Electrons in One Dimension / 19 \\
                 2.2: Free Electron in Three Dimensions / 21 \\
                 2.3: Quantum Slabs, Wires, and Dots / 24 \\
                 2.4: Circularly and Spherically-Symmetric Systems / 31
                 \\
                 2.5: The Harmonic Oscillator / 39 \\
                 3: Hamiltonian Mechanics \\
                 3.1: The Lagrangian / 45 \\
                 3.2: Hamilton's Equations / 46 \\
                 3.3: Including the Vector Potential / 48 \\
                 II. Electronic Structure \\
                 4: Atoms \\
                 4.1: The Hydrogen Atom / 53 \\
                 4.2: Many-Electron Atoms / 56 \\
                 4.3: Pseudopotentials / 62 \\
                 4.4: Nuclear Structure / 65 \\
                 5: Molecules \\
                 5.1: The Li$_2$ Molecule / 69 \\
                 5.2: The Variational Method / 73 \\
                 5.3: Molecular Orbitals / 68 \\
                 5.4: Perturbation Theory / 79 \\
                 5.5: N$_2$, CO, and CO$_2$ / 81 \\
                 6: Crystals \\
                 6.1: The Linear Chain / 88 \\
                 6.2: Free-Electron Bands and Tight-Binding Parameters /
                 92 \\
                 6.3: Metallic, Ionic, and Covalent Solids / 98 \\
                 III. Time Dependence \\
                 7: Transitions \\
                 7.1: A Pair of Coupled States / 105 \\
                 7.2: Fermi's Golden Rule / 106 \\
                 7.3: Scattering in One and Three Dimensions / 109 \\
                 8: Tunneling \\
                 8.1: Transmission in a 1-D Chain / 112 \\
                 8.2: More General Barriers / 115 \\
                 8.3: Tunneling Systems / 120 \\
                 8.4: Tunneling Resonance / 121 \\
                 9: Transition Rates \\
                 9.1: Second-Order Coupling / 125 \\
                 9.2: Carrier Emission and Capture / 128 \\
                 9.3: Time-Dependent Perturbations / 128 \\
                 9.4: Optical Transitions / 130 \\
                 9.5: Beta-Ray Emission from Nuclei / 135 \\
                 IV. Statistical Physics \\
                 10: Statistical Mechanics \\
                 10.1: Distribution Functions / 140 \\
                 10.2: Phonon and Photon Statistics / 145 \\
                 10.3: Bosons / 147 \\
                 10.4: Symmetry Under Interchange / 149 \\
                 10.5: Fermions / 153 \\
                 11: Transport Theory \\
                 11.1: Time-Dependent Distributions / 158 \\
                 11.2: The Boltzmann Equation / 159 \\
                 11.3: Conductivity, etc. / 162 \\
                 12: Noise \\
                 12.1: Classical Noise / 164 \\
                 12.2: Quantum Noise and van-der-Waals Interaction / 165
                 \\
                 12.3: Shot Noise / 167 \\
                 12.4: Other Sources / 170 \\
                 V. Electrons and Phonons \\
                 13: Energy Bands \\
                 13.1: The Empty-Core Pseudopotential / 174 \\
                 13.2: A Band Calculation / 178 \\
                 13.3: Diffraction / 184 \\
                 13.4: Scattering by Impurities / 185 \\
                 13.5: Semiconductor Energy Bands / 186 \\
                 14: Electron Dynamics \\
                 14.1: Dynamics of Packets / 189 \\
                 14.2: Effective Masses and Donor States / 192 \\
                 14.3: The Dynamics of Holes / 194 \\
                 15: Lattice Vibrations \\
                 15.1: The Spectrum / 197 \\
                 15.2: The Classical-Vibration Hamiltonian / 201 \\
                 15.3: The Electron-Phonon Interaction / 203 \\
                 VI. Quantum Optics \\
                 16: Operators \\
                 16.1: Annihilation and Creation Operators for Electrons
                 / 207 \\
                 16.2: Stepping Operators / 212 \\
                 16.3: Angular Momentum / 216 \\
                 17: Phonons \\
                 17.1: Annihilation and Creation Operators for Phonons /
                 220 \\
                 17.2: Phonon Emission and Absorption / 223 \\
                 17.3: Polaron Self-Energy / 225 \\
                 17.4: Electron-Electron and Nucleon-Nucleon
                 Interactions / 228 \\
                 18: Photons \\
                 18.1: Photons and the Electron-Photon Interaction / 232
                 \\
                 18.2: Excitation of Atoms / 235 \\
                 18.3: The Three-Level Laser / 239 \\
                 18.4: Interband Transitions / 241 \\
                 19: Coherent States \\
                 19.1: Coherence in a Harmonic Oscillator / 247 \\
                 19.2: A Driven Classical Oscillator / 249 \\
                 19.3: A Driven Quantum Oscillator / 251 \\
                 19.4: Coherent Light / 254 \\
                 19.5: Electromagnetically-Induced Transparency / 256
                 \\
                 VII. Many-Body Effects \\
                 20: Coulomb Effects \\
                 20.1: Coulomb Shifts / 260 \\
                 20.2: Screening / 263 \\
                 21: Cooperative Phenomena \\
                 21.1: Localization and Symmetry Breaking / 270 \\
                 21.2: The Hubbard Hamiltonian / 275 \\
                 21.3: Peierls Distortions / 281 \\
                 21.4: Superconductivity / 282 \\
                 22: Magnetism \\
                 22.1: Free Electrons in a Magnetic Field / 287 \\
                 22.2: Magnetism of Atoms / 292 \\
                 22.3: Magnetic Susceptibility / 295 \\
                 22.4: Ferromagnetism / 298 \\
                 22.5: Spin-Orbit Coupling / 301 \\
                 23: Shake-Off Excitations \\
                 23.1: Adiabatic and Sudden Approximations / 306 \\
                 23.2: Vibrational Excitations / 309 \\
                 23.3: Electronic and Auger processes / 315 \\
                 23.4: Inelastic Processes / 316 \\
                 Epilogue / 322 \\
                 Exercises / 323 \\
                 References / 343 \\
                 Subject Index / 345",
}


bibtype: book
filename: master.bib
label: Hart:1968:CAa
title: Computer Approximations
publisher: pub-R-E-KRIEGER
address: pub-R-E-KRIEGER:adr
pages: x + 343
year: 1968
ISBN: 0-88275-642-7 OR 0882756427
ISBN13: 978-0-88275-642-4 OR 9780882756424
LCCN: QA 297 C64 1978
bibdate: Tue Dec 14 22:55:11 1993
bibtimestamp: 1993.12.14 22:55:11 ???
note: Reprinted 1978 with corrections.
acknowledgement: ack-nhfb
rawnote: Reprinted 1978 with corrections.
rawtitle: Computer Approximations
author:
John F. Hart and E. W. Cheney and Charles L. Lawson and Hans J. Maehly and Charles K. Mesztenyi and John R. Rice and Henry G. Thatcher, Jr. and Christoph Witzgall

bibsource:
https://www.math.utah.edu/pub/bibnet/authors/r/rice-john-r.bib; https://www.math.utah.edu/pub/tex/bib/elefunt.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

TOC:
1: The Design of a Function Subroutine / 1 1.1 Introduction / 1 1.2 General Considerations in Writing a Function Subroutine / 2 1.3 Relation of the Function Subroutine to the Computer System / 3 1.4 The Three Main Types of Function Subroutine / 4 1.5 Special Programming Techniques / 7 1.6 Subroutine Errors / 7 1.7 Final Steps / 9 2: General Methods of Computing Functions / 10 2.1 Introduction / 10 2.2 Application of Infinite Expansions / 11 2.3 Recurrence and Difference Relations / 23 2.4 Iterative Techniques / 27 2.5 Integral Representations / 28 2.6 Differential Equations / 29 2.7 Tabular Data / 32 2.8 Convergence Acceleration / 33 3: Least Maximum Approximations / 42 3.1 Introduction / 42 3.2 Properties of Least Maximum Approximations / 43 3.3 Nearly Least Maximum Approximations / 46 3.4 Rational Approximation / 51 3.5 Segmented Approximation / 54 3.6 Computation of the Tables / 55 4: The Choice and Application of Approximations / 58 4.1 Introduction / 5 8 4.2 Domain Considerations / 58 4.3 Machine Considerations / 62 4.4 Conditioning of Approximations / 65 4.5 Polynomial Forms / 67 4.6 Rational Forms / 73 4.7 Transformation Algorithms / 78 5: Description and Use of the Tables / 82 5.1 Introduction / 22 5.2 Function Notes / 82 5.3 Accuracy of the Coefficients / 83 5.4 How to Use the Tables / 86 5.5 Preparation of the Tables / 88 6: Function Notes / 89 6.1 Square Root, Cube Root / 89 6.2 Exponential and Hyperbolic Functions / 96 6.3 The Logarithm Function / 105 6.4 Trigonometric Functions / 112 6.5 The Inverse Trigonometric Functions / 120 6.6 The Gamma Function and Its Logarithm / 130 6.7 The Error Function / 136 6.8 Bessel Functions / 141 6.9 Complete Elliptic Integrals / 150 7: Tables of Coefficients / 155 Appendix A Conversion Algorithms / 307 Appendix B Bibliography of Approximations / 313 Appendix C Decimal and Octal Constants / 333 References / 336 Index / 341

rawauthor:
John F. Hart and E. W. Cheney and Charles L. Lawson and Hans J. Maehly and Charles K. Mesztenyi and John R. Rice and Henry G. {Thatcher, Jr.} and Christoph Witzgall

shortTOC:
1: The Design of a Function Subroutine / 1 2: General Methods of Computing Functions / 10 3: Least Maximum Approximations / 42 4: The Choice and Application of Approximations / 58 5: Description and Use of the Tables / 82 6: Function Notes / 89 7: Tables of Coefficients / 155 Appendix A: Conversion Algorithms / 307 Appendix B: Bibliography of Approximations / 313 Appendix C: Decimal and Octal Constants / 333 References / 336 Index / 341

rawshortTOC:
1: The Design of a Function Subroutine / 1 \\ 2: General Methods of Computing Functions / 10 \\ 3: Least Maximum Approximations / 42 \\ 4: The Choice and Application of Approximations / 58 \\ 5: Description and Use of the Tables / 82 \\ 6: Function Notes / 89 \\ 7: Tables of Coefficients / 155 \\ Appendix A: Conversion Algorithms / 307 \\ Appendix B: Bibliography of Approximations / 313 \\ Appendix C: Decimal and Octal Constants / 333 \\ References / 336 \\ Index / 341

rawTOC:
1: The Design of a Function Subroutine / 1 \\ 1.1 Introduction / 1 \\ 1.2 General Considerations in Writing a Function Subroutine / 2 \\ 1.3 Relation of the Function Subroutine to the Computer System / 3 \\ 1.4 The Three Main Types of Function Subroutine / 4 \\ 1.5 Special Programming Techniques / 7 \\ 1.6 Subroutine Errors / 7 \\ 1.7 Final Steps / 9 \\ 2: General Methods of Computing Functions / 10 \\ 2.1 Introduction / 10 \\ 2.2 Application of Infinite Expansions / 11 \\ 2.3 Recurrence and Difference Relations / 23 \\ 2.4 Iterative Techniques / 27 \\ 2.5 Integral Representations / 28 \\ 2.6 Differential Equations / 29 \\ 2.7 Tabular Data / 32 \\ 2.8 Convergence Acceleration / 33 \\ 3: Least Maximum Approximations / 42 \\ 3.1 Introduction / 42 \\ 3.2 Properties of Least Maximum Approximations / 43 \\ 3.3 Nearly Least Maximum Approximations / 46 \\ 3.4 Rational Approximation / 51 \\ 3.5 Segmented Approximation / 54 \\ 3.6 Computation of the Tables / 55 \\ 4: The Choice and Application of Approximations / 58 \\ 4.1 Introduction / 5 8 \\ 4.2 Domain Considerations / 58 \\ 4.3 Machine Considerations / 62 \\ 4.4 Conditioning of Approximations / 65 \\ 4.5 Polynomial Forms / 67 \\ 4.6 Rational Forms / 73 \\ 4.7 Transformation Algorithms / 78 \\ 5: Description and Use of the Tables / 82 \\ 5.1 Introduction / 22 \\ 5.2 Function Notes / 82 \\ 5.3 Accuracy of the Coefficients / 83 \\ 5.4 How to Use the Tables / 86 \\ 5.5 Preparation of the Tables / 88 \\ 6: Function Notes / 89 \\ 6.1 Square Root, Cube Root / 89 \\ 6.2 Exponential and Hyperbolic Functions / 96 \\ 6.3 The Logarithm Function / 105 \\ 6.4 Trigonometric Functions / 112 \\ 6.5 The Inverse Trigonometric Functions / 120 \\ 6.6 The Gamma Function and Its Logarithm / 130 \\ 6.7 The Error Function / 136 \\ 6.8 Bessel Functions / 141 \\ 6.9 Complete Elliptic Integrals / 150 \\ 7: Tables of Coefficients / 155 \\ Appendix A Conversion Algorithms / 307 \\ Appendix B Bibliography of Approximations / 313 \\ Appendix C Decimal and Octal Constants / 333 \\ References / 336 \\ Index / 341

entry:
@Book{Hart:1968:CAa,
  author =       "John F. Hart and E. W. Cheney and Charles L. Lawson
                 and Hans J. Maehly and Charles K. Mesztenyi and John R.
                 Rice and Henry G. {Thatcher, Jr.} and Christoph
                 Witzgall",
  title =        "Computer Approximations",
  publisher =    pub-R-E-KRIEGER,
  address =      pub-R-E-KRIEGER:adr,
  pages =        "x + 343",
  year =         "1968",
  ISBN =         "0-88275-642-7",
  ISBN-13 =      "978-0-88275-642-4",
  LCCN =         "QA 297 C64 1978",
  bibdate =      "Tue Dec 14 22:55:11 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/r/rice-john-r.bib;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted 1978 with corrections.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1: The Design of a Function Subroutine / 1 \\
                 2: General Methods of Computing Functions / 10 \\
                 3: Least Maximum Approximations / 42 \\
                 4: The Choice and Application of Approximations / 58
                 \\
                 5: Description and Use of the Tables / 82 \\
                 6: Function Notes / 89 \\
                 7: Tables of Coefficients / 155 \\
                 Appendix A: Conversion Algorithms / 307 \\
                 Appendix B: Bibliography of Approximations / 313 \\
                 Appendix C: Decimal and Octal Constants / 333 \\
                 References / 336 \\
                 Index / 341",
  tableofcontents = "1: The Design of a Function Subroutine / 1 \\
                 1.1 Introduction / 1 \\
                 1.2 General Considerations in Writing a Function
                 Subroutine / 2 \\
                 1.3 Relation of the Function Subroutine to the Computer
                 System / 3 \\
                 1.4 The Three Main Types of Function Subroutine / 4 \\
                 1.5 Special Programming Techniques / 7 \\
                 1.6 Subroutine Errors / 7 \\
                 1.7 Final Steps / 9 \\
                 2: General Methods of Computing Functions / 10 \\
                 2.1 Introduction / 10 \\
                 2.2 Application of Infinite Expansions / 11 \\
                 2.3 Recurrence and Difference Relations / 23 \\
                 2.4 Iterative Techniques / 27 \\
                 2.5 Integral Representations / 28 \\
                 2.6 Differential Equations / 29 \\
                 2.7 Tabular Data / 32 \\
                 2.8 Convergence Acceleration / 33 \\
                 3: Least Maximum Approximations / 42 \\
                 3.1 Introduction / 42 \\
                 3.2 Properties of Least Maximum Approximations / 43 \\
                 3.3 Nearly Least Maximum Approximations / 46 \\
                 3.4 Rational Approximation / 51 \\
                 3.5 Segmented Approximation / 54 \\
                 3.6 Computation of the Tables / 55 \\
                 4: The Choice and Application of Approximations / 58
                 \\
                 4.1 Introduction / 5 8 \\
                 4.2 Domain Considerations / 58 \\
                 4.3 Machine Considerations / 62 \\
                 4.4 Conditioning of Approximations / 65 \\
                 4.5 Polynomial Forms / 67 \\
                 4.6 Rational Forms / 73 \\
                 4.7 Transformation Algorithms / 78 \\
                 5: Description and Use of the Tables / 82 \\
                 5.1 Introduction / 22 \\
                 5.2 Function Notes / 82 \\
                 5.3 Accuracy of the Coefficients / 83 \\
                 5.4 How to Use the Tables / 86 \\
                 5.5 Preparation of the Tables / 88 \\
                 6: Function Notes / 89 \\
                 6.1 Square Root, Cube Root / 89 \\
                 6.2 Exponential and Hyperbolic Functions / 96 \\
                 6.3 The Logarithm Function / 105 \\
                 6.4 Trigonometric Functions / 112 \\
                 6.5 The Inverse Trigonometric Functions / 120 \\
                 6.6 The Gamma Function and Its Logarithm / 130 \\
                 6.7 The Error Function / 136 \\
                 6.8 Bessel Functions / 141 \\
                 6.9 Complete Elliptic Integrals / 150 \\
                 7: Tables of Coefficients / 155 \\
                 Appendix A Conversion Algorithms / 307 \\
                 Appendix B Bibliography of Approximations / 313 \\
                 Appendix C Decimal and Octal Constants / 333 \\
                 References / 336 \\
                 Index / 341",
}


bibtype: book
filename: master.bib
label: Hasegawa:2005:RES
author: Tsuyoshi Hasegawa
title: Racing the enemy: Stalin, Truman, and the surrender of Japan
publisher: pub-BELKNAP
address: pub-BELKNAP:adr
pages: ix + 382
year: 2005
ISBN: 0-674-01693-9 (hardcover), 0-674-03840-1 (e-book) OR 0674016939 (hardcover), 0674038401 (ebook)
LCCN: D813.J3 H37 2005
bibdate: Fri Jan 13 17:17:15 MST 2006
bibtimestamp: 2006.01.13 17:17:15 MST
subject: World War, 1939--1945; Armistices; Japan; Soviet Union; United States; World politics; 1933--1945
acknowledgement: ack-nhfb
rawauthor: Tsuyoshi Hasegawa
rawtitle: Racing the enemy: {Stalin}, {Truman}, and the surrender of {Japan}
ISBN13:
978-0-674-01693-4 (hardcover), 978-0-674-03840-0 (e-book) OR 9780674016934 (hardcover), 9780674038400 (ebook)

abstract:
In the first international history of the end of World War II in the Pacific --- the only book to fully integrate the roles of the United States, the Soviet Union, and Japan --- Tsuyoshi Hasegawa traces an intricate diplomatic and military end game as he shatters standard accounts of the Japanese surrender.

TOC:
Triangular relations and the Pacific War Stalin, Truman and Hirohito face new challenges Decisions for war and peace Potsdam: the turning point The atomic bombs and Soviet entry into the war Japan accepts unconditional surrender August Storm: the Soviet--Japanese War and the United States Conclusion: Assessing the roads not taken

rawabstract:
In the first international history of the end of World War II in the Pacific --- the only book to fully integrate the roles of the United States, the Soviet Union, and Japan --- Tsuyoshi Hasegawa traces an intricate diplomatic and military end game as he shatters standard accounts of the Japanese surrender.

rawTOC:
Triangular relations and the Pacific War \\ Stalin, Truman and Hirohito face new challenges \\ Decisions for war and peace \\ Potsdam: the turning point \\ The atomic bombs and Soviet entry into the war \\ Japan accepts unconditional surrender \\ August Storm: the Soviet--Japanese War and the United States \\ Conclusion: Assessing the roads not taken

entry:
@Book{Hasegawa:2005:RES,
  author =       "Tsuyoshi Hasegawa",
  title =        "Racing the enemy: {Stalin}, {Truman}, and the
                 surrender of {Japan}",
  publisher =    pub-BELKNAP,
  address =      pub-BELKNAP:adr,
  pages =        "ix + 382",
  year =         "2005",
  ISBN =         "0-674-01693-9 (hardcover), 0-674-03840-1 (e-book)",
  ISBN-13 =      "978-0-674-01693-4 (hardcover), 978-0-674-03840-0
                 (e-book)",
  LCCN =         "D813.J3 H37 2005",
  bibdate =      "Fri Jan 13 17:17:15 MST 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "In the first international history of the end of World
                 War II in the Pacific --- the only book to fully
                 integrate the roles of the United States, the Soviet
                 Union, and Japan --- Tsuyoshi Hasegawa traces an
                 intricate diplomatic and military end game as he
                 shatters standard accounts of the Japanese surrender.",
  acknowledgement = ack-nhfb,
  subject =      "World War, 1939--1945; Armistices; Japan; Soviet
                 Union; United States; World politics; 1933--1945",
  tableofcontents = "Triangular relations and the Pacific War \\
                 Stalin, Truman and Hirohito face new challenges \\
                 Decisions for war and peace \\
                 Potsdam: the turning point \\
                 The atomic bombs and Soviet entry into the war \\
                 Japan accepts unconditional surrender \\
                 August Storm: the Soviet--Japanese War and the United
                 States \\
                 Conclusion: Assessing the roads not taken",
}


bibtype: book
filename: master.bib
label: Hassan:2004:HPT
editor: Mahbub Hassan and Raj Jain
title: High Performance TCP / IP Networking: Concepts, Issues, and Solutions
publisher: pub-PEARSON-PH
address: pub-PEARSON-PH:adr
pages: xx + 383
year: 2004
ISBN: 0-13-064634-2, 0-13-127257-8 (paperback) OR 0130646342, 0131272578 (paperback)
ISBN13: 978-0-13-064634-7, 978-0-13-127257-6 (paperback) OR 9780130646347, 9780131272576 (paperback)
LCCN: TK5105.585 .H54 2003
bibdate: Tue Dec 30 18:38:09 2003
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2003.12.30 18:38:09 ???
acknowledgement: ack-nhfb
raweditor: Mahbub Hassan and Raj Jain
rawtitle: High Performance {TCP\slash IP} Networking: Concepts, Issues, and Solutions
abstract:
This text provides in-depth coverage of the necessary tools and techniques for the performance evaluation of TCP/IP networks. It examines performance concepts and issues for running TCP/IP over wireless, mobile, optical and satellite networks; congestion control algorithms in hosts and routers to manage traffic congestion in TCP/IP networks and enhance application performance; and high performance implementation of TCP/IP protocol stack in software and hardware.

TOC:
Background: TCP/IP fundamentals. Performance evaluation: performance measurement of TCP/IP networks TCP/IP network simulation TCP modelling. Performance in emerging networks: TCP/IP performance over wireless networks TCP/IP performance over mobile networks TCP/IP performance over optical networks TCP/IP performance over satellite networks TCP/IP performance over asymmetry networks. Congestion control: new TCP standards and flavours active queue management in TCP/IP networks. Implementation: software implementation of TCP hardware implementation of TCP/IP

rawabstract:
This text provides in-depth coverage of the necessary tools and techniques for the performance evaluation of TCP/IP networks. It examines performance concepts and issues for running TCP/IP over wireless, mobile, optical and satellite networks; congestion control algorithms in hosts and routers to manage traffic congestion in TCP/IP networks and enhance application performance; and high performance implementation of TCP/IP protocol stack in software and hardware.

rawTOC:
Background: TCP/IP fundamentals. Performance evaluation: performance measurement of TCP/IP networks \\ TCP/IP network simulation \\ TCP modelling. Performance in emerging networks: TCP/IP performance over wireless networks \\ TCP/IP performance over mobile networks \\ TCP/IP performance over optical networks \\ TCP/IP performance over satellite networks \\ TCP/IP performance over asymmetry networks. Congestion control: new TCP standards and flavours \\ active queue management in TCP/IP networks. Implementation: software implementation of TCP \\ hardware implementation of TCP/IP

entry:
@Book{Hassan:2004:HPT,
  editor =       "Mahbub Hassan and Raj Jain",
  title =        "High Performance {TCP\slash IP} Networking: Concepts,
                 Issues, and Solutions",
  publisher =    pub-PEARSON-PH,
  address =      pub-PEARSON-PH:adr,
  pages =        "xx + 383",
  year =         "2004",
  ISBN =         "0-13-064634-2, 0-13-127257-8 (paperback)",
  ISBN-13 =      "978-0-13-064634-7, 978-0-13-127257-6 (paperback)",
  LCCN =         "TK5105.585 .H54 2003",
  bibdate =      "Tue Dec 30 18:38:09 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$59.00",
  abstract =     "This text provides in-depth coverage of the necessary
                 tools and techniques for the performance evaluation of
                 TCP/IP networks. It examines performance concepts and
                 issues for running TCP/IP over wireless, mobile,
                 optical and satellite networks; congestion control
                 algorithms in hosts and routers to manage traffic
                 congestion in TCP/IP networks and enhance application
                 performance; and high performance implementation of
                 TCP/IP protocol stack in software and hardware.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Background: TCP/IP fundamentals. Performance
                 evaluation: performance measurement of TCP/IP networks
                 \\
                 TCP/IP network simulation \\
                 TCP modelling. Performance in emerging networks: TCP/IP
                 performance over wireless networks \\
                 TCP/IP performance over mobile networks \\
                 TCP/IP performance over optical networks \\
                 TCP/IP performance over satellite networks \\
                 TCP/IP performance over asymmetry networks. Congestion
                 control: new TCP standards and flavours \\
                 active queue management in TCP/IP networks.
                 Implementation: software implementation of TCP \\
                 hardware implementation of TCP/IP",
}


bibtype: book
filename: master.bib
label: Hastings:1955:ADC
author: Cecil Hastings, Jr.
title: Approximations for Digital Computers
publisher: pub-PRINCETON
address: pub-PRINCETON:adr
pages: viii + 201
year: 1955
ISBN: 0-691-07914-5 OR 0691079145
ISBN13: 978-0-691-07914-1 OR 9780691079141
LCCN: QA76 .H37
bibdate: Mon Oct 01 15:59:48 2007
bibtimestamp: 2007.10.01 15:59:48 ???
note: Assisted by Jeanne T. Hayward and James P. Wong, Jr.
series: The Rand series
subject: Electronic digital computers; Numerical analysis
acknowledgement: ack-nhfb
rawauthor: Cecil {Hastings, Jr.}
rawnote: Assisted by Jeanne T. Hayward and James P. Wong, Jr.
rawtitle: Approximations for Digital Computers
bibsource:
https://www.math.utah.edu/pub/tex/bib/elefunt.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/prng.bib; z3950.loc.gov:7090/Voyager

TOC:
Preface / v Part I 1: Concerning Best Fit / 3 2: Linear Weights / 19 3: An Iterative Procedure / 27 4: Solution of Equations / 35 5: Chebyshev Polynomials / 47 6: Concerning Weights / 65 7: Function With a Peak / 75 8: Rates of Convergence / 83 9: Choice of Form / 95 10: A Scoring-Camera Problem / 115 Part II 1: $log _10 x$ / 125 5: $phi (x) = (1 - e^-x) / x$ / 129 8: $arctan x$ / 132 14: $sin (pi /2) x$ / 138 17: $10^x$ / 141 21: $W(x) = e^-x / (1 + e^-x)^2$ / 145 24: $P_k(x) = 1.72 + 42 x^2$ or $0.136 / x^2$ / 148 27: $E'(x) = (1 / sqrt 2 pi ) e^-(1/2)x^2$ / 151 30: ``Total Klein-Nishina Cross Section'' Function / 154 31: $Gamma (1 + x)$ / 155 35: $arcsin x$ / 159 40: $log _2 x$ / 164 43: $Phi (x) = (2 / sqrt pi ) int _0^x e^-t^2 dt$ / 167 46: $K(k) = int _0^pi /2 (1 / sqrt 1 - k^2 sin ^2 phi ) dphi $ / 170 49: $E(k) = int _0^pi /2 (sqrt 1 - k^2 sin ^2 phi ) dphi $ / 173 52: $ln (1 + x)$ / 176 57: $e^-x$ / 181 61: $Phi (x) = (2 / sqrt pi ) int _0^x e^-t^2 dt$ / 185 64: $-rm Ei(-x) = int _x^infty (e^-t / t) dt$ / 188 67: $q = (1 / sqrt 2 pi ) int _x(q)^infty e^-(1/2)t^2 dt$ / 191 69: $W(z) = int _0^infty (e^(-u z) / (K_1^2(u) + pi ^2 I_1^2(u))) (1/u) du$ / 193 71: $P(x) = int _x^infty (sin (t - x) / t) dt$ / 195 74: $Q(x) = int _x^infty (cos (t - x) / t) dt$ / 195 References for Part II / 201

rawTOC:
Preface / v \\ Part I \\ 1: Concerning Best Fit / 3 \\ 2: Linear Weights / 19 \\ 3: An Iterative Procedure / 27 \\ 4: Solution of Equations / 35 \\ 5: Chebyshev Polynomials / 47 \\ 6: Concerning Weights / 65 \\ 7: Function With a Peak / 75 \\ 8: Rates of Convergence / 83 \\ 9: Choice of Form / 95 \\ 10: A Scoring-Camera Problem / 115 \\ Part II \\ 1: $\log_{10} x$ / 125 \\ 5: $\phi(x) = (1 - e^{-x}) / x$ / 129 \\ 8: $\arctan x$ / 132 \\ 14: $\sin (\pi/2) x$ / 138 \\ 17: $10^x$ / 141 \\ 21: $W(x) = e^{-x} / (1 + e^{-x})^2$ / 145 \\ 24: $P_k(x) = 1.72 + 42 x^2$ or $0.136 / x^2$ / 148 \\ 27: $E'(x) = (1 / \sqrt{2 \pi}) e^{-(1/2)x^2}$ / 151 \\ 30: ``Total Klein-Nishina Cross Section'' Function / 154 \\ 31: $\Gamma(1 + x)$ / 155 \\ 35: $\arcsin x$ / 159 \\ 40: $\log_2 x$ / 164 \\ 43: $\Phi(x) = (2 / \sqrt{\pi}) \int_0^x e^{-t^2} \, dt$ / 167 \\ 46: $K(k) = \int_0^{\pi/2} (1 / \sqrt{1 - k^2 \sin^2 \phi}) \, d\phi$ / 170 \\ 49: $E(k) = \int_0^{\pi/2} (\sqrt{1 - k^2 \sin^2 \phi}) \, d\phi$ / 173 \\ 52: $\ln(1 + x)$ / 176 \\ 57: $e^{-x}$ / 181 \\ 61: $\Phi(x) = (2 / \sqrt{\pi}) \int_0^x e^{-t^2} \, dt$ / 185 \\ 64: $-{\rm Ei}(-x) = \int_x^\infty (e^{-t} / t) \, dt$ / 188 \\ 67: $q = (1 / \sqrt{2 \pi}) \int_{x(q)}^\infty e^{-(1/2)t^2} \, dt$ / 191 \\ 69: $W(z) = \int_0^\infty (e^(-u z) / (K_1^2(u) + \pi^2 I_1^2(u))) (1/u) \, du$ / 193 \\ 71: $P(x) = \int_x^\infty (\sin(t - x) / t) \, dt$ / 195 \\ 74: $Q(x) = \int_x^\infty (\cos(t - x) / t) \, dt$ / 195 \\ References for Part II / 201

entry:
@Book{Hastings:1955:ADC,
  author =       "Cecil {Hastings, Jr.}",
  title =        "Approximations for Digital Computers",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "viii + 201",
  year =         "1955",
  ISBN =         "0-691-07914-5",
  ISBN-13 =      "978-0-691-07914-1",
  LCCN =         "QA76 .H37",
  bibdate =      "Mon Oct 01 15:59:48 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "Assisted by Jeanne T. Hayward and James P. Wong, Jr.",
  series =       "The Rand series",
  acknowledgement = ack-nhfb,
  remark-1 =     "Reprinted 1957, 1959, 1962, 1966, and 1970. I have
                 fourth printing (1962).",
  remark-2 =     "Hastings gives a polynomial approximation for
                 computing random numbers from a normal distribution.",
  subject =      "Electronic digital computers; Numerical analysis",
  tableofcontents = "Preface / v \\
                 Part I \\
                 1: Concerning Best Fit / 3 \\
                 2: Linear Weights / 19 \\
                 3: An Iterative Procedure / 27 \\
                 4: Solution of Equations / 35 \\
                 5: Chebyshev Polynomials / 47 \\
                 6: Concerning Weights / 65 \\
                 7: Function With a Peak / 75 \\
                 8: Rates of Convergence / 83 \\
                 9: Choice of Form / 95 \\
                 10: A Scoring-Camera Problem / 115 \\
                 Part II \\
                 1: $\log_{10} x$ / 125 \\
                 5: $\phi(x) = (1 - e^{-x}) / x$ / 129 \\
                 8: $\arctan x$ / 132 \\
                 14: $\sin (\pi/2) x$ / 138 \\
                 17: $10^x$ / 141 \\
                 21: $W(x) = e^{-x} / (1 + e^{-x})^2$ / 145 \\
                 24: $P_k(x) = 1.72 + 42 x^2$ or $0.136 / x^2$ / 148 \\
                 27: $E'(x) = (1 / \sqrt{2 \pi}) e^{-(1/2)x^2}$ / 151
                 \\
                 30: ``Total Klein-Nishina Cross Section'' Function /
                 154 \\
                 31: $\Gamma(1 + x)$ / 155 \\
                 35: $\arcsin x$ / 159 \\
                 40: $\log_2 x$ / 164 \\
                 43: $\Phi(x) = (2 / \sqrt{\pi}) \int_0^x e^{-t^2} \,
                 dt$ / 167 \\
                 46: $K(k) = \int_0^{\pi/2} (1 / \sqrt{1 - k^2 \sin^2
                 \phi}) \, d\phi$ / 170 \\
                 49: $E(k) = \int_0^{\pi/2} (\sqrt{1 - k^2 \sin^2 \phi})
                 \, d\phi$ / 173 \\
                 52: $\ln(1 + x)$ / 176 \\
                 57: $e^{-x}$ / 181 \\
                 61: $\Phi(x) = (2 / \sqrt{\pi}) \int_0^x e^{-t^2} \,
                 dt$ / 185 \\
                 64: $-{\rm Ei}(-x) = \int_x^\infty (e^{-t} / t) \, dt$
                 / 188 \\
                 67: $q = (1 / \sqrt{2 \pi}) \int_{x(q)}^\infty
                 e^{-(1/2)t^2} \, dt$ / 191 \\
                 69: $W(z) = \int_0^\infty (e^(-u z) / (K_1^2(u) + \pi^2
                 I_1^2(u))) (1/u) \, du$ / 193 \\
                 71: $P(x) = \int_x^\infty (\sin(t - x) / t) \, dt$ /
                 195 \\
                 74: $Q(x) = \int_x^\infty (\cos(t - x) / t) \, dt$ /
                 195 \\
                 References for Part II / 201",
}


bibtype: book
filename: master.bib
label: Hastings:2016:SWS
author: Max Hastings
title: The Secret War: Spies, Ciphers, and Guerrillas 1939--1945
publisher: Harper
address: New York, NY
pages: xxvii + 610 + 32
year: 2016
LCCN: D810.S7 H365 2017
bibdate: Wed Jan 2 07:39:53 MST 2019
bibtimestamp: 2019.01.02 07:39:53 MST
remark: First published in a different form in the United Kingdom in 2015.
acknowledgement: ack-nhfb
rawauthor: Max Hastings
rawtitle: The Secret War: Spies, Ciphers, and Guerrillas 1939--1945
ISBN:
0-06-225927-X (hardcover), 0-06-225928-8 (paperback), 0-06-244156-6 OR 006225927X (hardcover), 0062259288 (paperback), 0062441566

ISBN13:
978-0-06-225927-1 (hardcover), 978-0-06-225928-8 (paperback), 978-0-06-244156-0 OR 9780062259271 (hardcover), 9780062259288 (paperback), 9780062441560

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

abstract:
An examination of one of the most important yet underexplored aspects of World War II --- intelligence shows how espionage successes and failures by the United States, Britain, Russia, Germany, and Japan influenced the course of the war and its final outcome.

subject:
World War, 1939--1945; Secret service; Underground movements; Cryptography; Electronic intelligence; Intelligence service; History; 20th century; Espionage; Bletchley Park (Milton Keynes, England)

TOC:
List of illustrations Introduction 1: Before the deluge / 1 Seekers after truth The British: gentlemen and players The Russians: temples of espionage 2: The storm breaks / 42 The ``fiction flood'' Shadowing Canaris 3: Miracles take a little longer: Bletchley / 68 ``Tips'' and ``cillis'' Flirting with America 4: The dogs that barked / 103 ``Lucy's'' people Sorge's warnings The orchestra plays The deaf man in the Kremlin 5: Divine winds / 135 Mrs Ferguson's tea set The Japanese The man who won Midway 6: Muddling and groping: the Russians at war / 175 Centre mobilises The end of Sorge The second source Gourevitch takes a train 7: Britain's secret war machine / 195 The sharp end The brain At sea 8: `Mars': the bloodiest deception / 222 Gehlen ``Agent Max'' 9: The orchestra's last concert / 238 10: Guerrilla / 252 Registers and raiders SOE 11: Hoover's G-men, Donovan's wild men / 281 Adventurers Ivory towers Allen Dulles: talking to Germany 12: Russia's partisans: terrorising both sides / 314 13: Islands in the storm / 328 The Abwehr's Irish jig No man's land 14: A little help from their friends / 346 ``It stinks, but somebody has to do it'' American traitors 15: The knowledge factories / 385 Agents The jewel of sources Production lines Infernal machines 16: `Blunderhead': the English patient / 428 17: Eclipse of the Abwehr / 444 Hitler's Bletchleys ``Cicero'' The fantasists The ``good'' Nazi 18: Battlefields / 480 Wielding the Ultra wand Suicide spies Tarnished triumph 19: Black widows, few white knights / 501 Fighting Japan Fighting each other The enemy: groping in the dark 20: `Enormoz' / 521 21: Decoding victory / 533 Acknowledgements Notes and Sources Bibliography Index

rawabstract:
An examination of one of the most important yet underexplored aspects of World War II --- intelligence shows how espionage successes and failures by the United States, Britain, Russia, Germany, and Japan influenced the course of the war and its final outcome.

rawTOC:
List of illustrations \\ Introduction \\ 1: Before the deluge / 1 \\ Seekers after truth \\ The British: gentlemen and players \\ The Russians: temples of espionage \\ 2: The storm breaks / 42 \\ The ``fiction flood'' \\ Shadowing Canaris \\ 3: Miracles take a little longer: Bletchley / 68 \\ ``Tips'' and ``cillis'' \\ Flirting with America \\ 4: The dogs that barked / 103 \\ ``Lucy's'' people \\ Sorge's warnings \\ The orchestra plays \\ The deaf man in the Kremlin \\ 5: Divine winds / 135 \\ Mrs Ferguson's tea set \\ The Japanese \\ The man who won Midway \\ 6: Muddling and groping: the Russians at war / 175 \\ Centre mobilis{\'e}s \\ The end of Sorge \\ The second source \\ Gourevitch takes a train \\ 7: Britain's secret war machine / 195 \\ The sharp end \\ The brain \\ At sea \\ 8: `Mars': the bloodiest deception / 222 \\ Gehlen \\ ``Agent Max'' \\ 9: The orchestra's last concert / 238 \\ 10: Guerrilla / 252 \\ Registers and raiders \\ SOE \\ 11: Hoover's G-men, Donovan's wild men / 281 \\ Adventurers \\ Ivory towers \\ Allen Dulles: talking to Germany \\ 12: Russia's partisans: terrorising both sides / 314 \\ 13: Islands in the storm / 328 \\ The Abwehr's Irish jig \\ No man's land \\ 14: A little help from their friends / 346 \\ ``It stinks, but somebody has to do it'' \\ American traitors \\ 15: The knowledge factories / 385 \\ Agents \\ The jewel of sources \\ Production lines \\ Infernal machines \\ 16: `Blunderhead': the English patient / 428 \\ 17: Eclipse of the Abwehr / 444 \\ Hitler's Bletchleys \\ ``Cicero'' \\ The fantasists \\ The ``good'' Nazi \\ 18: Battlefields / 480 \\ Wielding the Ultra wand \\ Suicide spies \\ Tarnished triumph \\ 19: Black widows, few white knights / 501 \\ Fighting Japan \\ Fighting each other \\ The enemy: groping in the dark \\ 20: `Enormoz' / 521 \\ 21: Decoding victory / 533 \\ Acknowledgements \\ Notes and Sources \\ Bibliography \\ Index

entry:
@Book{Hastings:2016:SWS,
  author =       "Max Hastings",
  title =        "The Secret War: Spies, Ciphers, and Guerrillas
                 1939--1945",
  publisher =    "Harper",
  address =      "New York, NY",
  pages =        "xxvii + 610 + 32",
  year =         "2016",
  ISBN =         "0-06-225927-X (hardcover), 0-06-225928-8 (paperback),
                 0-06-244156-6",
  ISBN-13 =      "978-0-06-225927-1 (hardcover), 978-0-06-225928-8
                 (paperback), 978-0-06-244156-0",
  LCCN =         "D810.S7 H365 2017",
  bibdate =      "Wed Jan 2 07:39:53 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "An examination of one of the most important yet
                 underexplored aspects of World War II --- intelligence
                 shows how espionage successes and failures by the
                 United States, Britain, Russia, Germany, and Japan
                 influenced the course of the war and its final
                 outcome.",
  acknowledgement = ack-nhfb,
  remark =       "First published in a different form in the United
                 Kingdom in 2015.",
  subject =      "World War, 1939--1945; Secret service; Underground
                 movements; Cryptography; Electronic intelligence;
                 Intelligence service; History; 20th century; Espionage;
                 Bletchley Park (Milton Keynes, England)",
  tableofcontents = "List of illustrations \\
                 Introduction \\
                 1: Before the deluge / 1 \\
                 Seekers after truth \\
                 The British: gentlemen and players \\
                 The Russians: temples of espionage \\
                 2: The storm breaks / 42 \\
                 The ``fiction flood'' \\
                 Shadowing Canaris \\
                 3: Miracles take a little longer: Bletchley / 68 \\
                 ``Tips'' and ``cillis'' \\
                 Flirting with America \\
                 4: The dogs that barked / 103 \\
                 ``Lucy's'' people \\
                 Sorge's warnings \\
                 The orchestra plays \\
                 The deaf man in the Kremlin \\
                 5: Divine winds / 135 \\
                 Mrs Ferguson's tea set \\
                 The Japanese \\
                 The man who won Midway \\
                 6: Muddling and groping: the Russians at war / 175 \\
                 Centre mobilis{\'e}s \\
                 The end of Sorge \\
                 The second source \\
                 Gourevitch takes a train \\
                 7: Britain's secret war machine / 195 \\
                 The sharp end \\
                 The brain \\
                 At sea \\
                 8: `Mars': the bloodiest deception / 222 \\
                 Gehlen \\
                 ``Agent Max'' \\
                 9: The orchestra's last concert / 238 \\
                 10: Guerrilla / 252 \\
                 Registers and raiders \\
                 SOE \\
                 11: Hoover's G-men, Donovan's wild men / 281 \\
                 Adventurers \\
                 Ivory towers \\
                 Allen Dulles: talking to Germany \\
                 12: Russia's partisans: terrorising both sides / 314
                 \\
                 13: Islands in the storm / 328 \\
                 The Abwehr's Irish jig \\
                 No man's land \\
                 14: A little help from their friends / 346 \\
                 ``It stinks, but somebody has to do it'' \\
                 American traitors \\
                 15: The knowledge factories / 385 \\
                 Agents \\
                 The jewel of sources \\
                 Production lines \\
                 Infernal machines \\
                 16: `Blunderhead': the English patient / 428 \\
                 17: Eclipse of the Abwehr / 444 \\
                 Hitler's Bletchleys \\
                 ``Cicero'' \\
                 The fantasists \\
                 The ``good'' Nazi \\
                 18: Battlefields / 480 \\
                 Wielding the Ultra wand \\
                 Suicide spies \\
                 Tarnished triumph \\
                 19: Black widows, few white knights / 501 \\
                 Fighting Japan \\
                 Fighting each other \\
                 The enemy: groping in the dark \\
                 20: `Enormoz' / 521 \\
                 21: Decoding victory / 533 \\
                 Acknowledgements \\
                 Notes and Sources \\
                 Bibliography \\
                 Index",
}


bibtype: article
filename: master.bib
label: Hatton:seismic-kernel
author: Les Hatton and Andy Wright and Stuart Smith and Gregg Parkes and Paddy Bennett and Robert Laws
title: The Seismic Kernel System: A Large-Scale Exercise in Fortran 77 Portability
journal: j-SPE
volume: 18
number: 4
pages: 301--329
month: apr
monthnumber: 4
year: 1988
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
note: Describes portability issues in a 500,000+ line system.
acknowledgement: ack-nhfb
rawauthor: Les Hatton and Andy Wright and Stuart Smith and Gregg Parkes and Paddy Bennett and Robert Laws
rawnote: Describes portability issues in a 500,000+ line system.
rawtitle: The {Seismic Kernel System}: {A} Large-Scale Exercise in {Fortran} 77 Portability
entry:
@Article{Hatton:seismic-kernel,
  author =       "Les Hatton and Andy Wright and Stuart Smith and Gregg
                 Parkes and Paddy Bennett and Robert Laws",
  title =        "The {Seismic Kernel System}: {A} Large-Scale Exercise
                 in {Fortran} 77 Portability",
  journal =      j-SPE,
  volume =       "18",
  number =       "4",
  pages =        "301--329",
  month =        apr,
  year =         "1988",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Describes portability issues in a 500,000+ line
                 system.",
  acknowledgement = ack-nhfb,
  quote-1 =      "\ldots{} a load of around $10^{14}$ floating-point
                 operations for a typical marine seismic survey
                 involving just one ship for perhaps four weeks",
  quote-2 =      "Assuming that 100 Mflops\slash sec can be sustained
                 for an average of 600 hours per month (somewhat more
                 than most centers can achieve), the speed at which data
                 can be processed by such a computer is comparable to
                 the speed at which it can be acquired by a single
                 vessel. As might be imagined, this requires a
                 significant percentage of the world's supercomputer
                 capacity.",
  quote-3 =      "\ldots{}, there are a number of algorithms waiting in
                 the wings which cannot be computed on any current
                 machine within a reasonable time, and must await the
                 arritve of massively parallel machines and an
                 appropriate software methodology \ldots{}",
  quote-4 =      "Furthermore, things never improved because of the
                 complication and inpenetrability of most of the code,
                 which was negligibly commented, unindented and of a
                 classic fractal nature. In this sense, fractal code
                 (like its mathematical counterpart) never gets any
                 simpler no matter how closely it is scrutinized.",
  quote-5 =      "SKS is expected to reach a million lines by the end of
                 the decade.",
}


bibtype: book
filename: master.bib
label: Hauser:2000:WMW
author: Marc D. Hauser
title: Wild Minds: What Animals Really Think
publisher: pub-HENRY-HOLT
address: pub-HENRY-HOLT:adr
pages: xx + 315
year: 2000
ISBN: 0-8050-5669-6 (hardcover), 0-8050-5670-X OR 0805056696 (hardcover), 080505670X
ISBN13: 978-0-8050-5669-3 (hardcover) OR 9780805056693 (hardcover)
LCCN: QL785 .H38 2000
bibdate: Wed Feb 21 18:13:38 2001
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2001.02.21 18:13:38 ???
note: Illustrations by Ted Dewan.
keywords: Animal psychology; Cognition in animals; Social behavior in animals
acknowledgement: ack-nhfb
rawauthor: Marc D. Hauser
rawnote: Illustrations by Ted Dewan.
rawtitle: Wild Minds: What Animals Really Think
abstract:
An essential examination of how animals assemble the basic tool kit that we call the mind: the ability to count, to navigate, to recognize individuals, to communicate, and to socialize.

TOC:
Prologue: Mental Toolkits / xiii 1 Animal Tales / 3 Part I Universal Knowledge 2 The Material World / 21 3 Number Juggling / 45 4 Space Travelers / 65 Part II Nature's Psychologists 5 Know Thyself / 91 6 Schools of Learning / 115 7 Tools of Deceit / 141 Part III Minds in Society 8 Gossip on the Ark / 175 9 Moral Instincts / 211 Epilogue: What It's Like to Be a Spider Monkey / 255 Notes / 259 References / 269 Index / 301

rawabstract:
An essential examination of how animals assemble the basic tool kit that we call the mind: the ability to count, to navigate, to recognize individuals, to communicate, and to socialize.

rawTOC:
Prologue: Mental Toolkits / xiii \\ 1 Animal Tales / 3 \\ Part I Universal Knowledge \\ 2 The Material World / 21 \\ 3 Number Juggling / 45 \\ 4 Space Travelers / 65 \\ Part II Nature's Psychologists \\ 5 Know Thyself / 91 \\ 6 Schools of Learning / 115 \\ 7 Tools of Deceit / 141 \\ Part III Minds in Society \\ 8 Gossip on the Ark / 175 \\ 9 Moral Instincts / 211 \\ Epilogue: What It's Like to Be a Spider Monkey / 255 \\ Notes / 259 \\ References / 269 Index / 301

entry:
@Book{Hauser:2000:WMW,
  author =       "Marc D. Hauser",
  title =        "Wild Minds: What Animals Really Think",
  publisher =    pub-HENRY-HOLT,
  address =      pub-HENRY-HOLT:adr,
  pages =        "xx + 315",
  year =         "2000",
  ISBN =         "0-8050-5669-6 (hardcover), 0-8050-5670-X",
  ISBN-13 =      "978-0-8050-5669-3 (hardcover)",
  LCCN =         "QL785 .H38 2000",
  bibdate =      "Wed Feb 21 18:13:38 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Illustrations by Ted Dewan.",
  abstract =     "An essential examination of how animals assemble the
                 basic tool kit that we call the mind: the ability to
                 count, to navigate, to recognize individuals, to
                 communicate, and to socialize.",
  acknowledgement = ack-nhfb,
  keywords =     "Animal psychology; Cognition in animals; Social
                 behavior in animals",
  libnote =      "Not yet in my library.",
  tableofcontents = "Prologue: Mental Toolkits / xiii \\
                 1 Animal Tales / 3 \\
                 Part I Universal Knowledge \\
                 2 The Material World / 21 \\
                 3 Number Juggling / 45 \\
                 4 Space Travelers / 65 \\
                 Part II Nature's Psychologists \\
                 5 Know Thyself / 91 \\
                 6 Schools of Learning / 115 \\
                 7 Tools of Deceit / 141 \\
                 Part III Minds in Society \\
                 8 Gossip on the Ark / 175 \\
                 9 Moral Instincts / 211 \\
                 Epilogue: What It's Like to Be a Spider Monkey / 255
                 \\
                 Notes / 259 \\
                 References / 269 Index / 301",
}


bibtype: book
filename: master.bib
label: Havil:2003:GEE
author: Julian Havil
title: Gamma: Exploring Euler's Constant
publisher: pub-PRINCETON
address: pub-PRINCETON:adr
pages: xxiii + 266
year: 2003
ISBN: 0-691-09983-9 OR 0691099839
ISBN13: 978-0-691-09983-5 OR 9780691099835
LCCN: QA41 .H23 2003
bibdate: Thu Sep 25 16:52:46 2003
bibtimestamp: 2003.09.25 16:52:46 ???
URL: http://www.loc.gov/catdir/description/prin031/2002192453.html
acknowledgement: ack-nhfb
rawauthor: Julian Havil
rawtitle: {Gamma}: Exploring {Euler}'s Constant
bibsource:
https://www.math.utah.edu/pub/tex/bib/benfords-law.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
Among the myriad of constants that appear in mathematics, $ pi $, $e$, and $i$ are the most familiar. Following closely behind is $ gamma $ or gamma, a constant that arises in many mathematical areas yet maintains a profound sense of mystery. In a tantalizing blend of history and mathematics, Julian Havil takes the reader on a journey through logarithms and the harmonic series, the two defining elements of gamma, toward the first account of gamma's place in mathematics. Introduced by the Swiss mathematician Leonhard Euler (1707--1783), who figures prominently in this book, gamma is defined as the limit of the sum of $ 1 + 1 / 2 + 1 / 3 + cdots + 1 / n - ln n$, the numerical value being $ 0.5772156 ldots $. But unlike its more celebrated colleagues $ pi $ and $e$, the exact nature of gamma remains a mystery --- we don't even know if it can be expressed as a fraction. Among the numerous topics that arise during this historical odyssey into fundamental mathematical ideas are the Prime Number Theorem and the most important open problem in mathematics today, the Riemann Hypothesis (though no proof of either is offered!). Sure to be popular with not only students and instructors but all math aficionados, Gamma takes us through countries, centuries, lives, and works, unfolding along the way the stories of some remarkable mathematics from some remarkable mathematicians.

TOC:
Foreword / xv Acknowledgements / xvii Introduction / xix Chapter One: The Logarithmic Cradle / 1 1.1 A Mathematical Nightmare- and an Awakening / 1 1.2 The Baron's Wonderful Canon / 4 1.3 A Touch of Kepler / 11 1.4 A Touch of Euler / 13 1.5 Napier's Other Ideas / 16 Chapter Two: The Harmonic Series / 21 2.1 The Principle / 21 2.2 Generating Function for $H_n$ / 21 2.3 Three Surprising Results / 22 Chapter Three: Sub-Harmonic Series / 27 3.1 A Gentle Start / 27 3.2 Harmonic Series of Primes / 28 3.3 The Kempner Series / 31 3.4 Madelung's Constants / 33 Chapter Four: Zeta Functions / 37 4.1 Where $n$ Is a Positive Integer / 37 4.2 Where $x$ Is a Real Number / 42 4.3 Two Results to End With / 44 Chapter Five: Gamma's Birthplace / 47 5.1 Advent / 47 5.2 Birth / 49 Chapter Six: The Gamma Function / 53 6.1 Exotic Definitions / 53 6.2 Yet Reasonable Definitions / 56 6.3 Gamma Meets Gamma / 57 6.4 Complement and Beauty / 58 Chapter Seven: Euler's Wonderful Identity / 61 7.1 The All-Important Formula / 61 7.2 And a Hint of Its Usefulness / 62 Chapter Eight: A Promise Fulfilled / 65 Chapter Nine: What Is Gamma Exactly? / 69 9.1 Gamma Exists / 69 9.2 Gamma Is What Number? 739.3 A Surprisingly Good Improvement / 75 9.4 The Germ of a Great Idea / 78 Chapter Ten: Gamma as a Decimal / 81 10.1 Bernoulli Numbers / 81 10.2 Euler--Maclaurin Summation / 85 10.3 Two Examples / 86 10.4 The Implications for Gamma / 88 Chapter Eleven: Gamma as a Fraction / 91 11.1 A Mystery / 91 11.2 A Challenge / 91 11.3 An Answer / 93 11.4 Three Results / 95 11.5 Irrationals / 95 11.6 Pell's Equation Solved / 97 11.7 Filling the Gaps / 98 11.8 The Harmonic Alternative / 98 Chapter Twelve: Where Is Gamma? / 101 12.1 The Alternating Harmonic Series Revisited / 101 12.2 In Analysis / 105 12.3 In Number Theory / 112 12.4 In Conjecture / 116 12.5 In Generalization / 116 Chapter Thirteen: It's a Harmonic World / 119 13.1 Ways of Means / 119 13.2 Geometric Harmony / 121 13.3 Musical Harmony / 123 13.4 Setting Records / 125 13.5 Testing to Destruction / 126 13.6 Crossing the Desert / 127 13.7 Shuffiing Cards / 127 13.8 Quicksort / 128 13.9 Collecting a Complete Set / 130 13.10 A Putnam Prize Question / 131 13.11 Maximum Possible Overhang / 132 13.12 Worm on a Band / 133 13.13 Optimal Choice / 134 Chapter Fourteen: It's a Logarithmic World / 139 14.1 A Measure of Uncertainty / 139 14.2 Benford's Law / 145 14.3 Continued-Fraction Behaviour / 155 Chapter Fifteen: Problems with Primes / 163 15.1 Some Hard Questions about Primes / 163 15.2 A Modest Start / 164 15.3 A Sort of Answer / 167 15.4 Picture the Problem / 169 15.5 The Sieve of Eratosthenes / 171 15.6 Heuristics / 172 15.7 A Letter / 174 15.8 The Harmonic Approximation / 179 15.9 Different-and Yet the Same / 180 15.10 There are Really Two Questions, Not Three / 182 15.11 Enter Chebychev with Some Good Ideas / 183 15.12 Enter Riemann, Followed by Proof(s) / 186 Chapter Sixteen: The Riemann Initiative / 189 16.1 Counting Primes the Riemann Way / 189 16.2 A New Mathematical Tool / 191 16.3 Analytic Continuation / 191 16.4 Riemann's Extension of the Zeta Function / 193 16.5 Zeta's Functional Equation / 193 16.6 The Zeros of Zeta / 193 16.7 The Evaluation of $Pi (x)$ and $pi (x)$ / 196 16.8 Misleading Evidence / 197 16.9 The Von Mangoldt Explicit Formula --- and How It Is Used to Prove the Prime Number Theorem / 200 16.10 The Riemann Hypothesis / 202 16.11 Why Is the Riemann Hypothesis Important? / 204 16.12 Real Alternatives / 206 16.13 A Back Route to Immortality-Partly Closed / 207 16.14 Incentives, Old and New / 210 16.15 Progress / 213 Appendix A: The Greek Alphabet / 217 Appendix B: Big Oh Notation / 219 Appendix C: Taylor Expansions / 221 C.1 Degree 1 / 221 C.2 Degree 2 / 221 C.3 Examples / 223 C.4 Convergence / 223 Appendix D: Complex Function Theory / 225 D.1 Complex Differentiation / 225 D.2 Weierstrass Function / 230 D.3 Complex Logarithms / 231 D.4 Complex Integration / 232 D.5 A Useful Inequality / 235 D.6 The Indefinite Integral / 235 D.7 The Seminal Result / 237 D.8 An Astonishing Consequence / 238 D.9 Taylor Expansions-and an Important Consequence / 239 D.10 Laurent Expansions --- and Another Important Consequence / 242 D.11 The Calculus of Residues / 245 D.12 Analytic Continuation / 247 Appendix E: Application to the Zeta Function / 249 E.1 Zeta Analytically Continued / 249 E.2 Zeta's Functional Relationship / 253

rawabstract:
Among the myriad of constants that appear in mathematics, $ \pi $, $e$, and $i$ are the most familiar. Following closely behind is $ \gamma $ or gamma, a constant that arises in many mathematical areas yet maintains a profound sense of mystery. In a tantalizing blend of history and mathematics, Julian Havil takes the reader on a journey through logarithms and the harmonic series, the two defining elements of gamma, toward the first account of gamma's place in mathematics. Introduced by the Swiss mathematician Leonhard Euler (1707--1783), who figures prominently in this book, gamma is defined as the limit of the sum of $ 1 + 1 / 2 + 1 / 3 + \cdots + 1 / n - \ln n$, the numerical value being $ 0.5772156 \ldots {}$. But unlike its more celebrated colleagues $ \pi $ and $e$, the exact nature of gamma remains a mystery --- we don't even know if it can be expressed as a fraction. Among the numerous topics that arise during this historical odyssey into fundamental mathematical ideas are the Prime Number Theorem and the most important open problem in mathematics today, the Riemann Hypothesis (though no proof of either is offered!). Sure to be popular with not only students and instructors but all math aficionados, Gamma takes us through countries, centuries, lives, and works, unfolding along the way the stories of some remarkable mathematics from some remarkable mathematicians.

rawTOC:
Foreword / xv \\ Acknowledgements / xvii \\ Introduction / xix \\ Chapter One: The Logarithmic Cradle / 1 \\ 1.1 A Mathematical Nightmare- and an Awakening / 1 \\ 1.2 The Baron's Wonderful Canon / 4 \\ 1.3 A Touch of Kepler / 11 \\ 1.4 A Touch of Euler / 13 \\ 1.5 Napier's Other Ideas / 16 \\ Chapter Two: The Harmonic Series / 21 \\ 2.1 The Principle / 21 \\ 2.2 Generating Function for $H_n$ / 21 \\ 2.3 Three Surprising Results / 22 \\ Chapter Three: Sub-Harmonic Series / 27 \\ 3.1 A Gentle Start / 27 \\ 3.2 Harmonic Series of Primes / 28 \\ 3.3 The Kempner Series / 31 \\ 3.4 Madelung's Constants / 33 \\ Chapter Four: Zeta Functions / 37 \\ 4.1 Where $n$ Is a Positive Integer / 37 \\ 4.2 Where $x$ Is a Real Number / 42 \\ 4.3 Two Results to End With / 44 \\ Chapter Five: Gamma's Birthplace / 47 \\ 5.1 Advent / 47 \\ 5.2 Birth / 49 \\ Chapter Six: The Gamma Function / 53 \\ 6.1 Exotic Definitions / 53 \\ 6.2 Yet Reasonable Definitions / 56 \\ 6.3 Gamma Meets Gamma / 57 \\ 6.4 Complement and Beauty / 58 \\ Chapter Seven: Euler's Wonderful Identity / 61 \\ 7.1 The All-Important Formula / 61 \\ 7.2 And a Hint of Its Usefulness / 62 \\ Chapter Eight: A Promise Fulfilled / 65 \\ Chapter Nine: What Is Gamma Exactly? / 69 \\ 9.1 Gamma Exists / 69 \\ 9.2 Gamma Is What Number? 739.3 A Surprisingly Good Improvement / 75 \\ 9.4 The Germ of a Great Idea / 78 \\ Chapter Ten: Gamma as a Decimal / 81 \\ 10.1 Bernoulli Numbers / 81 \\ 10.2 Euler--Maclaurin Summation / 85 \\ 10.3 Two Examples / 86 \\ 10.4 The Implications for Gamma / 88 \\ Chapter Eleven: Gamma as a Fraction / 91 \\ 11.1 A Mystery / 91 \\ 11.2 A Challenge / 91 \\ 11.3 An Answer / 93 \\ 11.4 Three Results / 95 \\ 11.5 Irrationals / 95 \\ 11.6 Pell's Equation Solved / 97 \\ 11.7 Filling the Gaps / 98 \\ 11.8 The Harmonic Alternative / 98 \\ Chapter Twelve: Where Is Gamma? / 101 \\ 12.1 The Alternating Harmonic Series Revisited / 101 \\ 12.2 In Analysis / 105 \\ 12.3 In Number Theory / 112 \\ 12.4 In Conjecture / 116 \\ 12.5 In Generalization / 116 \\ Chapter Thirteen: It's a Harmonic World / 119 \\ 13.1 Ways of Means / 119 \\ 13.2 Geometric Harmony / 121 \\ 13.3 Musical Harmony / 123 \\ 13.4 Setting Records / 125 \\ 13.5 Testing to Destruction / 126 \\ 13.6 Crossing the Desert / 127 \\ 13.7 Shuffiing Cards / 127 \\ 13.8 Quicksort / 128 \\ 13.9 Collecting a Complete Set / 130 \\ 13.10 A Putnam Prize Question / 131 \\ 13.11 Maximum Possible Overhang / 132 \\ 13.12 Worm on a Band / 133 \\ 13.13 Optimal Choice / 134 \\ Chapter Fourteen: It's a Logarithmic World / 139 \\ 14.1 A Measure of Uncertainty / 139 \\ 14.2 Benford's Law / 145 \\ 14.3 Continued-Fraction Behaviour / 155 \\ Chapter Fifteen: Problems with Primes / 163 \\ 15.1 Some Hard Questions about Primes / 163 \\ 15.2 A Modest Start / 164 \\ 15.3 A Sort of Answer / 167 \\ 15.4 Picture the Problem / 169 \\ 15.5 The Sieve of Eratosthenes / 171 \\ 15.6 Heuristics / 172 \\ 15.7 A Letter / 174 \\ 15.8 The Harmonic Approximation / 179 \\ 15.9 Different-and Yet the Same / 180 \\ 15.10 There are Really Two Questions, Not Three / 182 \\ 15.11 Enter Chebychev with Some Good Ideas / 183 \\ 15.12 Enter Riemann, Followed by Proof(s) / 186 \\ Chapter Sixteen: The Riemann Initiative / 189 \\ 16.1 Counting Primes the Riemann Way / 189 \\ 16.2 A New Mathematical Tool / 191 \\ 16.3 Analytic Continuation / 191 \\ 16.4 Riemann's Extension of the Zeta Function / 193 \\ 16.5 Zeta's Functional Equation / 193 \\ 16.6 The Zeros of Zeta / 193 \\ 16.7 The Evaluation of $\Pi(x)$ and $\pi(x)$ / 196 \\ 16.8 Misleading Evidence / 197 \\ 16.9 The Von Mangoldt Explicit Formula --- and How It Is Used to Prove the Prime Number Theorem / 200 \\ 16.10 The Riemann Hypothesis / 202 \\ 16.11 Why Is the Riemann Hypothesis Important? / 204 \\ 16.12 Real Alternatives / 206 \\ 16.13 A Back Route to Immortality-Partly Closed / 207 \\ 16.14 Incentives, Old and New / 210 \\ 16.15 Progress / 213 \\ Appendix A: The Greek Alphabet / 217 \\ Appendix B: Big Oh Notation / 219 \\ Appendix C: Taylor Expansions / 221 \\ C.1 Degree 1 / 221 \\ C.2 Degree 2 / 221 \\ C.3 Examples / 223 \\ C.4 Convergence / 223 \\ Appendix D: Complex Function Theory / 225 \\ D.1 Complex Differentiation / 225 \\ D.2 Weierstrass Function / 230 \\ D.3 Complex Logarithms / 231 \\ D.4 Complex Integration / 232 \\ D.5 A Useful Inequality / 235 \\ D.6 The Indefinite Integral / 235 \\ D.7 The Seminal Result / 237 \\ D.8 An Astonishing Consequence / 238 \\ D.9 Taylor Expansions-and an Important Consequence / 239 \\ D.10 Laurent Expansions --- and Another Important Consequence / 242 \\ D.11 The Calculus of Residues / 245 \\ D.12 Analytic Continuation / 247 \\ Appendix E: Application to the Zeta Function / 249 \\ E.1 Zeta Analytically Continued / 249 \\ E.2 Zeta's Functional Relationship / 253

entry:
@Book{Havil:2003:GEE,
  author =       "Julian Havil",
  title =        "{Gamma}: Exploring {Euler}'s Constant",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xxiii + 266",
  year =         "2003",
  ISBN =         "0-691-09983-9",
  ISBN-13 =      "978-0-691-09983-5",
  LCCN =         "QA41 .H23 2003",
  bibdate =      "Thu Sep 25 16:52:46 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$29.95",
  URL =          "http://www.loc.gov/catdir/description/prin031/2002192453.html",
  abstract =     "Among the myriad of constants that appear in
                 mathematics, $ \pi $, $e$, and $i$ are the most
                 familiar. Following closely behind is $ \gamma $ or
                 gamma, a constant that arises in many mathematical
                 areas yet maintains a profound sense of mystery. In a
                 tantalizing blend of history and mathematics, Julian
                 Havil takes the reader on a journey through logarithms
                 and the harmonic series, the two defining elements of
                 gamma, toward the first account of gamma's place in
                 mathematics. Introduced by the Swiss mathematician
                 Leonhard Euler (1707--1783), who figures prominently in
                 this book, gamma is defined as the limit of the sum of
                 $ 1 + 1 / 2 + 1 / 3 + \cdots + 1 / n - \ln n$, the
                 numerical value being $ 0.5772156 \ldots {}$. But
                 unlike its more celebrated colleagues $ \pi $ and $e$,
                 the exact nature of gamma remains a mystery --- we
                 don't even know if it can be expressed as a fraction.
                 Among the numerous topics that arise during this
                 historical odyssey into fundamental mathematical ideas
                 are the Prime Number Theorem and the most important
                 open problem in mathematics today, the Riemann
                 Hypothesis (though no proof of either is offered!).
                 Sure to be popular with not only students and
                 instructors but all math aficionados, Gamma takes us
                 through countries, centuries, lives, and works,
                 unfolding along the way the stories of some remarkable
                 mathematics from some remarkable mathematicians.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword / xv \\
                 Acknowledgements / xvii \\
                 Introduction / xix \\
                 Chapter One: The Logarithmic Cradle / 1 \\
                 1.1 A Mathematical Nightmare- and an Awakening / 1 \\
                 1.2 The Baron's Wonderful Canon / 4 \\
                 1.3 A Touch of Kepler / 11 \\
                 1.4 A Touch of Euler / 13 \\
                 1.5 Napier's Other Ideas / 16 \\
                 Chapter Two: The Harmonic Series / 21 \\
                 2.1 The Principle / 21 \\
                 2.2 Generating Function for $H_n$ / 21 \\
                 2.3 Three Surprising Results / 22 \\
                 Chapter Three: Sub-Harmonic Series / 27 \\
                 3.1 A Gentle Start / 27 \\
                 3.2 Harmonic Series of Primes / 28 \\
                 3.3 The Kempner Series / 31 \\
                 3.4 Madelung's Constants / 33 \\
                 Chapter Four: Zeta Functions / 37 \\
                 4.1 Where $n$ Is a Positive Integer / 37 \\
                 4.2 Where $x$ Is a Real Number / 42 \\
                 4.3 Two Results to End With / 44 \\
                 Chapter Five: Gamma's Birthplace / 47 \\
                 5.1 Advent / 47 \\
                 5.2 Birth / 49 \\
                 Chapter Six: The Gamma Function / 53 \\
                 6.1 Exotic Definitions / 53 \\
                 6.2 Yet Reasonable Definitions / 56 \\
                 6.3 Gamma Meets Gamma / 57 \\
                 6.4 Complement and Beauty / 58 \\
                 Chapter Seven: Euler's Wonderful Identity / 61 \\
                 7.1 The All-Important Formula / 61 \\
                 7.2 And a Hint of Its Usefulness / 62 \\
                 Chapter Eight: A Promise Fulfilled / 65 \\
                 Chapter Nine: What Is Gamma Exactly? / 69 \\
                 9.1 Gamma Exists / 69 \\
                 9.2 Gamma Is What Number? 739.3 A Surprisingly Good
                 Improvement / 75 \\
                 9.4 The Germ of a Great Idea / 78 \\
                 Chapter Ten: Gamma as a Decimal / 81 \\
                 10.1 Bernoulli Numbers / 81 \\
                 10.2 Euler--Maclaurin Summation / 85 \\
                 10.3 Two Examples / 86 \\
                 10.4 The Implications for Gamma / 88 \\
                 Chapter Eleven: Gamma as a Fraction / 91 \\
                 11.1 A Mystery / 91 \\
                 11.2 A Challenge / 91 \\
                 11.3 An Answer / 93 \\
                 11.4 Three Results / 95 \\
                 11.5 Irrationals / 95 \\
                 11.6 Pell's Equation Solved / 97 \\
                 11.7 Filling the Gaps / 98 \\
                 11.8 The Harmonic Alternative / 98 \\
                 Chapter Twelve: Where Is Gamma? / 101 \\
                 12.1 The Alternating Harmonic Series Revisited / 101
                 \\
                 12.2 In Analysis / 105 \\
                 12.3 In Number Theory / 112 \\
                 12.4 In Conjecture / 116 \\
                 12.5 In Generalization / 116 \\
                 Chapter Thirteen: It's a Harmonic World / 119 \\
                 13.1 Ways of Means / 119 \\
                 13.2 Geometric Harmony / 121 \\
                 13.3 Musical Harmony / 123 \\
                 13.4 Setting Records / 125 \\
                 13.5 Testing to Destruction / 126 \\
                 13.6 Crossing the Desert / 127 \\
                 13.7 Shuffiing Cards / 127 \\
                 13.8 Quicksort / 128 \\
                 13.9 Collecting a Complete Set / 130 \\
                 13.10 A Putnam Prize Question / 131 \\
                 13.11 Maximum Possible Overhang / 132 \\
                 13.12 Worm on a Band / 133 \\
                 13.13 Optimal Choice / 134 \\
                 Chapter Fourteen: It's a Logarithmic World / 139 \\
                 14.1 A Measure of Uncertainty / 139 \\
                 14.2 Benford's Law / 145 \\
                 14.3 Continued-Fraction Behaviour / 155 \\
                 Chapter Fifteen: Problems with Primes / 163 \\
                 15.1 Some Hard Questions about Primes / 163 \\
                 15.2 A Modest Start / 164 \\
                 15.3 A Sort of Answer / 167 \\
                 15.4 Picture the Problem / 169 \\
                 15.5 The Sieve of Eratosthenes / 171 \\
                 15.6 Heuristics / 172 \\
                 15.7 A Letter / 174 \\
                 15.8 The Harmonic Approximation / 179 \\
                 15.9 Different-and Yet the Same / 180 \\
                 15.10 There are Really Two Questions, Not Three / 182
                 \\
                 15.11 Enter Chebychev with Some Good Ideas / 183 \\
                 15.12 Enter Riemann, Followed by Proof(s) / 186 \\
                 Chapter Sixteen: The Riemann Initiative / 189 \\
                 16.1 Counting Primes the Riemann Way / 189 \\
                 16.2 A New Mathematical Tool / 191 \\
                 16.3 Analytic Continuation / 191 \\
                 16.4 Riemann's Extension of the Zeta Function / 193 \\
                 16.5 Zeta's Functional Equation / 193 \\
                 16.6 The Zeros of Zeta / 193 \\
                 16.7 The Evaluation of $\Pi(x)$ and $\pi(x)$ / 196 \\
                 16.8 Misleading Evidence / 197 \\
                 16.9 The Von Mangoldt Explicit Formula --- and How It
                 Is Used to Prove the Prime Number Theorem / 200 \\
                 16.10 The Riemann Hypothesis / 202 \\
                 16.11 Why Is the Riemann Hypothesis Important? / 204
                 \\
                 16.12 Real Alternatives / 206 \\
                 16.13 A Back Route to Immortality-Partly Closed / 207
                 \\
                 16.14 Incentives, Old and New / 210 \\
                 16.15 Progress / 213 \\
                 Appendix A: The Greek Alphabet / 217 \\
                 Appendix B: Big Oh Notation / 219 \\
                 Appendix C: Taylor Expansions / 221 \\
                 C.1 Degree 1 / 221 \\
                 C.2 Degree 2 / 221 \\
                 C.3 Examples / 223 \\
                 C.4 Convergence / 223 \\
                 Appendix D: Complex Function Theory / 225 \\
                 D.1 Complex Differentiation / 225 \\
                 D.2 Weierstrass Function / 230 \\
                 D.3 Complex Logarithms / 231 \\
                 D.4 Complex Integration / 232 \\
                 D.5 A Useful Inequality / 235 \\
                 D.6 The Indefinite Integral / 235 \\
                 D.7 The Seminal Result / 237 \\
                 D.8 An Astonishing Consequence / 238 \\
                 D.9 Taylor Expansions-and an Important Consequence /
                 239 \\
                 D.10 Laurent Expansions --- and Another Important
                 Consequence / 242 \\
                 D.11 The Calculus of Residues / 245 \\
                 D.12 Analytic Continuation / 247 \\
                 Appendix E: Application to the Zeta Function / 249 \\
                 E.1 Zeta Analytically Continued / 249 \\
                 E.2 Zeta's Functional Relationship / 253",
}


bibtype: book
filename: master.bib
label: Hawking:2005:GCI
author: Stephen Hawking
title: God created the integers: the mathematical breakthroughs that changed history
publisher: Running Press Book Publishers
address: Philadelphia, PA; London, UK
pages: xiii + 1160
year: 2005
ISBN: 0-7624-1922-9 (hardcover) OR 0762419229 (hardcover)
ISBN13: 978-0-7624-1922-7 (hardcover) OR 9780762419227 (hardcover)
LCCN: QA21 .G63 2005
bibdate: Wed Oct 26 15:10:09 MDT 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2005.10.26 15:10:09 MDT
URL: http://www.perseusbooksgroup.com/runningpress/book_detail.jsp?isbn=0762419229
acknowledgement: ack-nhfb
rawauthor: Stephen Hawking
rawtitle: {God} created the integers: the mathematical breakthroughs that changed history
remark:
From the publisher: ``Stephen Hawking explores the `masterpieces' of mathematics, 25 landmarks spanning 2,500 years and representing the work of 15 mathematicians, including Augustin Cauchy, Bernard Riemann, and Alan Turing.''

TOC:
Euclid (ca. 325BCE--265BCE) Archimedes (287BCE--212BC) Diophantus (Third Century AD) Rene Descartes (1596--1650) Isaac Newton (1642--1727) Pierre Simon de LaPlace (1749--1827) Jean Baptiste Joseph Fourier (1768--1830) Carl Friedrich Gauss (1777--1855) Augustin-Louis Cauchy (1789--1857) George Boole (1815--1864) Georg Friedrich Berhard Riemann (1826--1866) Karl Weierstrass (1815--1897) Richard Julius Wilhelm Dedekind (1831--1916) Georg Cantor (1845--1918) Henri Lebesgue (1875--1941) Kurt Godel (1906--1978) Alan Mathison Turing (1912--1954)

rawTOC:
Euclid (ca. 325BCE--265BCE) \\ Archimedes (287BCE--212BC) \\ Diophantus (Third Century AD) \\ Ren{\'e} Descartes (1596--1650) \\ Isaac Newton (1642--1727) \\ Pierre Simon de LaPlace (1749--1827) \\ Jean Baptiste Joseph Fourier (1768--1830) \\ Carl Friedrich Gauss (1777--1855) \\ Augustin-Louis Cauchy (1789--1857) \\ George Boole (1815--1864) \\ Georg Friedrich Berhard Riemann (1826--1866) \\ Karl Weierstrass (1815--1897) \\ Richard Julius Wilhelm Dedekind (1831--1916) \\ Georg Cantor (1845--1918) \\ Henri Lebesgue (1875--1941) \\ Kurt G{\"o}del (1906--1978) \\ Alan Mathison Turing (1912--1954)

entry:
@Book{Hawking:2005:GCI,
  author =       "Stephen Hawking",
  title =        "{God} created the integers: the mathematical
                 breakthroughs that changed history",
  publisher =    "Running Press Book Publishers",
  address =      "Philadelphia, PA; London, UK",
  pages =        "xiii + 1160",
  year =         "2005",
  ISBN =         "0-7624-1922-9 (hardcover)",
  ISBN-13 =      "978-0-7624-1922-7 (hardcover)",
  LCCN =         "QA21 .G63 2005",
  bibdate =      "Wed Oct 26 15:10:09 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$29.95",
  URL =          "http://www.perseusbooksgroup.com/runningpress/book_detail.jsp?isbn=0762419229",
  acknowledgement = ack-nhfb,
  remark =       "From the publisher: ``Stephen Hawking explores the
                 `masterpieces' of mathematics, 25 landmarks spanning
                 2,500 years and representing the work of 15
                 mathematicians, including Augustin Cauchy, Bernard
                 Riemann, and Alan Turing.''",
  tableofcontents = "Euclid (ca. 325BCE--265BCE) \\
                 Archimedes (287BCE--212BC) \\
                 Diophantus (Third Century AD) \\
                 Ren{\'e} Descartes (1596--1650) \\
                 Isaac Newton (1642--1727) \\
                 Pierre Simon de LaPlace (1749--1827) \\
                 Jean Baptiste Joseph Fourier (1768--1830) \\
                 Carl Friedrich Gauss (1777--1855) \\
                 Augustin-Louis Cauchy (1789--1857) \\
                 George Boole (1815--1864) \\
                 Georg Friedrich Berhard Riemann (1826--1866) \\
                 Karl Weierstrass (1815--1897) \\
                 Richard Julius Wilhelm Dedekind (1831--1916) \\
                 Georg Cantor (1845--1918) \\
                 Henri Lebesgue (1875--1941) \\
                 Kurt G{\"o}del (1906--1978) \\
                 Alan Mathison Turing (1912--1954)",
}


bibtype: book
filename: master.bib
label: Heal:1995:MVM
author: K. M. Heal and M. L. Hansen and K. M. Rickard
title: Maple V Mathematics Learning Guide
publisher: pub-SV
address: pub-SV:adr
pages: ix + 269
year: 1995
ISBN: 0-387-94536-9 OR 0387945369
ISBN13: 978-0-387-94536-1 OR 9780387945361
LCCN: QA155.7.E4 H42 1996
bibdate: Wed Dec 18 16:38:41 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1996.12.18 16:38:41 ???
note: With the editorial assistance of J. S. Devitt; based in part on the work of B. W. Char.
acknowledgement: ack-nhfb
rawauthor: K. M. Heal and M. L. Hansen and K. M. Rickard
rawnote: With the editorial assistance of J. S. Devitt; based in part on the work of B. W. Char.
rawtitle: {Maple V} Mathematics Learning Guide
abstract:
Mathematical environment for symbolic and numeric computation, two- and three-dimensional graphics, and programming. Features worksheet-based interface, animation, more than 2,500 built-in functions, and solutions to problems involving piecewise functions.

TOC:
Interactive use of Maple Mathematics with Maple: the basics Finding solutions Graphics Evaluation and simplification Examples from calculus Input and output

rawabstract:
Mathematical environment for symbolic and numeric computation, two- and three-dimensional graphics, and programming. Features worksheet-based interface, animation, more than 2,500 built-in functions, and solutions to problems involving piecewise functions.

rawTOC:
Interactive use of Maple \\ Mathematics with Maple: the basics \\ Finding solutions \\ Graphics \\ Evaluation and simplification \\ Examples from calculus \\ Input and output

entry:
@Book{Heal:1995:MVM,
  author =       "K. M. Heal and M. L. Hansen and K. M. Rickard",
  title =        "{Maple V} Mathematics Learning Guide",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "ix + 269",
  year =         "1995",
  ISBN =         "0-387-94536-9",
  ISBN-13 =      "978-0-387-94536-1",
  LCCN =         "QA155.7.E4 H42 1996",
  bibdate =      "Wed Dec 18 16:38:41 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "With the editorial assistance of J. S. Devitt; based
                 in part on the work of B. W. Char.",
  price =        "US\$24.00",
  abstract =     "Mathematical environment for symbolic and numeric
                 computation, two- and three-dimensional graphics, and
                 programming. Features worksheet-based interface,
                 animation, more than 2,500 built-in functions, and
                 solutions to problems involving piecewise functions.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Interactive use of Maple \\
                 Mathematics with Maple: the basics \\
                 Finding solutions \\
                 Graphics \\
                 Evaluation and simplification \\
                 Examples from calculus \\
                 Input and output",
}


bibtype: book
filename: master.bib
label: Heck:1993:IM
author: Andre Heck
title: Introduction to Maple
publisher: pub-SV
address: pub-SV:adr
pages: xiii + 497
year: 1993
ISBN: 0-387-97662-0 (New York), 3-540-97662-0 (Berlin) OR 0387976620 (New York), 3540976620 (Berlin)
LCCN: QA155.7.E4H43 1993
bibdate: Tue Dec 14 22:55:13 1993
bibtimestamp: 1993.12.14 22:55:13 ???
acknowledgement: ack-nhfb
rawauthor: Andr{\'e} Heck
rawtitle: Introduction to {Maple}
ISBN13:
978-0-387-97662-4 (New York), 978-3-540-97662-2 (Berlin) OR 9780387976624 (New York), 9783540976622 (Berlin)

abstract:
A modern computer algebra system that automates the symbolic, numeric, and graphical computation involved in mathematical problem solving. It provides a gentle presentation of this computer algebra system.

TOC:
Introduction to computer algebra The first steps: calculus on numbers Variables and names Getting around with Maple Polynomials and rational functions Internal data representation and substitution Manipulation of polynomials and rational expressions Functions Differentiation Integration and summation Truncated series expansions, power series, and limits Composite data types Simplification Graphics Solving equations Differential equations Linear algebra: basics Linear algebra: applications

rawabstract:
A modern computer algebra system that automates the symbolic, numeric, and graphical computation involved in mathematical problem solving. It provides a gentle presentation of this computer algebra system.

rawTOC:
Introduction to computer algebra \\ The first steps: calculus on numbers \\ Variables and names \\ Getting around with Maple \\ Polynomials and rational functions \\ Internal data representation and substitution \\ Manipulation of polynomials and rational expressions \\ Functions \\ Differentiation \\ Integration and summation \\ Truncated series expansions, power series, and limits \\ Composite data types \\ Simplification \\ Graphics \\ Solving equations \\ Differential equations \\ Linear algebra: basics \\ Linear algebra: applications

entry:
@Book{Heck:1993:IM,
  author =       "Andr{\'e} Heck",
  title =        "Introduction to {Maple}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiii + 497",
  year =         "1993",
  ISBN =         "0-387-97662-0 (New York), 3-540-97662-0 (Berlin)",
  ISBN-13 =      "978-0-387-97662-4 (New York), 978-3-540-97662-2
                 (Berlin)",
  LCCN =         "QA155.7.E4H43 1993",
  bibdate =      "Tue Dec 14 22:55:13 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "A modern computer algebra system that automates the
                 symbolic, numeric, and graphical computation involved
                 in mathematical problem solving. It provides a gentle
                 presentation of this computer algebra system.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction to computer algebra \\
                 The first steps: calculus on numbers \\
                 Variables and names \\
                 Getting around with Maple \\
                 Polynomials and rational functions \\
                 Internal data representation and substitution \\
                 Manipulation of polynomials and rational expressions
                 \\
                 Functions \\
                 Differentiation \\
                 Integration and summation \\
                 Truncated series expansions, power series, and limits
                 \\
                 Composite data types \\
                 Simplification \\
                 Graphics \\
                 Solving equations \\
                 Differential equations \\
                 Linear algebra: basics \\
                 Linear algebra: applications",
}


bibtype: book
filename: master.bib
label: Heck:1996:IM
author: Andre Heck
title: Introduction to Maple
publisher: pub-SV
address: pub-SV:adr
edition: Second
pages: xx + 699
year: 1996
DOI: https://doi.org/10.1007/978-1-4684-0484-5
LCCN: QA155.7.E4H43 1993
MRclass: 65-01, 65B10, 65D18, 65Dxx, 65Fxx, 65Lxx, 68-01, 68N15, 68W30, 68NXX
MRnumber: MR1405611 (97c:68076)
bibdate: Tue Jun 06 17:57:02 1995
bibtimestamp: 1995.06.06 17:57:02 ???
acknowledgement: ack-nhfb
rawauthor: Andr{\'e} Heck
rawtitle: Introduction to {Maple}
ISBN:
0-387-94535-0 (hardcover), 1-4684-0484-9, 1-4684-0486-5 OR 0387945350 (hardcover), 1468404849, 1468404865

ISBN13:
978-0-387-94535-4 (hardcover), 978-1-4684-0484-5, 978-1-4684-0486-9 OR 9780387945354 (hardcover), 9781468404845, 9781468404869

bibsource:
https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/maple-extract.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
The first edition of this book has been very well received by the community. The new version 4 of Maple V contains so many new mathematical features and improvements in the user interface that Waterloo Maple Inc. markets it as ``the Power Edition.'' These two facts have made it necessary to write a second edition within a short period of the first. I corrected typographical errors, rephrased text, updated and improved many examples, and added much new material. Hardly any chapter has been left untouched. Substantially changed or added sections and chapters address the assume facility, I/O, approximation theory, integration, composite data types, simplification, graphics, differential equations, and matrix algebra. Tables summarize features, command options, etc., and constitute a quick reference. The enlarged index of the book has been carefully compiled to make locating search items quick and easy. Many new examples have been included showing how to use Maple as a problem solver, how to assist the system during computations, and how to extend its built-in facilities. About the Maple Version Used: The second edition of this book is fully revised and updated to Maple V Release 4. More precisely, the second edition of this book was produced with Maple V Release 4, beta 3 on a SUN SPARCstation 20, Model 71. There should be hardly any difference between this beta version and the final release; only minor differences in the user interface are not excluded.

TOC:
Preface to the Second Edition / v Preface to the First Edition / ix List of Tables / xix 1 Introduction to Computer Algebra / 1 1.1 What is Computer Algebra? / 1 1.2 Computer Algebra Systems / 2 1.3 Some Properties of Computer Algebra Systems / 5 1.4 Advantages of Computer Algebra / 11 1.5 Limitations of Computer Algebra / 24 1.6 Design of Maple / 30 2 The First Steps: Calculus on Numbers / 35 2.1 Getting Started / 35 2.2 Getting Help / 38 2.3 Integers and Rational Numbers / 44 2.4 Irrational Numbers and Floating-Point Numbers / 48 2.5 Algebraic Numbers / 54 2.6 Complex Numbers / 59 2.7 Exercises / 63 3 Variables and Names / 65 3.1 Assignment and Unassignment / 65 3.2 Evaluation / 73 3.3 Names of Variables / 77 3.4 Basic Data Types / 82 3.5 Attributes / 86 3.6 Properties / 87 3.7 Exercises / 92 4 Getting Around with Maple / 95 4.1 Maple Input and Output / 95 4.2 The Maple Library / 101 4.3 Reading and Writing Files / 105 4.4 Importing and Exporting Numerical Data / 110 4.5 Low-Level I/O / 113 4.6 Code Generation / 123 4.7 Changing Maple to Your Own Taste / 129 4.8 Exercises / 133 5 Polynomials and Rational Functions / 135 5.1 Univariate Polynomials / 135 5.2 Multivariate Polynomials / 140 5.3 Rational Functions / 142 5.4 Conversions / 144 5.5 Exercises / 147 6 Internal Data Representation and Substitution / 149 6.1 Internal Representation of Polynomials / 149 6.2 Generalized Rational Expressions / 155 6.3 Substitution / 158 6.4 Exercises / 170 7 Manipulation of Polynomials and Rational Expressions / 173 7.1 Expansion / 173 7.2 Factorization / 176 7.3 Canonical Form and Normal Form / 179 7.4 Normalization / 181 7.5 Collection / 183 7.6 Sorting / 186 7.7 Exercises / 186 8 Functions / 189 8.1 Mathematical Functions / 189 8.2 Arrow Operators / 193 8.3 Piecewise Defined Functions / 195 8.4 Maple Procedures / 202 8.5 Recursive Procedure Definitions / 204 8.6 unapply / 209 8.7 Operations on Functions / 210 8.8 Anonymous Functions / 211 8.9 Exercises / 212 9 Differentiation / 213 9.1 Symbolic Differentiation / 213 9.2 Automatic Differentiation / 221 9.3 Exercises / 224 10 Integration and Summation / 227 10.1 Indefinite Integration / 227 10.2 Definite Integration / 236 10.3 Numerical Integration / 241 10.4 Integral Transforms / 242 10.5 Assisting Maple's Integrator / 252 10.6 Summation / 256 10.7 Exercises / 261 11 Series, Approximation, and Limits / 267 11.1 Truncated Series / 267 11.2 Approximation of Functions / 278 11.3 Power Series / 285 11.4 Limits / 288 11.5 Exercises / 291 12 Composite Data Types / 293 12.1 Sequence / 293 12.2 Set / 296 12.3 List / 298 12.4 Array / 304 12.5 Table / 310 12.6 Last Name Evaluation / 314 12.7 Function Call / 317 12.8 Conversion Between Composite Data Types / 319 12.9 Exercises / 322 13 The Assume Facility / 325 13.1 The Need for an Assume Facility / 325 13.2 Basics of assume / 329 13.3 An Algebra of Properties / 332 13.4 Implementation of assume / 335 13.5 Exercises / 340 13.6 Hierarchy of Properties / 340 14 Simplification / 343 14.1 Automatic Simplification / 344 14.2 expand / 346 14.3 combine / 353 14.4 simplify / 358 14.5 convert / 364 14.6 Trigonometrie Simplification / 367 14.7 Simplification w.r.t. Side Relations / 370 14.8 Control Over Simplification / 374 14.9 Defining Your Own Simplification Routines / 378 14.10 Exercises / 383 14.11 Simplification Chart / 385 15 Graphics / 387 15.1 Some Basic Two-Dimensional Plots / 389 15.2 Options of plot / 393 15.3 The Structure of Two-Dimensional Graphics / 406 15.4 The plottools Package / 412 15.5 Special Two-Dimensional Plots / 416 15.6 Two-Dimensional Geometry / 429 15.7 Plot Aliasing / 432 15.8 A Common Mistake / 433 15.9 Some Basic Three-Dimensional Plots / 434 15.10 Options of plot3d / 436 15.11 The Structure of Three-Dimensional Graphics / 444 15.12 Special Three-Dimensional Plots / 449 15.13 Data Plotting / 457 15.14 Animation / 467 15.15 List of Plot Options / 469 15.16 Exercises / 475 16 Solving Equations / 479 16.1 Equations in One Unknown / 479 16.2 Abbreviations in solve / 480 16.3 Some Difficulties / 481 16.4 Systems of Equations / 488 16.5 The Grobner Basis Method / 499 16.6 Inequalities / 505 16.7 Numerical Solvers / 507 16.8 Other Solvers in Maple / 509 16.9 Exercises / 515 17 Differential Equations / 519 17.1 First Glance at ODEs / 519 17.2 Analytic Solutions / 520 17.3 Taylor Series Method / 532 17.4 Power Series Method / 534 17.5 Numerical Solutions / 536 17.6 DEtools / 548 17.7 Perturbation Methods / 555 17.8 Partial Differential Equations / 567 17.9 Lie Point Symmetries of PDEs / 569 17.10 Exercises / 572 18 Linear Algebra: The l i n a i g Package / 575 18.1 Loading the l i n a i g Package / 575 18.2 Creating New Vectors and Matrices / 576 18.3 Vector and Matrix Arithmetic / 580 18.4 Basic Matrix Functions / 584 18.5 Structural Operations / 589 18.6 Vector Operations / 592 18.7 Standard Forms of Matrices / 592 18.8 Exercises / 597 19 Linear Algebra: Applications / 601 19.1 Kinematics of the Stanford Manipulator / 601 19.2 A Three-Compartment Model of Cadmium Transfer / 606 19.3 Molecular-Orbital Huckel Theory / 618 19.4 Vector Analysis / 623 19.5 Moore--Penrose Inverse / 631 19.6 Exercises / 633 References / 635 Index / 651

rawabstract:
The first edition of this book has been very well received by the community. The new version 4 of Maple V contains so many new mathematical features and improvements in the user interface that Waterloo Maple Inc. markets it as ``the Power Edition.'' These two facts have made it necessary to write a second edition within a short period of the first. I corrected typographical errors, rephrased text, updated and improved many examples, and added much new material. Hardly any chapter has been left untouched. Substantially changed or added sections and chapters address the assume facility, I/O, approximation theory, integration, composite data types, simplification, graphics, differential equations, and matrix algebra. Tables summarize features, command options, etc., and constitute a quick reference. The enlarged index of the book has been carefully compiled to make locating search items quick and easy. Many new examples have been included showing how to use Maple as a problem solver, how to assist the system during computations, and how to extend its built-in facilities. About the Maple Version Used: The second edition of this book is fully revised and updated to Maple V Release 4. More precisely, the second edition of this book was produced with Maple V Release 4, beta 3 on a SUN SPARCstation 20, Model 71. There should be hardly any difference between this beta version and the final release; only minor differences in the user interface are not excluded.

rawTOC:
Preface to the Second Edition / v \\ Preface to the First Edition / ix \\ List of Tables / xix \\ 1 Introduction to Computer Algebra / 1 \\ 1.1 What is Computer Algebra? / 1 \\ 1.2 Computer Algebra Systems / 2 \\ 1.3 Some Properties of Computer Algebra Systems / 5 \\ 1.4 Advantages of Computer Algebra / 11 \\ 1.5 Limitations of Computer Algebra / 24 \\ 1.6 Design of Maple / 30 \\ 2 The First Steps: Calculus on Numbers / 35 \\ 2.1 Getting Started / 35 \\ 2.2 Getting Help / 38 \\ 2.3 Integers and Rational Numbers / 44 \\ 2.4 Irrational Numbers and Floating-Point Numbers / 48 \\ 2.5 Algebraic Numbers / 54 \\ 2.6 Complex Numbers / 59 \\ 2.7 Exercises / 63 \\ 3 Variables and Names / 65 \\ 3.1 Assignment and Unassignment / 65 \\ 3.2 Evaluation / 73 \\ 3.3 Names of Variables / 77 \\ 3.4 Basic Data Types / 82 \\ 3.5 Attributes / 86 \\ 3.6 Properties / 87 \\ 3.7 Exercises / 92 \\ 4 Getting Around with Maple / 95 \\ 4.1 Maple Input and Output / 95 \\ 4.2 The Maple Library / 101 \\ 4.3 Reading and Writing Files / 105 \\ 4.4 Importing and Exporting Numerical Data / 110 \\ 4.5 Low-Level I/O / 113 \\ 4.6 Code Generation / 123 \\ 4.7 Changing Maple to Your Own Taste / 129 \\ 4.8 Exercises / 133 \\ 5 Polynomials and Rational Functions / 135 \\ 5.1 Univariate Polynomials / 135 \\ 5.2 Multivariate Polynomials / 140 \\ 5.3 Rational Functions / 142 \\ 5.4 Conversions / 144 \\ 5.5 Exercises / 147 \\ 6 Internal Data Representation and Substitution / 149 \\ 6.1 Internal Representation of Polynomials / 149 \\ 6.2 Generalized Rational Expressions / 155 \\ 6.3 Substitution / 158 \\ 6.4 Exercises / 170 \\ 7 Manipulation of Polynomials and Rational Expressions / 173 \\ 7.1 Expansion / 173 \\ 7.2 Factorization / 176 \\ 7.3 Canonical Form and Normal Form / 179 \\ 7.4 Normalization / 181 \\ 7.5 Collection / 183 \\ 7.6 Sorting / 186 \\ 7.7 Exercises / 186 \\ 8 Functions / 189 \\ 8.1 Mathematical Functions / 189 \\ 8.2 Arrow Operators / 193 \\ 8.3 Piecewise Defined Functions / 195 \\ 8.4 Maple Procedures / 202 \\ 8.5 Recursive Procedure Definitions / 204 \\ 8.6 unapply / 209 \\ 8.7 Operations on Functions / 210 \\ 8.8 Anonymous Functions / 211 \\ 8.9 Exercises / 212 \\ 9 Differentiation / 213 \\ 9.1 Symbolic Differentiation / 213 \\ 9.2 Automatic Differentiation / 221 \\ 9.3 Exercises / 224 \\ 10 Integration and Summation / 227 \\ 10.1 Indefinite Integration / 227 \\ 10.2 Definite Integration / 236 \\ 10.3 Numerical Integration / 241 \\ 10.4 Integral Transforms / 242 \\ 10.5 Assisting Maple's Integrator / 252 \\ 10.6 Summation / 256 \\ 10.7 Exercises / 261 \\ 11 Series, Approximation, and Limits / 267 \\ 11.1 Truncated Series / 267 \\ 11.2 Approximation of Functions / 278 \\ 11.3 Power Series / 285 \\ 11.4 Limits / 288 \\ 11.5 Exercises / 291 \\ 12 Composite Data Types / 293 \\ 12.1 Sequence / 293 \\ 12.2 Set / 296 \\ 12.3 List / 298 \\ 12.4 Array / 304 \\ 12.5 Table / 310 \\ 12.6 Last Name Evaluation / 314 \\ 12.7 Function Call / 317 \\ 12.8 Conversion Between Composite Data Types / 319 \\ 12.9 Exercises / 322 \\ 13 The Assume Facility / 325 \\ 13.1 The Need for an Assume Facility / 325 \\ 13.2 Basics of assume / 329 \\ 13.3 An Algebra of Properties / 332 \\ 13.4 Implementation of assume / 335 \\ 13.5 Exercises / 340 \\ 13.6 Hierarchy of Properties / 340 \\ 14 Simplification / 343 \\ 14.1 Automatic Simplification / 344 \\ 14.2 expand / 346 \\ 14.3 combine / 353 \\ 14.4 simplify / 358 \\ 14.5 convert / 364 \\ 14.6 Trigonometrie Simplification / 367 \\ 14.7 Simplification w.r.t. Side Relations / 370 \\ 14.8 Control Over Simplification / 374 \\ 14.9 Defining Your Own Simplification Routines / 378 \\ 14.10 Exercises / 383 \\ 14.11 Simplification Chart / 385 \\ 15 Graphics / 387 \\ 15.1 Some Basic Two-Dimensional Plots / 389 \\ 15.2 Options of plot / 393 \\ 15.3 The Structure of Two-Dimensional Graphics / 406 \\ 15.4 The plottools Package / 412 \\ 15.5 Special Two-Dimensional Plots / 416 \\ 15.6 Two-Dimensional Geometry / 429 \\ 15.7 Plot Aliasing / 432 \\ 15.8 A Common Mistake / 433 \\ 15.9 Some Basic Three-Dimensional Plots / 434 \\ 15.10 Options of plot3d / 436 \\ 15.11 The Structure of Three-Dimensional Graphics / 444 \\ 15.12 Special Three-Dimensional Plots / 449 \\ 15.13 Data Plotting / 457 \\ 15.14 Animation / 467 \\ 15.15 List of Plot Options / 469 \\ 15.16 Exercises / 475 \\ 16 Solving Equations / 479 \\ 16.1 Equations in One Unknown / 479 \\ 16.2 Abbreviations in solve / 480 \\ 16.3 Some Difficulties / 481 \\ 16.4 Systems of Equations / 488 \\ 16.5 The Gr{\"o}bner Basis Method / 499 \\ 16.6 Inequalities / 505 \\ 16.7 Numerical Solvers / 507 \\ 16.8 Other Solvers in Maple / 509 \\ 16.9 Exercises / 515 \\ 17 Differential Equations / 519 \\ 17.1 First Glance at ODEs / 519 \\ 17.2 Analytic Solutions / 520 \\ 17.3 Taylor Series Method / 532 \\ 17.4 Power Series Method / 534 \\ 17.5 Numerical Solutions / 536 \\ 17.6 DEtools / 548 \\ 17.7 Perturbation Methods / 555 \\ 17.8 Partial Differential Equations / 567 \\ 17.9 Lie Point Symmetries of PDEs / 569 \\ 17.10 Exercises / 572 \\ 18 Linear Algebra: The l i n a i g Package / 575 \\ 18.1 Loading the l i n a i g Package / 575 \\ 18.2 Creating New Vectors and Matrices / 576 \\ 18.3 Vector and Matrix Arithmetic / 580 \\ 18.4 Basic Matrix Functions / 584 \\ 18.5 Structural Operations / 589 \\ 18.6 Vector Operations / 592 \\ 18.7 Standard Forms of Matrices / 592 \\ 18.8 Exercises / 597 \\ 19 Linear Algebra: Applications / 601 \\ 19.1 Kinematics of the Stanford Manipulator / 601 \\ 19.2 A Three-Compartment Model of Cadmium Transfer / 606 \\ 19.3 Molecular-Orbital H{\"u}ckel Theory / 618 \\ 19.4 Vector Analysis / 623 \\ 19.5 Moore--Penrose Inverse / 631 \\ 19.6 Exercises / 633 \\ References / 635 \\ Index / 651

entry:
@Book{Heck:1996:IM,
  author =       "Andr{\'e} Heck",
  title =        "Introduction to {Maple}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xx + 699",
  year =         "1996",
  DOI =          "https://doi.org/10.1007/978-1-4684-0484-5",
  ISBN =         "0-387-94535-0 (hardcover), 1-4684-0484-9,
                 1-4684-0486-5",
  ISBN-13 =      "978-0-387-94535-4 (hardcover), 978-1-4684-0484-5,
                 978-1-4684-0486-9",
  LCCN =         "QA155.7.E4H43 1993",
  MRclass =      "65-01, 65B10, 65D18, 65Dxx, 65Fxx, 65Lxx, 68-01,
                 68N15, 68W30, 68NXX",
  MRnumber =     "MR1405611 (97c:68076)",
  bibdate =      "Tue Jun 06 17:57:02 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$39.00",
  abstract =     "The first edition of this book has been very well
                 received by the community. The new version 4 of Maple V
                 contains so many new mathematical features and
                 improvements in the user interface that Waterloo Maple
                 Inc. markets it as ``the Power Edition.'' These two
                 facts have made it necessary to write a second edition
                 within a short period of the first. I corrected
                 typographical errors, rephrased text, updated and
                 improved many examples, and added much new material.
                 Hardly any chapter has been left untouched.
                 Substantially changed or added sections and chapters
                 address the assume facility, I/O, approximation theory,
                 integration, composite data types, simplification,
                 graphics, differential equations, and matrix algebra.
                 Tables summarize features, command options, etc., and
                 constitute a quick reference. The enlarged index of the
                 book has been carefully compiled to make locating
                 search items quick and easy. Many new examples have
                 been included showing how to use Maple as a problem
                 solver, how to assist the system during computations,
                 and how to extend its built-in facilities. About the
                 Maple Version Used: The second edition of this book is
                 fully revised and updated to Maple V Release 4. More
                 precisely, the second edition of this book was produced
                 with Maple V Release 4, beta 3 on a SUN SPARCstation
                 20, Model 71. There should be hardly any difference
                 between this beta version and the final release; only
                 minor differences in the user interface are not
                 excluded.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface to the Second Edition / v \\
                 Preface to the First Edition / ix \\
                 List of Tables / xix \\
                 1 Introduction to Computer Algebra / 1 \\
                 1.1 What is Computer Algebra? / 1 \\
                 1.2 Computer Algebra Systems / 2 \\
                 1.3 Some Properties of Computer Algebra Systems / 5 \\
                 1.4 Advantages of Computer Algebra / 11 \\
                 1.5 Limitations of Computer Algebra / 24 \\
                 1.6 Design of Maple / 30 \\
                 2 The First Steps: Calculus on Numbers / 35 \\
                 2.1 Getting Started / 35 \\
                 2.2 Getting Help / 38 \\
                 2.3 Integers and Rational Numbers / 44 \\
                 2.4 Irrational Numbers and Floating-Point Numbers / 48
                 \\
                 2.5 Algebraic Numbers / 54 \\
                 2.6 Complex Numbers / 59 \\
                 2.7 Exercises / 63 \\
                 3 Variables and Names / 65 \\
                 3.1 Assignment and Unassignment / 65 \\
                 3.2 Evaluation / 73 \\
                 3.3 Names of Variables / 77 \\
                 3.4 Basic Data Types / 82 \\
                 3.5 Attributes / 86 \\
                 3.6 Properties / 87 \\
                 3.7 Exercises / 92 \\
                 4 Getting Around with Maple / 95 \\
                 4.1 Maple Input and Output / 95 \\
                 4.2 The Maple Library / 101 \\
                 4.3 Reading and Writing Files / 105 \\
                 4.4 Importing and Exporting Numerical Data / 110 \\
                 4.5 Low-Level I/O / 113 \\
                 4.6 Code Generation / 123 \\
                 4.7 Changing Maple to Your Own Taste / 129 \\
                 4.8 Exercises / 133 \\
                 5 Polynomials and Rational Functions / 135 \\
                 5.1 Univariate Polynomials / 135 \\
                 5.2 Multivariate Polynomials / 140 \\
                 5.3 Rational Functions / 142 \\
                 5.4 Conversions / 144 \\
                 5.5 Exercises / 147 \\
                 6 Internal Data Representation and Substitution / 149
                 \\
                 6.1 Internal Representation of Polynomials / 149 \\
                 6.2 Generalized Rational Expressions / 155 \\
                 6.3 Substitution / 158 \\
                 6.4 Exercises / 170 \\
                 7 Manipulation of Polynomials and Rational Expressions
                 / 173 \\
                 7.1 Expansion / 173 \\
                 7.2 Factorization / 176 \\
                 7.3 Canonical Form and Normal Form / 179 \\
                 7.4 Normalization / 181 \\
                 7.5 Collection / 183 \\
                 7.6 Sorting / 186 \\
                 7.7 Exercises / 186 \\
                 8 Functions / 189 \\
                 8.1 Mathematical Functions / 189 \\
                 8.2 Arrow Operators / 193 \\
                 8.3 Piecewise Defined Functions / 195 \\
                 8.4 Maple Procedures / 202 \\
                 8.5 Recursive Procedure Definitions / 204 \\
                 8.6 unapply / 209 \\
                 8.7 Operations on Functions / 210 \\
                 8.8 Anonymous Functions / 211 \\
                 8.9 Exercises / 212 \\
                 9 Differentiation / 213 \\
                 9.1 Symbolic Differentiation / 213 \\
                 9.2 Automatic Differentiation / 221 \\
                 9.3 Exercises / 224 \\
                 10 Integration and Summation / 227 \\
                 10.1 Indefinite Integration / 227 \\
                 10.2 Definite Integration / 236 \\
                 10.3 Numerical Integration / 241 \\
                 10.4 Integral Transforms / 242 \\
                 10.5 Assisting Maple's Integrator / 252 \\
                 10.6 Summation / 256 \\
                 10.7 Exercises / 261 \\
                 11 Series, Approximation, and Limits / 267 \\
                 11.1 Truncated Series / 267 \\
                 11.2 Approximation of Functions / 278 \\
                 11.3 Power Series / 285 \\
                 11.4 Limits / 288 \\
                 11.5 Exercises / 291 \\
                 12 Composite Data Types / 293 \\
                 12.1 Sequence / 293 \\
                 12.2 Set / 296 \\
                 12.3 List / 298 \\
                 12.4 Array / 304 \\
                 12.5 Table / 310 \\
                 12.6 Last Name Evaluation / 314 \\
                 12.7 Function Call / 317 \\
                 12.8 Conversion Between Composite Data Types / 319 \\
                 12.9 Exercises / 322 \\
                 13 The Assume Facility / 325 \\
                 13.1 The Need for an Assume Facility / 325 \\
                 13.2 Basics of assume / 329 \\
                 13.3 An Algebra of Properties / 332 \\
                 13.4 Implementation of assume / 335 \\
                 13.5 Exercises / 340 \\
                 13.6 Hierarchy of Properties / 340 \\
                 14 Simplification / 343 \\
                 14.1 Automatic Simplification / 344 \\
                 14.2 expand / 346 \\
                 14.3 combine / 353 \\
                 14.4 simplify / 358 \\
                 14.5 convert / 364 \\
                 14.6 Trigonometrie Simplification / 367 \\
                 14.7 Simplification w.r.t. Side Relations / 370 \\
                 14.8 Control Over Simplification / 374 \\
                 14.9 Defining Your Own Simplification Routines / 378
                 \\
                 14.10 Exercises / 383 \\
                 14.11 Simplification Chart / 385 \\
                 15 Graphics / 387 \\
                 15.1 Some Basic Two-Dimensional Plots / 389 \\
                 15.2 Options of plot / 393 \\
                 15.3 The Structure of Two-Dimensional Graphics / 406
                 \\
                 15.4 The plottools Package / 412 \\
                 15.5 Special Two-Dimensional Plots / 416 \\
                 15.6 Two-Dimensional Geometry / 429 \\
                 15.7 Plot Aliasing / 432 \\
                 15.8 A Common Mistake / 433 \\
                 15.9 Some Basic Three-Dimensional Plots / 434 \\
                 15.10 Options of plot3d / 436 \\
                 15.11 The Structure of Three-Dimensional Graphics / 444
                 \\
                 15.12 Special Three-Dimensional Plots / 449 \\
                 15.13 Data Plotting / 457 \\
                 15.14 Animation / 467 \\
                 15.15 List of Plot Options / 469 \\
                 15.16 Exercises / 475 \\
                 16 Solving Equations / 479 \\
                 16.1 Equations in One Unknown / 479 \\
                 16.2 Abbreviations in solve / 480 \\
                 16.3 Some Difficulties / 481 \\
                 16.4 Systems of Equations / 488 \\
                 16.5 The Gr{\"o}bner Basis Method / 499 \\
                 16.6 Inequalities / 505 \\
                 16.7 Numerical Solvers / 507 \\
                 16.8 Other Solvers in Maple / 509 \\
                 16.9 Exercises / 515 \\
                 17 Differential Equations / 519 \\
                 17.1 First Glance at ODEs / 519 \\
                 17.2 Analytic Solutions / 520 \\
                 17.3 Taylor Series Method / 532 \\
                 17.4 Power Series Method / 534 \\
                 17.5 Numerical Solutions / 536 \\
                 17.6 DEtools / 548 \\
                 17.7 Perturbation Methods / 555 \\
                 17.8 Partial Differential Equations / 567 \\
                 17.9 Lie Point Symmetries of PDEs / 569 \\
                 17.10 Exercises / 572 \\
                 18 Linear Algebra: The l i n a i g Package / 575 \\
                 18.1 Loading the l i n a i g Package / 575 \\
                 18.2 Creating New Vectors and Matrices / 576 \\
                 18.3 Vector and Matrix Arithmetic / 580 \\
                 18.4 Basic Matrix Functions / 584 \\
                 18.5 Structural Operations / 589 \\
                 18.6 Vector Operations / 592 \\
                 18.7 Standard Forms of Matrices / 592 \\
                 18.8 Exercises / 597 \\
                 19 Linear Algebra: Applications / 601 \\
                 19.1 Kinematics of the Stanford Manipulator / 601 \\
                 19.2 A Three-Compartment Model of Cadmium Transfer /
                 606 \\
                 19.3 Molecular-Orbital H{\"u}ckel Theory / 618 \\
                 19.4 Vector Analysis / 623 \\
                 19.5 Moore--Penrose Inverse / 631 \\
                 19.6 Exercises / 633 \\
                 References / 635 \\
                 Index / 651",
}


bibtype: book
filename: master.bib
label: Heckbert:1994:GGI
editor: Paul S. Heckbert
title: Graphics gems IV
volume: 4
publisher: pub-AP-PROFESSIONAL
address: pub-AP-PROFESSIONAL:adr
pages: xvii + 575
year: 1994
LCCN: T385 .G6974 1994
bibdate: Mon Aug 24 17:09:12 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.08.24 17:09:12 ???
series: Graphics Gems
acknowledgement: ack-nhfb
raweditor: Paul S. Heckbert
rawtitle: Graphics gems {IV}
ISBN:
0-12-336156-7 (with Macintosh disk), 0-12-336155-9 (with IBM disk) OR 0123361567 (with Macintosh disk), 0123361559 (with IBM disk)

ISBN13:
978-0-12-336156-1 (with Macintosh disk), 978-0-12-336155-4 (with IBM disk) OR 9780123361561 (with Macintosh disk), 9780123361554 (with IBM disk)

TOC:
Geometry Transformations Polyhedra Polygons Curves Surfaces Shading Ray Tracing General Rendering Color Image Processing General Graphics

rawTOC:
Geometry \\ Transformations \\ Polyhedra \\ Polygons \\ Curves \\ Surfaces \\ Shading \\ Ray Tracing \\ General Rendering \\ Color \\ Image Processing \\ General Graphics

entry:
@Book{Heckbert:1994:GGI,
  editor =       "Paul S. Heckbert",
  title =        "Graphics gems {IV}",
  volume =       "4",
  publisher =    pub-AP-PROFESSIONAL,
  address =      pub-AP-PROFESSIONAL:adr,
  pages =        "xvii + 575",
  year =         "1994",
  ISBN =         "0-12-336156-7 (with Macintosh disk), 0-12-336155-9
                 (with IBM disk)",
  ISBN-13 =      "978-0-12-336156-1 (with Macintosh disk),
                 978-0-12-336155-4 (with IBM disk)",
  LCCN =         "T385 .G6974 1994",
  bibdate =      "Mon Aug 24 17:09:12 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Graphics Gems",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Geometry \\
                 Transformations \\
                 Polyhedra \\
                 Polygons \\
                 Curves \\
                 Surfaces \\
                 Shading \\
                 Ray Tracing \\
                 General Rendering \\
                 Color \\
                 Image Processing \\
                 General Graphics",
}


bibtype: book
filename: master.bib
label: Heindel:1975:LPI
author: Lee E. Heindel and Jerry T. Roberto
title: LANG-PAK: An Interactive Language Design System
volume: 1
publisher: pub-ELSEVIER
address: pub-ELSEVIER:adr
pages: xi + 184
year: 1975
LCCN: QA76.6 .H468 1975
bibdate: Tue Dec 14 22:55:15 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:55:15 ???
series: Programming Languages Series, Editor: Thomas E. Cheatham
acknowledgement: ack-nhfb
rawauthor: Lee E. Heindel and Jerry T. Roberto
rawtitle: {LANG-PAK}: An Interactive Language Design System
ISBN:
0-444-00154-9 (hardcover), 0-444-00162-X (paperback) OR 0444001549 (hardcover), 044400162X (paperback)

ISBN13:
978-0-444-00154-2 (hardcover), 978-0-444-00162-7 (paperback) OR 9780444001542 (hardcover), 9780444001627 (paperback)

entry:
@Book{Heindel:1975:LPI,
  author =       "Lee E. Heindel and Jerry T. Roberto",
  title =        "{LANG-PAK}: An Interactive Language Design System",
  volume =       "1",
  publisher =    pub-ELSEVIER,
  address =      pub-ELSEVIER:adr,
  pages =        "xi + 184",
  year =         "1975",
  ISBN =         "0-444-00154-9 (hardcover), 0-444-00162-X (paperback)",
  ISBN-13 =      "978-0-444-00154-2 (hardcover), 978-0-444-00162-7
                 (paperback)",
  LCCN =         "QA76.6 .H468 1975",
  bibdate =      "Tue Dec 14 22:55:15 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Programming Languages Series, Editor: Thomas E.
                 Cheatham",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Heinrich:1993:MRM
author: Joe Heinrich
title: MIPS R4000 Microprocessor User's Manual
publisher: pub-PHPTR
address: pub-PHPTR:adr
pages: xxvi + 438 + A182 + B62 + C6 + D4 + E4
year: 1993
ISBN: 0-13-105925-4 OR 0131059254
ISBN13: 978-0-13-105925-2 OR 9780131059252
LCCN: QA76.8.M523H45 1993
bibdate: Wed Aug 10 11:02:27 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.08.10 11:02:27 ???
acknowledgement: ack-nhfb
rawauthor: Joe Heinrich
rawtitle: {MIPS R4000} Microprocessor User's Manual
TOC:
Introduction CPU Instruction Set Summary The CPU Pipeline Memory Management CPU Exception Processing Floating-Point Unit Floating-Point Exceptions R4000 Processor Signal Descriptions Initialization Interface Clock Interface Cache Organization, Operation, and Coherency System Interface Secondary Cache Interface JTAG Interface R4000 Processor Interrupts Error Checking and Correcting CPU Instruction Set Details FPU Instruction Set Details Subblock Ordering Output Buffer ldots Di ldots Dt Control Mechanism PLL Passive Components R4000 Coprocessor 0 Hazards

rawTOC:
Introduction \\ CPU Instruction Set Summary \\ The CPU Pipeline \\ Memory Management \\ CPU Exception Processing \\ Floating-Point Unit \\ Floating-Point Exceptions \\ R4000 Processor Signal Descriptions \\ Initialization Interface \\ Clock Interface \\ Cache Organization, Operation, and Coherency \\ System Interface \\ Secondary Cache Interface \\ JTAG Interface \\ R4000 Processor Interrupts \\ Error Checking and Correcting \\ CPU Instruction Set Details \\ FPU Instruction Set Details \\ Subblock Ordering \\ Output Buffer \ldots{} Di \ldots{} Dt Control Mechanism \\ PLL Passive Components \\ R4000 Coprocessor 0 Hazards

entry:
@Book{Heinrich:1993:MRM,
  author =       "Joe Heinrich",
  title =        "{MIPS R4000} Microprocessor User's Manual",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  pages =        "xxvi + 438 + A182 + B62 + C6 + D4 + E4",
  year =         "1993",
  ISBN =         "0-13-105925-4",
  ISBN-13 =      "978-0-13-105925-2",
  LCCN =         "QA76.8.M523H45 1993",
  bibdate =      "Wed Aug 10 11:02:27 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$34.00",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Introduction \\
                 CPU Instruction Set Summary \\
                 The CPU Pipeline \\
                 Memory Management \\
                 CPU Exception Processing \\
                 Floating-Point Unit \\
                 Floating-Point Exceptions \\
                 R4000 Processor Signal Descriptions \\
                 Initialization Interface \\
                 Clock Interface \\
                 Cache Organization, Operation, and Coherency \\
                 System Interface \\
                 Secondary Cache Interface \\
                 JTAG Interface \\
                 R4000 Processor Interrupts \\
                 Error Checking and Correcting \\
                 CPU Instruction Set Details \\
                 FPU Instruction Set Details \\
                 Subblock Ordering \\
                 Output Buffer \ldots{} Di \ldots{} Dt Control Mechanism
                 \\
                 PLL Passive Components \\
                 R4000 Coprocessor 0 Hazards",
}


bibtype: article
filename: master.bib
label: Heising:ftn
author: W. P. Heising
title: History and Summary of Fortran Standardization Development for the ASA
journal: j-CACM
volume: 7
pages: 590--625
year: 1966
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
note: See also final standard cite ANSI:ftn66.
acknowledgement: ack-nhfb
rawauthor: W. P. Heising
rawnote: See also final standard \cite{ANSI:ftn66}.
rawtitle: History and Summary of {Fortran} Standardization Development for the {ASA}
entry:
@Article{Heising:ftn,
  author =       "W. P. Heising",
  title =        "History and Summary of {Fortran} Standardization
                 Development for the {ASA}",
  journal =      j-CACM,
  volume =       "7",
  pages =        "590--625",
  year =         "1966",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also final standard \cite{ANSI:ftn66}.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Hejlsberg:2004:CPL
author: Anders Hejlsberg and Scott Wiltamuth and Peter Golde
title: The C# programming language
publisher: pub-AW
address: pub-AW:adr
pages: xiv + 644
year: 2004
ISBN: 0-321-15491-6 (hardcover) OR 0321154916 (hardcover)
ISBN13: 978-0-321-15491-0 (hardcover) OR 9780321154910 (hardcover)
LCCN: QA76.76.C154 H45 2004
bibdate: Wed Mar 8 10:50:27 MST 2006
bibtimestamp: 2006.03.08 10:50:27 MST
subject: C# (Computer program language)
acknowledgement: ack-nhfb
rawauthor: Anders Hejlsberg and Scott Wiltamuth and Peter Golde
rawtitle: The {C\#} programming language
bibsource:
https://www.math.utah.edu/pub/tex/bib/csharp.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; melvyl.cdlib.org:210/CDL90

abstract:
C# is a simple, modern, objectoriented, and typesafe programming language that combines the high productivity of rapid application development languages with the raw power of C and C++. Written by the language's architect and design team members, The C# Programming Language is the definitive technical reference for C#. Moving beyond the online documentation, the book provides the complete specification of the language along with descriptions, reference materials, and code samples from the C# design team. The first part of the book opens with an introduction to the language to bring readers quickly up to speed on the concepts of C#. Next follows a detailed and complete technical specification of the C# 1.0 language, as delivered in Visual Studio .NET 2002 and 2003. Topics covered include Lexical Structure, Types, Variables, Conversions, Expressions, Statements, Namespaces, Exceptions, Attributes, and Unsafe Code. The second part of the book provides an introduction to and technical specification of the four major new features of C# 2.0: Generics, Anonymous Methods, Iterators, and Partial Types. Reference tabs and an exhaustive print index allow readers to easily navigate the text and quickly find the topics that interest them most. An enhanced online index allows readers to quickly and easily search the entire text for specific topics. With the recent acceptance of C# as a standard by both the International Organization for Standardization (ISO) and ECMA, understanding the C# specification has become critical. The C# Programming Language is the definitive reference for programmers who want to acquire an indepth knowledge of C#.

TOC:
Part I: C# 1.0 1: Introduction 2: Lexical Structure 3: Basic Concepts 4: Types 5: Variables 6: Conversions 7: Expressions 8: Statements 9: Namespaces 10: Classes 11: Structs 12: Arrays

rawabstract:
C\# is a simple, modern, objectoriented, and typesafe programming language that combines the high productivity of rapid application development languages with the raw power of C and C++. Written by the language's architect and design team members, The C\# Programming Language is the definitive technical reference for C\#. Moving beyond the online documentation, the book provides the complete specification of the language along with descriptions, reference materials, and code samples from the C\# design team. The first part of the book opens with an introduction to the language to bring readers quickly up to speed on the concepts of C\#. Next follows a detailed and complete technical specification of the C\# 1.0 language, as delivered in Visual Studio .NET 2002 and 2003. Topics covered include Lexical Structure, Types, Variables, Conversions, Expressions, Statements, Namespaces, Exceptions, Attributes, and Unsafe Code. The second part of the book provides an introduction to and technical specification of the four major new features of C\# 2.0: Generics, Anonymous Methods, Iterators, and Partial Types. Reference tabs and an exhaustive print index allow readers to easily navigate the text and quickly find the topics that interest them most. An enhanced online index allows readers to quickly and easily search the entire text for specific topics. With the recent acceptance of C\# as a standard by both the International Organization for Standardization (ISO) and ECMA, understanding the C\# specification has become critical. The C\# Programming Language is the definitive reference for programmers who want to acquire an indepth knowledge of C\#.

rawTOC:
Part I: C\# 1.0 \\ 1: Introduction \\ 2: Lexical Structure \\ 3: Basic Concepts \\ 4: Types \\ 5: Variables \\ 6: Conversions \\ 7: Expressions \\ 8: Statements \\ 9: Namespaces \\ 10: Classes \\ 11: Structs \\ 12: Arrays

entry:
@Book{Hejlsberg:2004:CPL,
  author =       "Anders Hejlsberg and Scott Wiltamuth and Peter Golde",
  title =        "The {C\#} programming language",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiv + 644",
  year =         "2004",
  ISBN =         "0-321-15491-6 (hardcover)",
  ISBN-13 =      "978-0-321-15491-0 (hardcover)",
  LCCN =         "QA76.76.C154 H45 2004",
  bibdate =      "Wed Mar 8 10:50:27 MST 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/csharp.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  abstract =     "C\# is a simple, modern, objectoriented, and typesafe
                 programming language that combines the high
                 productivity of rapid application development languages
                 with the raw power of C and C++. Written by the
                 language's architect and design team members, The C\#
                 Programming Language is the definitive technical
                 reference for C\#. Moving beyond the online
                 documentation, the book provides the complete
                 specification of the language along with descriptions,
                 reference materials, and code samples from the C\#
                 design team. The first part of the book opens with an
                 introduction to the language to bring readers quickly
                 up to speed on the concepts of C\#. Next follows a
                 detailed and complete technical specification of the
                 C\# 1.0 language, as delivered in Visual Studio .NET
                 2002 and 2003. Topics covered include Lexical
                 Structure, Types, Variables, Conversions, Expressions,
                 Statements, Namespaces, Exceptions, Attributes, and
                 Unsafe Code. The second part of the book provides an
                 introduction to and technical specification of the four
                 major new features of C\# 2.0: Generics, Anonymous
                 Methods, Iterators, and Partial Types. Reference tabs
                 and an exhaustive print index allow readers to easily
                 navigate the text and quickly find the topics that
                 interest them most. An enhanced online index allows
                 readers to quickly and easily search the entire text
                 for specific topics. With the recent acceptance of C\#
                 as a standard by both the International Organization
                 for Standardization (ISO) and ECMA, understanding the
                 C\# specification has become critical. The C\#
                 Programming Language is the definitive reference for
                 programmers who want to acquire an indepth knowledge of
                 C\#.",
  acknowledgement = ack-nhfb,
  subject =      "C# (Computer program language)",
  tableofcontents = "Part I: C\# 1.0 \\
                 1: Introduction \\
                 2: Lexical Structure \\
                 3: Basic Concepts \\
                 4: Types \\
                 5: Variables \\
                 6: Conversions \\
                 7: Expressions \\
                 8: Statements \\
                 9: Namespaces \\
                 10: Classes \\
                 11: Structs \\
                 12: Arrays",
}


bibtype: book
filename: master.bib
label: Helferich:2004:HCA
author: Gerard Helferich
publisher: Gotham Books
address: New York, NY, USA
pages: xxii + 360
year: 2004
LCCN: Q143.H9 A6 2005
bibdate: Wed Oct 26 15:28:05 MDT 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; umlibr.library.umass.edu:210/INNOPAC
bibtimestamp: 2005.10.26 15:28:05 MDT
acknowledgement: ack-nhfb
subjectdates: Alexander von Humboldt (1769--1859)
rawauthor: Gerard Helferich
title:
Humboldt's Cosmos: Alexander von Humboldt and the Latin American Journey That Changed the Way We See the World

ISBN:
1-59240-106-6 (paperback), 1-59240-052-3 (paperback) OR 1592401066 (paperback), 1592400523 (paperback)

ISBN13:
978-1-59240-106-2 (paperback), 978-1-59240-052-2 (paperback) OR 9781592401062 (paperback), 9781592400522 (paperback)

subject:
Humboldt, Alexander von; Travel; Latin America; Scientific expeditions; Latin America; History; 19th century

TOC:
Humboldt's ghost Tegel Tenerife Cumana Caracas The Llanos The Orinoco The Amazon Cuba Chimborazo Cajamarca New Spain Washington, Paris, and Berlin Humboldt's spirit.

rawtitle:
{Humboldt}'s Cosmos: {Alexander von Humboldt} and the {Latin American} Journey That Changed the Way We See the World

rawTOC:
Humboldt's ghost \\ Tegel \\ Tenerife \\ Cumana \\ Caracas \\ The Llanos \\ The Orinoco \\ The Amazon \\ Cuba \\ Chimborazo \\ Cajamarca \\ New Spain \\ Washington, Paris, and Berlin \\ Humboldt's spirit.

entry:
@Book{Helferich:2004:HCA,
  author =       "Gerard Helferich",
  title =        "{Humboldt}'s Cosmos: {Alexander von Humboldt} and the
                 {Latin American} Journey That Changed the Way We See
                 the World",
  publisher =    "Gotham Books",
  address =      "New York, NY, USA",
  pages =        "xxii + 360",
  year =         "2004",
  ISBN =         "1-59240-106-6 (paperback), 1-59240-052-3 (paperback)",
  ISBN-13 =      "978-1-59240-106-2 (paperback), 978-1-59240-052-2
                 (paperback)",
  LCCN =         "Q143.H9 A6 2005",
  bibdate =      "Wed Oct 26 15:28:05 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 umlibr.library.umass.edu:210/INNOPAC",
  acknowledgement = ack-nhfb,
  subject =      "Humboldt, Alexander von; Travel; Latin America;
                 Scientific expeditions; Latin America; History; 19th
                 century",
  subject-dates = "Alexander von Humboldt (1769--1859)",
  tableofcontents = "Humboldt's ghost \\
                 Tegel \\
                 Tenerife \\
                 Cumana \\
                 Caracas \\
                 The Llanos \\
                 The Orinoco \\
                 The Amazon \\
                 Cuba \\
                 Chimborazo \\
                 Cajamarca \\
                 New Spain \\
                 Washington, Paris, and Berlin \\
                 Humboldt's spirit.",
}


bibtype: book
filename: master.bib
label: Heller:1990:XPM
author: Dan Heller
title: XView Programming Manual
volume: 7
publisher: pub-ORA
address: pub-ORA:adr
pages: xxviii + 557
year: 1990
ISBN: 0-937175-38-2 OR 0937175382
ISBN13: 978-0-937175-38-5 OR 9780937175385
LCCN: QA76.76.W56 D44 v.7 1990
bibdate: Tue Dec 14 22:55:18 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:55:18 ???
acknowledgement: ack-nhfb
rawauthor: Dan Heller
rawtitle: {XView} Programming Manual
entry:
@Book{Heller:1990:XPM,
  author =       "Dan Heller",
  title =        "{XView} Programming Manual",
  volume =       "7",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxviii + 557",
  year =         "1990",
  ISBN =         "0-937175-38-2",
  ISBN-13 =      "978-0-937175-38-5",
  LCCN =         "QA76.76.W56 D44 v.7 1990",
  bibdate =      "Tue Dec 14 22:55:18 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Heller:1991:MPM
author: Dan Heller
title: Motif Programming Manual for OSF / Motif Version 1.1
volume: 6
publisher: pub-ORA
address: pub-ORA:adr
pages: xl + 990
year: 1991
ISBN: 0-937175-70-6 OR 0937175706
ISBN13: 978-0-937175-70-5 OR 9780937175705
LCCN: QA76.76.W56 H446 1991
bibdate: Wed Dec 15 09:05:18 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 09:05:18 ???
acknowledgement: ack-nhfb
rawauthor: Dan Heller
rawtitle: {Motif} Programming Manual for {OSF\slash Motif} Version 1.1
entry:
@Book{Heller:1991:MPM,
  author =       "Dan Heller",
  title =        "{Motif} Programming Manual for {OSF\slash Motif}
                 Version 1.1",
  volume =       "6",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xl + 990",
  year =         "1991",
  ISBN =         "0-937175-70-6",
  ISBN-13 =      "978-0-937175-70-5",
  LCCN =         "QA76.76.W56 H446 1991",
  bibdate =      "Wed Dec 15 09:05:18 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Heller:1991:XPM
author: Dan Heller
title: XView Programming Manual
volume: 7A
publisher: pub-ORA
address: pub-ORA:adr
edition: Third
pages: xxxvii + 729
month: sep
monthnumber: 9
year: 1991
ISBN: 0-937175-87-0 OR 0937175870
ISBN13: 978-0-937175-87-3 OR 9780937175873
LCCN: QA76.76.W56 H447 1990
bibdate: Mon Jan 3 17:55:53 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.01.03 17:55:53 ???
series: The Definitive guides to the X Window System
acknowledgement: ack-nhfb
rawauthor: Dan Heller
rawtitle: {XView} Programming Manual
entry:
@Book{Heller:1991:XPM,
  author =       "Dan Heller",
  title =        "{XView} Programming Manual",
  volume =       "7A",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  edition =      "Third",
  pages =        "xxxvii + 729",
  month =        sep,
  year =         "1991",
  ISBN =         "0-937175-87-0",
  ISBN-13 =      "978-0-937175-87-3",
  LCCN =         "QA76.76.W56 H447 1990",
  bibdate =      "Mon Jan 3 17:55:53 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "The Definitive guides to the X Window System",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}


bibtype: book
filename: master.bib
label: Hennessy:1990:CAQ
author: John L. Hennessy and David A. Patterson
title: Computer Architecture: a Quantitative Approach
publisher: pub-MORGAN-KAUFMANN
address: pub-MORGAN-KAUFMANN:adr
pages: xxviii + 594
year: 1990
ISBN: 1-55860-069-8, 1-55880-169-8 OR 1558600698, 1558801698
ISBN13: 978-1-55860-069-0, 978-1-55880-169-1 OR 9781558600690, 9781558801691
LCCN: QA76.9.A73 P377 1990
bibdate: Mon Jan 31 08:47:46 1994
bibtimestamp: 1994.01.31 08:47:46 ???
acknowledgement: ack-nhfb
rawauthor: John L. Hennessy and David A. Patterson
rawtitle: Computer Architecture: a Quantitative Approach
bibsource:
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/microchip.bib

TOC:
Fundamentals of Computer Design Introduction The Changing Face of Computing and the Task of the Computer Designer Technology Trends Cost, Price, and their Trends Measuring and Reporting Performance Quantitative Principles of Computer Design Putting It All Together: Performance and Price-Performance Another View: Power Consumption and Efficiency as the Metric Fallacies and Pitfalls Concluding Remarks Historical Perspective and References Exercises Instruction Set Principles and Examples Introduction Classifying Instruction Set Architectures Memory Addressing Addressing Modes for Signal Processing Type and Size of Operands Operands for Media and Signal Processing Operations in the Instruction Set Operations for Media and Signal Processing Instructions for Control Flow Encoding an Instruction Set Crosscutting Issues: The Role of Compilers Putting It All Together: The MIPS Architecture Another View: The Trimedia TM32 CPU Fallacies and Pitfalls Concluding Remarks Historical Perspective and References Exercises Instruction-Level Parallelism and its Dynamic Exploitation Instruction-Level Parallelism: Concepts and Challenges Overcoming Data Hazards with Dynamic Scheduling Dynamic Scheduling: Examples and the Algorithm Reducing Branch Costs with Dynamic Hardware Prediction High Performance Instruction Delivery Taking Advantage of More ILP with Multiple Issue Hardware Based Speculation Studies of the Limitations of ILP Limitations on ILP for Realizable Processors Putting It All Together: The P6 Microarchitecture Another View: Thread Level Parallelism Crosscutting Issues: Using an ILP Datapath to Exploit TLP Fallacies and Pitfalls Concluding Remarks Historical Perspective and References Exercises Exploiting Instruction Level Parallelism with Software Approaches Basic Compiler Techniques for Exposing ILP Static Branch Prediction Static Multiple Issue: the VLIW Approach Advanced Compiler Support for Exposing and Exploiting ILP Hardware Support for Exposing More Parallelism at Compile-Time Crosscutting Issues Putting It All Together: The Intel IA-64 Architecture and Itanium Processor Another View: ILP in the Embedded and Mobile Markets Fallacies and Pitfalls Concluding Remarks Historical Perspective and References Exercises Memory-Hierarchy Design Introduction Review of the ABCs of Caches Cache Performance Reducing Cache Miss Penalty Reducing Miss Rate Reducing Cache Miss Penalty or Miss Rate via Parallelism Reducing Hit Time Main Memory and Organizations for Improving Performance Memory Technology Virtual Memory Protection and Examples of Virtual Memory Crosscutting Issues in the Design of Memory Hierarchies Putting It All Together: Alpha 21264 Memory Hierarchy Another View: The Emotion Engine of the Sony Playstation 2 Another View: The Sun Fire 6800 Server Fallacies and Pitfalls Concluding Remarks Historical Perspective and References Exercises Multiprocessors and Thread-Level Parallelism Introduction Characteristics of Application Domains Symmetric Shared-Memory Architectures Performance of Symmetric Shared-Memory Multiprocessors Distributed Shared-Memory Architectures Performance of Distributed Shared-Memory Multiprocessors Synchronization Models of Memory Consistency: An Introduction Multithreading: Exploiting Thread-Level Parallelism within a Processor Crosscutting Issues Putting It All Together: Sun's Wildfire Prototype Another View: Multithreading in a Commercial Server Another View: Embedded Multiprocessors Fallacies and Pitfalls Concluding Remarks Historical Perspective and References Exercises

rawTOC:
Fundamentals of Computer Design \\ Introduction \\ The Changing Face of Computing and the Task of the Computer Designer \\ Technology Trends \\ Cost, Price, and their Trends \\ Measuring and Reporting Performance \\ Quantitative Principles of Computer Design \\ Putting It All Together: Performance and Price-Performance \\ Another View: Power Consumption and Efficiency as the Metric \\ Fallacies and Pitfalls \\ Concluding Remarks \\ Historical Perspective and References \\ Exercises \\ Instruction Set Principles and Examples \\ Introduction \\ Classifying Instruction Set Architectures \\ Memory Addressing \\ Addressing Modes for Signal Processing \\ Type and Size of Operands \\ Operands for Media and Signal Processing \\ Operations in the Instruction Set \\ Operations for Media and Signal Processing \\ Instructions for Control Flow \\ Encoding an Instruction Set \\ Crosscutting Issues: The Role of Compilers \\ Putting It All Together: The MIPS Architecture \\ Another View: The Trimedia TM32 CPU \\ Fallacies and Pitfalls \\ Concluding Remarks \\ Historical Perspective and References \\ Exercises \\ Instruction-Level Parallelism and its Dynamic Exploitation \\ Instruction-Level Parallelism: Concepts and Challenges \\ Overcoming Data Hazards with Dynamic Scheduling \\ Dynamic Scheduling: Examples and the Algorithm \\ Reducing Branch Costs with Dynamic Hardware Prediction \\ High Performance Instruction Delivery \\ Taking Advantage of More ILP with Multiple Issue \\ Hardware Based Speculation \\ Studies of the Limitations of ILP \\ Limitations on ILP for Realizable Processors \\ Putting It All Together: The P6 Microarchitecture \\ Another View: Thread Level Parallelism \\ Crosscutting Issues: Using an ILP Datapath to Exploit TLP \\ Fallacies and Pitfalls \\ Concluding Remarks \\ Historical Perspective and References \\ Exercises \\ Exploiting Instruction Level Parallelism with Software Approaches \\ Basic Compiler Techniques for Exposing ILP \\ Static Branch Prediction \\ Static Multiple Issue: the VLIW Approach \\ Advanced Compiler Support for Exposing and Exploiting ILP \\ Hardware Support for Exposing More Parallelism at Compile-Time \\ Crosscutting Issues \\ Putting It All Together: The Intel IA-64 Architecture and Itanium Processor \\ Another View: ILP in the Embedded and Mobile Markets \\ Fallacies and Pitfalls \\ Concluding Remarks \\ Historical Perspective and References \\ Exercises \\ Memory-Hierarchy Design \\ Introduction \\ Review of the ABCs of Caches \\ Cache Performance \\ Reducing Cache Miss Penalty \\ Reducing Miss Rate \\ Reducing Cache Miss Penalty or Miss Rate via Parallelism \\ Reducing Hit Time \\ Main Memory and Organizations for Improving Performance \\ Memory Technology \\ Virtual Memory \\ Protection and Examples of Virtual Memory \\ Crosscutting Issues in the Design of Memory Hierarchies \\ Putting It All Together: Alpha 21264 Memory Hierarchy \\ Another View: The Emotion Engine of the Sony Playstation 2 \\ Another View: The Sun Fire 6800 Server \\ Fallacies and Pitfalls \\ Concluding Remarks \\ Historical Perspective and References \\ Exercises \\ Multiprocessors and Thread-Level Parallelism \\ Introduction \\ Characteristics of Application Domains \\ Symmetric Shared-Memory Architectures \\ Performance of Symmetric Shared-Memory Multiprocessors \\ Distributed Shared-Memory Architectures \\ Performance of Distributed Shared-Memory Multiprocessors \\ Synchronization \\ Models of Memory Consistency: An Introduction \\ Multithreading: Exploiting Thread-Level Parallelism within a Processor \\ Crosscutting Issues \\ Putting It All Together: Sun's Wildfire Prototype \\ Another View: Multithreading in a Commercial Server \\ Another View: Embedded Multiprocessors \\ Fallacies and Pitfalls \\ Concluding Remarks \\ Historical Perspective and References \\ Exercises

entry:
@Book{Hennessy:1990:CAQ,
  author =       "John L. Hennessy and David A. Patterson",
  title =        "Computer Architecture: a Quantitative Approach",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  pages =        "xxviii + 594",
  year =         "1990",
  ISBN =         "1-55860-069-8, 1-55880-169-8",
  ISBN-13 =      "978-1-55860-069-0, 978-1-55880-169-1",
  LCCN =         "QA76.9.A73 P377 1990",
  bibdate =      "Mon Jan 31 08:47:46 1994",
  bibsource =    "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/microchip.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Fundamentals of Computer Design \\
                 Introduction \\
                 The Changing Face of Computing and the Task of the
                 Computer Designer \\
                 Technology Trends \\
                 Cost, Price, and their Trends \\
                 Measuring and Reporting Performance \\
                 Quantitative Principles of Computer Design \\
                 Putting It All Together: Performance and
                 Price-Performance \\
                 Another View: Power Consumption and Efficiency as the
                 Metric \\
                 Fallacies and Pitfalls \\
                 Concluding Remarks \\
                 Historical Perspective and References \\
                 Exercises \\
                 Instruction Set Principles and Examples \\
                 Introduction \\
                 Classifying Instruction Set Architectures \\
                 Memory Addressing \\
                 Addressing Modes for Signal Processing \\
                 Type and Size of Operands \\
                 Operands for Media and Signal Processing \\
                 Operations in the Instruction Set \\
                 Operations for Media and Signal Processing \\
                 Instructions for Control Flow \\
                 Encoding an Instruction Set \\
                 Crosscutting Issues: The Role of Compilers \\
                 Putting It All Together: The MIPS Architecture \\
                 Another View: The Trimedia TM32 CPU \\
                 Fallacies and Pitfalls \\
                 Concluding Remarks \\
                 Historical Perspective and References \\
                 Exercises \\
                 Instruction-Level Parallelism and its Dynamic
                 Exploitation \\
                 Instruction-Level Parallelism: Concepts and Challenges
                 \\
                 Overcoming Data Hazards with Dynamic Scheduling \\
                 Dynamic Scheduling: Examples and the Algorithm \\
                 Reducing Branch Costs with Dynamic Hardware Prediction
                 \\
                 High Performance Instruction Delivery \\
                 Taking Advantage of More ILP with Multiple Issue \\
                 Hardware Based Speculation \\
                 Studies of the Limitations of ILP \\
                 Limitations on ILP for Realizable Processors \\
                 Putting It All Together: The P6 Microarchitecture \\
                 Another View: Thread Level Parallelism \\
                 Crosscutting Issues: Using an ILP Datapath to Exploit
                 TLP \\
                 Fallacies and Pitfalls \\
                 Concluding Remarks \\
                 Historical Perspective and References \\
                 Exercises \\
                 Exploiting Instruction Level Parallelism with Software
                 Approaches \\
                 Basic Compiler Techniques for Exposing ILP \\
                 Static Branch Prediction \\
                 Static Multiple Issue: the VLIW Approach \\
                 Advanced Compiler Support for Exposing and Exploiting
                 ILP \\
                 Hardware Support for Exposing More Parallelism at
                 Compile-Time \\
                 Crosscutting Issues \\
                 Putting It All Together: The Intel IA-64 Architecture
                 and Itanium Processor \\
                 Another View: ILP in the Embedded and Mobile Markets
                 \\
                 Fallacies and Pitfalls \\
                 Concluding Remarks \\
                 Historical Perspective and References \\
                 Exercises \\
                 Memory-Hierarchy Design \\
                 Introduction \\
                 Review of the ABCs of Caches \\
                 Cache Performance \\
                 Reducing Cache Miss Penalty \\
                 Reducing Miss Rate \\
                 Reducing Cache Miss Penalty or Miss Rate via
                 Parallelism \\
                 Reducing Hit Time \\
                 Main Memory and Organizations for Improving Performance
                 \\
                 Memory Technology \\
                 Virtual Memory \\
                 Protection and Examples of Virtual Memory \\
                 Crosscutting Issues in the Design of Memory Hierarchies
                 \\
                 Putting It All Together: Alpha 21264 Memory Hierarchy
                 \\
                 Another View: The Emotion Engine of the Sony
                 Playstation 2 \\
                 Another View: The Sun Fire 6800 Server \\
                 Fallacies and Pitfalls \\
                 Concluding Remarks \\
                 Historical Perspective and References \\
                 Exercises \\
                 Multiprocessors and Thread-Level Parallelism \\
                 Introduction \\
                 Characteristics of Application Domains \\
                 Symmetric Shared-Memory Architectures \\
                 Performance of Symmetric Shared-Memory Multiprocessors
                 \\
                 Distributed Shared-Memory Architectures \\
                 Performance of Distributed Shared-Memory
                 Multiprocessors \\
                 Synchronization \\
                 Models of Memory Consistency: An Introduction \\
                 Multithreading: Exploiting Thread-Level Parallelism
                 within a Processor \\
                 Crosscutting Issues \\
                 Putting It All Together: Sun's Wildfire Prototype \\
                 Another View: Multithreading in a Commercial Server \\
                 Another View: Embedded Multiprocessors \\
                 Fallacies and Pitfalls \\
                 Concluding Remarks \\
                 Historical Perspective and References \\
                 Exercises",
}


bibtype: book
filename: master.bib
label: Hennessy:1994:COD
author: John L. Hennessy and David A. Patterson
title: Computer Organization and Design: The Hardware / Software Interface
publisher: pub-MORGAN-KAUFMANN
address: pub-MORGAN-KAUFMANN:adrnew
pages: xxiv + 648
year: 1994
ISBN: 1-55860-281-X (paperback), 1-4832-2118-0 (e-book) OR 155860281X (paperback), 1483221180 (ebook)
LCCN: QA76.9 .C643 P37 1994
bibdate: Wed Feb 2 00:08:32 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.02.02 00:08:32 ???
acknowledgement: ack-nhfb
rawauthor: John L. Hennessy and David A. Patterson
rawtitle: Computer Organization and Design: The Hardware\slash Software Interface
ISBN13:
978-1-55860-281-6 (paperback), 978-1-4832-2118-2 (e-book) OR 9781558602816 (paperback), 9781483221182 (ebook)

abstract:
booktitle Computer Organization and Design: The Hardware/Software Interface presents the interaction between hardware and software at a variety of levels, which offers a framework for understanding the fundamentals of computing. This book focuses on the concepts that are the basis for computers. Organized into nine chapters, this book begins with an overview of the computer revolution. This text then explains the concepts and algorithms used in modern computer arithmetic. Other chapters consider the abstractions and concepts in memory hierarchies by starting with the simplest possible cache. This book discusses as well the complete data path and control for a processor. The final chapter deals with the exploitation of parallel machines. This book is a valuable resource for students in computer science and engineering. Readers with backgrounds in assembly language and logic design who want to learn how to design a computer or understand how a system works will also find this book useful.

TOC:
Computer abstractions and technology The role of performance Instructions: language of the machine Arithmetic for computers The processor: datapath and control Enhancing performance with pipelining Large and fast: exploiting memory hierarchy Interfacing processors and peripherals Parallel processors Appendices. Assemblers, linkers and the SPIM simulator / James R. Larus The basics of logic design Mapping control to hardware Introducing C to Pascal programmers Another approach to instruction set architecture: VAX

rawabstract:
\booktitle{Computer Organization and Design: The Hardware/Software Interface} presents the interaction between hardware and software at a variety of levels, which offers a framework for understanding the fundamentals of computing. This book focuses on the concepts that are the basis for computers. Organized into nine chapters, this book begins with an overview of the computer revolution. This text then explains the concepts and algorithms used in modern computer arithmetic. Other chapters consider the abstractions and concepts in memory hierarchies by starting with the simplest possible cache. This book discusses as well the complete data path and control for a processor. The final chapter deals with the exploitation of parallel machines. This book is a valuable resource for students in computer science and engineering. Readers with backgrounds in assembly language and logic design who want to learn how to design a computer or understand how a system works will also find this book useful.

rawTOC:
Computer abstractions and technology \\ The role of performance \\ Instructions: language of the machine \\ Arithmetic for computers \\ The processor: datapath and control \\ Enhancing performance with pipelining \\ Large and fast: exploiting memory hierarchy \\ Interfacing processors and peripherals \\ Parallel processors \\ Appendices. Assemblers, linkers and the SPIM simulator / James R. Larus \\ The basics of logic design \\ Mapping control to hardware \\ Introducing C to Pascal programmers \\ Another approach to instruction set architecture: VAX

entry:
@Book{Hennessy:1994:COD,
  author =       "John L. Hennessy and David A. Patterson",
  title =        "Computer Organization and Design: The Hardware\slash
                 Software Interface",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adrnew,
  pages =        "xxiv + 648",
  year =         "1994",
  ISBN =         "1-55860-281-X (paperback), 1-4832-2118-0 (e-book)",
  ISBN-13 =      "978-1-55860-281-6 (paperback), 978-1-4832-2118-2
                 (e-book)",
  LCCN =         "QA76.9 .C643 P37 1994",
  bibdate =      "Wed Feb 2 00:08:32 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$74.75",
  abstract =     "\booktitle{Computer Organization and Design: The
                 Hardware/Software Interface} presents the interaction
                 between hardware and software at a variety of levels,
                 which offers a framework for understanding the
                 fundamentals of computing. This book focuses on the
                 concepts that are the basis for computers. Organized
                 into nine chapters, this book begins with an overview
                 of the computer revolution. This text then explains the
                 concepts and algorithms used in modern computer
                 arithmetic. Other chapters consider the abstractions
                 and concepts in memory hierarchies by starting with the
                 simplest possible cache. This book discusses as well
                 the complete data path and control for a processor. The
                 final chapter deals with the exploitation of parallel
                 machines. This book is a valuable resource for students
                 in computer science and engineering. Readers with
                 backgrounds in assembly language and logic design who
                 want to learn how to design a computer or understand
                 how a system works will also find this book useful.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Computer abstractions and technology \\
                 The role of performance \\
                 Instructions: language of the machine \\
                 Arithmetic for computers \\
                 The processor: datapath and control \\
                 Enhancing performance with pipelining \\
                 Large and fast: exploiting memory hierarchy \\
                 Interfacing processors and peripherals \\
                 Parallel processors \\
                 Appendices. Assemblers, linkers and the SPIM simulator
                 / James R. Larus \\
                 The basics of logic design \\
                 Mapping control to hardware \\
                 Introducing C to Pascal programmers \\
                 Another approach to instruction set architecture: VAX",
}


bibtype: book
filename: master.bib
label: Hennessy:1996:CAQ
author: John L. Hennessy and David A. Patterson
title: Computer Architecture --- a Quantitative Approach
publisher: pub-MORGAN-KAUFMANN
address: pub-MORGAN-KAUFMANN:adr
edition: Second
pages: xxiii + 760 + A-77 + B-47 + C-26 + D-26 + E-13 + R-16 + I-14
year: 1996
ISBN: 1-55860-329-8 OR 1558603298
ISBN13: 978-1-55860-329-5 OR 9781558603295
LCCN: QA76.9.A73P377 1995
bibdate: Mon May 20 10:01:59 2002
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2002.05.20 10:01:59 ???
acknowledgement: ack-nhfb
rawauthor: John L. Hennessy and David A. Patterson
rawtitle: Computer Architecture --- a Quantitative Approach
abstract:
As the authors explain in their preface to the Second Edition, computer architecture itself has undergone significant change since 1990. Concentrating on currently predominant and emerging commercial systems, Hennessy and Patterson have prepared entirely new chapters covering additional advanced topics. A new chapter emphasizes superscalar and multiple issues. Networks: a chapter examines in depth the design issues for small and large shared-memory multiprocessors. This book includes coverage of I/O performance measures; memory: caches and memory-hierarchy design addresses contemporary design issues. It is completely revised on current architectures such as MIPS R4000, Intel 80x86 and Pentium, PowerPC, and HP PA-RISC.

TOC:
1: Fundamentals of Computer Design 2: Instruction Set Principles and Examples 3: Pipelining 4: Advanced Pipelining and Instruction-Level Parallelism 5: Memory-Hierarchy Design 6: Storage Systems 7: Interconnection Networks 8: Multiprocessors Appendix A: Computer Arithmetic / David Goldberg Appendix B: Vector Processors Appendix C: Survey of RISC Architectures Appendix D: An Alternative to RISC: The Intel 80x86 Appendix E: Implementing Coherence Protocols

rawabstract:
As the authors explain in their preface to the Second Edition, computer architecture itself has undergone significant change since 1990. Concentrating on currently predominant and emerging commercial systems, Hennessy and Patterson have prepared entirely new chapters covering additional advanced topics. A new chapter emphasizes superscalar and multiple issues. Networks: a chapter examines in depth the design issues for small and large shared-memory multiprocessors. This book includes coverage of I/O performance measures; memory: caches and memory-hierarchy design addresses contemporary design issues. It is completely revised on current architectures such as MIPS R4000, Intel 80x86 and Pentium, PowerPC, and HP PA-RISC.

rawTOC:
1: Fundamentals of Computer Design \\ 2: Instruction Set Principles and Examples \\ 3: Pipelining \\ 4: Advanced Pipelining and Instruction-Level Parallelism \\ 5: Memory-Hierarchy Design \\ 6: Storage Systems \\ 7: Interconnection Networks \\ 8: Multiprocessors \\ Appendix A: Computer Arithmetic / David Goldberg \\ Appendix B: Vector Processors \\ Appendix C: Survey of RISC Architectures \\ Appendix D: An Alternative to RISC: The Intel 80x86 \\ Appendix E: Implementing Coherence Protocols

entry:
@Book{Hennessy:1996:CAQ,
  author =       "John L. Hennessy and David A. Patterson",
  title =        "Computer Architecture --- a Quantitative Approach",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  edition =      "Second",
  pages =        "xxiii + 760 + A-77 + B-47 + C-26 + D-26 + E-13 + R-16
                 + I-14",
  year =         "1996",
  ISBN =         "1-55860-329-8",
  ISBN-13 =      "978-1-55860-329-5",
  LCCN =         "QA76.9.A73P377 1995",
  bibdate =      "Mon May 20 10:01:59 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$69.95",
  abstract =     "As the authors explain in their preface to the Second
                 Edition, computer architecture itself has undergone
                 significant change since 1990. Concentrating on
                 currently predominant and emerging commercial systems,
                 Hennessy and Patterson have prepared entirely new
                 chapters covering additional advanced topics. A new
                 chapter emphasizes superscalar and multiple issues.
                 Networks: a chapter examines in depth the design issues
                 for small and large shared-memory multiprocessors. This
                 book includes coverage of I/O performance measures;
                 memory: caches and memory-hierarchy design addresses
                 contemporary design issues. It is completely revised on
                 current architectures such as MIPS R4000, Intel 80x86
                 and Pentium, PowerPC, and HP PA-RISC.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Fundamentals of Computer Design \\
                 2: Instruction Set Principles and Examples \\
                 3: Pipelining \\
                 4: Advanced Pipelining and Instruction-Level
                 Parallelism \\
                 5: Memory-Hierarchy Design \\
                 6: Storage Systems \\
                 7: Interconnection Networks \\
                 8: Multiprocessors \\
                 Appendix A: Computer Arithmetic / David Goldberg \\
                 Appendix B: Vector Processors \\
                 Appendix C: Survey of RISC Architectures \\
                 Appendix D: An Alternative to RISC: The Intel 80x86 \\
                 Appendix E: Implementing Coherence Protocols",
}


bibtype: book
filename: master.bib
label: Hennessy:1997:COH
author: John L. Hennessy and David A. Patterson
title: Computer Organization: The Hardware / Software Interface
publisher: pub-MORGAN-KAUFMANN
address: pub-MORGAN-KAUFMANN:adrnew
edition: Second
pages: xxix + 759 + 205
year: 1997
LCCN: QA76.9.C643H46 1997
bibdate: Thu Sep 11 07:05:47 1997
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1997.09.11 07:05:47 ???
acknowledgement: ack-nhfb
rawauthor: John L. Hennessy and David A. Patterson
rawtitle: Computer Organization: The Hardware\slash Software Interface
ISBN:
1-55860-428-6 (hardcover), 1-55860-491-X (softcover) OR 1558604286 (hardcover), 155860491X (softcover)

ISBN13:
978-1-55860-428-5 (hardcover), 978-1-55860-491-9 (softcover) OR 9781558604285 (hardcover), 9781558604919 (softcover)

abstract:
The performance of software systems is dramatically affected by how well software designers understand the basic hardware technologies at work in a system. Similarly, hardware designers must understand the far-reaching effects their design decisions have on software applications. For readers in either category, this classic introduction to the field provides a look deep into the computer. It demonstrates the relationships between the software and hardware and focuses on the foundational concepts that are the basis for current computer design.

TOC:
Computer Abstractions and Technology Below Your Program Real Stuff: Manufacturing Pentium 4 Chips Computers in the Real World: Information Technology for the 4 Billion without IT Instructions: Language of the Computer Operations of the Computer Hardware Operands of the Computer Hardware Representing Instructions in the Computer Logical Operations Instructions for Making Decisions Supporting Procedures in Computer Hardware Communicating with People MIPS Addressing for 32-Bit Immediates and Addresses Translating and Starting a Program How Compilers Optimize How Compilers Work: An Introduction A C Sort Example to Put It All Together Implementing an Object-Oriented Language Arrays versus Pointers Real Stuff: IA-32 Instructions Computers in the Real World: Helping Save Our Environment with Data Arithmetic for Computers Signed and Unsigned Numbers Addition and Subtraction Multiplication Division Floating Point Real Stuff: Floating Point in the IA-32 Computers in the Real World: Reconstructing the Ancient World Assessing and Understanding Performance CPU Performance and Its Factors Evaluating Performance Real Stuff: Two SPEC Benchmarks and the Performance of Recent Intel Processors Computers in The Real World: Moving People Faster and More Safely The Processor: Datapath and Control Logic Design Conventions Building a Datapath A Simple Implementation Scheme A Multicycle Implementation Exceptions

rawabstract:
The performance of software systems is dramatically affected by how well software designers understand the basic hardware technologies at work in a system. Similarly, hardware designers must understand the far-reaching effects their design decisions have on software applications. For readers in either category, this classic introduction to the field provides a look deep into the computer. It demonstrates the relationships between the software and hardware and focuses on the foundational concepts that are the basis for current computer design.

rawTOC:
Computer Abstractions and Technology \\ Below Your Program \\ Real Stuff: Manufacturing Pentium 4 Chips \\ Computers in the Real World: Information Technology for the 4 Billion without IT \\ Instructions: Language of the Computer \\ Operations of the Computer Hardware \\ Operands of the Computer Hardware \\ Representing Instructions in the Computer \\ Logical Operations \\ Instructions for Making Decisions \\ Supporting Procedures in Computer Hardware \\ Communicating with People \\ MIPS Addressing for 32-Bit Immediates and Addresses \\ Translating and Starting a Program \\ How Compilers Optimize \\ How Compilers Work: An Introduction \\ A C Sort Example to Put It All Together \\ Implementing an Object-Oriented Language \\ Arrays versus Pointers \\ Real Stuff: IA-32 Instructions \\ Computers in the Real World: Helping Save Our Environment with Data \\ Arithmetic for Computers \\ Signed and Unsigned Numbers \\ Addition and Subtraction \\ Multiplication \\ Division \\ Floating Point \\ Real Stuff: Floating Point in the IA-32 \\ Computers in the Real World: Reconstructing the Ancient World \\ Assessing and Understanding Performance \\ CPU Performance and Its Factors \\ Evaluating Performance \\ Real Stuff: Two SPEC Benchmarks and the Performance of Recent Intel Processors \\ Computers in The Real World: Moving People Faster and More Safely \\ The Processor: Datapath and Control \\ Logic Design Conventions \\ Building a Datapath \\ A Simple Implementation Scheme \\ A Multicycle Implementation \\ Exceptions

entry:
@Book{Hennessy:1997:COH,
  author =       "John L. Hennessy and David A. Patterson",
  title =        "Computer Organization: The Hardware\slash Software
                 Interface",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adrnew,
  edition =      "Second",
  pages =        "xxix + 759 + 205",
  year =         "1997",
  ISBN =         "1-55860-428-6 (hardcover), 1-55860-491-X (softcover)",
  ISBN-13 =      "978-1-55860-428-5 (hardcover), 978-1-55860-491-9
                 (softcover)",
  LCCN =         "QA76.9.C643H46 1997",
  bibdate =      "Thu Sep 11 07:05:47 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$78.95",
  abstract =     "The performance of software systems is dramatically
                 affected by how well software designers understand the
                 basic hardware technologies at work in a system.
                 Similarly, hardware designers must understand the
                 far-reaching effects their design decisions have on
                 software applications. For readers in either category,
                 this classic introduction to the field provides a look
                 deep into the computer. It demonstrates the
                 relationships between the software and hardware and
                 focuses on the foundational concepts that are the basis
                 for current computer design.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Computer Abstractions and Technology \\
                 Below Your Program \\
                 Real Stuff: Manufacturing Pentium 4 Chips \\
                 Computers in the Real World: Information Technology for
                 the 4 Billion without IT \\
                 Instructions: Language of the Computer \\
                 Operations of the Computer Hardware \\
                 Operands of the Computer Hardware \\
                 Representing Instructions in the Computer \\
                 Logical Operations \\
                 Instructions for Making Decisions \\
                 Supporting Procedures in Computer Hardware \\
                 Communicating with People \\
                 MIPS Addressing for 32-Bit Immediates and Addresses \\
                 Translating and Starting a Program \\
                 How Compilers Optimize \\
                 How Compilers Work: An Introduction \\
                 A C Sort Example to Put It All Together \\
                 Implementing an Object-Oriented Language \\
                 Arrays versus Pointers \\
                 Real Stuff: IA-32 Instructions \\
                 Computers in the Real World: Helping Save Our
                 Environment with Data \\
                 Arithmetic for Computers \\
                 Signed and Unsigned Numbers \\
                 Addition and Subtraction \\
                 Multiplication \\
                 Division \\
                 Floating Point \\
                 Real Stuff: Floating Point in the IA-32 \\
                 Computers in the Real World: Reconstructing the Ancient
                 World \\
                 Assessing and Understanding Performance \\
                 CPU Performance and Its Factors \\
                 Evaluating Performance \\
                 Real Stuff: Two SPEC Benchmarks and the Performance of
                 Recent Intel Processors \\
                 Computers in The Real World: Moving People Faster and
                 More Safely \\
                 The Processor: Datapath and Control \\
                 Logic Design Conventions \\
                 Building a Datapath \\
                 A Simple Implementation Scheme \\
                 A Multicycle Implementation \\
                 Exceptions",
}


bibtype: book
filename: master.bib
label: Hennessy:2003:CAQ
author: John L. Hennessy and David A. Patterson
title: Computer Architecture --- a Quantitative Approach
publisher: pub-MORGAN-KAUFMANN
address: pub-MORGAN-KAUFMANN:adr
edition: Third
pages: xxi + 883 + A-87 + B-42 + C-1 + D-1 + E-1 + F-1 + G-1 + H-1 + I-1 + R-22 + I-44
year: 2003
ISBN: 1-55860-596-7 OR 1558605967
ISBN13: 978-1-55860-596-1 OR 9781558605961
LCCN: QA76.9.A73 P377 2003
bibdate: Thu Sep 12 15:26:03 2002
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2002.09.12 15:26:03 ???
URL: http://www.mkp.com/books_catalog/catalog.asp?ISBN=1-55860-596-7; http://www.mkp.com/CA3
acknowledgement: ack-nhfb
rawauthor: John L. Hennessy and David A. Patterson
rawtitle: Computer Architecture --- a Quantitative Approach
abstract:
In this [book,] the authors bring their trademark method of quantitative analysis not only to high-performance desktop machine design, but also to the design of embedded and server systems. They have illustrated their principles with designs from all three of these domains, including examples from consumer electronics, multimedia and Web technologies, and high-performance computing. [The authors] focus on fundamental techniques for designing real machines and for maximizing their cost-performance. Anyone involved in designing computers or designing with computers, from PDAs to Web servers to super-computers, will benefit from the expertise they offer in this [book].

TOC:
Fundamentals of computer design Instruction set principles and examples Instruction-level parallelism and its dynamic exploitation Exploiting instruction-level parallelism with software approaches Memory hierarchy design Multiprocessors and thread-level parallelism Storage systems Interconnection networks and clusters Appendices: Pipelining, basic and intermediate concepts Solutions to selected exercises A survey of RISC architectures for desktop, server, and embedded computers Alternative to RISC, the VAX architecture IBM 360/370 architecture for mainframe computers Vector processors Computer arithmetic Implementing coherence protocols

rawabstract:
In this [book,] the authors bring their trademark method of quantitative analysis not only to high-performance desktop machine design, but also to the design of embedded and server systems. They have illustrated their principles with designs from all three of these domains, including examples from consumer electronics, multimedia and Web technologies, and high-performance computing. [The authors] focus on fundamental techniques for designing real machines and for maximizing their cost-performance. Anyone involved in designing computers or designing with computers, from PDAs to Web servers to super-computers, will benefit from the expertise they offer in this [book].

rawTOC:
Fundamentals of computer design \\ Instruction set principles and examples \\ Instruction-level parallelism and its dynamic exploitation \\ Exploiting instruction-level parallelism with software approaches \\ Memory hierarchy design \\ Multiprocessors and thread-level parallelism \\ Storage systems \\ Interconnection networks and clusters \\ Appendices: Pipelining, basic and intermediate concepts \\ Solutions to selected exercises \\ A survey of RISC architectures for desktop, server, and embedded computers \\ Alternative to RISC, the VAX architecture \\ IBM 360/370 architecture for mainframe computers \\ Vector processors \\ Computer arithmetic \\ Implementing coherence protocols

entry:
@Book{Hennessy:2003:CAQ,
  author =       "John L. Hennessy and David A. Patterson",
  title =        "Computer Architecture --- a Quantitative Approach",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  edition =      "Third",
  pages =        "xxi + 883 + A-87 + B-42 + C-1 + D-1 + E-1 + F-1 + G-1
                 + H-1 + I-1 + R-22 + I-44",
  year =         "2003",
  ISBN =         "1-55860-596-7",
  ISBN-13 =      "978-1-55860-596-1",
  LCCN =         "QA76.9.A73 P377 2003",
  bibdate =      "Thu Sep 12 15:26:03 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$89.95",
  URL =          "http://www.mkp.com/books_catalog/catalog.asp?ISBN=1-55860-596-7;
                 http://www.mkp.com/CA3",
  abstract =     "In this [book,] the authors bring their trademark
                 method of quantitative analysis not only to
                 high-performance desktop machine design, but also to
                 the design of embedded and server systems. They have
                 illustrated their principles with designs from all
                 three of these domains, including examples from
                 consumer electronics, multimedia and Web technologies,
                 and high-performance computing. [The authors] focus on
                 fundamental techniques for designing real machines and
                 for maximizing their cost-performance. Anyone involved
                 in designing computers or designing with computers,
                 from PDAs to Web servers to super-computers, will
                 benefit from the expertise they offer in this [book].",
  acknowledgement = ack-nhfb,
  tableofcontents = "Fundamentals of computer design \\
                 Instruction set principles and examples \\
                 Instruction-level parallelism and its dynamic
                 exploitation \\
                 Exploiting instruction-level parallelism with software
                 approaches \\
                 Memory hierarchy design \\
                 Multiprocessors and thread-level parallelism \\
                 Storage systems \\
                 Interconnection networks and clusters \\
                 Appendices: Pipelining, basic and intermediate concepts
                 \\
                 Solutions to selected exercises \\
                 A survey of RISC architectures for desktop, server, and
                 embedded computers \\
                 Alternative to RISC, the VAX architecture \\
                 IBM 360/370 architecture for mainframe computers \\
                 Vector processors \\
                 Computer arithmetic \\
                 Implementing coherence protocols",
}


bibtype: book
filename: master.bib
label: Hennessy:2004:COH
author: John L. Hennessy and David A. Patterson
title: Computer Organization: The Hardware / Software Interface
publisher: pub-MORGAN-KAUFMANN
address: pub-MORGAN-KAUFMANN:adrnew
edition: Third
pages: xvii + 621
year: 2004
ISBN: 1-55860-604-1 (paperback), 0-12-088433-X (CD-ROM) OR 1558606041 (paperback), 012088433X (CDROM)
LCCN: QA76.9.C643 H46 2004
bibdate: Mon Nov 15 16:01:58 2004
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2004.11.15 16:01:58 ???
acknowledgement: ack-nhfb
rawauthor: John L. Hennessy and David A. Patterson
rawtitle: Computer Organization: The Hardware\slash Software Interface
ISBN13:
978-1-55860-604-3 (paperback), 978-0-12-088433-9 (CD-ROM) OR 9781558606043 (paperback), 9780120884339 (CDROM)

abstract:
[This book] demonstrates the relationships between the software and hardware and focuses on the foundational concepts that are the basis for current computer design. A MIPS processor is the core used to present the fundamentals of hardware technologies at work in a computer system. The book presents an entire MIPS instruction set --- instruction by instruction --- the fundamentals of assembly language, computer arithmetic, pipelining, memory hierarchies, and I/O, and introduces the essentials of network and multiprocessor architectures. The audience for this book includes those with little experience in assembly language or logic design who need to understand basic computer organization as well as readers with backgrounds in assembly language and/or logic design who want to learn how to design a computer or understand how a system works and why it performs as it does.

TOC:
1: Computer abstractions and technology Computers in the real world: information technology for the 4 billion without IT 2: Instructions: language of the computer Computers in the real world: helping save our environment with data 3: Arithmetic for computers Computers in the real world: reconstructing the ancient world 4: Assessing and understanding performance Computers in the real world: moving people faster and more safely 5: The processor: datapath and control Computers in the real world: empowering the disabled 6: Enhancing performance with pipelining Computers in the real world: mass communication without gatekeepers 7: Large and fast: exploiting memory hierarchy Computers in the real world: saving the world's art treasures 8: Storage, networks, and other peripherals Computers in the real world: saving lives through better diagnosis 9: Multiprocessors and clusters Appendix A: Assemblers, linkers, and the SPIM simulator Appendix B: The basics of logic design Appendix C: Mapping control to hardware Appendix D: A survey of RISC architectures for desktop, server, and embedded computers

rawabstract:
[This book] demonstrates the relationships between the software and hardware and focuses on the foundational concepts that are the basis for current computer design. A MIPS processor is the core used to present the fundamentals of hardware technologies at work in a computer system. The book presents an entire MIPS instruction set --- instruction by instruction --- the fundamentals of assembly language, computer arithmetic, pipelining, memory hierarchies, and I/O, and introduces the essentials of network and multiprocessor architectures. The audience for this book includes those with little experience in assembly language or logic design who need to understand basic computer organization as well as readers with backgrounds in assembly language and/or logic design who want to learn how to design a computer or understand how a system works and why it performs as it does.

rawTOC:
1: Computer abstractions and technology \\ Computers in the real world: information technology for the 4 billion without IT \\ 2: Instructions: language of the computer \\ Computers in the real world: helping save our environment with data \\ 3: Arithmetic for computers \\ Computers in the real world: reconstructing the ancient world \\ 4: Assessing and understanding performance \\ Computers in the real world: moving people faster and more safely \\ 5: The processor: datapath and control \\ Computers in the real world: empowering the disabled \\ 6: Enhancing performance with pipelining \\ Computers in the real world: mass communication without gatekeepers \\ 7: Large and fast: exploiting memory hierarchy \\ Computers in the real world: saving the world's art treasures \\ 8: Storage, networks, and other peripherals \\ Computers in the real world: saving lives through better diagnosis \\ 9: Multiprocessors and clusters \\ Appendix A: Assemblers, linkers, and the SPIM simulator \\ Appendix B: The basics of logic design \\ Appendix C: Mapping control to hardware \\ Appendix D: A survey of RISC architectures for desktop, server, and embedded computers

entry:
@Book{Hennessy:2004:COH,
  author =       "John L. Hennessy and David A. Patterson",
  title =        "Computer Organization: The Hardware\slash Software
                 Interface",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adrnew,
  edition =      "Third",
  pages =        "xvii + 621",
  year =         "2004",
  ISBN =         "1-55860-604-1 (paperback), 0-12-088433-X (CD-ROM)",
  ISBN-13 =      "978-1-55860-604-3 (paperback), 978-0-12-088433-9
                 (CD-ROM)",
  LCCN =         "QA76.9.C643 H46 2004",
  bibdate =      "Mon Nov 15 16:01:58 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$64.95",
  abstract =     "[This book] demonstrates the relationships between the
                 software and hardware and focuses on the foundational
                 concepts that are the basis for current computer
                 design. A MIPS processor is the core used to present
                 the fundamentals of hardware technologies at work in a
                 computer system. The book presents an entire MIPS
                 instruction set --- instruction by instruction --- the
                 fundamentals of assembly language, computer arithmetic,
                 pipelining, memory hierarchies, and I/O, and introduces
                 the essentials of network and multiprocessor
                 architectures. The audience for this book includes
                 those with little experience in assembly language or
                 logic design who need to understand basic computer
                 organization as well as readers with backgrounds in
                 assembly language and/or logic design who want to learn
                 how to design a computer or understand how a system
                 works and why it performs as it does.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Computer abstractions and technology \\
                 Computers in the real world: information technology for
                 the 4 billion without IT \\
                 2: Instructions: language of the computer \\
                 Computers in the real world: helping save our
                 environment with data \\
                 3: Arithmetic for computers \\
                 Computers in the real world: reconstructing the ancient
                 world \\
                 4: Assessing and understanding performance \\
                 Computers in the real world: moving people faster and
                 more safely \\
                 5: The processor: datapath and control \\
                 Computers in the real world: empowering the disabled
                 \\
                 6: Enhancing performance with pipelining \\
                 Computers in the real world: mass communication without
                 gatekeepers \\
                 7: Large and fast: exploiting memory hierarchy \\
                 Computers in the real world: saving the world's art
                 treasures \\
                 8: Storage, networks, and other peripherals \\
                 Computers in the real world: saving lives through
                 better diagnosis \\
                 9: Multiprocessors and clusters \\
                 Appendix A: Assemblers, linkers, and the SPIM simulator
                 \\
                 Appendix B: The basics of logic design \\
                 Appendix C: Mapping control to hardware \\
                 Appendix D: A survey of RISC architectures for desktop,
                 server, and embedded computers",
}


bibtype: book
filename: master.bib
label: Hennessy:2006:CAQ
author: John L. Hennessy and David A. Patterson and Andrea C. Arpaci-Dusseau and others
title: Computer Architecture: a Quantitative Approach
publisher: pub-MORGAN-KAUFMANN
address: pub-MORGAN-KAUFMANN:adrbo
edition: Fourth
pages: xxvii + 423 + 349
year: 2006
LCCN: QA76.9.A73 P377 2006
bibdate: Sat Sep 2 10:10:32 MDT 2006
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2006.09.02 10:10:32 MDT
subject: Computer architecture
acknowledgement: ack-nhfb
rawauthor: John L. Hennessy and David A. Patterson and Andrea C. Arpaci-Dusseau and others
rawtitle: Computer Architecture: a Quantitative Approach
ISBN:
0-12-370490-1 (paperback), 0-08-047502-7 (e-book), 0-12-373590-4 OR 0123704901 (paperback), 0080475027 (ebook), 0123735904

ISBN13:
978-0-12-370490-0 (paperback), 978-0-08-047502-8 (e-book), 978-0-12-373590-4 OR 9780123704900 (paperback), 9780080475028 (ebook), 9780123735904

URL:
http://www.loc.gov/catdir/enhancements/fy0665/2006024358-d.html; http://www.loc.gov/catdir/toc/ecip0618/2006024358.html

TOC:
1: Fundamentals of computer design 2: Instruction-level parallelism and its exploitation 3: Limits on instruction-level parallelism 4: Multiprocessors and thread-level parallelism 5: Memory hierarchy design 6: Storage systems Appendix A: Pipelining: basic and intermediate concepts Appendix B: Instruction set principles and examples Appendix C: Review of memory hierarchy

rawTOC:
1: Fundamentals of computer design \\ 2: Instruction-level parallelism and its exploitation \\ 3: Limits on instruction-level parallelism \\ 4: Multiprocessors and thread-level parallelism \\ 5: Memory hierarchy design \\ 6: Storage systems \\ Appendix A: Pipelining: basic and intermediate concepts \\ Appendix B: Instruction set principles and examples \\ Appendix C: Review of memory hierarchy

entry:
@Book{Hennessy:2006:CAQ,
  author =       "John L. Hennessy and David A. Patterson and Andrea C.
                 Arpaci-Dusseau and others",
  title =        "Computer Architecture: a Quantitative Approach",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adrbo,
  edition =      "Fourth",
  pages =        "xxvii + 423 + 349",
  year =         "2006",
  ISBN =         "0-12-370490-1 (paperback), 0-08-047502-7 (e-book),
                 0-12-373590-4",
  ISBN-13 =      "978-0-12-370490-0 (paperback), 978-0-08-047502-8
                 (e-book), 978-0-12-373590-4",
  LCCN =         "QA76.9.A73 P377 2006",
  bibdate =      "Sat Sep 2 10:10:32 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0665/2006024358-d.html;
                 http://www.loc.gov/catdir/toc/ecip0618/2006024358.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer architecture",
  tableofcontents = "1: Fundamentals of computer design \\
                 2: Instruction-level parallelism and its exploitation
                 \\
                 3: Limits on instruction-level parallelism \\
                 4: Multiprocessors and thread-level parallelism \\
                 5: Memory hierarchy design \\
                 6: Storage systems \\
                 Appendix A: Pipelining: basic and intermediate concepts
                 \\
                 Appendix B: Instruction set principles and examples \\
                 Appendix C: Review of memory hierarchy",
}


bibtype: book
filename: master.bib
label: Hennessy:2019:CAQ
author: John L. Hennessy and David A. Patterson
title: Computer Architecture: a Quantitative Approach
publisher: pub-MORGAN-KAUFMANN-ELSEVIER
address: pub-MORGAN-KAUFMANN-ELSEVIER:adr
edition: Sixth
pages: xxix + 617 + 284
year: 2019
DOI: https://doi.org/10.1016/B978-0-12-811905-1.00001-8
ISBN: 0-12-811905-5 (paperback) OR 0128119055 (paperback)
ISBN13: 978-0-12-811905-1 (paperback) OR 9780128119051 (paperback)
LCCN: QA76.9.A73 H46 2019; QA76.9.A73 P377 2019
bibdate: Sat Nov 9 11:53:04 MST 2019
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2019.11.09 11:53:04 MST
acknowledgement: ack-nhfb
rawauthor: John L. Hennessy and David A. Patterson
rawtitle: Computer Architecture: a Quantitative Approach
URL:
http://booksite.mkp.com/9780128119051; https://www.elsevier.com/books-and-journals/book-companion/9780128119051

subject:
Computer input-output equipment; Computers; Design and construction; Problems, exercises, etc.; Hardware

TOC:
Foreword / ix Preface / xvii Acknowledgments / xxv Chapter 1 Fundamentals of Quantitative Design and Analysis 1.1 Introduction / 2 1.2 Classes of Computers / 6 1.3 Defining Computer Architecture / 11 1.4 Trends in Technology / 18 1.5 Trends in Power and Energy in Integrated Circuits / 23 1.6 Trends in Cost / 29 1.7 Dependability / 36 1.8 Measuring, Reporting, and Summarizing Performance / 39 1.9 Quantitative Principles of Computer Design / 48 1.10 Putting It All Together: Performance, Price, and Power / 55 1.11 Fallacies and Pitfalls / 58 1.12 Concluding Remarks / 64 1.13 Historical Perspectives and References / 67 Case Studies and Exercises / Diana Franklin / 67 Chapter 2 Memory Hierarchy Design 2.1 Introduction / 78 2.2 Memory Technology and Optimizations / 84 2.3 Ten Advanced Optimizations of Cache Performance / 94 2.4 Virtual Memory and Virtual Machines 1 / 18 2.5 Cross-Cutting Issues: The Design of Memory Hierarchies / 126 2.6 Putting It All Together: Memory Hierarchies in the ARM Cortex-A53 and Intel Core i7 6700 / 129 2.7 Fallacies and Pitfalls / 142 2.8 Concluding Remarks: Looking Ahead / 146 2.9 Historical Perspectives and References / 148 Case Studies and Exercises / Norman P. Jouppi, Rajeev Balasubramonian, Naveen Muralimanohar, and Sheng Li / 148 Chapter 3 Instruction-Level Parallelism and Its Exploitation 3.1 Instruction-Level Parallelism: Concepts and Challenges / 168 3.2 Basic Compiler Techniques for Exposing ILP / 176 3.3 Reducing Branch Costs With Advanced Branch Prediction / 182 3.4 Overcoming Data Hazards With Dynamic Scheduling / 191 3.5 Dynamic Scheduling: Examples and the Algorithm / 201 3.6 Hardware-Based Speculation / 208 3.7 Exploiting ILP Using Multiple Issue and Static Scheduling / 218 3.8 Exploiting ILP Using Dynamic Scheduling, Multiple Issue, and Speculation / 222 3.9 Advanced Techniques for Instruction Delivery and Speculation / 228 3.10 Cross-Cutting Issues / 240 3.11 Multithreading: Exploiting Thread-Level Parallelism to Improve Uniprocessor Throughput / 242 3.12 Putting It All Together: The Intel Core i7 6700 and ARM Cortex-A53 / 247 3.13 Fallacies and Pitfalls / 258 3.14 Concluding Remarks: What's Ahead? / 264 3.15 Historical Perspective and References / 266 Case Studies and Exercises / Jason B. Bakos and Robert P. Colwell / 266 Chapter 4 Data-Level Parallelism in Vector, SIMD, and GPU Architectures 4.1 Introduction / 282 4.2 Vector Architecture / 283 4.3 SIMD Instruction Set Extensions for Multimedia / 304 4.4 Graphics Processing Units / 310 4.5 Detecting and Enhancing Loop-Level Parallelism / 336 4.6 Cross-Cutting Issues / 345 4.7 Putting It All Together: Embedded Versus Server GPUs and Tesla Versus Core i7 / 346 4.8 Fallacies and Pitfalls / 353 4.9 Concluding Remarks / 357 4.10 Historical Perspective and References / 357 Case Study and Exercises / Jason D. Bakos / 357 Chapter 5 Thread-Level Parallelism 5.1 Introduction / 368 5.2 Centralized Shared-Memory Architectures / 377 5.3 Performance of Symmetric Shared-Memory Multiprocessors / 393 5.4 Distributed Shared-Memory and Directory-Based Coherence / 404 5.5 Synchronization: The Basics / 412 5.6 Models of Memory Consistency: An Introduction / 417 5.7 'Cross-Cutting Issues / 422 5.8 Putting It All Together: Multicore Processors and Their Performance / 426 5.9 Fallacies and Pitfalls / 438 5.10 The Future of Multicore Scaling / 442 5.11 Concluding Remarks / 444 5.12 Historical Perspectives and References / 445 Case Studies and Exercises / Amr Zaky and David A. Wood / 446 Chapter 6 Warehouse-Scale Computers to Exploit Request-Level and Data-Level Parallelism 6.1 Introduction / 466 6.2 Programming Models and Workloads for Warehouse-Scale Computers / 471 6.3 Computer Architecture of Warehouse-Scale Computers / 477 6.4 The Efficiency and Cost of Warehouse-Scale Computers / 482 6.5 Cloud Computing: The Return of Utility Computing / 490 6.6 Cross-Cutting Issues / 501 6.7 Putting It All Together: A Google Warehouse-Scale Computer / 503 6.8 Fallacies and Pitfalls / 514 6.9 Concluding Remarks / 518 6.10 Historical Perspectives and References / 519 Case Studies and Exercises / Parthasarathy Ranganathan / 519 Chapter 7 Domain-Specific Architectures 7.1 Introduction / 540 7.2 Guidelines for DSAs / 543 7.3 Example Domain: Deep Neural Networks / 544 7.4 Google's Tensor Processing Unit, an Inference Data Center Accelerator / 557 7.5 Microsoft Catapult, a Flexible Data Center Accelerator / 567 7.6 Intel Crest, a Data Center Accelerator for Training / 579 7.7 Pixel Visual Core, a Personal Mobile Device Image Processing Unit / 579 7.8 Cross-Cutting Issues / 592 7.9 Putting It All Together: CPUs Versus GPUs Versus DNN Accelerators / 595 7.10 Fallacies and Pitfalls / 602 7.11 Concluding Remarks / 604 7.12 Historical Perspectives and References / 606 Case Studies and Exercises / Cliff Young / 606 Appendix A Instruction Set Principles A.1 Introduction/ A-2 A.2 Classifying Instruction Set Architectures/ A-3 A.3 Memory Addressing/ A-7 A.4 Type and Size of Operands/ A-13 A.5 Operations in the Instruction Set/ A-15 A.6 Instructions for Control Flow/ A-16 A.7 Encoding an Instruction Set/ A-21 A.8 Cross-Cutting Issues: The Role of Compilers/ A-24 A.9 Putting It All Together: The RISC-V Architecture/ A-33 A.10 Fallacies and Pitfalls/ A-42 A.11 Concluding Remarks/ A-46 A.12 Historical Perspective and References/ A-47 Exercises / Gregory D. Peterson/ A-47 Appendix B Review of Memory Hierarchy B.1 Introduction/ B-2 B.2 Cache Performance/ B-15 B.3 Six Basic Cache Optimizations/ B-22 B.4 Virtual Memory/ B-40 B.5 Protection and Examples of Virtual Memory/ B-49 B.6 Fallacies and Pitfalls/ B-57 B.7 Concluding Remarks/ B-59 B.8 Historical Perspective and References/ B-59 Exercises / Amr Zaky/ B-60 Appendix C Pipelining: Basic and Intermediate Concepts C.1 Introduction/ C-2 C.2 The Major Hurdle of Pipelining --- Pipeline Hazards C-1 O C.3 How ls Pipelining Implemented?/ C-26 C.4 What Makes Pipelining Hard to Implement? / C-37 C.5 Extending the RISC V Integer Pipeline to Handle Multicycle Operations/ C-45 C.6 Putting It All Together: The MIPS R4000 Pipeline/ C-55 C.7 Cross-Cutting Issues/ C-65 C.8 Fallacies and Pitfalls/ C-70 C.9 Concluding Remarks/ C-71 C.10 Historical Perspective and References/ C-71 Updated Exercises / Diana Franklin/ C-71 Online Appendices Appendix D Storage Systems Appendix E Embedded Systems / by Thomas M. Conte Appendix F Interconnection Networks / Timothy M. Pinkston and Jose Duato Appendix G Vector Processors In More Depth / Krste Asanovic Appendix H Hardware and Software for VLIW and EPIC Appendix I Large-Scale Multiprocessors and Scientific Applications Appendix J Computer Arithmetic / David Goldberg Appendix K Survey of Instruction Set Architectures Appendix L Advanced Concepts on Address Translation / Abhishek Bhattacharjee Appendix M Historical Perspectives and References References / R-1 Index / 1-1

shortTOC:
 1. Fundamentals of quantitative design and analysis 2. Memory hierarchy design 3. Instruction-level parallelism and its exploitation 4. Data-level parallelism in Vector, SIMD, and GPU architectures 5. Thread-level parallelism 6. Warehouse-scale computers to exploit request-level and data-level parallelism 7. Domain-specific architectures A. Instruction set principles B. Review of memory hierarchy C. Pipelining: basic and intermediate concepts.

rawshortTOC:
\\ 1. Fundamentals of quantitative design and analysis \\ 2. Memory hierarchy design \\ 3. Instruction-level parallelism and its exploitation \\ 4. Data-level parallelism in Vector, SIMD, and GPU architectures \\ 5. Thread-level parallelism \\ 6. Warehouse-scale computers to exploit request-level and data-level parallelism \\ 7. Domain-specific architectures \\ A. Instruction set principles \\ B. Review of memory hierarchy \\ C. Pipelining: basic and intermediate concepts.

rawTOC:
Foreword / ix \\ Preface / xvii \\ Acknowledgments / xxv \\ Chapter 1 Fundamentals of Quantitative Design and Analysis \\ 1.1 Introduction / 2 \\ 1.2 Classes of Computers / 6 \\ 1.3 Defining Computer Architecture / 11 \\ 1.4 Trends in Technology / 18 \\ 1.5 Trends in Power and Energy in Integrated Circuits / 23 \\ 1.6 Trends in Cost / 29 \\ 1.7 Dependability / 36 \\ 1.8 Measuring, Reporting, and Summarizing Performance / 39 \\ 1.9 Quantitative Principles of Computer Design / 48 \\ 1.10 Putting It All Together: Performance, Price, and Power / 55 \\ 1.11 Fallacies and Pitfalls / 58 \\ 1.12 Concluding Remarks / 64 \\ 1.13 Historical Perspectives and References / 67 \\ Case Studies and Exercises / Diana Franklin / 67 \\ Chapter 2 Memory Hierarchy Design \\ 2.1 Introduction / 78 \\ 2.2 Memory Technology and Optimizations / 84 \\ 2.3 Ten Advanced Optimizations of Cache Performance / 94 \\ 2.4 Virtual Memory and Virtual Machines 1 / 18 \\ 2.5 Cross-Cutting Issues: The Design of Memory Hierarchies / 126 \\ 2.6 Putting It All Together: Memory Hierarchies in the ARM Cortex-A53 and Intel Core i7 6700 / 129 \\ 2.7 Fallacies and Pitfalls / 142 \\ 2.8 Concluding Remarks: Looking Ahead / 146 \\ 2.9 Historical Perspectives and References / 148 \\ Case Studies and Exercises / Norman P. Jouppi, Rajeev Balasubramonian, Naveen Muralimanohar, and Sheng Li / 148 \\ Chapter 3 Instruction-Level Parallelism and Its Exploitation \\ 3.1 Instruction-Level Parallelism: Concepts and Challenges / 168 \\ 3.2 Basic Compiler Techniques for Exposing ILP / 176 \\ 3.3 Reducing Branch Costs With Advanced Branch Prediction / 182 \\ 3.4 Overcoming Data Hazards With Dynamic Scheduling / 191 \\ 3.5 Dynamic Scheduling: Examples and the Algorithm / 201 \\ 3.6 Hardware-Based Speculation / 208 \\ 3.7 Exploiting ILP Using Multiple Issue and Static Scheduling / 218 \\ 3.8 Exploiting ILP Using Dynamic Scheduling, Multiple Issue, and Speculation / 222 \\ 3.9 Advanced Techniques for Instruction Delivery and Speculation / 228 \\ 3.10 Cross-Cutting Issues / 240 \\ 3.11 Multithreading: Exploiting Thread-Level Parallelism to Improve Uniprocessor Throughput / 242 \\ 3.12 Putting It All Together: The Intel Core i7 6700 and ARM Cortex-A53 / 247 \\ 3.13 Fallacies and Pitfalls / 258 \\ 3.14 Concluding Remarks: What's Ahead? / 264 \\ 3.15 Historical Perspective and References / 266 \\ Case Studies and Exercises / Jason B. Bakos and Robert P. Colwell / 266 \\ Chapter 4 Data-Level Parallelism in Vector, SIMD, and GPU Architectures \\ 4.1 Introduction / 282 \\ 4.2 Vector Architecture / 283 \\ 4.3 SIMD Instruction Set Extensions for Multimedia / 304 \\ 4.4 Graphics Processing Units / 310 \\ 4.5 Detecting and Enhancing Loop-Level Parallelism / 336 \\ 4.6 Cross-Cutting Issues / 345 \\ 4.7 Putting It All Together: Embedded Versus Server GPUs and Tesla Versus Core i7 / 346 \\ 4.8 Fallacies and Pitfalls / 353 \\ 4.9 Concluding Remarks / 357 \\ 4.10 Historical Perspective and References / 357 \\ Case Study and Exercises / Jason D. Bakos / 357 \\ Chapter 5 Thread-Level Parallelism \\ 5.1 Introduction / 368 \\ 5.2 Centralized Shared-Memory Architectures / 377 \\ 5.3 Performance of Symmetric Shared-Memory Multiprocessors / 393 \\ 5.4 Distributed Shared-Memory and Directory-Based Coherence / 404 \\ 5.5 Synchronization: The Basics / 412 \\ 5.6 Models of Memory Consistency: An Introduction / 417 \\ 5.7 'Cross-Cutting Issues / 422 \\ 5.8 Putting It All Together: Multicore Processors and Their Performance / 426 \\ 5.9 Fallacies and Pitfalls / 438 \\ 5.10 The Future of Multicore Scaling / 442 \\ 5.11 Concluding Remarks / 444 \\ 5.12 Historical Perspectives and References / 445 \\ Case Studies and Exercises / Amr Zaky and David A. Wood / 446 \\ Chapter 6 Warehouse-Scale Computers to Exploit Request-Level and Data-Level Parallelism \\ 6.1 Introduction / 466 \\ 6.2 Programming Models and Workloads for Warehouse-Scale Computers / 471 \\ 6.3 Computer Architecture of Warehouse-Scale Computers / 477 \\ 6.4 The Efficiency and Cost of Warehouse-Scale Computers / 482 \\ 6.5 Cloud Computing: The Return of Utility Computing / 490 \\ 6.6 Cross-Cutting Issues / 501 \\ 6.7 Putting It All Together: A Google Warehouse-Scale Computer / 503 \\ 6.8 Fallacies and Pitfalls / 514 \\ 6.9 Concluding Remarks / 518 \\ 6.10 Historical Perspectives and References / 519 \\ Case Studies and Exercises / Parthasarathy Ranganathan / 519 \\ Chapter 7 Domain-Specific Architectures \\ 7.1 Introduction / 540 \\ 7.2 Guidelines for DSAs / 543 \\ 7.3 Example Domain: Deep Neural Networks / 544 \\ 7.4 Google's Tensor Processing Unit, an Inference Data Center Accelerator / 557 \\ 7.5 Microsoft Catapult, a Flexible Data Center Accelerator / 567 \\ 7.6 Intel Crest, a Data Center Accelerator for Training / 579 \\ 7.7 Pixel Visual Core, a Personal Mobile Device Image Processing Unit / 579 \\ 7.8 Cross-Cutting Issues / 592 \\ 7.9 Putting It All Together: CPUs Versus GPUs Versus DNN Accelerators / 595 \\ 7.10 Fallacies and Pitfalls / 602 \\ 7.11 Concluding Remarks / 604 \\ 7.12 Historical Perspectives and References / 606 \\ Case Studies and Exercises / Cliff Young / 606 \\ Appendix A Instruction Set Principles \\ A.1 Introduction/ A-2 \\ A.2 Classifying Instruction Set Architectures/ A-3 \\ A.3 Memory Addressing/ A-7 \\ A.4 Type and Size of Operands/ A-13 \\ A.5 Operations in the Instruction Set/ A-15 \\ A.6 Instructions for Control Flow/ A-16 \\ A.7 Encoding an Instruction Set/ A-21 \\ A.8 Cross-Cutting Issues: The Role of Compilers/ A-24 \\ A.9 Putting It All Together: The RISC-V Architecture/ A-33 \\ A.10 Fallacies and Pitfalls/ A-42 \\ A.11 Concluding Remarks/ A-46 \\ A.12 Historical Perspective and References/ A-47 \\ Exercises / Gregory D. Peterson/ A-47 \\ Appendix B Review of Memory Hierarchy \\ B.1 Introduction/ B-2 \\ B.2 Cache Performance/ B-15 \\ B.3 Six Basic Cache Optimizations/ B-22 \\ B.4 Virtual Memory/ B-40 \\ B.5 Protection and Examples of Virtual Memory/ B-49 \\ B.6 Fallacies and Pitfalls/ B-57 \\ B.7 Concluding Remarks/ B-59 \\ B.8 Historical Perspective and References/ B-59 \\ Exercises / Amr Zaky/ B-60 \\ Appendix C Pipelining: Basic and Intermediate Concepts \\ C.1 Introduction/ C-2 \\ C.2 The Major Hurdle of Pipelining --- Pipeline Hazards C-1 O \\ C.3 How ls Pipelining Implemented?/ C-26 \\ C.4 What Makes Pipelining Hard to Implement? / C-37 \\ C.5 Extending the RISC V Integer Pipeline to Handle Multicycle Operations/ C-45 \\ C.6 Putting It All Together: The MIPS R4000 Pipeline/ C-55 \\ C.7 Cross-Cutting Issues/ C-65 \\ C.8 Fallacies and Pitfalls/ C-70 \\ C.9 Concluding Remarks/ C-71 \\ C.10 Historical Perspective and References/ C-71 \\ Updated Exercises / Diana Franklin/ C-71 \\ Online Appendices \\ Appendix D Storage Systems \\ Appendix E Embedded Systems / by Thomas M. Conte \\ Appendix F Interconnection Networks / Timothy M. Pinkston and Jose Duato \\ Appendix G Vector Processors In More Depth / Krste Asanovic \\ Appendix H Hardware and Software for VLIW and EPIC \\ Appendix I Large-Scale Multiprocessors and Scientific Applications \\ Appendix J Computer Arithmetic / David Goldberg \\ Appendix K Survey of Instruction Set Architectures \\ Appendix L Advanced Concepts on Address Translation / Abhishek Bhattacharjee \\ Appendix M Historical Perspectives and References \\ References / R-1 \\ Index / 1-1

entry:
@Book{Hennessy:2019:CAQ,
  author =       "John L. Hennessy and David A. Patterson",
  title =        "Computer Architecture: a Quantitative Approach",
  publisher =    pub-MORGAN-KAUFMANN-ELSEVIER,
  address =      pub-MORGAN-KAUFMANN-ELSEVIER:adr,
  edition =      "Sixth",
  pages =        "xxix + 617 + 284",
  year =         "2019",
  DOI =          "https://doi.org/10.1016/B978-0-12-811905-1.00001-8",
  ISBN =         "0-12-811905-5 (paperback)",
  ISBN-13 =      "978-0-12-811905-1 (paperback)",
  LCCN =         "QA76.9.A73 H46 2019; QA76.9.A73 P377 2019",
  bibdate =      "Sat Nov 9 11:53:04 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://booksite.mkp.com/9780128119051;
                 https://www.elsevier.com/books-and-journals/book-companion/9780128119051",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "\\
                 1. Fundamentals of quantitative design and analysis \\
                 2. Memory hierarchy design \\
                 3. Instruction-level parallelism and its exploitation
                 \\
                 4. Data-level parallelism in Vector, SIMD, and GPU
                 architectures \\
                 5. Thread-level parallelism \\
                 6. Warehouse-scale computers to exploit request-level
                 and data-level parallelism \\
                 7. Domain-specific architectures \\
                 A. Instruction set principles \\
                 B. Review of memory hierarchy \\
                 C. Pipelining: basic and intermediate concepts.",
  subject =      "Computer input-output equipment; Computers; Design and
                 construction; Problems, exercises, etc.; Hardware",
  tableofcontents = "Foreword / ix \\
                 Preface / xvii \\
                 Acknowledgments / xxv \\
                 Chapter 1 Fundamentals of Quantitative Design and
                 Analysis \\
                 1.1 Introduction / 2 \\
                 1.2 Classes of Computers / 6 \\
                 1.3 Defining Computer Architecture / 11 \\
                 1.4 Trends in Technology / 18 \\
                 1.5 Trends in Power and Energy in Integrated Circuits /
                 23 \\
                 1.6 Trends in Cost / 29 \\
                 1.7 Dependability / 36 \\
                 1.8 Measuring, Reporting, and Summarizing Performance /
                 39 \\
                 1.9 Quantitative Principles of Computer Design / 48 \\
                 1.10 Putting It All Together: Performance, Price, and
                 Power / 55 \\
                 1.11 Fallacies and Pitfalls / 58 \\
                 1.12 Concluding Remarks / 64 \\
                 1.13 Historical Perspectives and References / 67 \\
                 Case Studies and Exercises / Diana Franklin / 67 \\
                 Chapter 2 Memory Hierarchy Design \\
                 2.1 Introduction / 78 \\
                 2.2 Memory Technology and Optimizations / 84 \\
                 2.3 Ten Advanced Optimizations of Cache Performance /
                 94 \\
                 2.4 Virtual Memory and Virtual Machines 1 / 18 \\
                 2.5 Cross-Cutting Issues: The Design of Memory
                 Hierarchies / 126 \\
                 2.6 Putting It All Together: Memory Hierarchies in the
                 ARM Cortex-A53 and Intel Core i7 6700 / 129 \\
                 2.7 Fallacies and Pitfalls / 142 \\
                 2.8 Concluding Remarks: Looking Ahead / 146 \\
                 2.9 Historical Perspectives and References / 148 \\
                 Case Studies and Exercises / Norman P. Jouppi, Rajeev
                 Balasubramonian, Naveen Muralimanohar, and Sheng Li /
                 148 \\
                 Chapter 3 Instruction-Level Parallelism and Its
                 Exploitation \\
                 3.1 Instruction-Level Parallelism: Concepts and
                 Challenges / 168 \\
                 3.2 Basic Compiler Techniques for Exposing ILP / 176
                 \\
                 3.3 Reducing Branch Costs With Advanced Branch
                 Prediction / 182 \\
                 3.4 Overcoming Data Hazards With Dynamic Scheduling /
                 191 \\
                 3.5 Dynamic Scheduling: Examples and the Algorithm /
                 201 \\
                 3.6 Hardware-Based Speculation / 208 \\
                 3.7 Exploiting ILP Using Multiple Issue and Static
                 Scheduling / 218 \\
                 3.8 Exploiting ILP Using Dynamic Scheduling, Multiple
                 Issue, and Speculation / 222 \\
                 3.9 Advanced Techniques for Instruction Delivery and
                 Speculation / 228 \\
                 3.10 Cross-Cutting Issues / 240 \\
                 3.11 Multithreading: Exploiting Thread-Level
                 Parallelism to Improve Uniprocessor Throughput / 242
                 \\
                 3.12 Putting It All Together: The Intel Core i7 6700
                 and ARM Cortex-A53 / 247 \\
                 3.13 Fallacies and Pitfalls / 258 \\
                 3.14 Concluding Remarks: What's Ahead? / 264 \\
                 3.15 Historical Perspective and References / 266 \\
                 Case Studies and Exercises / Jason B. Bakos and Robert
                 P. Colwell / 266 \\
                 Chapter 4 Data-Level Parallelism in Vector, SIMD, and
                 GPU Architectures \\
                 4.1 Introduction / 282 \\
                 4.2 Vector Architecture / 283 \\
                 4.3 SIMD Instruction Set Extensions for Multimedia /
                 304 \\
                 4.4 Graphics Processing Units / 310 \\
                 4.5 Detecting and Enhancing Loop-Level Parallelism /
                 336 \\
                 4.6 Cross-Cutting Issues / 345 \\
                 4.7 Putting It All Together: Embedded Versus Server
                 GPUs and Tesla Versus Core i7 / 346 \\
                 4.8 Fallacies and Pitfalls / 353 \\
                 4.9 Concluding Remarks / 357 \\
                 4.10 Historical Perspective and References / 357 \\
                 Case Study and Exercises / Jason D. Bakos / 357 \\
                 Chapter 5 Thread-Level Parallelism \\
                 5.1 Introduction / 368 \\
                 5.2 Centralized Shared-Memory Architectures / 377 \\
                 5.3 Performance of Symmetric Shared-Memory
                 Multiprocessors / 393 \\
                 5.4 Distributed Shared-Memory and Directory-Based
                 Coherence / 404 \\
                 5.5 Synchronization: The Basics / 412 \\
                 5.6 Models of Memory Consistency: An Introduction / 417
                 \\
                 5.7 'Cross-Cutting Issues / 422 \\
                 5.8 Putting It All Together: Multicore Processors and
                 Their Performance / 426 \\
                 5.9 Fallacies and Pitfalls / 438 \\
                 5.10 The Future of Multicore Scaling / 442 \\
                 5.11 Concluding Remarks / 444 \\
                 5.12 Historical Perspectives and References / 445 \\
                 Case Studies and Exercises / Amr Zaky and David A. Wood
                 / 446 \\
                 Chapter 6 Warehouse-Scale Computers to Exploit
                 Request-Level and Data-Level Parallelism \\
                 6.1 Introduction / 466 \\
                 6.2 Programming Models and Workloads for
                 Warehouse-Scale Computers / 471 \\
                 6.3 Computer Architecture of Warehouse-Scale Computers
                 / 477 \\
                 6.4 The Efficiency and Cost of Warehouse-Scale
                 Computers / 482 \\
                 6.5 Cloud Computing: The Return of Utility Computing /
                 490 \\
                 6.6 Cross-Cutting Issues / 501 \\
                 6.7 Putting It All Together: A Google Warehouse-Scale
                 Computer / 503 \\
                 6.8 Fallacies and Pitfalls / 514 \\
                 6.9 Concluding Remarks / 518 \\
                 6.10 Historical Perspectives and References / 519 \\
                 Case Studies and Exercises / Parthasarathy Ranganathan
                 / 519 \\
                 Chapter 7 Domain-Specific Architectures \\
                 7.1 Introduction / 540 \\
                 7.2 Guidelines for DSAs / 543 \\
                 7.3 Example Domain: Deep Neural Networks / 544 \\
                 7.4 Google's Tensor Processing Unit, an Inference Data
                 Center Accelerator / 557 \\
                 7.5 Microsoft Catapult, a Flexible Data Center
                 Accelerator / 567 \\
                 7.6 Intel Crest, a Data Center Accelerator for Training
                 / 579 \\
                 7.7 Pixel Visual Core, a Personal Mobile Device Image
                 Processing Unit / 579 \\
                 7.8 Cross-Cutting Issues / 592 \\
                 7.9 Putting It All Together: CPUs Versus GPUs Versus
                 DNN Accelerators / 595 \\
                 7.10 Fallacies and Pitfalls / 602 \\
                 7.11 Concluding Remarks / 604 \\
                 7.12 Historical Perspectives and References / 606 \\
                 Case Studies and Exercises / Cliff Young / 606 \\
                 Appendix A Instruction Set Principles \\
                 A.1 Introduction/ A-2 \\
                 A.2 Classifying Instruction Set Architectures/ A-3 \\
                 A.3 Memory Addressing/ A-7 \\
                 A.4 Type and Size of Operands/ A-13 \\
                 A.5 Operations in the Instruction Set/ A-15 \\
                 A.6 Instructions for Control Flow/ A-16 \\
                 A.7 Encoding an Instruction Set/ A-21 \\
                 A.8 Cross-Cutting Issues: The Role of Compilers/ A-24
                 \\
                 A.9 Putting It All Together: The RISC-V Architecture/
                 A-33 \\
                 A.10 Fallacies and Pitfalls/ A-42 \\
                 A.11 Concluding Remarks/ A-46 \\
                 A.12 Historical Perspective and References/ A-47 \\
                 Exercises / Gregory D. Peterson/ A-47 \\
                 Appendix B Review of Memory Hierarchy \\
                 B.1 Introduction/ B-2 \\
                 B.2 Cache Performance/ B-15 \\
                 B.3 Six Basic Cache Optimizations/ B-22 \\
                 B.4 Virtual Memory/ B-40 \\
                 B.5 Protection and Examples of Virtual Memory/ B-49 \\
                 B.6 Fallacies and Pitfalls/ B-57 \\
                 B.7 Concluding Remarks/ B-59 \\
                 B.8 Historical Perspective and References/ B-59 \\
                 Exercises / Amr Zaky/ B-60 \\
                 Appendix C Pipelining: Basic and Intermediate Concepts
                 \\
                 C.1 Introduction/ C-2 \\
                 C.2 The Major Hurdle of Pipelining --- Pipeline Hazards
                 C-1 O \\
                 C.3 How ls Pipelining Implemented?/ C-26 \\
                 C.4 What Makes Pipelining Hard to Implement? / C-37 \\
                 C.5 Extending the RISC V Integer Pipeline to Handle
                 Multicycle Operations/ C-45 \\
                 C.6 Putting It All Together: The MIPS R4000 Pipeline/
                 C-55 \\
                 C.7 Cross-Cutting Issues/ C-65 \\
                 C.8 Fallacies and Pitfalls/ C-70 \\
                 C.9 Concluding Remarks/ C-71 \\
                 C.10 Historical Perspective and References/ C-71 \\
                 Updated Exercises / Diana Franklin/ C-71 \\
                 Online Appendices \\
                 Appendix D Storage Systems \\
                 Appendix E Embedded Systems / by Thomas M. Conte \\
                 Appendix F Interconnection Networks / Timothy M.
                 Pinkston and Jose Duato \\
                 Appendix G Vector Processors In More Depth / Krste
                 Asanovic \\
                 Appendix H Hardware and Software for VLIW and EPIC \\
                 Appendix I Large-Scale Multiprocessors and Scientific
                 Applications \\
                 Appendix J Computer Arithmetic / David Goldberg \\
                 Appendix K Survey of Instruction Set Architectures \\
                 Appendix L Advanced Concepts on Address Translation /
                 Abhishek Bhattacharjee \\
                 Appendix M Historical Perspectives and References \\
                 References / R-1 \\
                 Index / 1-1",
}


bibtype: book
filename: master.bib
label: Hentschel:1992:ETE
author: Klaus Hentschel
publisher: Spektrum Akademischer Verlag
address: Heidelberg, Germany
pages: 192
year: 1992
ISBN: 3-86025-025-6 OR 3860250256
ISBN13: 978-3-86025-025-9 OR 9783860250259
LCCN: QB36.F73 H46 1992
bibdate: Sat Sep 20 14:29:15 MDT 2014
bibtimestamp: 2014.09.20 14:29:15 MDT
note: See also English translation cite Hentschel:1997:ETI.
language: German
ZMnumber: 1009.01504
acknowledgement: ack-nhfb
rawauthor: Klaus Hentschel
rawnote: See also English translation \cite{Hentschel:1997:ETI}.
title:
Der Einstein-Turm: Erwin F. Freundlich und die Relativitatstheorie; Ansatze zu einer ``dichten Beschreibung'' von institutionellen, biographischen und theoriengeschichtlichen Aspekten. (German) [The Einstein Tower: Erwin F. friendly and the Theory of Relativity; Dense approaches to a description of institutional, biographical and theoretical-historical aspects]

MRclass:
01A74 (History of mathematics at institutions and academies (nonuniversity)); 01A60 (Mathematics in the 20th century); 01A80 (Sociology (and profession) of mathematics)

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

subject:
Mendelsohn, Erich; ``Der Einstein-Turm''; astrophysique relativiste; Freundlich, Erwin Finlay; Potsdam (Allemagne); 1911 / 1933.

TOC:
1. Einfuhrung: Probleme einer `dichten Beschreibung' / 9 2. Erwin Finlay Freundlich (1885--1964) / 15 3. Freundlich und Einstein seit 1911 / 23 4. Die Relativitatstheorie und ihre experimentellen Tests / 30 5. Freundlichs Fixsternstatistik [1915--16] als ein Versuch der Neudeutung fruher gewonnener Daten / 38 6. Wissenschaftspolitik in Berlin und die Forderung Freundlichs seit 1913 / 51 7. Astrophysik im internationalen Vergleich / 59 8. Der Bau des Einstein-Turms / 69 9. Einige Forschungsresultate von Freundlich und Mitarbeitern am Einstein-Turm / 107 10. Querelen zwischen Freundlich und Ludendorff / 127 11. Der Machtwechsel 1933 / 143 12. Der Einstein-Turm aus der Vogelperspektive / 162 Danksagungen / 170 Abkurzungen / 171 Literatur / 172 Namensregister / 190

rawtitle:
{Der Einstein-Turm: Erwin F. Freundlich und die Relativit{\"a}tstheorie; Ans{\"a}tze zu einer ``dichten Beschreibung'' von institutionellen, biographischen und theoriengeschichtlichen Aspekten}. ({German}) [{The Einstein Tower}: {Erwin F. friendly} and the {Theory of Relativity}; Dense approaches to a description of institutional, biographical and theoretical-historical aspects]

rawTOC:
1. Einf{\"u}hrung: Probleme einer `dichten Beschreibung' / 9 \\ 2. Erwin Finlay Freundlich (1885--1964) / 15 \\ 3. Freundlich und Einstein seit 1911 / 23 \\ 4. Die Relativit{\"a}tstheorie und ihre experimentellen Tests / 30 \\ 5. Freundlichs Fixsternstatistik [1915--16] als ein Versuch der Neudeutung fr{\"u}her gewonnener Daten / 38 \\ 6. Wissenschaftspolitik in Berlin und die F{\"o}rderung Freundlichs seit 1913 / 51 \\ 7. Astrophysik im internationalen Vergleich / 59 \\ 8. Der Bau des Einstein-Turms / 69 \\ 9. Einige Forschungsresultate von Freundlich und Mitarbeitern am Einstein-Turm / 107 \\ 10. Querelen zwischen Freundlich und Ludendorff / 127 \\ 11. Der Machtwechsel 1933 / 143 \\ 12. Der Einstein-Turm aus der Vogelperspektive / 162 \\ Danksagungen / 170 \\ Abk{\"u}rzungen / 171 \\ Literatur / 172 \\ Namensregister / 190

entry:
@Book{Hentschel:1992:ETE,
  author =       "Klaus Hentschel",
  title =        "{Der Einstein-Turm: Erwin F. Freundlich und die
                 Relativit{\"a}tstheorie; Ans{\"a}tze zu einer ``dichten
                 Beschreibung'' von institutionellen, biographischen und
                 theoriengeschichtlichen Aspekten}. ({German}) [{The
                 Einstein Tower}: {Erwin F. friendly} and the {Theory of
                 Relativity}; Dense approaches to a description of
                 institutional, biographical and theoretical-historical
                 aspects]",
  publisher =    "Spektrum Akademischer Verlag",
  address =      "Heidelberg, Germany",
  pages =        "192",
  year =         "1992",
  ISBN =         "3-86025-025-6",
  ISBN-13 =      "978-3-86025-025-9",
  LCCN =         "QB36.F73 H46 1992",
  MRclass =      "01A74 (History of mathematics at institutions and
                 academies (nonuniversity)); 01A60 (Mathematics in the
                 20th century); 01A80 (Sociology (and profession) of
                 mathematics)",
  bibdate =      "Sat Sep 20 14:29:15 MDT 2014",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/jhistastron.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/shps-b.bib",
  note =         "See also English translation
                 \cite{Hentschel:1997:ETI}.",
  ZMnumber =     "1009.01504",
  acknowledgement = ack-nhfb,
  language =     "German",
  libnote =      "Not in my library.",
  subject =      "Mendelsohn, Erich; ``Der Einstein-Turm'';
                 astrophysique relativiste; Freundlich, Erwin Finlay;
                 Potsdam (Allemagne); 1911 / 1933.",
  tableofcontents = "1. Einf{\"u}hrung: Probleme einer `dichten
                 Beschreibung' / 9 \\
                 2. Erwin Finlay Freundlich (1885--1964) / 15 \\
                 3. Freundlich und Einstein seit 1911 / 23 \\
                 4. Die Relativit{\"a}tstheorie und ihre experimentellen
                 Tests / 30 \\
                 5. Freundlichs Fixsternstatistik [1915--16] als ein
                 Versuch der Neudeutung fr{\"u}her gewonnener Daten / 38
                 \\
                 6. Wissenschaftspolitik in Berlin und die F{\"o}rderung
                 Freundlichs seit 1913 / 51 \\
                 7. Astrophysik im internationalen Vergleich / 59 \\
                 8. Der Bau des Einstein-Turms / 69 \\
                 9. Einige Forschungsresultate von Freundlich und
                 Mitarbeitern am Einstein-Turm / 107 \\
                 10. Querelen zwischen Freundlich und Ludendorff / 127
                 \\
                 11. Der Machtwechsel 1933 / 143 \\
                 12. Der Einstein-Turm aus der Vogelperspektive / 162
                 \\
                 Danksagungen / 170 \\
                 Abk{\"u}rzungen / 171 \\
                 Literatur / 172 \\
                 Namensregister / 190",
}


bibtype: book
filename: master.bib
label: Hentschel:1997:ETI
author: Klaus Hentschel
title: The Einstein Tower: an intertexture of dynamic construction, Relativity Theory, and astronomy
publisher: pub-STANFORD
address: pub-STANFORD:adr
pages: xiv + 226
year: 1997
ISBN: 0-8047-2824-0 OR 0804728240
ISBN13: 978-0-8047-2824-9 OR 9780804728249
LCCN: QB462.65
bibdate: Wed Nov 2 07:49:15 MDT 2011
bibtimestamp: 2011.11.02 07:49:15 MDT
note: English translation by Ann M. Hentschel of the German original cite Hentschel:1992:ETE.
series: Writing science
URL: http://www.gbv.de/dms/goettingen/220404755.pdf
acknowledgement: ack-nhfb
rawauthor: Klaus Hentschel
rawnote: English translation by Ann M. Hentschel of the German original \cite{Hentschel:1992:ETE}.
rawtitle: The {Einstein Tower}: an intertexture of dynamic construction, {Relativity Theory}, and astronomy
bibsource:
https://www.math.utah.edu/pub/tex/bib/einstein.bib; https://www.math.utah.edu/pub/tex/bib/jhistastron.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/shps-b.bib; z3950.gbv.de:20011/gvk

TOC:
Introduction / i 1. The Young Astronomer Erwin Finlay Freundlich / 5 2. A Theorist's Observer: Freundlich's Collaboration with Einstein from 1911 / 12 3. Relativity Theory Under Scrutiny: Experimental Testing / 18 4. Statistical Investigations of Gravitational Redshift, 1915--1916 / 25 5. Berlin Science Politics: Support for Freundlich from 1913 / 35 6. Astrophysics at Potsdam and Elsewhere / 42 7. Erich Mendelsohn and the Tower Telescope Design / 53 8. Research at the Einstein Tower During the Freundlich Era / 88 9. The Solar Eclipse Expedition of 1929 / 103 10. Clashes Between Freundlich and Ludendorff / 117 11. Political Transition and Exile / 129 12. A Solitary Fate: Photon--Photon Interaction / 141 13. A Bird's-Eye View / 147 Reference Matter Abbreviations in the Notes / 157 Notes / 159 Abbreviations in the References / 189 References / 191 Index / 221

rawTOC:
Introduction / i \\ 1. The Young Astronomer Erwin Finlay Freundlich / 5 \\ 2. A Theorist's Observer: Freundlich's Collaboration with Einstein from 1911 / 12 \\ 3. Relativity Theory Under Scrutiny: Experimental Testing / 18 \\ 4. Statistical Investigations of Gravitational Redshift, 1915--1916 / 25 \\ 5. Berlin Science Politics: Support for Freundlich from 1913 / 35 \\ 6. Astrophysics at Potsdam and Elsewhere / 42 \\ 7. Erich Mendelsohn and the Tower Telescope Design / 53 \\ 8. Research at the Einstein Tower During the Freundlich Era / 88 \\ 9. The Solar Eclipse Expedition of 1929 / 103 \\ 10. Clashes Between Freundlich and Ludendorff / 117 \\ 11. Political Transition and Exile / 129 \\ 12. A Solitary Fate: Photon--Photon Interaction / 141 \\ 13. A Bird's-Eye View / 147 \\ Reference Matter Abbreviations in the Notes / 157 \\ Notes / 159 \\ Abbreviations in the References / 189 \\ References / 191 \\ Index / 221

entry:
@Book{Hentschel:1997:ETI,
  author =       "Klaus Hentschel",
  title =        "The {Einstein Tower}: an intertexture of dynamic
                 construction, {Relativity Theory}, and astronomy",
  publisher =    pub-STANFORD,
  address =      pub-STANFORD:adr,
  pages =        "xiv + 226",
  year =         "1997",
  ISBN =         "0-8047-2824-0",
  ISBN-13 =      "978-0-8047-2824-9",
  LCCN =         "QB462.65",
  bibdate =      "Wed Nov 2 07:49:15 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/jhistastron.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/shps-b.bib;
                 z3950.gbv.de:20011/gvk",
  note =         "English translation by Ann M. Hentschel of the German
                 original \cite{Hentschel:1992:ETE}.",
  series =       "Writing science",
  URL =          "http://www.gbv.de/dms/goettingen/220404755.pdf",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction / i \\
                 1. The Young Astronomer Erwin Finlay Freundlich / 5 \\
                 2. A Theorist's Observer: Freundlich's Collaboration
                 with Einstein from 1911 / 12 \\
                 3. Relativity Theory Under Scrutiny: Experimental
                 Testing / 18 \\
                 4. Statistical Investigations of Gravitational
                 Redshift, 1915--1916 / 25 \\
                 5. Berlin Science Politics: Support for Freundlich from
                 1913 / 35 \\
                 6. Astrophysics at Potsdam and Elsewhere / 42 \\
                 7. Erich Mendelsohn and the Tower Telescope Design / 53
                 \\
                 8. Research at the Einstein Tower During the Freundlich
                 Era / 88 \\
                 9. The Solar Eclipse Expedition of 1929 / 103 \\
                 10. Clashes Between Freundlich and Ludendorff / 117 \\
                 11. Political Transition and Exile / 129 \\
                 12. A Solitary Fate: Photon--Photon Interaction / 141
                 \\
                 13. A Bird's-Eye View / 147 \\
                 Reference Matter Abbreviations in the Notes / 157 \\
                 Notes / 159 \\
                 Abbreviations in the References / 189 \\
                 References / 191 \\
                 Index / 221",
}


bibtype: book
filename: master.bib
label: Herken:2002:BBT
author: Gregg Herken
publisher: pub-HENRY-HOLT
address: pub-HENRY-HOLT:adr
pages: xiv + 448
year: 2002
ISBN: 0-8050-6588-1 (hardcover) OR 0805065881 (hardcover)
ISBN13: 978-0-8050-6588-6 (hardcover) OR 9780805065886 (hardcover)
LCCN: QC16.O62 H47 2002
bibdate: Thu Oct 6 06:57:45 MDT 2011
bibtimestamp: 2011.10.06 06:57:45 MDT
acknowledgement: ack-nhfb
subjectdates: 1904--1967; 1901--1958; 1908--2003
rawauthor: Gregg Herken
title:
Brotherhood of the bomb: the tangled lives and loyalties of Robert Oppenheimer, Ernest Lawrence, and Edward Teller

bibsource:
https://www.math.utah.edu/pub/bibnet/authors/o/oppenheimer-j-robert.bib; https://www.math.utah.edu/pub/bibnet/authors/t/teller-edward.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

URL:
ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/; http://alsos.wlu.edu/information.aspx?id=1264; http://www.loc.gov/catdir/bios/hol051/2002017219.html; http://www.loc.gov/catdir/description/hol021/2002017219.html

abstract:
This biographical work focuses on Robert Oppenheimer, Ernest Lawrence, and Edward Teller, three physicists who were instrumental in developing nuclear weapons for the United States. It encompasses the making of the atomic bomb and the ensuing thermonuclear hydrogen bomb. The author provides accounts of the influence of these men on not only science but on public policy. His detailed descriptions of allegations of treason and the resulting political hearings make for interesting reading. Declassified United States government documents, wiretaps, secret cables, and official Communist Party records are used to tell an interesting, detailed story that integrates the achievements and failures of the three main characters. The work spans the period from the early 1930s to 1958. Extensive end notes provide excellent bibliographic sources.

remark:
According to two reviewers, cite Schweber:2003:BRB,Bernstein:2003:BRB, there are serious flaws in this book's treatment of Oppenheimer, although the book's author rebuts them in cite Herken:2003:CBR.

subject:
Oppenheimer, J. Robert; Lawrence, Ernest Orlando; Teller, Edward; Physicists; United States; Biography; Atomic bomb; United States; History; 20th century; Nuclear physics; United States; History; 20th century

TOC:
Part One: Temples of the future 1. Cyclotron republic 2. Practical philosopher's stone 3. Useful adviser 4. Adventurous time Part Two: Inside the wire 5. Enormoz 6. A Question of divided loyalties 7. Break, blow, burn 8. A Stone's throw from despair Part Three: Scientists in gray flannels suits 9. A World in which war will not occur 10. Character, association, and loyalty 11. A Rather puzzled horror 12. A Desperate urgency here Part Four: Sorcerer's apprentice 13. Nuclear plenty 14. A Bad business now threatening 15. Descent into the maelstrom 16. Not much more than a kangaroo court Part Five: All the evil of the times 17. The Good deeds a man has done before 18. Like going to a new country 19. Cross of atoms Epilogue Notes Bibliography Acknowledgements Index

rawabstract:
This biographical work focuses on Robert Oppenheimer, Ernest Lawrence, and Edward Teller, three physicists who were instrumental in developing nuclear weapons for the United States. It encompasses the making of the atomic bomb and the ensuing thermonuclear hydrogen bomb. The author provides accounts of the influence of these men on not only science but on public policy. His detailed descriptions of allegations of treason and the resulting political hearings make for interesting reading. Declassified United States government documents, wiretaps, secret cables, and official Communist Party records are used to tell an interesting, detailed story that integrates the achievements and failures of the three main characters. The work spans the period from the early 1930s to 1958. Extensive end notes provide excellent bibliographic sources.

rawtitle:
Brotherhood of the bomb: the tangled lives and loyalties of {Robert Oppenheimer}, {Ernest Lawrence}, and {Edward Teller}

rawTOC:
Part One: Temples of the future \\ 1. Cyclotron republic \\ 2. Practical philosopher's stone \\ 3. Useful adviser \\ 4. Adventurous time \\ Part Two: Inside the wire \\ 5. Enormoz \\ 6. A Question of divided loyalties \\ 7. Break, blow, burn \\ 8. A Stone's throw from despair \\ Part Three: Scientists in gray flannels suits \\ 9. A World in which war will not occur \\ 10. Character, association, and loyalty \\ 11. A Rather puzzled horror \\ 12. A Desperate urgency here \\ Part Four: Sorcerer's apprentice \\ 13. Nuclear plenty \\ 14. A Bad business now threatening \\ 15. Descent into the maelstrom \\ 16. Not much more than a kangaroo court \\ Part Five: All the evil of the times \\ 17. The Good deeds a man has done before \\ 18. Like going to a new country \\ 19. Cross of atoms \\ Epilogue \\ Notes \\ Bibliography \\ Acknowledgements \\ Index

entry:
@Book{Herken:2002:BBT,
  author =       "Gregg Herken",
  title =        "Brotherhood of the bomb: the tangled lives and
                 loyalties of {Robert Oppenheimer}, {Ernest Lawrence},
                 and {Edward Teller}",
  publisher =    pub-HENRY-HOLT,
  address =      pub-HENRY-HOLT:adr,
  pages =        "xiv + 448",
  year =         "2002",
  ISBN =         "0-8050-6588-1 (hardcover)",
  ISBN-13 =      "978-0-8050-6588-6 (hardcover)",
  LCCN =         "QC16.O62 H47 2002",
  bibdate =      "Thu Oct 6 06:57:45 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/o/oppenheimer-j-robert.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/teller-edward.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",
  URL =          "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/;
                 http://alsos.wlu.edu/information.aspx?id=1264;
                 http://www.loc.gov/catdir/bios/hol051/2002017219.html;
                 http://www.loc.gov/catdir/description/hol021/2002017219.html",
  abstract =     "This biographical work focuses on Robert Oppenheimer,
                 Ernest Lawrence, and Edward Teller, three physicists
                 who were instrumental in developing nuclear weapons for
                 the United States. It encompasses the making of the
                 atomic bomb and the ensuing thermonuclear hydrogen
                 bomb. The author provides accounts of the influence of
                 these men on not only science but on public policy. His
                 detailed descriptions of allegations of treason and the
                 resulting political hearings make for interesting
                 reading. Declassified United States government
                 documents, wiretaps, secret cables, and official
                 Communist Party records are used to tell an
                 interesting, detailed story that integrates the
                 achievements and failures of the three main characters.
                 The work spans the period from the early 1930s to 1958.
                 Extensive end notes provide excellent bibliographic
                 sources.",
  acknowledgement = ack-nhfb,
  remark =       "According to two reviewers,
                 \cite{Schweber:2003:BRB,Bernstein:2003:BRB}, there are
                 serious flaws in this book's treatment of Oppenheimer,
                 although the book's author rebuts them in
                 \cite{Herken:2003:CBR}.",
  subject =      "Oppenheimer, J. Robert; Lawrence, Ernest Orlando;
                 Teller, Edward; Physicists; United States; Biography;
                 Atomic bomb; United States; History; 20th century;
                 Nuclear physics; United States; History; 20th century",
  subject-dates = "1904--1967; 1901--1958; 1908--2003",
  tableofcontents = "Part One: Temples of the future \\
                 1. Cyclotron republic \\
                 2. Practical philosopher's stone \\
                 3. Useful adviser \\
                 4. Adventurous time \\
                 Part Two: Inside the wire \\
                 5. Enormoz \\
                 6. A Question of divided loyalties \\
                 7. Break, blow, burn \\
                 8. A Stone's throw from despair \\
                 Part Three: Scientists in gray flannels suits \\
                 9. A World in which war will not occur \\
                 10. Character, association, and loyalty \\
                 11. A Rather puzzled horror \\
                 12. A Desperate urgency here \\
                 Part Four: Sorcerer's apprentice \\
                 13. Nuclear plenty \\
                 14. A Bad business now threatening \\
                 15. Descent into the maelstrom \\
                 16. Not much more than a kangaroo court \\
                 Part Five: All the evil of the times \\
                 17. The Good deeds a man has done before \\
                 18. Like going to a new country \\
                 19. Cross of atoms \\
                 Epilogue \\
                 Notes \\
                 Bibliography \\
                 Acknowledgements \\
                 Index",
}


bibtype: book
filename: master.bib
label: Herlihy:2008:AMP
author: Maurice Herlihy and Nir Shavit
title: The art of multiprocessor programming
publisher: pub-MORGAN-KAUFMANN
address: pub-MORGAN-KAUFMANN:adr
pages: xx + 508
year: 2008
ISBN: 0-12-370591-6 (paperback), 0-08-056958-7 (e-book) OR 0123705916 (paperback), 0080569587 (ebook)
LCCN: QA76.6 .H475 2008
bibdate: Mon May 5 13:29:13 MDT 2008
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; libraries.colorado.edu:210/INNOPAC
bibtimestamp: 2008.05.05 13:29:13 MDT
subject: multiprogramming (electronic computers); multiprocessors
acknowledgement: ack-nhfb
rawauthor: Maurice Herlihy and Nir Shavit
rawtitle: The art of multiprocessor programming
ISBN13:
978-0-12-370591-4 (paperback), 978-0-08-056958-1 (e-book) OR 9780123705914 (paperback), 9780080569581 (ebook)

TOC:
1. Introduction I. Principles 2. Mutual Exclusion 3. Concurrent Objects 4. Foundations of Shared Memory 5. The Relative Power of Primitive Synchronization Operations 6. Universality of Consensus II. Practice 7. Spin Locks and Contention 8. Monitors and Blocking Synchronization 9. Linked Lists: The Role of Locking 10. Concurrent Queues and the ABA Problem 11. Concurrent Stacks and Elimination 12. Counting, Sorting, and Distributed Coordination 13. Concurrent Hashing and Natural Parallelism 14. Skiplists and Balanced Search 15. Priority Queues 16. Futures, Scheduling, and Work Distribution 17. Barriers 18. Transactional Memory III. Appendix A. Software Basics B. Hardware Basics.

rawTOC:
1. Introduction \\ I. Principles \\ 2. Mutual Exclusion \\ 3. Concurrent Objects \\ 4. Foundations of Shared Memory \\ 5. The Relative Power of Primitive Synchronization Operations \\ 6. Universality of Consensus \\ II. Practice \\ 7. Spin Locks and Contention \\ 8. Monitors and Blocking Synchronization \\ 9. Linked Lists: The Role of Locking \\ 10. Concurrent Queues and the ABA Problem \\ 11. Concurrent Stacks and Elimination \\ 12. Counting, Sorting, and Distributed Coordination \\ 13. Concurrent Hashing and Natural Parallelism \\ 14. Skiplists and Balanced Search \\ 15. Priority Queues \\ 16. Futures, Scheduling, and Work Distribution \\ 17. Barriers \\ 18. Transactional Memory \\ III. Appendix \\ A. Software Basics \\ B. Hardware Basics.

entry:
@Book{Herlihy:2008:AMP,
  author =       "Maurice Herlihy and Nir Shavit",
  title =        "The art of multiprocessor programming",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  pages =        "xx + 508",
  year =         "2008",
  ISBN =         "0-12-370591-6 (paperback), 0-08-056958-7 (e-book)",
  ISBN-13 =      "978-0-12-370591-4 (paperback), 978-0-08-056958-1
                 (e-book)",
  LCCN =         "QA76.6 .H475 2008",
  bibdate =      "Mon May 5 13:29:13 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 libraries.colorado.edu:210/INNOPAC",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "multiprogramming (electronic computers);
                 multiprocessors",
  tableofcontents = "1. Introduction \\
                 I. Principles \\
                 2. Mutual Exclusion \\
                 3. Concurrent Objects \\
                 4. Foundations of Shared Memory \\
                 5. The Relative Power of Primitive Synchronization
                 Operations \\
                 6. Universality of Consensus \\
                 II. Practice \\
                 7. Spin Locks and Contention \\
                 8. Monitors and Blocking Synchronization \\
                 9. Linked Lists: The Role of Locking \\
                 10. Concurrent Queues and the ABA Problem \\
                 11. Concurrent Stacks and Elimination \\
                 12. Counting, Sorting, and Distributed Coordination \\
                 13. Concurrent Hashing and Natural Parallelism \\
                 14. Skiplists and Balanced Search \\
                 15. Priority Queues \\
                 16. Futures, Scheduling, and Work Distribution \\
                 17. Barriers \\
                 18. Transactional Memory \\
                 III. Appendix \\
                 A. Software Basics \\
                 B. Hardware Basics.",
}


bibtype: techreport
filename: master.bib
label: Hershey:advanced-typography
author: Allen V. Hershey
title: Advanced Computer Typography
number: NPS012-81-005
institution: pub-USNPS
address: pub-USNPS:adr
pages: xx + 508
month: dec
monthnumber: 12
year: 1981
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: Allen V. Hershey
rawtitle: Advanced Computer Typography
entry:
@TechReport{Hershey:advanced-typography,
  author =       "Allen V. Hershey",
  title =        "Advanced Computer Typography",
  number =       "NPS012-81-005",
  institution =  pub-USNPS,
  address =      pub-USNPS:adr,
  month =        dec,
  year =         "1981",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: master.bib
label: Hershey:calligraphy
author: Allen V. Hershey
title: Calligraphy for Computers
number: TR-2101
institution: pub-USNWL
address: pub-USNWL:adr
pages: xx + 508
month: aug
monthnumber: 8
year: 1967
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: Allen V. Hershey
rawtitle: Calligraphy for Computers
entry:
@TechReport{Hershey:calligraphy,
  author =       "Allen V. Hershey",
  title =        "Calligraphy for Computers",
  number =       "TR-2101",
  institution =  pub-USNWL,
  address =      pub-USNWL:adr,
  month =        aug,
  year =         "1967",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: master.bib
label: Hershey:computer-typography
author: Allen V. Hershey
title: A Computer System for Scientific Typography
journal: j-CGIP
volume: 1
pages: 373--385
year: 1972
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: Allen V. Hershey
rawtitle: A Computer System for Scientific Typography
entry:
@Article{Hershey:computer-typography,
  author =       "Allen V. Hershey",
  title =        "A Computer System for Scientific Typography",
  journal =      j-CGIP,
  volume =       "1",
  pages =        "373--385",
  year =         "1972",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: master.bib
label: Hershey:fortran-cartography
author: Allen V. Hershey
title: FORTRAN IV Programming for Cartography and Typography
number: TR-2339
institution: pub-USNWL
address: pub-USNWL:adr
pages: 373--385
month: sep
monthnumber: 9
year: 1969
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: Allen V. Hershey
rawtitle: {FORTRAN IV} Programming for Cartography and Typography
entry:
@TechReport{Hershey:fortran-cartography,
  author =       "Allen V. Hershey",
  title =        "{FORTRAN IV} Programming for Cartography and
                 Typography",
  number =       "TR-2339",
  institution =  pub-USNWL,
  address =      pub-USNWL:adr,
  month =        sep,
  year =         "1969",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: master.bib
label: Hershey:fortran-typography
author: Allen V. Hershey
title: Preparation of Reports with the FORTRAN Typographic System
number: TN-K\slash 27-70
institution: pub-USNWL
address: pub-USNWL:adr
pages: 373--385
month: sep
monthnumber: 9
year: 1970
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: Allen V. Hershey
rawtitle: Preparation of Reports with the {FORTRAN} Typographic System
entry:
@TechReport{Hershey:fortran-typography,
  author =       "Allen V. Hershey",
  title =        "Preparation of Reports with the {FORTRAN} Typographic
                 System",
  number =       "TN-K\slash 27-70",
  institution =  pub-USNWL,
  address =      pub-USNWL:adr,
  month =        sep,
  year =         "1970",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: master.bib
label: Hershey:fourier
author: Allen V. Hershey
title: A Comment on the Fourier Theorem
number: TR-3145
institution: pub-USNWL
address: pub-USNWL:adr
pages: 373--385
month: jun
monthnumber: 6
year: 1974
bibdate: Fri Feb 9 18:04:33 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1996.02.09 18:04:33 ???
acknowledgement: ack-nhfb
rawauthor: Allen V. Hershey
rawtitle: A Comment on the {Fourier} Theorem
entry:
@TechReport{Hershey:fourier,
  author =       "Allen V. Hershey",
  title =        "A Comment on the {Fourier} Theorem",
  number =       "TR-3145",
  institution =  pub-USNWL,
  address =      pub-USNWL:adr,
  month =        jun,
  year =         "1974",
  bibdate =      "Fri Feb 9 18:04:33 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: master.bib
label: Hershey:lagally
author: Allen V. Hershey
title: A Comment on the Lagally Theorem
number: TR-3133
institution: pub-USNWL
address: pub-USNWL:adr
pages: 373--385
month: may
monthnumber: 5
year: 1974
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: Allen V. Hershey
rawtitle: A Comment on the Lagally Theorem
entry:
@TechReport{Hershey:lagally,
  author =       "Allen V. Hershey",
  title =        "A Comment on the Lagally Theorem",
  number =       "TR-3133",
  institution =  pub-USNWL,
  address =      pub-USNWL:adr,
  month =        may,
  year =         "1974",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: master.bib
label: Hershey:wavetrains
author: Allen V. Hershey
title: FORTRAN Programming for Surface Wave Trains
number: TR-2714
institution: pub-USNWL
address: pub-USNWL:adr
pages: 373--385
month: sep
monthnumber: 9
year: 1972
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: Allen V. Hershey
rawtitle: {FORTRAN} Programming for Surface Wave Trains
entry:
@TechReport{Hershey:wavetrains,
  author =       "Allen V. Hershey",
  title =        "{FORTRAN} Programming for Surface Wave Trains",
  number =       "TR-2714",
  institution =  pub-USNWL,
  address =      pub-USNWL:adr,
  month =        sep,
  year =         "1972",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: master.bib
label: Hershey:wavetrains-2
author: Allen V. Hershey
title: Interpolation of Surface Wave Trains
number: TR-3064
institution: pub-USNWL
address: pub-USNWL:adr
pages: 373--385
month: sep
monthnumber: 9
year: 1972
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: Allen V. Hershey
rawtitle: Interpolation of Surface Wave Trains
entry:
@TechReport{Hershey:wavetrains-2,
  author =       "Allen V. Hershey",
  title =        "Interpolation of Surface Wave Trains",
  number =       "TR-3064",
  institution =  pub-USNWL,
  address =      pub-USNWL:adr,
  month =        sep,
  year =         "1972",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Herz-Fischler:1987:MHD
author: Roger Herz-Fischler
title: A Mathematical History of Division in Extreme and Mean Ratio
publisher: Wilfrid Laurier University Press
address: Waterloo, ON, Canada
pages: xvi + 191
year: 1987
ISBN: 0-88920-152-8 OR 0889201528
ISBN13: 978-0-88920-152-1 OR 9780889201521
LCCN: A481.H47 1987
bibdate: Thu Jul 10 08:02:28 2003
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2003.07.10 08:02:28 ???
acknowledgement: ack-nhfb
rawauthor: Roger Herz-Fischler
rawtitle: A Mathematical History of Division in Extreme and Mean Ratio
abstract:
A comprehensive study of the historic development of division in extreme and mean ratio (``the golden number''), this text traces the concept's development from its first appearance in Euclid's Elements through the 18th century. The coherent but rigorous presentation offers clear explanations of DEMR's historical transmission, poses controversial views on the concept's relationship to other mathematical topics, and features numerous illustrations.

TOC:
Introduction 1: The Euclidean text 2: Mathematical topics 3: Examples of the pentagon, pentagram, and dodecahedron before -400 4: The Pythagoreans 5: Miscellaneous theories 6: The classical period: from Theodorus to Euclid 7: The post-Euclidean Greek period (c. -300 to 350) 8: The Arabic world, India, and China 9: Europe: from the Middle Ages through the eighteenth century

rawabstract:
A comprehensive study of the historic development of division in extreme and mean ratio (``the golden number''), this text traces the concept's development from its first appearance in Euclid's Elements through the 18th century. The coherent but rigorous presentation offers clear explanations of DEMR's historical transmission, poses controversial views on the concept's relationship to other mathematical topics, and features numerous illustrations.

rawTOC:
Introduction \\ 1: The Euclidean text \\ 2: Mathematical topics \\ 3: Examples of the pentagon, pentagram, and dodecahedron before -400 \\ 4: The Pythagoreans \\ 5: Miscellaneous theories \\ 6: The classical period: from Theodorus to Euclid \\ 7: The post-Euclidean Greek period (c. -300 to 350) \\ 8: The Arabic world, India, and China \\ 9: Europe: from the Middle Ages through the eighteenth century

entry:
@Book{Herz-Fischler:1987:MHD,
  author =       "Roger Herz-Fischler",
  title =        "A Mathematical History of Division in Extreme and Mean
                 Ratio",
  publisher =    "Wilfrid Laurier University Press",
  address =      "Waterloo, ON, Canada",
  pages =        "xvi + 191",
  year =         "1987",
  ISBN =         "0-88920-152-8",
  ISBN-13 =      "978-0-88920-152-1",
  LCCN =         "A481.H47 1987",
  bibdate =      "Thu Jul 10 08:02:28 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$65.00",
  abstract =     "A comprehensive study of the historic development of
                 division in extreme and mean ratio (``the golden
                 number''), this text traces the concept's development
                 from its first appearance in Euclid's Elements through
                 the 18th century. The coherent but rigorous
                 presentation offers clear explanations of DEMR's
                 historical transmission, poses controversial views on
                 the concept's relationship to other mathematical
                 topics, and features numerous illustrations.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Introduction \\
                 1: The Euclidean text \\
                 2: Mathematical topics \\
                 3: Examples of the pentagon, pentagram, and
                 dodecahedron before -400 \\
                 4: The Pythagoreans \\
                 5: Miscellaneous theories \\
                 6: The classical period: from Theodorus to Euclid \\
                 7: The post-Euclidean Greek period (c. -300 to 350) \\
                 8: The Arabic world, India, and China \\
                 9: Europe: from the Middle Ages through the eighteenth
                 century",
}


bibtype: book
filename: master.bib
label: Herz-Fischler:1998:MHG
author: Roger Herz-Fischler
title: A Mathematical History of Golden Number
publisher: pub-DOVER
address: pub-DOVER:adr
pages: xxii + 195
year: 1998
ISBN: 0-486-40007-7 OR 0486400077
ISBN13: 978-0-486-40007-5 OR 9780486400075
LCCN: QA481.H47 1998
bibdate: Thu Jul 10 08:02:28 2003
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2003.07.10 08:02:28 ???
acknowledgement: ack-nhfb
annote: Reprint of ``Mathematical history of division in extreme and mean ratio''
rawauthor: Roger Herz-Fischler
rawtitle: A Mathematical History of Golden Number
entry:
@Book{Herz-Fischler:1998:MHG,
  author =       "Roger Herz-Fischler",
  title =        "A Mathematical History of Golden Number",
  publisher =    pub-DOVER,
  address =      pub-DOVER:adr,
  pages =        "xxii + 195",
  year =         "1998",
  ISBN =         "0-486-40007-7",
  ISBN-13 =      "978-0-486-40007-5",
  LCCN =         "QA481.H47 1998",
  bibdate =      "Thu Jul 10 08:02:28 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  annote =       "Reprint of ``Mathematical history of division in
                 extreme and mean ratio''",
  libnote =      "Not yet in my library.",
}


bibtype: book
filename: master.bib
label: Herzberg:1945:MSM
author: Gerhard Herzberg
title: Molecular Spectra and Molecular Structure: II. Infrared and Raman Spectra of Polyatomic Molecules
publisher: pub-VAN-NOSTRAND-REINHOLD
address: pub-VAN-NOSTRAND-REINHOLD:adr
pages: xiii + 632
year: 1945
ISBN: 0-442-03386-9 OR 0442033869
ISBN13: 978-0-442-03386-6 OR 9780442033866
LCCN: QC451 .H464
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: Gerhard Herzberg
rawtitle:
Molecular Spectra and Molecular Structure: {II}. Infrared and {Raman} Spectra of Polyatomic Molecules

entry:
@Book{Herzberg:1945:MSM,
  author =       "Gerhard Herzberg",
  title =        "Molecular Spectra and Molecular Structure: {II}.
                 Infrared and {Raman} Spectra of Polyatomic Molecules",
  publisher =    pub-VAN-NOSTRAND-REINHOLD,
  address =      pub-VAN-NOSTRAND-REINHOLD:adr,
  pages =        "xiii + 632",
  year =         "1945",
  ISBN =         "0-442-03386-9",
  ISBN-13 =      "978-0-442-03386-6",
  LCCN =         "QC451 .H464",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Herzberg:1950:MSM
author: Gerhard Herzberg
title: Molecular Spectra and Molecular Structure: I. Spectra of Diatomic Molecules
publisher: pub-VAN-NOSTRAND-REINHOLD
address: pub-VAN-NOSTRAND-REINHOLD:adr
edition: Second
pages: xiii + 658
year: 1950
ISBN: 0-442-03385-0 OR 0442033850
ISBN13: 978-0-442-03385-9 OR 9780442033859
LCCN: QC451 .H455 1950
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: Gerhard Herzberg
rawtitle: Molecular Spectra and Molecular Structure: {I}. Spectra of Diatomic Molecules
subject:
Spectrum analysis; Molecules; Molecules; Spectrum analysis; Tweeatomige moleculen; Moleculaire spectrometrie; Elektronenstructuur; Molecuulstructuur

TOC:
Resume of the elements of atomic structure Observed molecular spectra and their representation by empirical formulae Rotation and vibration of diatomic molecules Interpretation of infrared and Raman spectra Elementary discussion of electronic states and electronic transitions Finer details about electronic states and electronic transitions Building-up principles, electron configurations, and valence Continuous and diffuse molecular spectra: dissociation and predissociation Examples, results, and applications

rawTOC:
R{\'e}sum{\'e} of the elements of atomic structure \\ Observed molecular spectra and their representation by empirical formulae \\ Rotation and vibration of diatomic molecules \\ Interpretation of infrared and Raman spectra \\ Elementary discussion of electronic states and electronic transitions \\ Finer details about electronic states and electronic transitions \\ Building-up principles, electron configurations, and valence \\ Continuous and diffuse molecular spectra: dissociation and predissociation \\ Examples, results, and applications

entry:
@Book{Herzberg:1950:MSM,
  author =       "Gerhard Herzberg",
  title =        "Molecular Spectra and Molecular Structure: {I}.
                 Spectra of Diatomic Molecules",
  publisher =    pub-VAN-NOSTRAND-REINHOLD,
  address =      pub-VAN-NOSTRAND-REINHOLD:adr,
  edition =      "Second",
  pages =        "xiii + 658",
  year =         "1950",
  ISBN =         "0-442-03385-0",
  ISBN-13 =      "978-0-442-03385-9",
  LCCN =         "QC451 .H455 1950",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  subject =      "Spectrum analysis; Molecules; Molecules; Spectrum
                 analysis; Tweeatomige moleculen; Moleculaire
                 spectrometrie; Elektronenstructuur; Molecuulstructuur",
  tableofcontents = "R{\'e}sum{\'e} of the elements of atomic structure
                 \\
                 Observed molecular spectra and their representation by
                 empirical formulae \\
                 Rotation and vibration of diatomic molecules \\
                 Interpretation of infrared and Raman spectra \\
                 Elementary discussion of electronic states and
                 electronic transitions \\
                 Finer details about electronic states and electronic
                 transitions \\
                 Building-up principles, electron configurations, and
                 valence \\
                 Continuous and diffuse molecular spectra: dissociation
                 and predissociation \\
                 Examples, results, and applications",
}


bibtype: book
filename: master.bib
label: Herzberg:1966:MSM
author: Gerhard Herzberg
publisher: pub-VAN-NOSTRAND-REINHOLD
address: pub-VAN-NOSTRAND-REINHOLD:adr
pages: xviii + 745
year: 1966
ISBN: 0-442-03387-7 OR 0442033877
ISBN13: 978-0-442-03387-3 OR 9780442033873
LCCN: QC451 .H455 v.3
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: Gerhard Herzberg
title:
Molecular Spectra and Molecular Structure: III. Electronic Spectra and Electronic Structure of Polyatomic Molecules

rawtitle:
Molecular Spectra and Molecular Structure: {III}. Electronic Spectra and Electronic Structure of Polyatomic Molecules

entry:
@Book{Herzberg:1966:MSM,
  author =       "Gerhard Herzberg",
  title =        "Molecular Spectra and Molecular Structure: {III}.
                 Electronic Spectra and Electronic Structure of
                 Polyatomic Molecules",
  publisher =    pub-VAN-NOSTRAND-REINHOLD,
  address =      pub-VAN-NOSTRAND-REINHOLD:adr,
  pages =        "xviii + 745",
  year =         "1966",
  ISBN =         "0-442-03387-7",
  ISBN-13 =      "978-0-442-03387-3",
  LCCN =         "QC451 .H455 v.3",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Hess:2010:PVS
author: Kenneth Hess and Amy Newman
title: Practical Virtualization Solutions: Virtualization from the Trenches
publisher: Prentice Hall / Pearson Education
address: Upper Saddle River, NJ, USA
pages: xxiii + 304
year: 2010
ISBN: 0-13-714297-8 (paperback) OR 0137142978 (paperback)
ISBN13: 978-0-13-714297-2 (paperback) OR 9780137142972 (paperback)
LCCN: QA76.9.V5 H47 2010
bibdate: Thu Jan 21 14:38:30 MST 2010
bibtimestamp: 2010.01.21 14:38:30 MST
series: Negus software solutions series
subject: Virtual computer systems; Management
acknowledgement: ack-nhfb
rawauthor: Kenneth Hess and Amy Newman
rawtitle: Practical Virtualization Solutions: Virtualization from the Trenches
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager

TOC:
Virtualization basics and techology choices: To virtualize or not to virtualize Comparing virtualization technologies VMware server VMware ESXi Citrix XenServer Microsoft virtual PC Microsoft Hyper-V VirtualBox Applying virtualization: Server virtualization in action Desktop virtualization in action Network and storage virtualization in action Building the virtual infrastructure: hardware's role in virtualization: Form-factor choices and their implications Choosing a vendor Beyond the box From development to production: managing the virtual infrastructure: Laying the foundation: the planning stage Deployment Postproduction: wrapping it up Virtual machine installation

rawTOC:
Virtualization basics and techology choices: To virtualize or not to virtualize \\ Comparing virtualization technologies \\ VMware server \\ VMware ESXi \\ Citrix XenServer \\ Microsoft virtual PC \\ Microsoft Hyper-V \\ VirtualBox \\ Applying virtualization: Server virtualization in action \\ Desktop virtualization in action \\ Network and storage virtualization in action \\ Building the virtual infrastructure: hardware's role in virtualization: Form-factor choices and their implications \\ Choosing a vendor \\ Beyond the box \\ From development to production: managing the virtual infrastructure: Laying the foundation: the planning stage \\ Deployment \\ Postproduction: wrapping it up \\ Virtual machine installation

entry:
@Book{Hess:2010:PVS,
  author =       "Kenneth Hess and Amy Newman",
  title =        "Practical Virtualization Solutions: Virtualization
                 from the Trenches",
  publisher =    "Prentice Hall\slash Pearson Education",
  address =      "Upper Saddle River, NJ, USA",
  pages =        "xxiii + 304",
  year =         "2010",
  ISBN =         "0-13-714297-8 (paperback)",
  ISBN-13 =      "978-0-13-714297-2 (paperback)",
  LCCN =         "QA76.9.V5 H47 2010",
  bibdate =      "Thu Jan 21 14:38:30 MST 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Negus software solutions series",
  acknowledgement = ack-nhfb,
  subject =      "Virtual computer systems; Management",
  tableofcontents = "Virtualization basics and techology choices: To
                 virtualize or not to virtualize \\
                 Comparing virtualization technologies \\
                 VMware server \\
                 VMware ESXi \\
                 Citrix XenServer \\
                 Microsoft virtual PC \\
                 Microsoft Hyper-V \\
                 VirtualBox \\
                 Applying virtualization: Server virtualization in
                 action \\
                 Desktop virtualization in action \\
                 Network and storage virtualization in action \\
                 Building the virtual infrastructure: hardware's role in
                 virtualization: Form-factor choices and their
                 implications \\
                 Choosing a vendor \\
                 Beyond the box \\
                 From development to production: managing the virtual
                 infrastructure: Laying the foundation: the planning
                 stage \\
                 Deployment \\
                 Postproduction: wrapping it up \\
                 Virtual machine installation",
}


bibtype: book
filename: master.bib
label: Heudin:1992:RA
author: Jean-Claude Heudin and Christian Panetto
title: RISC Architectures
publisher: pub-CHAPMAN-HALL
address: pub-CHAPMAN-HALL:adr
pages: ix + 261
year: 1992
ISBN: 0-412-45340-1 OR 0412453401
ISBN13: 978-0-412-45340-3 OR 9780412453403
LCCN: QA76.9.A93 H48 1992
bibdate: Wed Aug 10 11:56:30 1994
bibtimestamp: 1994.08.10 11:56:30 ???
subject: RISC microprocessors; Reduced instruction set computers; Computer architecture
acknowledgement: ack-nhfb
rawauthor: Jean-Claude Heudin and Christian Panetto
rawtitle: {RISC} Architectures
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/microchip.bib

TOC:
1. The RISC architecture history 1.1. Constraints in Microprocessor Design 1.2. The Technology Evolution 1.3. RISC Pioneers 1.4. The Berkeley RISC Project 1.5. The Stanford MIPS Project 1.6. Future Research Directions 1.7. RISC Versus CISC 2. Principles of the RISC design methodology 2.1. The RISC Methodology 2.2. A Reduced and Homogeneous Instruction Set 2.3. A Streamlined Architecture 2.4. The Memory Bottleneck 2.5. Controversies 2.6. RISC Versus CISC 3. Overview of RISC microprocessors 3.1. RISC Products 3.2. The SPARC Architecture from Sun Microsystems Inc. 3.3. The R3000 Architecture from MIPS Computer Systems 3.4. The AM29000 Architecture from Advanced Micro Devices 3.5. The 88100 Architecture from Motorola 3.6. The 80960 Architecture from Intel 3.7. The i860 Architecture from Intel 3.8. The C400 Architecture from Intergraph 3.9. The POWER Architecture from IBM 3.10. The ARM Architecture from ACORN 3.11. The IMS T800 Transputer Architecture from INMOS 3.12. Other RISC Processors 3.13. RISC Architecture Comparison 4. An example: the KIM20 microprocessor 4.1. A RISC Architecture for Artificial Intelligence 4.2. The Programming Model 4.3. KIM20 Hardware Architecture 4.4. Software and Performance Aspects

rawTOC:
1. The RISC architecture history \\ 1.1. Constraints in Microprocessor Design \\ 1.2. The Technology Evolution \\ 1.3. RISC Pioneers \\ 1.4. The Berkeley RISC Project \\ 1.5. The Stanford MIPS Project \\ 1.6. Future Research Directions \\ 1.7. RISC Versus CISC \\ 2. Principles of the RISC design methodology \\ 2.1. The RISC Methodology \\ 2.2. A Reduced and Homogeneous Instruction Set \\ 2.3. A Streamlined Architecture \\ 2.4. The Memory Bottleneck \\ 2.5. Controversies \\ 2.6. RISC Versus CISC \\ 3. Overview of RISC microprocessors \\ 3.1. RISC Products \\ 3.2. The SPARC Architecture from Sun Microsystems Inc. \\ 3.3. The R3000 Architecture from MIPS Computer Systems \\ 3.4. The AM29000 Architecture from Advanced Micro Devices \\ 3.5. The 88100 Architecture from Motorola \\ 3.6. The 80960 Architecture from Intel \\ 3.7. The i860 Architecture from Intel \\ 3.8. The C400 Architecture from Intergraph \\ 3.9. The POWER Architecture from IBM \\ 3.10. The ARM Architecture from ACORN \\ 3.11. The IMS T800 Transputer Architecture from INMOS \\ 3.12. Other RISC Processors \\ 3.13. RISC Architecture Comparison \\ 4. An example: the KIM20 microprocessor \\ 4.1. A RISC Architecture for Artificial Intelligence \\ 4.2. The Programming Model \\ 4.3. KIM20 Hardware Architecture \\ 4.4. Software and Performance Aspects

entry:
@Book{Heudin:1992:RA,
  author =       "Jean-Claude Heudin and Christian Panetto",
  title =        "{RISC} Architectures",
  publisher =    pub-CHAPMAN-HALL,
  address =      pub-CHAPMAN-HALL:adr,
  pages =        "ix + 261",
  year =         "1992",
  ISBN =         "0-412-45340-1",
  ISBN-13 =      "978-0-412-45340-3",
  LCCN =         "QA76.9.A93 H48 1992",
  bibdate =      "Wed Aug 10 11:56:30 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/microchip.bib",
  price =        "US\$43.95",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "RISC microprocessors; Reduced instruction set
                 computers; Computer architecture",
  tableofcontents = "1. The RISC architecture history \\
                 1.1. Constraints in Microprocessor Design \\
                 1.2. The Technology Evolution \\
                 1.3. RISC Pioneers \\
                 1.4. The Berkeley RISC Project \\
                 1.5. The Stanford MIPS Project \\
                 1.6. Future Research Directions \\
                 1.7. RISC Versus CISC \\
                 2. Principles of the RISC design methodology \\
                 2.1. The RISC Methodology \\
                 2.2. A Reduced and Homogeneous Instruction Set \\
                 2.3. A Streamlined Architecture \\
                 2.4. The Memory Bottleneck \\
                 2.5. Controversies \\
                 2.6. RISC Versus CISC \\
                 3. Overview of RISC microprocessors \\
                 3.1. RISC Products \\
                 3.2. The SPARC Architecture from Sun Microsystems Inc.
                 \\
                 3.3. The R3000 Architecture from MIPS Computer Systems
                 \\
                 3.4. The AM29000 Architecture from Advanced Micro
                 Devices \\
                 3.5. The 88100 Architecture from Motorola \\
                 3.6. The 80960 Architecture from Intel \\
                 3.7. The i860 Architecture from Intel \\
                 3.8. The C400 Architecture from Intergraph \\
                 3.9. The POWER Architecture from IBM \\
                 3.10. The ARM Architecture from ACORN \\
                 3.11. The IMS T800 Transputer Architecture from INMOS
                 \\
                 3.12. Other RISC Processors \\
                 3.13. RISC Architecture Comparison \\
                 4. An example: the KIM20 microprocessor \\
                 4.1. A RISC Architecture for Artificial Intelligence
                 \\
                 4.2. The Programming Model \\
                 4.3. KIM20 Hardware Architecture \\
                 4.4. Software and Performance Aspects",
}


bibtype: book
filename: master.bib
label: Heyne:2007:LEM
author: Andreas K. Heyne and Alice K. Heyne and Elena S. Pini and Tahu Matheson
title: Leonhard Euler: a man to be reckoned with
publisher: pub-BIRKHAUSER
address: pub-BIRKHAUSER:adr
pages: 45
year: 2007
ISBN: 3-7643-8332-1 OR 3764383321
ISBN13: 978-3-7643-8332-9 OR 9783764383329
LCCN: QA29.E8 H49 2007
bibdate: Wed Nov 26 22:46:07 MST 2008
bibtimestamp: 2008.11.26 22:46:07 MST
remark: Comic book.
acknowledgement: ack-nhfb
rawauthor: Andreas K. Heyne and Alice K. Heyne and Elena S. Pini and Tahu Matheson
rawtitle: {Leonhard Euler}: a man to be reckoned with
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; prodorbis.library.yale.edu:7090/voyager; z3950.loc.gov:7090/Voyager

entry:
@Book{Heyne:2007:LEM,
  author =       "Andreas K. Heyne and Alice K. Heyne and Elena S. Pini
                 and Tahu Matheson",
  title =        "{Leonhard Euler}: a man to be reckoned with",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "45",
  year =         "2007",
  ISBN =         "3-7643-8332-1",
  ISBN-13 =      "978-3-7643-8332-9",
  LCCN =         "QA29.E8 H49 2007",
  bibdate =      "Wed Nov 26 22:46:07 MST 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 prodorbis.library.yale.edu:7090/voyager;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  remark =       "Comic book.",
}


bibtype: book
filename: master.bib
label: Higham:1993:HWM
author: Nicholas J. Higham
title: Handbook of Writing for the Mathematical Sciences
publisher: pub-SIAM
address: pub-SIAM:adr
pages: xii + 241
month: jun
monthnumber: 6
year: 1993
ISBN: 0-89871-314-5 OR 0898713145
ISBN13: 978-0-89871-314-5 OR 9780898713145
LCCN: QA42.H54 1993
bibdate: Mon Oct 4 08:48:35 1993
bibtimestamp: 1993.10.04 08:48:35 ???
acknowledgement: ack-njh
rawauthor: Nicholas J. Higham
rawtitle: Handbook of Writing for the Mathematical Sciences
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/h/higham-nicholas-john.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

TOC:
Preface 1: General Principles 2: Writer's Tools and Recommended Reading 3: Mathematical Writing 4: English Usage 5: When English is a Foreign Language 6: Writing a Paper 7: Revising a Draft 8: Publishing a Paper 9: Writing a Talk 10: Computer Aids for Writing and Research Appendix A: The Greek Alphabet Appendix B: Summary of TeX and LaTeX Symbols Appendix C: GNU Emacs--The Sixty+ Most Useful Commands; Appendix D: Mathematical Organizations in the UK and USA Appendix E: Winners of Prizes for Expository Writing; Appendix F: Glossary Bibliography Index

rawTOC:
Preface \\ 1: General Principles \\ 2: Writer's Tools and Recommended Reading \\ 3: Mathematical Writing \\ 4: English Usage \\ 5: When English is a Foreign Language \\ 6: Writing a Paper \\ 7: Revising a Draft \\ 8: Publishing a Paper \\ 9: Writing a Talk \\ 10: Computer Aids for Writing and Research \\ Appendix A: The Greek Alphabet \\ Appendix B: Summary of \TeX{} and \LaTeX{} Symbols \\ Appendix C: GNU Emacs--The Sixty+ Most Useful Commands; \\ Appendix D: Mathematical Organizations in the UK and USA \\ Appendix E: Winners of Prizes for Expository Writing; \\ Appendix F: Glossary \\ Bibliography \\ Index

entry:
@Book{Higham:1993:HWM,
  author =       "Nicholas J. Higham",
  title =        "Handbook of Writing for the Mathematical Sciences",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "xii + 241",
  month =        jun,
  year =         "1993",
  ISBN =         "0-89871-314-5",
  ISBN-13 =      "978-0-89871-314-5",
  LCCN =         "QA42.H54 1993",
  bibdate =      "Mon Oct 4 08:48:35 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/h/higham-nicholas-john.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$21.50",
  acknowledgement = ack-njh,
  note-1 =       "[From the publisher]: Having trouble with your latest
                 math paper? Giving a presentation that you just can't
                 pull together? Struggling with your thesis or trying to
                 get your first article published in a technical
                 journal? Handbook of Writing for the Mathematical
                 Sciences is the book for you!

                 This handy volume provides information on virtually
                 every issue you will face when writing a technical
                 paper or talk, from choosing the right journal to
                 handling your references. You'll also get an overview
                 of the entire publication process--invaluable for
                 anyone hoping to publish in a technical journal.",
  note-2 =       "To write a truly impressive paper, you'll need to
                 understand the anatomy of a research paper and the
                 steps involved in revising a draft. This book offers
                 discussions of these fundamental topics, along with
                 illustrative and provocative examples. Also included
                 are chapters on standard English usage, using computers
                 for writing and research, and writing technical
                 material when English is a foreign language.

                 This handbook provides much-needed advice on handling
                 the basic ingredients of a research paper, like
                 definitions, theorems, examples, and equations. In
                 addition, appendices provide essential reference
                 material, including summaries of \LaTeX{} symbols and
                 Emacs commands, addresses of mathematical societies,
                 and a list of papers that have won expository writing
                 prizes.",
  note-3 =       "This book is ideal for graduate students and teachers.
                 Among its special features:

                 \begin{itemize} \item Detail and extensive use of
                 examples make it an excellent teaching tool

                 \item Discusses \TeX{} and other software tools for
                 preparing publications

                 \item Thorough treatment, with examples, of how to
                 write slides (transparencies) for a mathematical
                 talk.

                 \item Comprehensive index and extensive bibliography
                 make it an excellent reference

                 \item Readable for everyone in the field--from
                 undergraduates to seasoned professionals
                 \end{itemize}",
  note-4 =       "About the Author: Nicholas J. Higham is a Reader in
                 Mathematics at the University of Manchester, UK. He is
                 the author of more than 40 publications and is a member
                 of the editorial board of the SIAM Journal on Matrix
                 Analysis and Applications.",
  tableofcontents = "Preface \\
                 1: General Principles \\
                 2: Writer's Tools and Recommended Reading \\
                 3: Mathematical Writing \\
                 4: English Usage \\
                 5: When English is a Foreign Language \\
                 6: Writing a Paper \\
                 7: Revising a Draft \\
                 8: Publishing a Paper \\
                 9: Writing a Talk \\
                 10: Computer Aids for Writing and Research \\
                 Appendix A: The Greek Alphabet \\
                 Appendix B: Summary of \TeX{} and \LaTeX{} Symbols \\
                 Appendix C: GNU Emacs--The Sixty+ Most Useful Commands;
                 \\
                 Appendix D: Mathematical Organizations in the UK and
                 USA \\
                 Appendix E: Winners of Prizes for Expository Writing;
                 \\
                 Appendix F: Glossary \\
                 Bibliography \\
                 Index",
}


bibtype: book
filename: master.bib
label: Higham:1996:ASN
author: Nicholas J. Higham
title: Accuracy and Stability of Numerical Algorithms
publisher: pub-SIAM
address: pub-SIAM:adr
pages: xxviii + 688
year: 1996
ISBN: 0-89871-355-2 (paperback) OR 0898713552 (paperback)
ISBN13: 978-0-89871-355-8 (paperback) OR 9780898713558 (paperback)
LCCN: QA297.H53 1996
MRclass: 65Fxx, 15-04, 65-02, 65G50
bibdate: Tue Jan 30 11:01:35 1996
bibtimestamp: 1996.01.30 11:01:35 ???
URL: http://www.ma.man.ac.uk/~higham/asna.html
remark: Typeset with LaTeX 2e.
acknowledgement: ack-njh
rawauthor: Nicholas J. Higham
rawtitle: Accuracy and Stability of Numerical Algorithms
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/h/higham-nicholas-john.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/texbook2.bib

TOC:
Principles of Finite Precision Computation Relative Error and Significant Digits Sources of Errors Precision Versus Accuracy Backward and Forward Errors Conditioning Cancellation Solving a Quadratic Equation Computing the Sample Variance Solving Linear Equations Accumulation of Rounding Errors Instability Without Cancellation Increasing the Precision Cancellation of Rounding Errors Rounding Errors Can Be Beneficial Stability of an Algorithm Depends on the Problem Rounding Errors Are Not Random Designing Stable Algorithms Misconceptions Rounding Errors in Numerical Analysis Floating Point Arithmetic Floating Point Number System Model of Arithmetic IEEE Arithmetic Aberrant Arithmetics Exact Subtraction Fused Multiply-Add Operation Choice of Base and Distribution of Numbers Statistical Distribution of Rounding Errors Alternative Number Systems Elementary Functions Accuracy Tests Inner and Outer Products The Purpose of Rounding Error Analysis Running Error Analysis Notation for Error Analysis Matrix Multiplication Complex Arithmetic Miscellany Error Analysis Demystified Other Approaches Summation Summation Methods Error Analysis Compensated Summation Other Summation Methods Statistical Estimates of Accuracy Choice of Method Polynomials Horner's Method Evaluating Derivatives The Newton Form and Polynomial Interpolation Matrix Polynomials Norms Vector Norms

rawTOC:
Principles of Finite Precision Computation \\ Relative Error and Significant Digits \\ Sources of Errors \\ Precision Versus Accuracy \\ Backward and Forward Errors \\ Conditioning \\ Cancellation \\ Solving a Quadratic Equation \\ Computing the Sample Variance \\ Solving Linear Equations \\ Accumulation of Rounding Errors \\ Instability Without Cancellation \\ Increasing the Precision \\ Cancellation of Rounding Errors \\ Rounding Errors Can Be Beneficial \\ Stability of an Algorithm Depends on the Problem \\ Rounding Errors Are Not Random \\ Designing Stable Algorithms \\ Misconceptions \\ Rounding Errors in Numerical Analysis \\ Floating Point Arithmetic \\ Floating Point Number System \\ Model of Arithmetic \\ IEEE Arithmetic \\ Aberrant Arithmetics \\ Exact Subtraction \\ Fused Multiply-Add Operation \\ Choice of Base and Distribution of Numbers \\ Statistical Distribution of Rounding Errors \\ Alternative Number Systems \\ Elementary Functions \\ Accuracy Tests \\ Inner and Outer Products \\ The Purpose of Rounding Error Analysis \\ Running Error Analysis \\ Notation for Error Analysis \\ Matrix Multiplication \\ Complex Arithmetic \\ Miscellany \\ Error Analysis Demystified \\ Other Approaches \\ Summation \\ Summation Methods \\ Error Analysis \\ Compensated Summation \\ Other Summation Methods \\ Statistical Estimates of Accuracy \\ Choice of Method \\ Polynomials \\ Horner's Method \\ Evaluating Derivatives \\ The Newton Form and Polynomial Interpolation \\ Matrix Polynomials \\ Norms \\ Vector Norms

entry:
@Book{Higham:1996:ASN,
  author =       "Nicholas J. Higham",
  title =        "Accuracy and Stability of Numerical Algorithms",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "xxviii + 688",
  year =         "1996",
  ISBN =         "0-89871-355-2 (paperback)",
  ISBN-13 =      "978-0-89871-355-8 (paperback)",
  LCCN =         "QA297.H53 1996",
  MRclass =      "65Fxx, 15-04, 65-02, 65G50",
  bibdate =      "Tue Jan 30 11:01:35 1996",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/h/higham-nicholas-john.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/texbook2.bib",
  price =        "US\$39.00",
  URL =          "http://www.ma.man.ac.uk/~higham/asna.html",
  acknowledgement = ack-njh # " and " # ack-nhfb,
  remark =       "Typeset with \LaTeX2e.",
  tableofcontents = "Principles of Finite Precision Computation \\
                 Relative Error and Significant Digits \\
                 Sources of Errors \\
                 Precision Versus Accuracy \\
                 Backward and Forward Errors \\
                 Conditioning \\
                 Cancellation \\
                 Solving a Quadratic Equation \\
                 Computing the Sample Variance \\
                 Solving Linear Equations \\
                 Accumulation of Rounding Errors \\
                 Instability Without Cancellation \\
                 Increasing the Precision \\
                 Cancellation of Rounding Errors \\
                 Rounding Errors Can Be Beneficial \\
                 Stability of an Algorithm Depends on the Problem \\
                 Rounding Errors Are Not Random \\
                 Designing Stable Algorithms \\
                 Misconceptions \\
                 Rounding Errors in Numerical Analysis \\
                 Floating Point Arithmetic \\
                 Floating Point Number System \\
                 Model of Arithmetic \\
                 IEEE Arithmetic \\
                 Aberrant Arithmetics \\
                 Exact Subtraction \\
                 Fused Multiply-Add Operation \\
                 Choice of Base and Distribution of Numbers \\
                 Statistical Distribution of Rounding Errors \\
                 Alternative Number Systems \\
                 Elementary Functions \\
                 Accuracy Tests \\
                 Inner and Outer Products \\
                 The Purpose of Rounding Error Analysis \\
                 Running Error Analysis \\
                 Notation for Error Analysis \\
                 Matrix Multiplication \\
                 Complex Arithmetic \\
                 Miscellany \\
                 Error Analysis Demystified \\
                 Other Approaches \\
                 Summation \\
                 Summation Methods \\
                 Error Analysis \\
                 Compensated Summation \\
                 Other Summation Methods \\
                 Statistical Estimates of Accuracy \\
                 Choice of Method \\
                 Polynomials \\
                 Horner's Method \\
                 Evaluating Derivatives \\
                 The Newton Form and Polynomial Interpolation \\
                 Matrix Polynomials \\
                 Norms \\
                 Vector Norms",
}


bibtype: book
filename: master.bib
label: Higham:2002:ASN
author: Nicholas J. Higham
title: Accuracy and Stability of Numerical Algorithms
publisher: pub-SIAM
address: pub-SIAM:adr
edition: Second
pages: xxx + 680
year: 2002
DOI: https://doi.org/10.1137/1.9780898718027
ISBN: 0-89871-521-0 (hardcover), 0-89871-802-3 (e-book) OR 0898715210 (hardcover), 0898718023 (ebook)
LCCN: QA297 .H53 2002
MRclass: 65G50 (65-02)
MRnumber: MR1927606 (2003g:65064)
bibdate: Wed Oct 30 14:20:02 2002
bibtimestamp: 2002.10.30 14:20:02 ???
keywords: accurate floating-point summation
acknowledgement: ack-nhfb
rawauthor: Nicholas J. Higham
rawtitle: Accuracy and Stability of Numerical Algorithms
ISBN13:
978-0-89871-521-7 (hardcover), 978-0-89871-802-7 (e-book) OR 9780898715217 (hardcover), 9780898718027 (ebook)

bibsource:
https://www.math.utah.edu/pub/bibnet/authors/h/higham-nicholas-john.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
booktitle Accuracy and Stability of Numerical Algorithms gives a thorough, up-to-date treatment of the behavior of numerical algorithms in finite precision arithmetic. It combines algorithmic derivations, perturbation theory, and rounding error analysis, all enlivened by historical perspective and informative quotations. This second edition expands and updates the coverage of the first edition (1996) and includes numerous improvements to the original material. Two new chapters treat symmetric indefinite systems and skew-symmetric systems, and nonlinear systems and Newton's method. Twelve new sections include coverage of additional error bounds for Gaussian elimination, rank revealing $ L U $ factorizations, weighted and constrained least squares problems, and the fused multiply-add operation found on some modern computer architectures.

TOC:
List of Figures List of Tables Preface to Second Edition Preface to First Edition About the Dedication 1: Principles of Finite Precision Computation 2: Floating Point Arithmetic 3: Basics 4: Summation 5: Polynomials 6: Norms 7: Perturbation Theory for Linear Systems 8: Triangular Systems 9: $ L U $ Factorization and Linear Equations 10: Cholesky Factorization 11: Symmetric Indefinite and Skew-Symmetric Systems 12: Iterative Refinement 13: Block LU Factorization 14: Matrix Inversion 15: Condition Number Estimation 16: The Sylvester Equation 17: Stationary Iterative Methods 18: Matrix Powers 19: QR Factorization 20: The Least Squares Problem 21: Underdetermined Systems 22: Vandermonde Systems 23: Fast Matrix Multiplication 24: The Fast Fourier Transform and Applications 25: Nonlinear Systems and Newton's Method 26: Automatic Error Analysis 27: Software Issues in Floating Point Arithmetic 28: A Gallery of Test Matrices Appendix A: Solutions to Problems Appendix B: Acquiring Software Appendix C: Program Libraries Appendix D: The Matrix Computation Toolbox Bibliography Name Index Subject Index

rawabstract:
\booktitle{Accuracy and Stability of Numerical Algorithms} gives a thorough, up-to-date treatment of the behavior of numerical algorithms in finite precision arithmetic. It combines algorithmic derivations, perturbation theory, and rounding error analysis, all enlivened by historical perspective and informative quotations. This second edition expands and updates the coverage of the first edition (1996) and includes numerous improvements to the original material. Two new chapters treat symmetric indefinite systems and skew-symmetric systems, and nonlinear systems and Newton's method. Twelve new sections include coverage of additional error bounds for Gaussian elimination, rank revealing $ L U $ factorizations, weighted and constrained least squares problems, and the fused multiply-add operation found on some modern computer architectures.

rawTOC:
List of Figures \\ List of Tables \\ Preface to Second Edition \\ Preface to First Edition \\ About the Dedication \\ 1: Principles of Finite Precision Computation \\ 2: Floating Point Arithmetic \\ 3: Basics \\ 4: Summation \\ 5: Polynomials \\ 6: Norms \\ 7: Perturbation Theory for Linear Systems \\ 8: Triangular Systems \\ 9: $ L U $ Factorization and Linear Equations \\ 10: Cholesky Factorization \\ 11: Symmetric Indefinite and Skew-Symmetric Systems \\ 12: Iterative Refinement \\ 13: Block LU Factorization \\ 14: Matrix Inversion \\ 15: Condition Number Estimation \\ 16: The Sylvester Equation \\ 17: Stationary Iterative Methods \\ 18: Matrix Powers \\ 19: QR Factorization \\ 20: The Least Squares Problem \\ 21: Underdetermined Systems \\ 22: Vandermonde Systems \\ 23: Fast Matrix Multiplication \\ 24: The Fast Fourier Transform and Applications \\ 25: Nonlinear Systems and Newton's Method \\ 26: Automatic Error Analysis \\ 27: Software Issues in Floating Point Arithmetic \\ 28: A Gallery of Test Matrices \\ Appendix A: Solutions to Problems \\ Appendix B: Acquiring Software \\ Appendix C: Program Libraries \\ Appendix D: The Matrix Computation Toolbox \\ Bibliography \\ Name Index \\ Subject Index

entry:
@Book{Higham:2002:ASN,
  author =       "Nicholas J. Higham",
  title =        "Accuracy and Stability of Numerical Algorithms",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  edition =      "Second",
  pages =        "xxx + 680",
  year =         "2002",
  DOI =          "https://doi.org/10.1137/1.9780898718027",
  ISBN =         "0-89871-521-0 (hardcover), 0-89871-802-3 (e-book)",
  ISBN-13 =      "978-0-89871-521-7 (hardcover), 978-0-89871-802-7
                 (e-book)",
  LCCN =         "QA297 .H53 2002",
  MRclass =      "65G50 (65-02)",
  MRnumber =     "MR1927606 (2003g:65064)",
  bibdate =      "Wed Oct 30 14:20:02 2002",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/h/higham-nicholas-john.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "\booktitle{Accuracy and Stability of Numerical
                 Algorithms} gives a thorough, up-to-date treatment of
                 the behavior of numerical algorithms in finite
                 precision arithmetic. It combines algorithmic
                 derivations, perturbation theory, and rounding error
                 analysis, all enlivened by historical perspective and
                 informative quotations. This second edition expands and
                 updates the coverage of the first edition (1996) and
                 includes numerous improvements to the original
                 material. Two new chapters treat symmetric indefinite
                 systems and skew-symmetric systems, and nonlinear
                 systems and Newton's method. Twelve new sections
                 include coverage of additional error bounds for
                 Gaussian elimination, rank revealing $ L U $
                 factorizations, weighted and constrained least squares
                 problems, and the fused multiply-add operation found on
                 some modern computer architectures.",
  acknowledgement = ack-nhfb,
  keywords =     "accurate floating-point summation",
  tableofcontents = "List of Figures \\
                 List of Tables \\
                 Preface to Second Edition \\
                 Preface to First Edition \\
                 About the Dedication \\
                 1: Principles of Finite Precision Computation \\
                 2: Floating Point Arithmetic \\
                 3: Basics \\
                 4: Summation \\
                 5: Polynomials \\
                 6: Norms \\
                 7: Perturbation Theory for Linear Systems \\
                 8: Triangular Systems \\
                 9: $ L U $ Factorization and Linear Equations \\
                 10: Cholesky Factorization \\
                 11: Symmetric Indefinite and Skew-Symmetric Systems \\
                 12: Iterative Refinement \\
                 13: Block LU Factorization \\
                 14: Matrix Inversion \\
                 15: Condition Number Estimation \\
                 16: The Sylvester Equation \\
                 17: Stationary Iterative Methods \\
                 18: Matrix Powers \\
                 19: QR Factorization \\
                 20: The Least Squares Problem \\
                 21: Underdetermined Systems \\
                 22: Vandermonde Systems \\
                 23: Fast Matrix Multiplication \\
                 24: The Fast Fourier Transform and Applications \\
                 25: Nonlinear Systems and Newton's Method \\
                 26: Automatic Error Analysis \\
                 27: Software Issues in Floating Point Arithmetic \\
                 28: A Gallery of Test Matrices \\
                 Appendix A: Solutions to Problems \\
                 Appendix B: Acquiring Software \\
                 Appendix C: Program Libraries \\
                 Appendix D: The Matrix Computation Toolbox \\
                 Bibliography \\
                 Name Index \\
                 Subject Index",
}


bibtype: book
filename: master.bib
label: Hilburn:1976:MCC
author: John L. Hilburn and Paul M. Julich
title: Microcomputers / Microprocessors: Hardware, Software, and Applications
publisher: pub-PH
address: pub-PH:adr
pages: xii + 372
year: 1976
ISBN: 0-13-580969-X OR 013580969X
ISBN13: 978-0-13-580969-3 OR 9780135809693
LCCN: TK7888.3 .H48
bibdate: Wed Dec 15 09:07:00 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 09:07:00 ???
series: Prentice-Hall Series in Automatic Computation
acknowledgement: ack-nhfb
rawauthor: John L. Hilburn and Paul M. Julich
rawtitle: Microcomputers\slash Microprocessors: Hardware, Software, and Applications
TOC:
Preface / xi 1: Introduction / 1 References / 6 2: Digital Logic / 7 2.1. Basic Logic Gates / 7 2.2. Boolean Algebra / 14 2.3. Digital Integrated Circuits / 22 2.4. Flip-Flops / 30 2.5. Shift Registers / 37 2.6. Output Buffers / 40 References / 43 Exercises / 43 3: Number Systems and Codes / 45 3.1. Decimal Number System / 45 3.2. Binary Number System / 46 3.3. Octal Number System / 53 3.4. Hexadecimal Number System / 56 3.5. Signed Numbers and Complement Arithmetic / 59 3.6. Binary-Coded Number Systems / 66 3.7. Signed 10's Complement Decimal Arithmetic / 69 3.8. American Standard Code for Information Interchange (ASCII) / 70 References / 72 Exercises / 72 4: Microcomputer Architecture / 74 4.1. Introduction / 74 4.2. Read-Only Memory (ROM) / 79 4.3. Read/Write Memory / 86 4.4. Microprocessor / 94 References / 112 Exercises / 114 5: Software / 116 5.1 Introduction / 116 5.2 Planning a Program / 118 5.3 Flow Charts / 119 5.4 Machine Language / 121 5.5 Symbolic Language / 124 5.6 Fundamentals of Programming in Assembly Language / 128 5.7 Editors / 141 5.8 High-Level Languages / 145 References / 147 Exercises / 148 6: Interfacing and Peripheral Devices / 150 6.1. Introduction / 150 6.2. Programmed-Data Transfers / 153 6.3. DMA Transfer / 168 6.4. Synchronization / 170 6.5. IC Interface Elements / 173 6.6. Programmable Interfaces / 180 6.7. Peripherals / 183 References / 193 Exercises / 194 7: Microprocessors and Microcomputer Systems / 196 7.1. Microprocessor Selection / 196 7.2. Intel 4004 / 197 7.3. Intel 4040 / 209 7.4. National IMP-4 / 215 7.5. Rockwell PPS-4 / 223 7.6. Intel 8008/8008-1 / 234 7.7. Intel 8080 / 243 7.8. Motorola 6800 / 252 7.9. RCA COSMAC / 259 7.10. Rockwell PPS-8 / 266 7.11. National PACE / 275 7.12. Microprocessor Summary / 284 References / 284 Exercises / 286 8: Design Methodology and Applications / 287 8.1. Design Methodology / 287 8.2. Examples of Microcomputer Applications / 304 References / 321 Exercises / 321 Appendix A Instruction set for Intel 4004 and 4040 / 323 Appendix B Instruction set for the National IMP-4 / 326 Appendix C Instruction set for the Rockwell PPS-4 / 332 Appendix D Instruction set for Intel 8008 / 338 Appendix E Instruction set for Intel 8080 / 341 Appendix F Instruction set for the Motorola 6800 / 345 Appendix G Instruction set for the RCA COSMAC / 350 Appendix H Instruction set for the Rockwell PPS-8 / 353 Appendix I Instruction set for the National PACE / 362 Index / 364

shortTOC:
1: Introduction 2: Digital logic 3: Number systems and codes 4: Microcomputer architecture 5: Software 6: Interfacing and peripheral devices 7: Microprocessors and microcomputer systems 8: Design methodology and applications

rawshortTOC:
1: Introduction \\ 2: Digital logic \\ 3: Number systems and codes \\ 4: Microcomputer architecture \\ 5: Software \\ 6: Interfacing and peripheral devices \\ 7: Microprocessors and microcomputer systems \\ 8: Design methodology and applications

rawTOC:
Preface / xi \\ 1: Introduction / 1 \\ References / 6 \\ 2: Digital Logic / 7 \\ 2.1. Basic Logic Gates / 7 \\ 2.2. Boolean Algebra / 14 \\ 2.3. Digital Integrated Circuits / 22 \\ 2.4. Flip-Flops / 30 \\ 2.5. Shift Registers / 37 \\ 2.6. Output Buffers / 40 \\ References / 43 \\ Exercises / 43 \\ 3: Number Systems and Codes / 45 \\ 3.1. Decimal Number System / 45 \\ 3.2. Binary Number System / 46 \\ 3.3. Octal Number System / 53 \\ 3.4. Hexadecimal Number System / 56 \\ 3.5. Signed Numbers and Complement Arithmetic / 59 \\ 3.6. Binary-Coded Number Systems / 66 \\ 3.7. Signed 10's Complement Decimal Arithmetic / 69 \\ 3.8. American Standard Code for Information Interchange (ASCII) / 70 \\ References / 72 \\ Exercises / 72 \\ 4: Microcomputer Architecture / 74 \\ 4.1. Introduction / 74 \\ 4.2. Read-Only Memory (ROM) / 79 \\ 4.3. Read/Write Memory / 86 \\ 4.4. Microprocessor / 94 \\ References / 112 \\ Exercises / 114 \\ 5: Software / 116 \\ 5.1 Introduction / 116 \\ 5.2 Planning a Program / 118 \\ 5.3 Flow Charts / 119 \\ 5.4 Machine Language / 121 \\ 5.5 Symbolic Language / 124 \\ 5.6 Fundamentals of Programming in Assembly Language / 128 \\ 5.7 Editors / 141 \\ 5.8 High-Level Languages / 145 \\ References / 147 \\ Exercises / 148 \\ 6: Interfacing and Peripheral Devices / 150 \\ 6.1. Introduction / 150 \\ 6.2. Programmed-Data Transfers / 153 \\ 6.3. DMA Transfer / 168 \\ 6.4. Synchronization / 170 \\ 6.5. IC Interface Elements / 173 \\ 6.6. Programmable Interfaces / 180 \\ 6.7. Peripherals / 183 \\ References / 193 \\ Exercises / 194 \\ 7: Microprocessors and Microcomputer Systems / 196 \\ 7.1. Microprocessor Selection / 196 \\ 7.2. Intel 4004 / 197 \\ 7.3. Intel 4040 / 209 \\ 7.4. National IMP-4 / 215 \\ 7.5. Rockwell PPS-4 / 223 \\ 7.6. Intel 8008/8008-1 / 234 \\ 7.7. Intel 8080 / 243 \\ 7.8. Motorola 6800 / 252 \\ 7.9. RCA COSMAC / 259 \\ 7.10. Rockwell PPS-8 / 266 \\ 7.11. National PACE / 275 \\ 7.12. Microprocessor Summary / 284 \\ References / 284 \\ Exercises / 286 \\ 8: Design Methodology and Applications / 287 \\ 8.1. Design Methodology / 287 \\ 8.2. Examples of Microcomputer Applications / 304 \\ References / 321 \\ Exercises / 321 \\ Appendix A Instruction set for Intel 4004 and 4040 / 323 \\ Appendix B Instruction set for the National IMP-4 / 326 \\ Appendix C Instruction set for the Rockwell PPS-4 / 332 \\ Appendix D Instruction set for Intel 8008 / 338 \\ Appendix E Instruction set for Intel 8080 / 341 \\ Appendix F Instruction set for the Motorola 6800 / 345 \\ Appendix G Instruction set for the RCA COSMAC / 350 \\ Appendix H Instruction set for the Rockwell PPS-8 / 353 \\ Appendix I Instruction set for the National PACE / 362 \\ Index / 364

entry:
@Book{Hilburn:1976:MCC,
  author =       "John L. Hilburn and Paul M. Julich",
  title =        "Microcomputers\slash Microprocessors: Hardware,
                 Software, and Applications",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xii + 372",
  year =         "1976",
  ISBN =         "0-13-580969-X",
  ISBN-13 =      "978-0-13-580969-3",
  LCCN =         "TK7888.3 .H48",
  bibdate =      "Wed Dec 15 09:07:00 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$16.50",
  series =       "Prentice-Hall Series in Automatic Computation",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1: Introduction \\
                 2: Digital logic \\
                 3: Number systems and codes \\
                 4: Microcomputer architecture \\
                 5: Software \\
                 6: Interfacing and peripheral devices \\
                 7: Microprocessors and microcomputer systems \\
                 8: Design methodology and applications",
  tableofcontents = "Preface / xi \\
                 1: Introduction / 1 \\
                 References / 6 \\
                 2: Digital Logic / 7 \\
                 2.1. Basic Logic Gates / 7 \\
                 2.2. Boolean Algebra / 14 \\
                 2.3. Digital Integrated Circuits / 22 \\
                 2.4. Flip-Flops / 30 \\
                 2.5. Shift Registers / 37 \\
                 2.6. Output Buffers / 40 \\
                 References / 43 \\
                 Exercises / 43 \\
                 3: Number Systems and Codes / 45 \\
                 3.1. Decimal Number System / 45 \\
                 3.2. Binary Number System / 46 \\
                 3.3. Octal Number System / 53 \\
                 3.4. Hexadecimal Number System / 56 \\
                 3.5. Signed Numbers and Complement Arithmetic / 59 \\
                 3.6. Binary-Coded Number Systems / 66 \\
                 3.7. Signed 10's Complement Decimal Arithmetic / 69 \\
                 3.8. American Standard Code for Information Interchange
                 (ASCII) / 70 \\
                 References / 72 \\
                 Exercises / 72 \\
                 4: Microcomputer Architecture / 74 \\
                 4.1. Introduction / 74 \\
                 4.2. Read-Only Memory (ROM) / 79 \\
                 4.3. Read/Write Memory / 86 \\
                 4.4. Microprocessor / 94 \\
                 References / 112 \\
                 Exercises / 114 \\
                 5: Software / 116 \\
                 5.1 Introduction / 116 \\
                 5.2 Planning a Program / 118 \\
                 5.3 Flow Charts / 119 \\
                 5.4 Machine Language / 121 \\
                 5.5 Symbolic Language / 124 \\
                 5.6 Fundamentals of Programming in Assembly Language /
                 128 \\
                 5.7 Editors / 141 \\
                 5.8 High-Level Languages / 145 \\
                 References / 147 \\
                 Exercises / 148 \\
                 6: Interfacing and Peripheral Devices / 150 \\
                 6.1. Introduction / 150 \\
                 6.2. Programmed-Data Transfers / 153 \\
                 6.3. DMA Transfer / 168 \\
                 6.4. Synchronization / 170 \\
                 6.5. IC Interface Elements / 173 \\
                 6.6. Programmable Interfaces / 180 \\
                 6.7. Peripherals / 183 \\
                 References / 193 \\
                 Exercises / 194 \\
                 7: Microprocessors and Microcomputer Systems / 196 \\
                 7.1. Microprocessor Selection / 196 \\
                 7.2. Intel 4004 / 197 \\
                 7.3. Intel 4040 / 209 \\
                 7.4. National IMP-4 / 215 \\
                 7.5. Rockwell PPS-4 / 223 \\
                 7.6. Intel 8008/8008-1 / 234 \\
                 7.7. Intel 8080 / 243 \\
                 7.8. Motorola 6800 / 252 \\
                 7.9. RCA COSMAC / 259 \\
                 7.10. Rockwell PPS-8 / 266 \\
                 7.11. National PACE / 275 \\
                 7.12. Microprocessor Summary / 284 \\
                 References / 284 \\
                 Exercises / 286 \\
                 8: Design Methodology and Applications / 287 \\
                 8.1. Design Methodology / 287 \\
                 8.2. Examples of Microcomputer Applications / 304 \\
                 References / 321 \\
                 Exercises / 321 \\
                 Appendix A Instruction set for Intel 4004 and 4040 /
                 323 \\
                 Appendix B Instruction set for the National IMP-4 / 326
                 \\
                 Appendix C Instruction set for the Rockwell PPS-4 / 332
                 \\
                 Appendix D Instruction set for Intel 8008 / 338 \\
                 Appendix E Instruction set for Intel 8080 / 341 \\
                 Appendix F Instruction set for the Motorola 6800 / 345
                 \\
                 Appendix G Instruction set for the RCA COSMAC / 350 \\
                 Appendix H Instruction set for the Rockwell PPS-8 / 353
                 \\
                 Appendix I Instruction set for the National PACE / 362
                 \\
                 Index / 364",
}


bibtype: book
filename: master.bib
label: Hill:1988:ECM
author: David R. Hill and Cleve B. Moler (consulting editor)
title: Experiments in Computational Matrix Algebra
publisher: pub-RANDOM-HOUSE
address: pub-RANDOM-HOUSE:adr
pages: xii + 446
year: 1988
ISBN: 0-394-35678-0 (paperback) OR 0394356780 (paperback)
ISBN13: 978-0-394-35678-5 (paperback) OR 9780394356785 (paperback)
LCCN: QA188 .H55 1987
MRclass: 65Fxx, 05-04, 15-04, 60-04, 62-04, 65-01
bibdate: Wed Dec 15 09:07:54 1993
bibtimestamp: 1993.12.15 09:07:54 ???
ZMnumber: 0668.65023
acknowledgement: ack-nhfb
rawauthor: David R. Hill and Cleve B. {Moler (consulting editor)}
rawtitle: Experiments in Computational Matrix Algebra
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/m/moler-cleve-b.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/matlab.bib

TOC:
Preliminaries / 1 Chapter 1: Beginning to Use MATLAB / 5 Part A: Introducing MATLAB / 7 1.1 Introduction to Matrices / 8 1.2 Matrices in MATLAB / 12 1.3 Basic Variables and Functions / 22 Part B: Matrix Algebra in MATLAB / 33 1.4 Building Expressions and Operations with Variables / 34 1.5 Basic Matrix Functions / 63 1.6 Data Manipulation Commands and Vector Norms / 75 Chapter 2: Linear Systems of Equations / 91 2.1 Introduction / 93 2.2 Solving Linear Systems Using Row Operations / 94 2.3 Applications of Row Operations / 119 2.4 Nonsingular Linear Systems / 154 2.5 Pivoting and LU-Factorization / 182 2.6 Determinants / 204 2.7 Estimating the Accuracy of Computed Solutions of Linear Systems / 217 Chapter 3: Eigenvalues and Eigenvectors / 243 3.1 Introduction / 244 3.2 The Eigenproblem I / 259 3.3 The Eigenproblem II / 299 Chapter 4: Programming in MATLAB / 335 4.1 Introduction / 336 4.2 Operators and Control of Flow / 336 4.3 Text Strings, ``Instant Subroutines,'' and Utility Commands / 353 4.4 Command Files and Function Files / 361 Chapter 5: Application Modules / 377 5.1 Graph Theory: An Application of Matrix Algebra / 378 5.2 Markov Processes / 386 5.3 Graphics in MATLAB / 401 5.4 Least Squares and Pseudoinverses / 426 Appendix I: Linear Algebra Concepts and Related Properties / A 1.1 Linear Combinations / A-3 1.2 Linear Independence and Dependence / A-4 1.3 Rank of a Matrix / A-5 1.4 Inverse of a Matrix / A-6 1.5 The Determinant / A-8 1.6 Vector Spaces / A-11 1.7 Linear Transformations / A-23 1.8 Singular Value Decomposition / A-32 Appendix II: Complex Numbers and Their Properties / A-39 Appendix III: Aids for Using MATLAB / A-45 QUICK-Reference Sheet / A-47 Exercise Sheet / A-49 Command Reference Sheet / A-51 Bibliography / B-1 Command and Function Index / C-1 Solutions to Selected Exercises / S-1 Index / I-1

rawTOC:
Preliminaries / 1 \\ Chapter 1: Beginning to Use MATLAB / 5 \\ Part A: Introducing MATLAB / 7 \\ 1.1 Introduction to Matrices / 8 \\ 1.2 Matrices in MATLAB / 12 \\ 1.3 Basic Variables and Functions / 22 \\ Part B: Matrix Algebra in MATLAB / 33 \\ 1.4 Building Expressions and Operations with Variables / 34 \\ 1.5 Basic Matrix Functions / 63 \\ 1.6 Data Manipulation Commands and Vector Norms / 75 \\ Chapter 2: Linear Systems of Equations / 91 \\ 2.1 Introduction / 93 \\ 2.2 Solving Linear Systems Using Row Operations / 94 \\ 2.3 Applications of Row Operations / 119 \\ 2.4 Nonsingular Linear Systems / 154 \\ 2.5 Pivoting and LU-Factorization / 182 \\ 2.6 Determinants / 204 \\ 2.7 Estimating the Accuracy of Computed Solutions of Linear Systems / 217 \\ Chapter 3: Eigenvalues and Eigenvectors / 243 \\ 3.1 Introduction / 244 \\ 3.2 The Eigenproblem I / 259 \\ 3.3 The Eigenproblem II / 299 \\ Chapter 4: Programming in MATLAB / 335 \\ 4.1 Introduction / 336 \\ 4.2 Operators and Control of Flow / 336 \\ 4.3 Text Strings, ``Instant Subroutines,'' and Utility Commands / 353 \\ 4.4 Command Files and Function Files / 361 \\ Chapter 5: Application Modules / 377 \\ 5.1 Graph Theory: An Application of Matrix Algebra / 378 \\ 5.2 Markov Processes / 386 \\ 5.3 Graphics in MATLAB / 401 \\ 5.4 Least Squares and Pseudoinverses / 426 \\ Appendix I: Linear Algebra Concepts and Related Properties / A \\ 1.1 Linear Combinations / A-3 \\ 1.2 Linear Independence and Dependence / A-4 \\ 1.3 Rank of a Matrix / A-5 \\ 1.4 Inverse of a Matrix / A-6 \\ 1.5 The Determinant / A-8 \\ 1.6 Vector Spaces / A-11 \\ 1.7 Linear Transformations / A-23 \\ 1.8 Singular Value Decomposition / A-32 \\ Appendix II: Complex Numbers and Their Properties / A-39 \\ Appendix III: Aids for Using MATLAB / A-45 \\ QUICK-Reference Sheet / A-47 \\ Exercise Sheet / A-49 \\ Command Reference Sheet / A-51 \\ Bibliography / B-1 \\ Command and Function Index / C-1 \\ Solutions to Selected Exercises / S-1 \\ Index / I-1

entry:
@Book{Hill:1988:ECM,
  author =       "David R. Hill and Cleve B. {Moler (consulting
                 editor)}",
  title =        "Experiments in Computational Matrix Algebra",
  publisher =    pub-RANDOM-HOUSE,
  address =      pub-RANDOM-HOUSE:adr,
  pages =        "xii + 446",
  year =         "1988",
  ISBN =         "0-394-35678-0 (paperback)",
  ISBN-13 =      "978-0-394-35678-5 (paperback)",
  LCCN =         "QA188 .H55 1987",
  MRclass =      "65Fxx, 05-04, 15-04, 60-04, 62-04, 65-01",
  bibdate =      "Wed Dec 15 09:07:54 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moler-cleve-b.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/matlab.bib",
  ZMnumber =     "0668.65023",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Preliminaries / 1 \\
                 Chapter 1: Beginning to Use MATLAB / 5 \\
                 Part A: Introducing MATLAB / 7 \\
                 1.1 Introduction to Matrices / 8 \\
                 1.2 Matrices in MATLAB / 12 \\
                 1.3 Basic Variables and Functions / 22 \\
                 Part B: Matrix Algebra in MATLAB / 33 \\
                 1.4 Building Expressions and Operations with Variables
                 / 34 \\
                 1.5 Basic Matrix Functions / 63 \\
                 1.6 Data Manipulation Commands and Vector Norms / 75
                 \\
                 Chapter 2: Linear Systems of Equations / 91 \\
                 2.1 Introduction / 93 \\
                 2.2 Solving Linear Systems Using Row Operations / 94
                 \\
                 2.3 Applications of Row Operations / 119 \\
                 2.4 Nonsingular Linear Systems / 154 \\
                 2.5 Pivoting and LU-Factorization / 182 \\
                 2.6 Determinants / 204 \\
                 2.7 Estimating the Accuracy of Computed Solutions of
                 Linear Systems / 217 \\
                 Chapter 3: Eigenvalues and Eigenvectors / 243 \\
                 3.1 Introduction / 244 \\
                 3.2 The Eigenproblem I / 259 \\
                 3.3 The Eigenproblem II / 299 \\
                 Chapter 4: Programming in MATLAB / 335 \\
                 4.1 Introduction / 336 \\
                 4.2 Operators and Control of Flow / 336 \\
                 4.3 Text Strings, ``Instant Subroutines,'' and Utility
                 Commands / 353 \\
                 4.4 Command Files and Function Files / 361 \\
                 Chapter 5: Application Modules / 377 \\
                 5.1 Graph Theory: An Application of Matrix Algebra /
                 378 \\
                 5.2 Markov Processes / 386 \\
                 5.3 Graphics in MATLAB / 401 \\
                 5.4 Least Squares and Pseudoinverses / 426 \\
                 Appendix I: Linear Algebra Concepts and Related
                 Properties / A \\
                 1.1 Linear Combinations / A-3 \\
                 1.2 Linear Independence and Dependence / A-4 \\
                 1.3 Rank of a Matrix / A-5 \\
                 1.4 Inverse of a Matrix / A-6 \\
                 1.5 The Determinant / A-8 \\
                 1.6 Vector Spaces / A-11 \\
                 1.7 Linear Transformations / A-23 \\
                 1.8 Singular Value Decomposition / A-32 \\
                 Appendix II: Complex Numbers and Their Properties /
                 A-39 \\
                 Appendix III: Aids for Using MATLAB / A-45 \\
                 QUICK-Reference Sheet / A-47 \\
                 Exercise Sheet / A-49 \\
                 Command Reference Sheet / A-51 \\
                 Bibliography / B-1 \\
                 Command and Function Index / C-1 \\
                 Solutions to Selected Exercises / S-1 \\
                 Index / I-1",
}


bibtype: book
filename: master.bib
label: Hillis:1985:CM
author: W. Daniel Hillis
title: The Connection Machine
publisher: pub-MIT
address: pub-MIT:adr
pages: xiii + 190
year: 1985
ISBN: 0-262-08157-1, 0-262-58097-7 (paperback) OR 0262081571, 0262580977 (paperback)
ISBN13: 978-0-262-08157-3, 978-0-262-58097-7 (paperback) OR 9780262081573, 9780262580977 (paperback)
LCCN: QA267 .H4871 1985
bibdate: Tue Dec 14 23:43:53 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 23:43:53 ???
remark: Originally presented as the author's thesis (Ph.D.)--MIT, 1985.
acknowledgement: ack-nhfb
rawauthor: W. Daniel Hillis
rawtitle: The Connection Machine
TOC:
Introduction How to program a connection machine Design considerations Prototype Data structures for the connection machine Storage allocation New computer architectures and their relationship to physics or, why computer science is no good

rawTOC:
Introduction \\ How to program a connection machine \\ Design considerations \\ Prototype \\ Data structures for the connection machine \\ Storage allocation \\ New computer architectures and their relationship to physics or, why computer science is no good

entry:
@Book{Hillis:1985:CM,
  author =       "W. Daniel Hillis",
  title =        "The Connection Machine",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xiii + 190",
  year =         "1985",
  ISBN =         "0-262-08157-1, 0-262-58097-7 (paperback)",
  ISBN-13 =      "978-0-262-08157-3, 978-0-262-58097-7 (paperback)",
  LCCN =         "QA267 .H4871 1985",
  bibdate =      "Tue Dec 14 23:43:53 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  remark =       "Originally presented as the author's thesis
                 (Ph.D.)--MIT, 1985.",
  tableofcontents = "Introduction \\
                 How to program a connection machine \\
                 Design considerations \\
                 Prototype \\
                 Data structures for the connection machine \\
                 Storage allocation \\
                 New computer architectures and their relationship to
                 physics or, why computer science is no good",
}


bibtype: book
filename: master.bib
label: Hiltzik:2015:BSE
author: Michael A. Hiltzik
title: Big Science: Ernest Lawrence, the Cyclotron, and the Birth of the Military--Industrial Complex
publisher: pub-SIMON-SCHUSTER
address: pub-SIMON-SCHUSTER:adr
pages: x + 512
year: 2015
LCCN: QC787.C8 H55 2015
bibdate: Mon Aug 3 14:55:43 MDT 2015
bibtimestamp: 2015.08.03 14:55:43 MDT
acknowledgement: ack-nhfb
subjectdates: 1901--1958
rawauthor: Michael A. Hiltzik
rawtitle: Big Science: {Ernest Lawrence}, the Cyclotron, and the Birth of the Military--Industrial Complex
ISBN:
1-4516-7575-5 (hardcover), 1-4516-7576-3 (paperback), 1-4516-7603-4 (e-book) OR 1451675755 (hardcover), 1451675763 (paperback), 1451676034 (ebook)

ISBN13:
978-1-4516-7575-7 (hardcover), 978-1-4516-7576-4 (paperback), 978-1-4516-7603-7 (e-book) OR 9781451675757 (hardcover), 9781451675764 (paperback), 9781451676037 (ebook)

bibsource:
https://www.math.utah.edu/pub/bibnet/authors/b/bethe-hans.bib; https://www.math.utah.edu/pub/bibnet/authors/o/oppenheimer-j-robert.bib; https://www.math.utah.edu/pub/bibnet/authors/s/slater-john-clarke.bib; https://www.math.utah.edu/pub/bibnet/authors/t/teller-edward.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager

subject:
Cyclotrons; Physicists; United States; Biography; Lawrence, Ernest Orlando; Oppenheimer, J. Robert; Slater, John Clarke

TOC:
A heroic time South Dakota boy ``I'm going to be famous'' Shims and sealing wax Oppie The deuton affair The cyclotron republic John Lawrence's mice Laureate Mr. Loomis ``Ernest, are you ready?'' The racetrack Oak Ridge The road to Trinity The postwar bonanza Oaths and loyalties The shadow of the Super Livermore The Oppenheimer affair The return of small science The ``clean bomb'' Element 103

rawTOC:
A heroic time \\ South Dakota boy \\ ``I'm going to be famous'' \\ Shims and sealing wax \\ Oppie \\ The deuton affair \\ The cyclotron republic \\ John Lawrence's mice \\ Laureate \\ Mr. Loomis \\ ``Ernest, are you ready?'' \\ The racetrack \\ Oak Ridge \\ The road to Trinity \\ The postwar bonanza \\ Oaths and loyalties \\ The shadow of the Super \\ Livermore \\ The Oppenheimer affair \\ The return of small science \\ The ``clean bomb'' \\ Element 103

entry:
@Book{Hiltzik:2015:BSE,
  author =       "Michael A. Hiltzik",
  title =        "Big Science: {Ernest Lawrence}, the Cyclotron, and the
                 Birth of the Military--Industrial Complex",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "x + 512",
  year =         "2015",
  ISBN =         "1-4516-7575-5 (hardcover), 1-4516-7576-3 (paperback),
                 1-4516-7603-4 (e-book)",
  ISBN-13 =      "978-1-4516-7575-7 (hardcover), 978-1-4516-7576-4
                 (paperback), 978-1-4516-7603-7 (e-book)",
  LCCN =         "QC787.C8 H55 2015",
  bibdate =      "Mon Aug 3 14:55:43 MDT 2015",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bethe-hans.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/o/oppenheimer-j-robert.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/slater-john-clarke.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/teller-edward.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  remark-1 =     "The book contains numerous mentions of J. Robert
                 Oppenheimer and Edward Teller, and discusses in the
                 chapter ``Livermore'' the founding of what is now
                 called Lawrence Livermore National Laboratory under the
                 leadership of Herbert York and Edward Teller.",
  remark-2 =     "From page 67: ``Raytheon Company, a maker of radio
                 tubes in Cambridge, Massachusetts, had applied for a
                 patent on a machine that sounded like his [Lawrence's]
                 spiral accelerator. The word came from John Slater,
                 MIT's Physics Chairman, \ldots{}''.",
  remark-3 =     "From page 186: ``Lawrence was the University of
                 California's first Nobel laureate --- indeed, the first
                 from any public university in the United States''. From
                 page 187, [because of the war] ``The formal
                 presentation of the Nobel Prize was held on February
                 29, 1940, in Berkeley.''",
  remark-4 =     "From nobelprize.org, ``The Nobel Prize in Physics 1939
                 was awarded to Ernest Lawrence `for the invention and
                 development of the cyclotron and for results obtained
                 with it, especially with regard to artificial
                 radioactive elements'.''",
  remark-5 =     "From page 187: ``It was February 27 [1940], and the
                 search was over. They [Martin Kamen and Sam Ruben] had
                 carbon-14, and by their calculations, its half-life was
                 at least 1,000 years. (In fact, it is about 5,730
                 years.) The material they had isolated would be the
                 most important biological isotope of all, and the key
                 to a wide range of research requiring precise
                 biological tracing and dating.''",
  remark-6 =     "From page 196: ``All through the Depression, the
                 \booktitle{Physical Review}'s customary publication
                 invoice to researchers for their submitted articles
                 came with a note stating that if they or their
                 university could not pay the bill, it would be covered
                 by an `anonymous friend' of the American Physical
                 Society. The anonymous friend was Alfred [Lee]
                 Loomis.'' Loomis was a wealthy patron of science who
                 set up a personal physics laboratory in his home. He
                 became a close friend of Ernest Lawrence.",
  remark-7 =     "From page 241: ``[Glenn] Seaborg never lost his
                 respect for the substance that would make his career.
                 `Plutonium is so unusual as to approach the
                 unbelievable,' he would write a quarter century later.
                 `Under some conditions it can be nearly as hard and
                 brittle as glass; under others, as soft and plastic as
                 lead. It will burn and crumble quickly to powder when
                 heated in air, or slowly disintegrate when kept at room
                 temperature \ldots{} It is unique among all of the
                 chemical elements. And it is fiendishly toxic, even in
                 small amounts.'' Lawrence's student Glenn Theodore
                 Seaborg (1912--1999) shared the 1951 Nobel Prize in
                 Chemistry with another Lawrence colleague, Edwin
                 Mattison McMillan (1907--1991), ``for their discoveries
                 in the chemistry of the transuranic elements.''",
  remark-8 =     "From page 405: ``[Atomic Energy Commission Chairman
                 Lewis] Strauss's allusion to a `humanitarian' H-bomb
                 drew derision from critics of the arms race. The very
                 notion of a `clean' thermonuclear weapon was
                 mercilessly demolished in the \booktitle{Bulletin of
                 the Atomic Scientists} [12(7) 261--264, September 1956]
                 by Ralph Lapp, a distinguished antinuclear physicist.
                 By lucidly describing the process that produced an
                 H-bomb blast, Lapp showed that a clean bomb was a
                 fantasy.'' [Strauss pronounced his name `Straws'].",
  subject =      "Cyclotrons; Physicists; United States; Biography;
                 Lawrence, Ernest Orlando; Oppenheimer, J. Robert;
                 Slater, John Clarke",
  subject-dates = "1901--1958",
  tableofcontents = "A heroic time \\
                 South Dakota boy \\
                 ``I'm going to be famous'' \\
                 Shims and sealing wax \\
                 Oppie \\
                 The deuton affair \\
                 The cyclotron republic \\
                 John Lawrence's mice \\
                 Laureate \\
                 Mr. Loomis \\
                 ``Ernest, are you ready?'' \\
                 The racetrack \\
                 Oak Ridge \\
                 The road to Trinity \\
                 The postwar bonanza \\
                 Oaths and loyalties \\
                 The shadow of the Super \\
                 Livermore \\
                 The Oppenheimer affair \\
                 The return of small science \\
                 The ``clean bomb'' \\
                 Element 103",
}


bibtype: book
filename: master.bib
label: Hochschild:1998:KLG
author: Adam Hochschild
title: King Leopold's Ghost: a Story of Greed, Terror, and Heroism in Colonial Africa
publisher: Macmillan
address: London, UK
pages: 366 + 16
year: 1998
LCCN: DT655.H63 1999
bibdate: Mon Mar 5 06:33:09 MST 2018
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2018.03.05 06:33:09 MST
acknowledgement: ack-nhfb
authordates: 1942--
rawauthor: Adam Hochschild
rawtitle: {King Leopold}'s Ghost: a Story of Greed, Terror, and Heroism in Colonial {Africa}
ISBN:
0-333-66126-5 (hardcover), 0-618-00190-5 (paperback) OR 0333661265 (hardcover), 0618001905 (paperback)

ISBN13:
978-0-333-66126-0 (hardcover), 978-0-618-00190-3 (paperback) OR 9780333661260 (hardcover), 9780618001903 (paperback)

URL:
http://catdir.loc.gov/catdir/description/hm051/2004271848.html; http://catdir.loc.gov/catdir/enhancements/fy0737/2004271848-b.html

abstract:
In the 1880s, as the European powers were carving up Africa, King Leopold II of Belgium seized for himself the vast and mostly unexplored territory surrounding the Congo River. Carrying out a genocidal plundering of the Congo, he looted its rubber, brutalized its people, and ultimately slashed its population by ten million -- all the while shrewdly cultivating his reputation as a great humanitarian. Heroic efforts to expose these crimes eventually led to the first great human rights movement of the twentieth century, in which everyone from Mark Twain to the Archbishop of Canterbury participated. booktitle King Leopold's Ghost is the account of a megalomaniac of monstrous proportions, a man as cunning, charming, and cruel as any of the great Shakespearean villains. It is also the portrait of those who fought Leopold: a brave handful of missionaries, travelers, and young idealists who went to Africa for work or adventure and unexpectedly found themselves witnesses to a holocaust. Adam Hochschild brings this story alive. He knows that history often provides a far richer cast of characters than any novelist could invent. Chief among them is Edmund Morel, a young British shipping agent who went on to lead the international crusade against Leopold. Another hero of this tale, the Irish patriot Roger Casement, ended his life on a London gallows. Two courageous black Americans, George Washington Williams and William Sheppard, risked much to bring evidence of the Congo atrocities to the outside world. Sailing into the middle of the story was a young Congo River steamboat officer named Joseph Conrad. And looming above them all, the duplicitous billionaire King Leopold II.

subject:
1885--1908; 19e siecle; 19th century; 20e siecle; 20th century; Autochtones; Belgium; Colonialism; Congo (Democratic Republic); Congo (Republique democratique); Democratic Republic of the Congo; Ethnische Beziehungen; Forced labor; Forced labor; Histoire; History; History, 19th Century; History, 20th Century; Human Rights; Human rights movements; Human rights movements; II; Indigenous peoples; Indigenous peoples; King of the Belgians; King of the Belgians,; Kolonialismus; Kongo (Demokratische Republik); Leopold; Mouvements des droits de l'homme; Oppression; Politics; Politics and government; Politics and government; Politique et gouvernement; Race relations; Race relations; Relations raciales; Travail force; Zwangsarbeit

TOC:
``The traders area kidnapping our people'' ``I shall not give up the chase'' The fox crosses the dream The magnificent cake ``The treaties must grant us everything'' From Florida to Berlin Under the Yacht Club flag The first heretic Where there aren't no Ten Commandments Meeting Mr. Kurtz The wood that weeps A secret society of murderers David and Goliath Breaking into the thieves' kitchen To flood his deeds with day A reckoning ``Journalists won't give you receipts'' No man is a stranger Victory? The Great Forgetting Looking back: A personal afterword

rawabstract:
In the 1880s, as the European powers were carving up Africa, King Leopold II of Belgium seized for himself the vast and mostly unexplored territory surrounding the Congo River. Carrying out a genocidal plundering of the Congo, he looted its rubber, brutalized its people, and ultimately slashed its population by ten million -- all the while shrewdly cultivating his reputation as a great humanitarian. Heroic efforts to expose these crimes eventually led to the first great human rights movement of the twentieth century, in which everyone from Mark Twain to the Archbishop of Canterbury participated. \booktitle{King Leopold's Ghost} is the account of a megalomaniac of monstrous proportions, a man as cunning, charming, and cruel as any of the great Shakespearean villains. It is also the portrait of those who fought Leopold: a brave handful of missionaries, travelers, and young idealists who went to Africa for work or adventure and unexpectedly found themselves witnesses to a holocaust. Adam Hochschild brings this story alive. He knows that history often provides a far richer cast of characters than any novelist could invent. Chief among them is Edmund Morel, a young British shipping agent who went on to lead the international crusade against Leopold. Another hero of this tale, the Irish patriot Roger Casement, ended his life on a London gallows. Two courageous black Americans, George Washington Williams and William Sheppard, risked much to bring evidence of the Congo atrocities to the outside world. Sailing into the middle of the story was a young Congo River steamboat officer named Joseph Conrad. And looming above them all, the duplicitous billionaire King Leopold II.

rawTOC:
``The traders area kidnapping our people'' \\ ``I shall not give up the chase'' \\ The fox crosses the dream \\ The magnificent cake \\ ``The treaties must grant us everything'' \\ From Florida to Berlin \\ Under the Yacht Club flag \\ The first heretic \\ Where there aren't no Ten Commandments \\ Meeting Mr. Kurtz \\ The wood that weeps \\ A secret society of murderers \\ David and Goliath \\ Breaking into the thieves' kitchen \\ To flood his deeds with day \\ A reckoning \\ ``Journalists won't give you receipts'' \\ No man is a stranger \\ Victory? \\ The Great Forgetting \\ Looking back: A personal afterword

entry:
@Book{Hochschild:1998:KLG,
  author =       "Adam Hochschild",
  title =        "{King Leopold}'s Ghost: a Story of Greed, Terror, and
                 Heroism in Colonial {Africa}",
  publisher =    "Macmillan",
  address =      "London, UK",
  pages =        "366 + 16",
  year =         "1998",
  ISBN =         "0-333-66126-5 (hardcover), 0-618-00190-5 (paperback)",
  ISBN-13 =      "978-0-333-66126-0 (hardcover), 978-0-618-00190-3
                 (paperback)",
  LCCN =         "DT655.H63 1999",
  bibdate =      "Mon Mar 5 06:33:09 MST 2018",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://catdir.loc.gov/catdir/description/hm051/2004271848.html;
                 http://catdir.loc.gov/catdir/enhancements/fy0737/2004271848-b.html",
  abstract =     "In the 1880s, as the European powers were carving up
                 Africa, King Leopold II of Belgium seized for himself
                 the vast and mostly unexplored territory surrounding
                 the Congo River. Carrying out a genocidal plundering of
                 the Congo, he looted its rubber, brutalized its people,
                 and ultimately slashed its population by ten million --
                 all the while shrewdly cultivating his reputation as a
                 great humanitarian. Heroic efforts to expose these
                 crimes eventually led to the first great human rights
                 movement of the twentieth century, in which everyone
                 from Mark Twain to the Archbishop of Canterbury
                 participated. \booktitle{King Leopold's Ghost} is the
                 account of a megalomaniac of monstrous proportions, a
                 man as cunning, charming, and cruel as any of the great
                 Shakespearean villains. It is also the portrait of
                 those who fought Leopold: a brave handful of
                 missionaries, travelers, and young idealists who went
                 to Africa for work or adventure and unexpectedly found
                 themselves witnesses to a holocaust. Adam Hochschild
                 brings this story alive. He knows that history often
                 provides a far richer cast of characters than any
                 novelist could invent. Chief among them is Edmund
                 Morel, a young British shipping agent who went on to
                 lead the international crusade against Leopold. Another
                 hero of this tale, the Irish patriot Roger Casement,
                 ended his life on a London gallows. Two courageous
                 black Americans, George Washington Williams and William
                 Sheppard, risked much to bring evidence of the Congo
                 atrocities to the outside world. Sailing into the
                 middle of the story was a young Congo River steamboat
                 officer named Joseph Conrad. And looming above them
                 all, the duplicitous billionaire King Leopold II.",
  acknowledgement = ack-nhfb,
  author-dates = "1942--",
  subject =      "1885--1908; 19e si{\`e}cle; 19th century; 20e
                 si{\`e}cle; 20th century; Autochtones; Belgium;
                 Colonialism; Congo (Democratic Republic); Congo
                 (R{\'e}publique d{\'e}mocratique); Democratic Republic
                 of the Congo; Ethnische Beziehungen; Forced labor;
                 Forced labor; Histoire; History; History, 19th Century;
                 History, 20th Century; Human Rights; Human rights
                 movements; Human rights movements; II; Indigenous
                 peoples; Indigenous peoples; King of the Belgians; King
                 of the Belgians,; Kolonialismus; Kongo (Demokratische
                 Republik); L{\'e}opold; Mouvements des droits de
                 l'homme; Oppression; Politics; Politics and government;
                 Politics and government; Politique et gouvernement;
                 Race relations; Race relations; Relations raciales;
                 Travail forc{\'e}; Zwangsarbeit",
  tableofcontents = "``The traders area kidnapping our people'' \\
                 ``I shall not give up the chase'' \\
                 The fox crosses the dream \\
                 The magnificent cake \\
                 ``The treaties must grant us everything'' \\
                 From Florida to Berlin \\
                 Under the Yacht Club flag \\
                 The first heretic \\
                 Where there aren't no Ten Commandments \\
                 Meeting Mr. Kurtz \\
                 The wood that weeps \\
                 A secret society of murderers \\
                 David and Goliath \\
                 Breaking into the thieves' kitchen \\
                 To flood his deeds with day \\
                 A reckoning \\
                 ``Journalists won't give you receipts'' \\
                 No man is a stranger \\
                 Victory? \\
                 The Great Forgetting \\
                 Looking back: A personal afterword",
}


bibtype: book
filename: master.bib
label: Hockney:1981:PCA
author: R. W. Hockney and C. R. Jesshope
title: Parallel Computers: Architecture, Programming, and Algorithms
publisher: pub-ADAM-HILGER
address: pub-ADAM-HILGER:adr
pages: xiii + 423
year: 1981, 1983
LCCN: QA76.6 .H58 1981
bibdate: Wed Dec 15 09:11:15 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 09:11:15 ???
acknowledgement: ack-nhfb
rawauthor: R. W. Hockney and C. R. Jesshope
rawtitle: Parallel Computers: Architecture, Programming, and Algorithms
ISBN:
0-85274-422-6 (hardcover), 0-85274-752-7 (paperback) OR 0852744226 (hardcover), 0852747527 (paperback)

ISBN13:
978-0-85274-422-2 (hardcover), 978-0-85274-752-0 (paperback) OR 9780852744222 (hardcover), 9780852747520 (paperback)

entry:
@Book{Hockney:1981:PCA,
  author =       "R. W. Hockney and C. R. Jesshope",
  title =        "Parallel Computers: Architecture, Programming, and
                 Algorithms",
  publisher =    pub-ADAM-HILGER,
  address =      pub-ADAM-HILGER:adr,
  pages =        "xiii + 423",
  year =         "1981, 1983",
  ISBN =         "0-85274-422-6 (hardcover), 0-85274-752-7 (paperback)",
  ISBN-13 =      "978-0-85274-422-2 (hardcover), 978-0-85274-752-0
                 (paperback)",
  LCCN =         "QA76.6 .H58 1981",
  bibdate =      "Wed Dec 15 09:11:15 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "UK\pounds 22.50",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Hockney:1988:PCA
author: Roger W. Hockney and Chris R. Jesshope
title: Parallel Computers: Architecture, Programming, and Algorithms
publisher: pub-ADAM-HILGER
address: pub-ADAM-HILGER:adr
edition: Second
pages: xv + 625
year: 1988
LCCN: QA76.5 .H57 1988
MRclass: 68-02, 65-04, 65Y05, 68N25
bibdate: Sun Jul 10 01:08:36 1994
bibtimestamp: 1994.07.10 01:08:36 ???
ZMnumber: 0641.68001
acknowledgement: ack-nhfb
rawauthor: Roger W. Hockney and Chris R. Jesshope
rawtitle: Parallel Computers: Architecture, Programming, and Algorithms
ISBN:
0-85274-811-6 (hardcover), 0-85274-812-4 (paperback) OR 0852748116 (hardcover), 0852748124 (paperback)

ISBN13:
978-0-85274-811-4 (hardcover), 978-0-85274-812-1 (paperback) OR 9780852748114 (hardcover), 9780852748121 (paperback)

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/master.bib

abstract:
Parallel Computers 2 follows the development of large fast supercomputers and provides a thorough guide to all aspects of the subject; technology, computer architecture, languages and algorithms using successful commercially available products as examples. Of interest to computer scientists, electronics engineers and physicists in academia and industry, students on MSc courses and final year undergraduates in computer science, parallel computers, supercomputers, parallel architectures, etc.

rawabstract:
Parallel Computers 2 follows the development of large fast supercomputers and provides a thorough guide to all aspects of the subject; technology, computer architecture, languages and algorithms using successful commercially available products as examples. Of interest to computer scientists, electronics engineers and physicists in academia and industry, students on MSc courses and final year undergraduates in computer science, parallel computers, supercomputers, parallel architectures, etc.

entry:
@Book{Hockney:1988:PCA,
  author =       "Roger W. Hockney and Chris R. Jesshope",
  title =        "Parallel Computers: Architecture, Programming, and
                 Algorithms",
  publisher =    pub-ADAM-HILGER,
  address =      pub-ADAM-HILGER:adr,
  edition =      "Second",
  pages =        "xv + 625",
  year =         "1988",
  ISBN =         "0-85274-811-6 (hardcover), 0-85274-812-4 (paperback)",
  ISBN-13 =      "978-0-85274-811-4 (hardcover), 978-0-85274-812-1
                 (paperback)",
  LCCN =         "QA76.5 .H57 1988",
  MRclass =      "68-02, 65-04, 65Y05, 68N25",
  bibdate =      "Sun Jul 10 01:08:36 1994",
  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/master.bib",
  ZMnumber =     "0641.68001",
  abstract =     "Parallel Computers 2 follows the development of large
                 fast supercomputers and provides a thorough guide to
                 all aspects of the subject; technology, computer
                 architecture, languages and algorithms using successful
                 commercially available products as examples. Of
                 interest to computer scientists, electronics engineers
                 and physicists in academia and industry, students on
                 MSc courses and final year undergraduates in computer
                 science, parallel computers, supercomputers, parallel
                 architectures, etc.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}


bibtype: book
filename: master.bib
label: Hochschild:1999:KLG
author: Adam Hochschild
title: King Leopold's ghost: a story of greed, terror, and heroism in Colonial Africa
publisher: Houghton Mifflin
address: Boston, MA, USA
pages: 366 + 16
year: 1999
LCCN: DT655 .H63 1998
bibdate: Sat Oct 23 16:32:02 MDT 2021
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2021.10.23 16:32:02 MDT
acknowledgement: ack-nhfb
subjectdates: 1873--1924; 1835--1909
rawauthor: Adam Hochschild
rawtitle: {King Leopold}'s ghost: a story of greed, terror, and heroism in {Colonial Africa}
ISBN:
0-395-75924-2 (hardcover), 0-618-00190-5 (paperback), 0-547-52573-7 (e-book) OR 0395759242 (hardcover), 0618001905 (paperback), 0547525737 (ebook)

ISBN13:
978-0-395-75924-0 (hardcover), 978-0-618-00190-3 (paperback), 978-0-547-52573-0 (e-book) OR 9780395759240 (hardcover), 9780618001903 (paperback), 9780547525730 (ebook)

URL:
http://books.google.com/books?id=VLuKAAAAMAAJ; http://catdir.loc.gov/catdir/description/hm022/98016813.html; http://catdir.loc.gov/catdir/enhancements/fy0736/98016813-b.html; http://www.houghtonmifflinbooks.com/readers_guides/hochschild_king_leo.shtml

abstract:
Chronicles the life of King Leopold II of Belgium and discusses how he plundered the Congo, how his people tried to overthrow him, and other related topics.

subject:
Morel, E. D; (Edmund Dene); Et le Congo; Leopold; II; roi des Belges; Forced labor; Congo (Democratic Republic); History; 19th century; 20th century; Indigenous peoples; Human rights movements; Travail force; Congo (Republique democratique); Histoire; Autochtones; 19e siecle; 20e siecle; Mouvements des droits de l'homme; Race relations; Politics and government; Indigenous peoples; Human rights movements; Forced labor; Koloniale periode; Uitbuiting; Gruweldaden; History; Indigenous people; Congo (Democratic Republic); Congo (Democratic Republic); Forced labor; Politics and government; 1885-1908; Race relations; Politique et gouvernement; Relations raciales; Kongo <Demokratische Republik>

TOC:
Prologue ``The traders area kidnapping our people'' Part I Walking into fire. ``I shall not give up the chase'' The fox crosses the stream The magnificent cake ``The treaties must grant us everything'' From Florida to Berlin Under the Yacht Club flag The first heretic Where there aren't no Ten Commandments Meeting Mr. Kurtz The wood that weeps A secret society of murderers Part II A King at bay. David and Goliath Breaking into the thieves' kitchen To flood his deeds with day A reckoning ``Journalists won't give you recipes'' No man is a stranger Victory? The Great Forgetting Looking back a personal afterword

rawabstract:
Chronicles the life of King Leopold II of Belgium and discusses how he plundered the Congo, how his people tried to overthrow him, and other related topics.

rawTOC:
Prologue \\ ``The traders area kidnapping our people'' \\ Part I \\ Walking into fire. ``I shall not give up the chase'' \\ The fox crosses the stream \\ The magnificent cake \\ ``The treaties must grant us everything'' \\ From Florida to Berlin \\ Under the Yacht Club flag \\ The first heretic \\ Where there aren't no Ten Commandments Meeting Mr. Kurtz \\ The wood that weeps \\ A secret society of murderers \\ Part II \\ A King at bay. David and Goliath \\ Breaking into the thieves' kitchen \\ To flood his deeds with day A reckoning \\ ``Journalists won't give you recipes'' No man is a stranger \\ Victory? \\ The Great Forgetting \\ Looking back \\ a personal afterword

entry:
@Book{Hochschild:1999:KLG,
  author =       "Adam Hochschild",
  title =        "{King Leopold}'s ghost: a story of greed, terror, and
                 heroism in {Colonial Africa}",
  publisher =    "Houghton Mifflin",
  address =      "Boston, MA, USA",
  pages =        "366 + 16",
  year =         "1999",
  ISBN =         "0-395-75924-2 (hardcover), 0-618-00190-5 (paperback),
                 0-547-52573-7 (e-book)",
  ISBN-13 =      "978-0-395-75924-0 (hardcover), 978-0-618-00190-3
                 (paperback), 978-0-547-52573-0 (e-book)",
  LCCN =         "DT655 .H63 1998",
  bibdate =      "Sat Oct 23 16:32:02 MDT 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://books.google.com/books?id=VLuKAAAAMAAJ;
                 http://catdir.loc.gov/catdir/description/hm022/98016813.html;
                 http://catdir.loc.gov/catdir/enhancements/fy0736/98016813-b.html;
                 http://www.houghtonmifflinbooks.com/readers_guides/hochschild_king_leo.shtml",
  abstract =     "Chronicles the life of King Leopold II of Belgium and
                 discusses how he plundered the Congo, how his people
                 tried to overthrow him, and other related topics.",
  acknowledgement = ack-nhfb,
  subject =      "Morel, E. D; (Edmund Dene); Et le Congo; L{\'e}opold;
                 II; roi des Belges; Forced labor; Congo (Democratic
                 Republic); History; 19th century; 20th century;
                 Indigenous peoples; Human rights movements; Travail
                 forc{\'e}; Congo (R{\'e}publique d{\'e}mocratique);
                 Histoire; Autochtones; 19e si{\`e}cle; 20e si{\`e}cle;
                 Mouvements des droits de l'homme; Race relations;
                 Politics and government; Indigenous peoples; Human
                 rights movements; Forced labor; Koloniale periode;
                 Uitbuiting; Gruweldaden; History; Indigenous people;
                 Congo (Democratic Republic); Congo (Democratic
                 Republic); Forced labor; Politics and government;
                 1885-1908; Race relations; Politique et gouvernement;
                 Relations raciales; Kongo <Demokratische Republik>",
  subject-dates = "1873--1924; 1835--1909",
  tableofcontents = "Prologue \\
                 ``The traders area kidnapping our people'' \\
                 Part I \\
                 Walking into fire. ``I shall not give up the chase''
                 \\
                 The fox crosses the stream \\
                 The magnificent cake \\
                 ``The treaties must grant us everything'' \\
                 From Florida to Berlin \\
                 Under the Yacht Club flag \\
                 The first heretic \\
                 Where there aren't no Ten Commandments Meeting Mr.
                 Kurtz \\
                 The wood that weeps \\
                 A secret society of murderers \\
                 Part II \\
                 A King at bay. David and Goliath \\
                 Breaking into the thieves' kitchen \\
                 To flood his deeds with day A reckoning \\
                 ``Journalists won't give you recipes'' No man is a
                 stranger \\
                 Victory? \\
                 The Great Forgetting \\
                 Looking back \\
                 a personal afterword",
}


bibtype: book
filename: master.bib
label: Hodge:2005:MVE
author: Jonathan K. Hodge and Richard E. Klima
title: The Mathematics of Voting and Elections: a Hands-on Approach
volume: 22
publisher: pub-AMS
address: pub-AMS:adr
pages: xiv + 226
year: 2005
ISBN: 0-8218-3798-2 (paperback), 1-4704-1194-6 (e-book) OR 0821837982 (paperback), 1470411946 (ebook)
ISSN: 1055-9426 OR 10559426
LCCN: JF1001 .H63 2005
bibdate: Wed Apr 23 16:02:16 MDT 2008
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2008.04.23 16:02:16 MDT
series: Mathematical world
subject: voting; mathematical models; elections; social choice; game theory; social sciences
acknowledgement: ack-nhfb
rawauthor: Jonathan K. Hodge and Richard E. Klima
rawtitle: The Mathematics of Voting and Elections: a Hands-on Approach
ISBN13:
978-0-8218-3798-6 (paperback), 978-1-4704-1194-7 (e-book) OR 9780821837986 (paperback), 9781470411947 (ebook)

abstract:
booktitle The Mathematics of Voting and Elections: A Hands-on Approach will help you discover answers to these and many other questions. Easily accessible to anyone interested in the subject, the book requires virtually no prior mathematical experience beyond basic arithmetic, and includes numerous examples and discussions regarding actual elections from politics and popular culture.

TOC:
1. What's so good about majority rule? 2. Perot, Nader, and other inconveniences 3. Back into the ring 4. Trouble in democracy 5. Explaining the impossible 6. One person, one vote? 7. Calculating corruption 8. The ultimate college experience 9. Trouble in direct democracy 10. Proportional (mis)representation

rawabstract:
\booktitle{The Mathematics of Voting and Elections: A Hands-on Approach} will help you discover answers to these and many other questions. Easily accessible to anyone interested in the subject, the book requires virtually no prior mathematical experience beyond basic arithmetic, and includes numerous examples and discussions regarding actual elections from politics and popular culture.

rawTOC:
1. What's so good about majority rule? \\ 2. Perot, Nader, and other inconveniences \\ 3. Back into the ring \\ 4. Trouble in democracy \\ 5. Explaining the impossible \\ 6. One person, one vote? \\ 7. Calculating corruption \\ 8. The ultimate college experience \\ 9. Trouble in direct democracy \\ 10. Proportional (mis)representation

entry:
@Book{Hodge:2005:MVE,
  author =       "Jonathan K. Hodge and Richard E. Klima",
  title =        "The Mathematics of Voting and Elections: a Hands-on
                 Approach",
  volume =       "22",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xiv + 226",
  year =         "2005",
  ISBN =         "0-8218-3798-2 (paperback), 1-4704-1194-6 (e-book)",
  ISBN-13 =      "978-0-8218-3798-6 (paperback), 978-1-4704-1194-7
                 (e-book)",
  ISSN =         "1055-9426",
  LCCN =         "JF1001 .H63 2005",
  bibdate =      "Wed Apr 23 16:02:16 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Mathematical world",
  abstract =     "\booktitle{The Mathematics of Voting and Elections: A
                 Hands-on Approach} will help you discover answers to
                 these and many other questions. Easily accessible to
                 anyone interested in the subject, the book requires
                 virtually no prior mathematical experience beyond basic
                 arithmetic, and includes numerous examples and
                 discussions regarding actual elections from politics
                 and popular culture.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "voting; mathematical models; elections; social choice;
                 game theory; social sciences",
  tableofcontents = "1. What's so good about majority rule? \\
                 2. Perot, Nader, and other inconveniences \\
                 3. Back into the ring \\
                 4. Trouble in democracy \\
                 5. Explaining the impossible \\
                 6. One person, one vote? \\
                 7. Calculating corruption \\
                 8. The ultimate college experience \\
                 9. Trouble in direct democracy \\
                 10. Proportional (mis)representation",
}


