# bibtab

bibtype: book
filename: master.bib
label: Griswold:1983:IPL
author: Ralph E. Griswold and Madge T. Griswold
title: The Icon Programming Language
publisher: pub-PH
address: pub-PH:adr
pages: xviii + 313
year: 1983
ISBN: 0-13-449777-5 (paperback) OR 0134497775 (paperback)
ISBN13: 978-0-13-449777-8 (paperback) OR 9780134497778 (paperback)
LCCN: QA76.73.I19 G74 1983
bibdate: Tue Dec 14 22:54:38 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:54:38 ???
acknowledgement: ack-nhfb
rawauthor: Ralph E. Griswold and Madge T. Griswold
rawtitle: The {Icon} Programming Language
entry:
@Book{Griswold:1983:IPL,
  author =       "Ralph E. Griswold and Madge T. Griswold",
  title =        "The {Icon} Programming Language",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xviii + 313",
  year =         "1983",
  ISBN =         "0-13-449777-5 (paperback)",
  ISBN-13 =      "978-0-13-449777-8 (paperback)",
  LCCN =         "QA76.73.I19 G74 1983",
  bibdate =      "Tue Dec 14 22:54:38 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Griswold:1986:IIP
author: Ralph E. Griswold and Madge T. Griswold
title: The Implementation of the Icon Programming Language
publisher: pub-PRINCETON
address: pub-PRINCETON:adr
pages: x + 336
year: 1986
ISBN: 0-691-08431-9 OR 0691084319
ISBN13: 978-0-691-08431-2 OR 9780691084312
LCCN: QA76.73.I19 G76 1986
bibdate: Sun Jul 10 01:07:50 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.07.10 01:07:50 ???
URL: http://www.cs.arizona.edu/icon/ibsale.htm
acknowledgement: ack-nhfb
rawauthor: Ralph E. Griswold and Madge T. Griswold
rawtitle: The Implementation of the {Icon} Programming Language
entry:
@Book{Griswold:1986:IIP,
  author =       "Ralph E. Griswold and Madge T. Griswold",
  title =        "The Implementation of the {Icon} Programming
                 Language",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "x + 336",
  year =         "1986",
  ISBN =         "0-691-08431-9",
  ISBN-13 =      "978-0-691-08431-2",
  LCCN =         "QA76.73.I19 G76 1986",
  bibdate =      "Sun Jul 10 01:07:50 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$39.50",
  URL =          "http://www.cs.arizona.edu/icon/ibsale.htm",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Griswold:1990:IPL
author: Ralph E. Griswold and Madge T. Griswold
title: The Icon Programming Language
publisher: pub-PH
address: pub-PH:adr
edition: Second
pages: xv + 367
year: 1990
ISBN: 0-13-447889-4 OR 0134478894
ISBN13: 978-0-13-447889-0 OR 9780134478890
LCCN: QA76.73.I19 G74 1990
bibdate: Tue Dec 14 22:54:39 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:54:39 ???
acknowledgement: ack-nhfb
rawauthor: Ralph E. Griswold and Madge T. Griswold
rawtitle: The {Icon} Programming Language
entry:
@Book{Griswold:1990:IPL,
  author =       "Ralph E. Griswold and Madge T. Griswold",
  title =        "The {Icon} Programming Language",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Second",
  pages =        "xv + 367",
  year =         "1990",
  ISBN =         "0-13-447889-4",
  ISBN-13 =      "978-0-13-447889-0",
  LCCN =         "QA76.73.I19 G74 1990",
  bibdate =      "Tue Dec 14 22:54:39 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$47.00",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}


bibtype: book
filename: master.bib
label: Gudmundsson:2016:EIG
author: Snae bjorn Gueth mundsson
title: Exploring Iceland's geology
publisher: Mal og menning
address: Reykjavik, Iceland
pages: 168
year: 2016
ISBN: 9979-3-3625-0 OR 9979336250
ISBN13: 978-9979-3-3625-9 OR 9789979336259
LCCN: QE279 .S63 2016
bibdate: Sat May 27 08:02:13 2017
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2017.05.27 08:02:13 ???
acknowledgement: ack-nhfb
rawauthor: Sn{\ae}bj{\"o}rn Gu{\eth}mundsson
rawtitle: Exploring {Iceland}'s geology
note:
English translation by Katrina Downs-Rose and Orn Sigureth sson of booktitle Vegvisir um jareth frae eth i Islands (2015).

rawnote:
English translation by Katrina Downs-Rose and {\"O}rn Sigur{\eth}sson of \booktitle{Vegv{\'\i}sir um jar{\eth}fr{\ae}{\eth}i {\'I}slands} (2015).

entry:
@Book{Gudmundsson:2016:EIG,
  author =       "Sn{\ae}bj{\"o}rn Gu{\eth}mundsson",
  title =        "Exploring {Iceland}'s geology",
  publisher =    "M{\'a}l og menning",
  address =      "Reykjav{\'\i}k, Iceland",
  pages =        "168",
  year =         "2016",
  ISBN =         "9979-3-3625-0",
  ISBN-13 =      "978-9979-3-3625-9",
  LCCN =         "QE279 .S63 2016",
  bibdate =      "Sat May 27 08:02:13 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "English translation by Katrina Downs-Rose and {\"O}rn
                 Sigur{\eth}sson of \booktitle{Vegv{\'\i}sir um
                 jar{\eth}fr{\ae}{\eth}i {\'I}slands} (2015).",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Gurari:1994:TLD
author: Eitan M. Gurari
title: TeX and LaTeX : Drawing and Literate Programming
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
pages: xiv + 310
year: 1994
LCCN: Z253.4.T47G87 1994
bibdate: Fri Oct 15 17:56:01 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.10.15 17:56:01 ???
acknowledgement: ack-nhfb
rawauthor: Eitan M. Gurari
rawtitle: {\TeX} and {\LaTeX}: Drawing and Literate Programming
ISBN:
0-07-025208-4 (book), 0-07-911616-7 (book + diskette) OR 0070252084 (book), 0079116167 (book + diskette)

ISBN13:
978-0-07-025208-0 (book), 978-0-07-911616-1 (book + diskette) OR 9780070252080 (book), 9780079116161 (book + diskette)

entry:
@Book{Gurari:1994:TLD,
  author =       "Eitan M. Gurari",
  title =        "{\TeX} and {\LaTeX}: Drawing and Literate
                 Programming",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xiv + 310",
  year =         "1994",
  ISBN =         "0-07-025208-4 (book), 0-07-911616-7 (book +
                 diskette)",
  ISBN-13 =      "978-0-07-025208-0 (book), 978-0-07-911616-1 (book +
                 diskette)",
  LCCN =         "Z253.4.T47G87 1994",
  bibdate =      "Fri Oct 15 17:56:01 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$34.95",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Gurari:1994:WT
author: Eitan M. Gurari
title: Writing with TeX
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
pages: xiv + 249
year: 1994
ISBN: 0-07-025207-6 OR 0070252076
ISBN13: 978-0-07-025207-3 OR 9780070252073
LCCN: Z253.4.T47 G87 1994
bibdate: Wed Sep 29 17:55:14 1993
bibtimestamp: 1993.09.29 17:55:14 ???
acknowledgement: ack-nhfb
rawauthor: Eitan M. Gurari
rawtitle: Writing with {\TeX}
TOC:
1: Getting Started 2: Writing Without Special Features 3: Basic Units 4: Fonts 5: Spaces and Breakpoints 6: Layout of Pages 7: Groups 8: Mathematical Formulas 9: Figures 10: Compound Units of Text 11: Macros 12: Data Types 13: Selectors 14: Auxiliary Files 15: Deeper Into Macros 16: Characters 17: Environments for Writing Appendix A: More on Symbols and Characters Appendix B: More About Tex Appendix C: Line Drawing Appendix D: Output Routines Appendix E: Mathematical Tables Appendix F: Ordinary Tables Appendix G: Catalog of Commands Appendix H: Bibliography

rawTOC:
1: Getting Started \\ 2: Writing Without Special Features \\ 3: Basic Units \\ 4: Fonts \\ 5: Spaces and Breakpoints \\ 6: Layout of Pages \\ 7: Groups \\ 8: Mathematical Formulas \\ 9: Figures \\ 10: Compound Units of Text \\ 11: Macros \\ 12: Data Types \\ 13: Selectors \\ 14: Auxiliary Files \\ 15: Deeper Into Macros \\ 16: Characters \\ 17: Environments for Writing \\ Appendix A: More on Symbols and Characters \\ Appendix B: More About Tex \\ Appendix C: Line Drawing \\ Appendix D: Output Routines \\ Appendix E: Mathematical Tables \\ Appendix F: Ordinary Tables \\ Appendix G: Catalog of Commands \\ Appendix H: Bibliography

entry:
@Book{Gurari:1994:WT,
  author =       "Eitan M. Gurari",
  title =        "Writing with {\TeX}",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xiv + 249",
  year =         "1994",
  ISBN =         "0-07-025207-6",
  ISBN-13 =      "978-0-07-025207-3",
  LCCN =         "Z253.4.T47 G87 1994",
  bibdate =      "Wed Sep 29 17:55:14 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Getting Started \\
                 2: Writing Without Special Features \\
                 3: Basic Units \\
                 4: Fonts \\
                 5: Spaces and Breakpoints \\
                 6: Layout of Pages \\
                 7: Groups \\
                 8: Mathematical Formulas \\
                 9: Figures \\
                 10: Compound Units of Text \\
                 11: Macros \\
                 12: Data Types \\
                 13: Selectors \\
                 14: Auxiliary Files \\
                 15: Deeper Into Macros \\
                 16: Characters \\
                 17: Environments for Writing \\
                 Appendix A: More on Symbols and Characters \\
                 Appendix B: More About Tex \\
                 Appendix C: Line Drawing \\
                 Appendix D: Output Routines \\
                 Appendix E: Mathematical Tables \\
                 Appendix F: Ordinary Tables \\
                 Appendix G: Catalog of Commands \\
                 Appendix H: Bibliography",
}


bibtype: book
filename: master.bib
label: Gusfield:1997:AST
author: Dan Gusfield
title: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology
publisher: pub-CAMBRIDGE
address: pub-CAMBRIDGE:adr
pages: xviii + 534
year: 1997
ISBN: 0-521-58519-8 (hardcover) OR 0521585198 (hardcover)
ISBN13: 978-0-521-58519-4 (hardcover) OR 9780521585194 (hardcover)
LCCN: QA76.9.A43 G87 1997
bibdate: Thu Apr 26 13:23:11 MDT 2001
bibtimestamp: 2001.04.26 13:23:11 MDT
keywords: computer algorithms; molecular biology --- data processing
acknowledgement: ack-nhfb
rawauthor: Dan Gusfield
rawtitle: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology
abstract:
String algorithms are a traditional area of study in computer science. In recent years their importance has grown dramatically with the huge increase of electronically stored text and of molecular sequence data (DNA or protein sequences) produced by various genome projects. This book is a general text on computer algorithms for string processing. In addition to pure computer science, the book contains extensive discussions on biological problems that are cast as string problems, and on methods developed to solve them. It emphasises the fundamental ideas and techniques central to today's applications. New approaches to this complex material simplify methods that up to now have been for the specialist alone. With over 400 exercises to reinforce the material and develop additional topics, the book is suitable as a text for graduate or advanced undergraduate students in computer science, computational biology, or bio-informatics. Its discussion of current algorithms and techniques also makes it a reference for professionals.

TOC:
Dedication Contents Preface I Exact String Matching: The Fundamental String Problem 1 Exact Matching: Fundamental Preprocessing and First Algorithms 1.1 The naive method 1.1.1. Early ideas for speeding up the naive method 1.2 The preprocessing approach 1.3 Fundamental preprocessing of the pattern 1.4 Fundamental preprocessing in linear time The Z algorithm 1.5 The simplest linear-time exact matching algorithm 1.5.1. Why continue? 1.6 Exercises A digression on circular strings in DNA 2 Exact Matching: Classical Comparison-Based Methods 2.1 Introduction 2.2 The Boyer--Moore Algorithm 2.2.1. Right-to-left scan 2.2.2. Bad character rule 2.2.3. The (strong) good suffix rule 2.2.4. Preprocessing for the good suffix rule 2.2.5. The good suffix rule in the search stage of Boyer--Moore 2.2.6. The complete Boyer--Moore algorithm 2.3 The Knuth--Morris--Pratt algorithm 2.3.1. The Knuth--Morris--Pratt shift idea The Knuth--Morris--Pratt shift rule 2.3.2. Preprocessing for Knuth--Morris--Pratt 2.3.3. A full implementation of Knuth--Morris--Pratt 2.4 Real-time string matching 2.4.1. Converting Knuth--Morris--Pratt to a real-time method 2.4.2. Preprocessing for real-time string matching 2.5 Exercises 3 Exact Matching: A Deeper Look at Classical Methods 3.1 A Boyer--Moore variant with a ``simple'' linear time bound 3.1.1. Key ideas 3.1.2. One phase in detail 3.1.3. Correctness and linear-time analysis 3.2 Cole's linear worst-case bound for Boyer--Moore 3.2.1. Cole's proof when the pattern does not occur in the text 3.2.2. The case when the pattern does occur in the text 3.2.3. Adding in the bad character rule 3.3 The original preprocessing for Knuth--Morris--Pratt 3.3.1. The method does not use fundamental preprocessing 3.3.2. The easy case 3.3.3. The general case 3.3.4. How to compute the optimized shift values 3.4 Exact matching with a set of patterns 3.4.1. Naive use of keyword trees for set matching 3.4.2. The speedup: generalizing Knuth--Morris--Pratt 3.4.3. Failure functions for the keyword tree 3.4.4. The failure links speed up the search 3.4.5. Linear preprocessing for the failure function 3.4.6. The full Aho--Corasick algorithm: relaxing the substring assumption 3.5 Three applications of exact set matching 3.5.1. Matching against a DNA or protein library of known patterns 3.5.2. Exact matching with wild cards 3.5.3. Two-dimensional exact matching 3.6 Regular expression pattern matching 3.6.1. Formal definitions 3.7 Exercises 4 Seminumerical String Matching 4.1 Arithmetic versus comparison-based methods 4.2 The Shift-And method 4.2.1. How to construct array M 4.2.2. Shift-And is effective for small patterns 4.2.3. agrep: The Shift-And method with errors 4.2.4. How to compute Mk [contents lost] ldots 

rawabstract:
String algorithms are a traditional area of study in computer science. In recent years their importance has grown dramatically with the huge increase of electronically stored text and of molecular sequence data (DNA or protein sequences) produced by various genome projects. This book is a general text on computer algorithms for string processing. In addition to pure computer science, the book contains extensive discussions on biological problems that are cast as string problems, and on methods developed to solve them. It emphasises the fundamental ideas and techniques central to today's applications. New approaches to this complex material simplify methods that up to now have been for the specialist alone. With over 400 exercises to reinforce the material and develop additional topics, the book is suitable as a text for graduate or advanced undergraduate students in computer science, computational biology, or bio-informatics. Its discussion of current algorithms and techniques also makes it a reference for professionals.

shortTOC:
I: Exact String Matching: The Fundamental String Problem / 1 1: Exact Matching: Fundamental Preprocessing and First Algorithms / 5 2: Exact Matching: Classical Comparison-Based Methods / 16 3: Exact Matching: A Deeper Look at Classical Methods. / 35 4: Seminumerical String Matching / 70 II: Suffix Trees and Their Uses / 87 5: Introduction to Suffix Trees / 89 6: Linear-Time Construction of Suffix Trees / 94 7: First Applications of Suffix Trees. / 122 8: Constant-Time Lowest Common Ancestor Retrieval. / 181 9: More Applications of Suffix Trees. / 196 III: Inexact Matching, Sequence Alignment, Dynamic Programming / 209 10: Importance of (Sub)sequence Comparison in Molecular Biology / 212 11: Core String Edits, Alignments, and Dynamic Programming. / 215 12: Refining Core String Edits and Alignments. / 254 13: Extending the Core Problems / 312 14: Multiple String Comparison The Holy Grail / 332 15: Sequence Databases and Their Uses The Mother Lode / 370IV: Currents, Cousins, and Cameos / 393 16: Maps, Mapping, Sequencing, and Superstrings / 395 17: Strings and Evolutionary Trees / 447 18: Three Short Topics / 480 19: Models of Genome-Level Mutations / 492 Epilogue Where next? / 501 Glossary / 524 Index / 530

rawshortTOC:
I: Exact String Matching: The Fundamental String Problem \\ / 1 \\ 1: Exact Matching: Fundamental Preprocessing and First Algorithms / 5 \\ 2: Exact Matching: Classical Comparison-Based Methods / 16 \\ 3: Exact Matching: A Deeper Look at Classical Methods. / 35 \\ 4: Seminumerical String Matching / 70 \\ II: Suffix Trees and Their Uses / 87 \\ 5: Introduction to Suffix Trees / 89 \\ 6: Linear-Time Construction of Suffix Trees / 94 \\ 7: First Applications of Suffix Trees. / 122 \\ 8: Constant-Time Lowest Common Ancestor Retrieval. / 181 \\ 9: More Applications of Suffix Trees. / 196 \\ III: Inexact Matching, Sequence Alignment, Dynamic Programming / 209 \\ 10: Importance of (Sub)sequence Comparison in Molecular Biology / 212 \\ 11: Core String Edits, Alignments, and Dynamic Programming. / 215 \\ 12: Refining Core String Edits and Alignments. / 254 \\ 13: Extending the Core Problems / 312 \\ 14: Multiple String Comparison \\ The Holy Grail / 332 \\ 15: Sequence Databases and Their Uses \\ The Mother Lode / 370IV: Currents, Cousins, and Cameos / 393 \\ 16: Maps, Mapping, Sequencing, and Superstrings / 395 \\ 17: Strings and Evolutionary Trees / 447 \\ 18: Three Short Topics / 480 \\ 19: Models of Genome-Level Mutations / 492 \\ Epilogue \\ Where next? / 501 \\ Glossary / 524 \\ Index / 530

rawTOC:
Dedication \\ Contents \\ Preface \\ I Exact String Matching: The Fundamental String Problem \\ 1 Exact Matching: Fundamental Preprocessing and First Algorithms \\ 1.1 The naive method \\ 1.1.1. Early ideas for speeding up the naive method \\ 1.2 The preprocessing approach \\ 1.3 Fundamental preprocessing of the pattern \\ 1.4 Fundamental preprocessing in linear time \\ The Z algorithm \\ 1.5 The simplest linear-time exact matching algorithm \\ 1.5.1. Why continue? \\ 1.6 Exercises \\ A digression on circular strings in DNA \\ 2 Exact Matching: Classical Comparison-Based Methods \\ 2.1 Introduction \\ 2.2 The Boyer--Moore Algorithm \\ 2.2.1. Right-to-left scan \\ 2.2.2. Bad character rule \\ 2.2.3. The (strong) good suffix rule \\ 2.2.4. Preprocessing for the good suffix rule \\ 2.2.5. The good suffix rule in the search stage of Boyer--Moore \\ 2.2.6. The complete Boyer--Moore algorithm \\ 2.3 The Knuth--Morris--Pratt algorithm \\ 2.3.1. The Knuth--Morris--Pratt shift idea \\ The Knuth--Morris--Pratt shift rule \\ 2.3.2. Preprocessing for Knuth--Morris--Pratt \\ 2.3.3. A full implementation of Knuth--Morris--Pratt \\ 2.4 Real-time string matching \\ 2.4.1. Converting Knuth--Morris--Pratt to a real-time method \\ 2.4.2. Preprocessing for real-time string matching \\ 2.5 Exercises \\ 3 Exact Matching: A Deeper Look at Classical Methods \\ 3.1 A Boyer--Moore variant with a ``simple'' linear time bound \\ 3.1.1. Key ideas \\ 3.1.2. One phase in detail \\ 3.1.3. Correctness and linear-time analysis \\ 3.2 Cole's linear worst-case bound for Boyer--Moore \\ 3.2.1. Cole's proof when the pattern does not occur in the text \\ 3.2.2. The case when the pattern does occur in the text \\ 3.2.3. Adding in the bad character rule \\ 3.3 The original preprocessing for Knuth--Morris--Pratt \\ 3.3.1. The method does not use fundamental preprocessing \\ 3.3.2. The easy case \\ 3.3.3. The general case \\ 3.3.4. How to compute the optimized shift values \\ 3.4 Exact matching with a set of patterns \\ 3.4.1. Naive use of keyword trees for set matching \\ 3.4.2. The speedup: generalizing Knuth--Morris--Pratt \\ 3.4.3. Failure functions for the keyword tree \\ 3.4.4. The failure links speed up the search \\ 3.4.5. Linear preprocessing for the failure function \\ 3.4.6. The full Aho--Corasick algorithm: relaxing the substring assumption \\ 3.5 Three applications of exact set matching \\ 3.5.1. Matching against a DNA or protein library of known patterns \\ 3.5.2. Exact matching with wild cards \\ 3.5.3. Two-dimensional exact matching \\ 3.6 Regular expression pattern matching \\ 3.6.1. Formal definitions \\ 3.7 Exercises \\ 4 Seminumerical String Matching \\ 4.1 Arithmetic versus comparison-based methods \\ 4.2 The Shift-And method \\ 4.2.1. How to construct array M \\ 4.2.2. Shift-And is effective for small patterns \\ 4.2.3. agrep: The Shift-And method with errors \\ 4.2.4. How to compute Mk \\ [contents lost] \ldots{}

entry:
@Book{Gusfield:1997:AST,
  author =       "Dan Gusfield",
  title =        "Algorithms on Strings, Trees, and Sequences: Computer
                 Science and Computational Biology",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xviii + 534",
  year =         "1997",
  ISBN =         "0-521-58519-8 (hardcover)",
  ISBN-13 =      "978-0-521-58519-4 (hardcover)",
  LCCN =         "QA76.9.A43 G87 1997",
  bibdate =      "Thu Apr 26 13:23:11 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  price =        "US\$64.95",
  abstract =     "String algorithms are a traditional area of study in
                 computer science. In recent years their importance has
                 grown dramatically with the huge increase of
                 electronically stored text and of molecular sequence
                 data (DNA or protein sequences) produced by various
                 genome projects. This book is a general text on
                 computer algorithms for string processing. In addition
                 to pure computer science, the book contains extensive
                 discussions on biological problems that are cast as
                 string problems, and on methods developed to solve
                 them. It emphasises the fundamental ideas and
                 techniques central to today's applications. New
                 approaches to this complex material simplify methods
                 that up to now have been for the specialist alone. With
                 over 400 exercises to reinforce the material and
                 develop additional topics, the book is suitable as a
                 text for graduate or advanced undergraduate students in
                 computer science, computational biology, or
                 bio-informatics. Its discussion of current algorithms
                 and techniques also makes it a reference for
                 professionals.",
  acknowledgement = ack-nhfb,
  keywords =     "computer algorithms; molecular biology --- data
                 processing",
  shorttableofcontents = "I: Exact String Matching: The Fundamental
                 String Problem \\
                 / 1 \\
                 1: Exact Matching: Fundamental Preprocessing and First
                 Algorithms / 5 \\
                 2: Exact Matching: Classical Comparison-Based Methods /
                 16 \\
                 3: Exact Matching: A Deeper Look at Classical Methods.
                 / 35 \\
                 4: Seminumerical String Matching / 70 \\
                 II: Suffix Trees and Their Uses / 87 \\
                 5: Introduction to Suffix Trees / 89 \\
                 6: Linear-Time Construction of Suffix Trees / 94 \\
                 7: First Applications of Suffix Trees. / 122 \\
                 8: Constant-Time Lowest Common Ancestor Retrieval. /
                 181 \\
                 9: More Applications of Suffix Trees. / 196 \\
                 III: Inexact Matching, Sequence Alignment, Dynamic
                 Programming / 209 \\
                 10: Importance of (Sub)sequence Comparison in Molecular
                 Biology / 212 \\
                 11: Core String Edits, Alignments, and Dynamic
                 Programming. / 215 \\
                 12: Refining Core String Edits and Alignments. / 254
                 \\
                 13: Extending the Core Problems / 312 \\
                 14: Multiple String Comparison \\
                 The Holy Grail / 332 \\
                 15: Sequence Databases and Their Uses \\
                 The Mother Lode / 370IV: Currents, Cousins, and Cameos
                 / 393 \\
                 16: Maps, Mapping, Sequencing, and Superstrings / 395
                 \\
                 17: Strings and Evolutionary Trees / 447 \\
                 18: Three Short Topics / 480 \\
                 19: Models of Genome-Level Mutations / 492 \\
                 Epilogue \\
                 Where next? / 501 \\
                 Glossary / 524 \\
                 Index / 530",
  tableofcontents = "Dedication \\
                 Contents \\
                 Preface \\
                 I Exact String Matching: The Fundamental String Problem
                 \\
                 1 Exact Matching: Fundamental Preprocessing and First
                 Algorithms \\
                 1.1 The naive method \\
                 1.1.1. Early ideas for speeding up the naive method \\
                 1.2 The preprocessing approach \\
                 1.3 Fundamental preprocessing of the pattern \\
                 1.4 Fundamental preprocessing in linear time \\
                 The Z algorithm \\
                 1.5 The simplest linear-time exact matching algorithm
                 \\
                 1.5.1. Why continue? \\
                 1.6 Exercises \\
                 A digression on circular strings in DNA \\
                 2 Exact Matching: Classical Comparison-Based Methods
                 \\
                 2.1 Introduction \\
                 2.2 The Boyer--Moore Algorithm \\
                 2.2.1. Right-to-left scan \\
                 2.2.2. Bad character rule \\
                 2.2.3. The (strong) good suffix rule \\
                 2.2.4. Preprocessing for the good suffix rule \\
                 2.2.5. The good suffix rule in the search stage of
                 Boyer--Moore \\
                 2.2.6. The complete Boyer--Moore algorithm \\
                 2.3 The Knuth--Morris--Pratt algorithm \\
                 2.3.1. The Knuth--Morris--Pratt shift idea \\
                 The Knuth--Morris--Pratt shift rule \\
                 2.3.2. Preprocessing for Knuth--Morris--Pratt \\
                 2.3.3. A full implementation of Knuth--Morris--Pratt
                 \\
                 2.4 Real-time string matching \\
                 2.4.1. Converting Knuth--Morris--Pratt to a real-time
                 method \\
                 2.4.2. Preprocessing for real-time string matching \\
                 2.5 Exercises \\
                 3 Exact Matching: A Deeper Look at Classical Methods
                 \\
                 3.1 A Boyer--Moore variant with a ``simple'' linear
                 time bound \\
                 3.1.1. Key ideas \\
                 3.1.2. One phase in detail \\
                 3.1.3. Correctness and linear-time analysis \\
                 3.2 Cole's linear worst-case bound for Boyer--Moore \\
                 3.2.1. Cole's proof when the pattern does not occur in
                 the text \\
                 3.2.2. The case when the pattern does occur in the text
                 \\
                 3.2.3. Adding in the bad character rule \\
                 3.3 The original preprocessing for Knuth--Morris--Pratt
                 \\
                 3.3.1. The method does not use fundamental
                 preprocessing \\
                 3.3.2. The easy case \\
                 3.3.3. The general case \\
                 3.3.4. How to compute the optimized shift values \\
                 3.4 Exact matching with a set of patterns \\
                 3.4.1. Naive use of keyword trees for set matching \\
                 3.4.2. The speedup: generalizing Knuth--Morris--Pratt
                 \\
                 3.4.3. Failure functions for the keyword tree \\
                 3.4.4. The failure links speed up the search \\
                 3.4.5. Linear preprocessing for the failure function
                 \\
                 3.4.6. The full Aho--Corasick algorithm: relaxing the
                 substring assumption \\
                 3.5 Three applications of exact set matching \\
                 3.5.1. Matching against a DNA or protein library of
                 known patterns \\
                 3.5.2. Exact matching with wild cards \\
                 3.5.3. Two-dimensional exact matching \\
                 3.6 Regular expression pattern matching \\
                 3.6.1. Formal definitions \\
                 3.7 Exercises \\
                 4 Seminumerical String Matching \\
                 4.1 Arithmetic versus comparison-based methods \\
                 4.2 The Shift-And method \\
                 4.2.1. How to construct array M \\
                 4.2.2. Shift-And is effective for small patterns \\
                 4.2.3. agrep: The Shift-And method with errors \\
                 4.2.4. How to compute Mk \\
                 [contents lost] \ldots{}",
}


bibtype: book
filename: master.bib
label: Gustafson:1998:ACM
author: Grant B. Gustafson and Calvin H. Wilcox
title: Analytical and Computational Methods of Advanced Engineering Mathematics
volume: 28
publisher: pub-SV
address: pub-SV:adr
pages: xxii + 729
year: 1998
ISBN: 0-387-98265-5 OR 0387982655
ISBN13: 978-0-387-98265-6 OR 9780387982656
LCCN: TA330 .G87 1998
bibdate: Sat Jul 03 08:08:09 2004
bibtimestamp: 2004.07.03 08:08:09 ???
series: Texts in applied mathematics
URL: http://www.springeronline.com/sgw/cda/frontpage/0,10735,4-40109-22-1522238-0,00.html
acknowledgement: ack-nhfb
rawauthor: Grant B. Gustafson and Calvin H. Wilcox
rawtitle: Analytical and Computational Methods of Advanced Engineering Mathematics
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/numana1990.bib; https://www.math.utah.edu/pub/tex/bib/utah-math-dept-books.bib

abstract:
This is a readable, innovative textbook of mathematical methods for undergraduate engineering and science students. The text is designed for a one-year course and is centered around the topics which form the essentials of engineering mathematics: ordinary differential equations, vector calculus, linear algebra, and partial differential equations. Ordinary differential equations are developed in a setting found suitable for scientists and engineers. Linear algebra, in particular, is a strong point of the book. The authors use a practical approach based upon solving equations, and all ideas are introduced from this basic viewpoint. Partial differential equations are introduced in the context of physical problems, rather than in an abstract setting. Emphasis is on the solution of an extensive and varied number of real-world problems, each treated completely and in sufficient depth to be self-contained. Advanced Engineering Mathematics is based on the authors' 25 years of university experience in teaching engineering mathematics.

TOC:
1: Numerical analysis 2: Ordinary differential equations of first order 3: Ordinary differential equations of higher order 4: The Laplace transform 5: Linear algebra 6: Vector analysis 7: Partial differential equations of mathematical physics 8: Fourier analysis and Sturm-Liouville theory 9: Boundary value problems of mathematical physics A: Answers and Hints

rawabstract:
This is a readable, innovative textbook of mathematical methods for undergraduate engineering and science students. The text is designed for a one-year course and is centered around the topics which form the essentials of engineering mathematics: ordinary differential equations, vector calculus, linear algebra, and partial differential equations. Ordinary differential equations are developed in a setting found suitable for scientists and engineers. Linear algebra, in particular, is a strong point of the book. The authors use a practical approach based upon solving equations, and all ideas are introduced from this basic viewpoint. Partial differential equations are introduced in the context of physical problems, rather than in an abstract setting. Emphasis is on the solution of an extensive and varied number of real-world problems, each treated completely and in sufficient depth to be self-contained. Advanced Engineering Mathematics is based on the authors' 25 years of university experience in teaching engineering mathematics.

rawTOC:
1: Numerical analysis \\ 2: Ordinary differential equations of first order \\ 3: Ordinary differential equations of higher order \\ 4: The Laplace transform \\ 5: Linear algebra \\ 6: Vector analysis \\ 7: Partial differential equations of mathematical physics \\ 8: Fourier analysis and Sturm-Liouville theory \\ 9: Boundary value problems of mathematical physics \\ A: Answers and Hints

entry:
@Book{Gustafson:1998:ACM,
  author =       "Grant B. Gustafson and Calvin H. Wilcox",
  title =        "Analytical and Computational Methods of Advanced
                 Engineering Mathematics",
  volume =       "28",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxii + 729",
  year =         "1998",
  ISBN =         "0-387-98265-5",
  ISBN-13 =      "978-0-387-98265-6",
  LCCN =         "TA330 .G87 1998",
  bibdate =      "Sat Jul 03 08:08:09 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/utah-math-dept-books.bib",
  series =       "Texts in applied mathematics",
  URL =          "http://www.springeronline.com/sgw/cda/frontpage/0,10735,4-40109-22-1522238-0,00.html",
  abstract =     "This is a readable, innovative textbook of
                 mathematical methods for undergraduate engineering and
                 science students. The text is designed for a one-year
                 course and is centered around the topics which form the
                 essentials of engineering mathematics: ordinary
                 differential equations, vector calculus, linear
                 algebra, and partial differential equations. Ordinary
                 differential equations are developed in a setting found
                 suitable for scientists and engineers. Linear algebra,
                 in particular, is a strong point of the book. The
                 authors use a practical approach based upon solving
                 equations, and all ideas are introduced from this basic
                 viewpoint. Partial differential equations are
                 introduced in the context of physical problems, rather
                 than in an abstract setting. Emphasis is on the
                 solution of an extensive and varied number of
                 real-world problems, each treated completely and in
                 sufficient depth to be self-contained. Advanced
                 Engineering Mathematics is based on the authors' 25
                 years of university experience in teaching engineering
                 mathematics.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Numerical analysis \\
                 2: Ordinary differential equations of first order \\
                 3: Ordinary differential equations of higher order \\
                 4: The Laplace transform \\
                 5: Linear algebra \\
                 6: Vector analysis \\
                 7: Partial differential equations of mathematical
                 physics \\
                 8: Fourier analysis and Sturm-Liouville theory \\
                 9: Boundary value problems of mathematical physics \\
                 A: Answers and Hints",
}


bibtype: article
filename: master.bib
label: Gustafson:slalom
author: John Gustafson and Diane Rover and Stephen Elbert and Michael Carter
title: SLALOM: The First Scalable Supercomputer Benchmark
journal: j-SR
volume: 3
number: 11
pages: 56--61
month: nov
monthnumber: 11
year: 1990
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: John Gustafson and Diane Rover and Stephen Elbert and Michael Carter
rawtitle: {SLALOM}: The First Scalable Supercomputer Benchmark
entry:
@Article{Gustafson:slalom,
  author =       "John Gustafson and Diane Rover and Stephen Elbert and
                 Michael Carter",
  title =        "{SLALOM}: The First Scalable Supercomputer Benchmark",
  journal =      j-SR,
  volume =       "3",
  number =       "11",
  pages =        "56--61",
  month =        nov,
  year =         "1990",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: master.bib
label: Gustafson:slalom-2
author: John Gustafson and Diane Rover and Stephen Elbert and Michael Carter
title: SLALOM Update: The Race Continues
journal: j-SR
volume: 4
number: 3
pages: 56--61
month: mar
monthnumber: 3
year: 1991
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: John Gustafson and Diane Rover and Stephen Elbert and Michael Carter
rawtitle: {SLALOM} Update: The Race Continues
entry:
@Article{Gustafson:slalom-2,
  author =       "John Gustafson and Diane Rover and Stephen Elbert and
                 Michael Carter",
  title =        "{SLALOM} Update: The Race Continues",
  journal =      j-SR,
  volume =       "4",
  number =       "3",
  pages =        "56--61",
  month =        mar,
  year =         "1991",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: master.bib
label: Gustafson:slalom-3
author: John Gustafson and Diane Rover and Stephen Elbert and Michael Carter
title: SLALOM: Is Your Computer on the List? If not, we'd like it to be
journal: j-SR
volume: 4
number: 7
pages: 52--59
month: jul
monthnumber: 7
year: 1991
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: John Gustafson and Diane Rover and Stephen Elbert and Michael Carter
rawtitle: {SLALOM}: Is Your Computer on the List? {If} not, we'd like it to be
entry:
@Article{Gustafson:slalom-3,
  author =       "John Gustafson and Diane Rover and Stephen Elbert and
                 Michael Carter",
  title =        "{SLALOM}: Is Your Computer on the List? {If} not, we'd
                 like it to be",
  journal =      j-SR,
  volume =       "4",
  number =       "7",
  pages =        "52--59",
  month =        jul,
  year =         "1991",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: master.bib
label: Gustafson:slalom-4
author: John Gustafson and Diane Rover and Stephen Elbert and Michael Carter
title: SLALOM: Surviving Adolescence
journal: j-SR
volume: 4
number: 12
pages: 54--57
month: dec
monthnumber: 12
year: 1991
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: John Gustafson and Diane Rover and Stephen Elbert and Michael Carter
rawtitle: {SLALOM}: Surviving Adolescence
entry:
@Article{Gustafson:slalom-4,
  author =       "John Gustafson and Diane Rover and Stephen Elbert and
                 Michael Carter",
  title =        "{SLALOM}: Surviving Adolescence",
  journal =      j-SR,
  volume =       "4",
  number =       "12",
  pages =        "54--57",
  month =        dec,
  year =         "1991",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Gustavii:2012:HPS
author: Bjorn Gustavii
title: How to Prepare a Scientific Doctoral Dissertation Based on Research Articles
publisher: pub-CAMBRIDGE
address: pub-CAMBRIDGE:adr
pages: ix + 93
year: 2012
LCCN: LB2369 .G87 2012
bibdate: Sat Dec 12 12:17:36 MST 2020
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2020.12.12 12:17:36 MST
acknowledgement: ack-nhfb
authordates: 1932--
rawauthor: Bj{\"o}rn Gustavii
rawtitle: How to Prepare a Scientific Doctoral Dissertation Based on Research Articles
ISBN:
1-107-25510-4, 1-107-30709-0, 1-107-30929-8, 1-107-31484-4, 1-107-66904-9, 1-139-15125-8 OR 1107255104, 1107307090, 1107309298, 1107314844, 1107669049, 1139151258

ISBN13:
978-1-107-25510-4, 978-1-107-30709-4, 978-1-107-30929-6, 978-1-107-31484-9, 978-1-107-66904-8, 978-1-139-15125-2 OR 9781107255104, 9781107307094, 9781107309296, 9781107314849, 9781107669048, 9781139151252

abstract:
The article-based thesis is becoming increasingly common, especially in the `hard' sciences such as biology, medicine and technology, and is beginning to replace the traditional monograph. Format guidelines vary among universities. This is the first book to summarise the main features, showing the PhD student how to prepare a thesis in such a format. The suggestions are highly practical; both its good and bad examples from published theses support the author's wise advice on all aspects of such theses. Poor figures are not only scrutinised in detail but also redrawn for comparison. Guidance also covers the issues of reprint permissions and copyright. This informative and accessible book, from the author of booktitle How to Write and Illustrate a Scientific Paper, has been developed through the author's extensive teaching experience in scientific writing and also his experience as a journal editor. It is therefore an indispensable guide to article-based thesis success.

TOC:
Preface 1. Introduction 2. Compilation 3. Front cover illustration 4. Title 5. Abstract 6. Quotations 7. Thesis at a glance 8. Abbreviations 9. List of publications 10. Contributors 11. Popularized summary 12. Acknowledgements 13. General introduction 14. Aims 15. Methods 16. Results 17. General discussion 18. Copyright 19. A dissertation worth considering Appendix Index

rawabstract:
The article-based thesis is becoming increasingly common, especially in the `hard' sciences such as biology, medicine and technology, and is beginning to replace the traditional monograph. Format guidelines vary among universities. This is the first book to summarise the main features, showing the PhD student how to prepare a thesis in such a format. The suggestions are highly practical; both its good and bad examples from published theses support the author's wise advice on all aspects of such theses. Poor figures are not only scrutinised in detail but also redrawn for comparison. Guidance also covers the issues of reprint permissions and copyright. This informative and accessible book, from the author of \booktitle{How to Write and Illustrate a Scientific Paper}, has been developed through the author's extensive teaching experience in scientific writing and also his experience as a journal editor. It is therefore an indispensable guide to article-based thesis success.

rawTOC:
Preface \\ 1. Introduction \\ 2. Compilation \\ 3. Front cover illustration \\ 4. Title \\ 5. Abstract \\ 6. Quotations \\ 7. Thesis at a glance \\ 8. Abbreviations \\ 9. List of publications \\ 10. Contributors \\ 11. Popularized summary \\ 12. Acknowledgements \\ 13. General introduction \\ 14. Aims \\ 15. Methods \\ 16. Results \\ 17. General discussion \\ 18. Copyright \\ 19. A dissertation worth considering \\ Appendix \\ Index

entry:
@Book{Gustavii:2012:HPS,
  author =       "Bj{\"o}rn Gustavii",
  title =        "How to Prepare a Scientific Doctoral Dissertation
                 Based on Research Articles",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "ix + 93",
  year =         "2012",
  ISBN =         "1-107-25510-4, 1-107-30709-0, 1-107-30929-8,
                 1-107-31484-4, 1-107-66904-9, 1-139-15125-8",
  ISBN-13 =      "978-1-107-25510-4, 978-1-107-30709-4,
                 978-1-107-30929-6, 978-1-107-31484-9,
                 978-1-107-66904-8, 978-1-139-15125-2",
  LCCN =         "LB2369 .G87 2012",
  bibdate =      "Sat Dec 12 12:17:36 MST 2020",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "The article-based thesis is becoming increasingly
                 common, especially in the `hard' sciences such as
                 biology, medicine and technology, and is beginning to
                 replace the traditional monograph. Format guidelines
                 vary among universities. This is the first book to
                 summarise the main features, showing the PhD student
                 how to prepare a thesis in such a format. The
                 suggestions are highly practical; both its good and bad
                 examples from published theses support the author's
                 wise advice on all aspects of such theses. Poor figures
                 are not only scrutinised in detail but also redrawn for
                 comparison. Guidance also covers the issues of reprint
                 permissions and copyright. This informative and
                 accessible book, from the author of \booktitle{How to
                 Write and Illustrate a Scientific Paper}, has been
                 developed through the author's extensive teaching
                 experience in scientific writing and also his
                 experience as a journal editor. It is therefore an
                 indispensable guide to article-based thesis success.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  author-dates = "1932--",
  tableofcontents = "Preface \\
                 1. Introduction \\
                 2. Compilation \\
                 3. Front cover illustration \\
                 4. Title \\
                 5. Abstract \\
                 6. Quotations \\
                 7. Thesis at a glance \\
                 8. Abbreviations \\
                 9. List of publications \\
                 10. Contributors \\
                 11. Popularized summary \\
                 12. Acknowledgements \\
                 13. General introduction \\
                 14. Aims \\
                 15. Methods \\
                 16. Results \\
                 17. General discussion \\
                 18. Copyright \\
                 19. A dissertation worth considering \\
                 Appendix \\
                 Index",
}


bibtype: book
filename: master.bib
label: Gustavii:2017:HWI
author: Bjorn Gustavii
title: How to Write and Illustrate a Scientific Paper
publisher: pub-CAMBRIDGE
address: pub-CAMBRIDGE:adr
pages: xiii + 225
year: 2017
DOI: https://doi.org/10.1017/9781316650431
ISBN: 1-316-60791-7 OR 1316607917
ISBN13: 978-1-316-60791-6 OR 9781316607916
LCCN: T11 .G86 2017
bibdate: Sat Dec 12 12:12:10 2020
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2020.12.12 12:12:10 ???
acknowledgement: ack-nhfb
rawauthor: Bj{\"o}rn Gustavii
rawtitle: How to Write and Illustrate a Scientific Paper
abstract:
This compact and easy-to-read book contains essential advice on how to take a manuscript from planning right through to publication. It will help both first-time writers and more experienced authors to present their results more effectively. While retaining the easy-to-read and well-structured approach of previous editions, the third edition of this essential guide has been expanded to include comprehensive advice on drawing graphs, and information about Open Access publishing. Illustrations are discussed in detail, with examples of poor illustrations taken from real papers in top-ranked journals, redrawn for comparison. Such before-and-after examples are also provided to demonstrate good and bad writing styles. The reader is offered practical advice --- from how to present a paper and where to submit the manuscript, through to responding to reviewers' comments and correcting the proofs --- all developed through the author's extensive teaching experience and his many years spent working as a journal editor.

TOC:
Basic rules of writing Comments on scientific language Drafting the manuscript Choosing a journal How to begin Figure captions (legends) Preparing a graph Graph combination Drawings How to design tables Title Authors Abstract Introduction Methods Results Discussion Acknowledgments References Ph.D. and other doctoral theses Letters and case reports Numbers Abbreviations How to present statistical results Typing Dealing with editors and referees Correcting proofs Authors' responsibilities Literature needed on your desk Further reading

rawabstract:
This compact and easy-to-read book contains essential advice on how to take a manuscript from planning right through to publication. It will help both first-time writers and more experienced authors to present their results more effectively. While retaining the easy-to-read and well-structured approach of previous editions, the third edition of this essential guide has been expanded to include comprehensive advice on drawing graphs, and information about Open Access publishing. Illustrations are discussed in detail, with examples of poor illustrations taken from real papers in top-ranked journals, redrawn for comparison. Such before-and-after examples are also provided to demonstrate good and bad writing styles. The reader is offered practical advice --- from how to present a paper and where to submit the manuscript, through to responding to reviewers' comments and correcting the proofs --- all developed through the author's extensive teaching experience and his many years spent working as a journal editor.

rawTOC:
Basic rules of writing \\ Comments on scientific language \\ Drafting the manuscript \\ Choosing a journal \\ How to begin \\ Figure captions (legends) \\ Preparing a graph \\ Graph combination \\ Drawings \\ How to design tables \\ Title \\ Authors \\ Abstract \\ Introduction \\ Methods \\ Results \\ Discussion \\ Acknowledgments \\ References \\ Ph.D. and other doctoral theses \\ Letters and case reports \\ Numbers \\ Abbreviations \\ How to present statistical results \\ Typing \\ Dealing with editors and referees \\ Correcting proofs \\ Authors' responsibilities \\ Literature needed on your desk \\ Further reading

entry:
@Book{Gustavii:2017:HWI,
  author =       "Bj{\"o}rn Gustavii",
  title =        "How to Write and Illustrate a Scientific Paper",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xiii + 225",
  year =         "2017",
  DOI =          "https://doi.org/10.1017/9781316650431",
  ISBN =         "1-316-60791-7",
  ISBN-13 =      "978-1-316-60791-6",
  LCCN =         "T11 .G86 2017",
  bibdate =      "Sat Dec 12 12:12:10 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "This compact and easy-to-read book contains essential
                 advice on how to take a manuscript from planning right
                 through to publication. It will help both first-time
                 writers and more experienced authors to present their
                 results more effectively. While retaining the
                 easy-to-read and well-structured approach of previous
                 editions, the third edition of this essential guide has
                 been expanded to include comprehensive advice on
                 drawing graphs, and information about Open Access
                 publishing. Illustrations are discussed in detail, with
                 examples of poor illustrations taken from real papers
                 in top-ranked journals, redrawn for comparison. Such
                 before-and-after examples are also provided to
                 demonstrate good and bad writing styles. The reader is
                 offered practical advice --- from how to present a
                 paper and where to submit the manuscript, through to
                 responding to reviewers' comments and correcting the
                 proofs --- all developed through the author's extensive
                 teaching experience and his many years spent working as
                 a journal editor.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "Basic rules of writing \\
                 Comments on scientific language \\
                 Drafting the manuscript \\
                 Choosing a journal \\
                 How to begin \\
                 Figure captions (legends) \\
                 Preparing a graph \\
                 Graph combination \\
                 Drawings \\
                 How to design tables \\
                 Title \\
                 Authors \\
                 Abstract \\
                 Introduction \\
                 Methods \\
                 Results \\
                 Discussion \\
                 Acknowledgments \\
                 References \\
                 Ph.D. and other doctoral theses \\
                 Letters and case reports \\
                 Numbers \\
                 Abbreviations \\
                 How to present statistical results \\
                 Typing \\
                 Dealing with editors and referees \\
                 Correcting proofs \\
                 Authors' responsibilities \\
                 Literature needed on your desk \\
                 Further reading",
}


bibtype: book
filename: master.bib
label: Guthery:2011:MMH
author: Scott B. Guthery
title: A motif of mathematics: history and application of the mediant and the Farey sequence
publisher: Docent Press
address: Boston, MA, USA
pages: xx + 243
year: 2011
ISBN: 1-4538-1057-9 (paperback) OR 1453810579 (paperback)
ISBN13: 978-1-4538-1057-6 (paperback) OR 9781453810576 (paperback)
LCCN: QA241 .G864 2011
bibdate: Mon Jan 22 14:57:08 MST 2018
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2018.01.22 14:57:08 MST
subject: Series, Farey; Continued fractions; Number theory
acknowledgement: ack-nhfb
rawauthor: Scott B. Guthery
rawtitle: A motif of mathematics: history and application of the mediant and the {Farey} sequence
TOC:
List of Figures / xv List of Tables / xix 1. The Mediant / 1 1.1. Non-Arithemetised Mathematics / 1 1.2. Ratio, Proportion and Fraction / 3 1.3. Definition of the Mediant / 5 1.4. A Sequence of Vulgar Fractions / 7 1.5. Nicolas Chuquet and the Regie des Nombres Moyens / 14 1.6. Rational Approximation / 16 1.7. The Mediant and the Continued Fraction / 19 1.8. John Wallis, Savilian Chair of Geometry / 22 1.9. Digit Generation / 23 1.10. The Mobius Transformation / 24 1.11. Mediant Convergents / 25 1.12. The Simpson Paradox / 32 1.13. A Motif of Mathematics / 35 2. History of the Farey Sequence / 39 2.1. Mr. R. Flitcon and Question 281 / 39 2.2. Charles Haros, Geometre / 44 2.3. ``Tables pour evaluer une fraction ordinaire ldots `` / 45 2.4. ``Tables for evaluating a common fraction ldots `` / 49 2.5. The Farey Sequence as the Argument of a Mathematical Table / 56 2.6. ``Instruction abregee sur les nouvelles mesures ldots `` / 58 2.7. Computing Logarithms / 61 2.8. General Purpose Root Finder / 64 2.9. Haros' Publications / 65 2.10. The Bureau du Cadastre / 69 2.11. Grandes Tables du Cadastre / 76 2.12. Sources of Inspiration / 77 2.13. Bookends on the Era of Organized Scientific Computation / 79 2.14. Henry Goodwyn, Brewer and Table Maker / 80 2.15. The Dispersal of Goodwyn's Archive / 84 2.16. Goodwyn's Publications / 88 2.17. ``On the Quotient arising from the Division of an Unit `` / 88 2.18. Goodwyn and the Mediant Property / 90 2.19. Decimalization of the Pound Sterling / 95 2.20. John Farey, Geologist and Musicologist / 98 2.21. ``On a Curious Property of Vulgar Fractions'' / 98 2.22. ``Proof of a Curious Theorem Regarding Numbers'' / 102 2.23. Delambre and Tilloch Weigh In / 105 2.24. Farey's Publications / 108 2.25. History's Grudge Against John Farey, Sr. / 112 3. The Table Makers / 115 3.1. Archibald's Mathematical Table Makers / 120 3.2. Lehmer's Guide to the Tables in the Theory of Numbers / 122 3.3. Tables of Tables / 124 3.4. Neville's Tables / 128 3.5. The Farey Series of Order 1025 / 129 3.6. Reviews of The Farey Series of Order 1025 / 133 3.7. Solving Diophantine Equations / 135 3.8. Rectangular--Polar Conversion Tables / 137 3.9. Reviews of Rectangular--Polar Conversion Tables / 141 3.10. Moritz Stern and Achille Brocot / 144 3.11. Gears and Rational Approximation / 146 4. Inventions and Applications / 151 4.1. Sampling Algorithm / 153 4.2. Dithering Algorithm / 155 4.3. Decimal-to-Fraction Conversion / 158 4.4. Analog-to-Digital Conversion / 158 4.5. Slash Arithmetic and Mediant Rounding / 160 4.6. Patterns for Weaving / 165 4.7. Networks of Resistors / 169 5. The Mediant and the Riemann Hypothesis / 173 5.1. Jerome Franel, Chair for Mathematics in the French Language / 175 5.2. ``The Farey Series and the Prime Numbers Problem'' / 177 5.3. A Synopsis of Franel's Proof / 182 5.4. ``Remarks Concerning the Earlier Paper by Mr. Franel'' / 186 5.5. Neville's Search for Structure / 191 5.6. Capturing Regularization / 195 6. Explorations and Peregrinations / 201 6.1. The Integer Part Function / 201 6.2. Mediant Factorization / 206 6.3. The Mayer--Erdos Constant / 207 6.4. Ocagne's Recursion / 210 6.5. Primes and Twin Primes / 212 6.6. The Fractional Part Function / 214 6.7. Final Words / 220 Appendix A. Landau's Proof of Franel's Two-Dimensional Integral / 221 Appendix B. ``Some Consequences of the Riemann Hypothesis'' / 223 Bibliography / 227 Index / 241

rawTOC:
List of Figures / xv \\ List of Tables / xix \\ 1. The Mediant / 1 \\ 1.1. Non-Arithemetised Mathematics / 1 \\ 1.2. Ratio, Proportion and Fraction / 3 \\ 1.3. Definition of the Mediant / 5 \\ 1.4. A Sequence of Vulgar Fractions / 7 \\ 1.5. Nicolas Chuquet and the Regie des Nombres Moyens / 14 \\ 1.6. Rational Approximation / 16 \\ 1.7. The Mediant and the Continued Fraction / 19 \\ 1.8. John Wallis, Savilian Chair of Geometry / 22 \\ 1.9. Digit Generation / 23 \\ 1.10. The Mobius Transformation / 24 \\ 1.11. Mediant Convergents / 25 \\ 1.12. The Simpson Paradox / 32 \\ 1.13. A Motif of Mathematics / 35 \\ 2. History of the Farey Sequence / 39 \\ 2.1. Mr. R. Flitcon and Question 281 / 39 \\ 2.2. Charles Haros, Geometre / 44 \\ 2.3. ``Tables pour evaluer une fraction ordinaire \ldots{} `` / 45 \\ 2.4. ``Tables for evaluating a common fraction \ldots{} `` / 49 \\ 2.5. The Farey Sequence as the Argument of a Mathematical Table / 56 \\ 2.6. ``Instruction abregee sur les nouvelles mesures \ldots{} `` / 58 \\ 2.7. Computing Logarithms / 61 \\ 2.8. General Purpose Root Finder / 64 \\ 2.9. Haros' Publications / 65 \\ 2.10. The Bureau du Cadastre / 69 \\ 2.11. Grandes Tables du Cadastre / 76 \\ 2.12. Sources of Inspiration / 77 \\ 2.13. Bookends on the Era of Organized Scientific Computation / 79 \\ 2.14. Henry Goodwyn, Brewer and Table Maker / 80 \\ 2.15. The Dispersal of Goodwyn's Archive / 84 \\ 2.16. Goodwyn's Publications / 88 \\ 2.17. ``On the Quotient arising from the Division of an Unit `` / 88 \\ 2.18. Goodwyn and the Mediant Property / 90 \\ 2.19. Decimalization of the Pound Sterling / 95 \\ 2.20. John Farey, Geologist and Musicologist / 98 \\ 2.21. ``On a Curious Property of Vulgar Fractions'' / 98 \\ 2.22. ``Proof of a Curious Theorem Regarding Numbers'' / 102 \\ 2.23. Delambre and Tilloch Weigh In / 105 \\ 2.24. Farey's Publications / 108 \\ 2.25. History's Grudge Against John Farey, Sr. / 112 \\ 3. The Table Makers / 115 \\ 3.1. Archibald's Mathematical Table Makers / 120 \\ 3.2. Lehmer's Guide to the Tables in the Theory of Numbers / 122 \\ 3.3. Tables of Tables / 124 \\ 3.4. Neville's Tables / 128 \\ 3.5. The Farey Series of Order 1025 / 129 \\ 3.6. Reviews of The Farey Series of Order 1025 / 133 \\ 3.7. Solving Diophantine Equations / 135 \\ 3.8. Rectangular--Polar Conversion Tables / 137 \\ 3.9. Reviews of Rectangular--Polar Conversion Tables / 141 \\ 3.10. Moritz Stern and Achille Brocot / 144 \\ 3.11. Gears and Rational Approximation / 146 \\ 4. Inventions and Applications / 151 \\ 4.1. Sampling Algorithm / 153 \\ 4.2. Dithering Algorithm / 155 \\ 4.3. Decimal-to-Fraction Conversion / 158 \\ 4.4. Analog-to-Digital Conversion / 158 \\ 4.5. Slash Arithmetic and Mediant Rounding / 160 \\ 4.6. Patterns for Weaving / 165 \\ 4.7. Networks of Resistors / 169 \\ 5. The Mediant and the Riemann Hypothesis / 173 \\ 5.1. Jerome Franel, Chair for Mathematics in the French Language / 175 \\ 5.2. ``The Farey Series and the Prime Numbers Problem'' / 177 \\ 5.3. A Synopsis of Franel's Proof / 182 \\ 5.4. ``Remarks Concerning the Earlier Paper by Mr. Franel'' / 186 \\ 5.5. Neville's Search for Structure / 191 \\ 5.6. Capturing Regularization / 195 \\ 6. Explorations and Peregrinations / 201 \\ 6.1. The Integer Part Function / 201 \\ 6.2. Mediant Factorization / 206 \\ 6.3. The Mayer--Erd{\H{o}}s Constant / 207 \\ 6.4. Ocagne's Recursion / 210 \\ 6.5. Primes and Twin Primes / 212 \\ 6.6. The Fractional Part Function / 214 \\ 6.7. Final Words / 220 \\ Appendix A. Landau's Proof of Franel's Two-Dimensional Integral / 221 \\ Appendix B. ``Some Consequences of the Riemann Hypothesis'' / 223 \\ Bibliography / 227 \\ Index / 241

entry:
@Book{Guthery:2011:MMH,
  author =       "Scott B. Guthery",
  title =        "A motif of mathematics: history and application of the
                 mediant and the {Farey} sequence",
  publisher =    "Docent Press",
  address =      "Boston, MA, USA",
  pages =        "xx + 243",
  year =         "2011",
  ISBN =         "1-4538-1057-9 (paperback)",
  ISBN-13 =      "978-1-4538-1057-6 (paperback)",
  LCCN =         "QA241 .G864 2011",
  bibdate =      "Mon Jan 22 14:57:08 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Series, Farey; Continued fractions; Number theory",
  tableofcontents = "List of Figures / xv \\
                 List of Tables / xix \\
                 1. The Mediant / 1 \\
                 1.1. Non-Arithemetised Mathematics / 1 \\
                 1.2. Ratio, Proportion and Fraction / 3 \\
                 1.3. Definition of the Mediant / 5 \\
                 1.4. A Sequence of Vulgar Fractions / 7 \\
                 1.5. Nicolas Chuquet and the Regie des Nombres Moyens /
                 14 \\
                 1.6. Rational Approximation / 16 \\
                 1.7. The Mediant and the Continued Fraction / 19 \\
                 1.8. John Wallis, Savilian Chair of Geometry / 22 \\
                 1.9. Digit Generation / 23 \\
                 1.10. The Mobius Transformation / 24 \\
                 1.11. Mediant Convergents / 25 \\
                 1.12. The Simpson Paradox / 32 \\
                 1.13. A Motif of Mathematics / 35 \\
                 2. History of the Farey Sequence / 39 \\
                 2.1. Mr. R. Flitcon and Question 281 / 39 \\
                 2.2. Charles Haros, Geometre / 44 \\
                 2.3. ``Tables pour evaluer une fraction ordinaire
                 \ldots{} `` / 45 \\
                 2.4. ``Tables for evaluating a common fraction \ldots{}
                 `` / 49 \\
                 2.5. The Farey Sequence as the Argument of a
                 Mathematical Table / 56 \\
                 2.6. ``Instruction abregee sur les nouvelles mesures
                 \ldots{} `` / 58 \\
                 2.7. Computing Logarithms / 61 \\
                 2.8. General Purpose Root Finder / 64 \\
                 2.9. Haros' Publications / 65 \\
                 2.10. The Bureau du Cadastre / 69 \\
                 2.11. Grandes Tables du Cadastre / 76 \\
                 2.12. Sources of Inspiration / 77 \\
                 2.13. Bookends on the Era of Organized Scientific
                 Computation / 79 \\
                 2.14. Henry Goodwyn, Brewer and Table Maker / 80 \\
                 2.15. The Dispersal of Goodwyn's Archive / 84 \\
                 2.16. Goodwyn's Publications / 88 \\
                 2.17. ``On the Quotient arising from the Division of an
                 Unit `` / 88 \\
                 2.18. Goodwyn and the Mediant Property / 90 \\
                 2.19. Decimalization of the Pound Sterling / 95 \\
                 2.20. John Farey, Geologist and Musicologist / 98 \\
                 2.21. ``On a Curious Property of Vulgar Fractions'' /
                 98 \\
                 2.22. ``Proof of a Curious Theorem Regarding Numbers''
                 / 102 \\
                 2.23. Delambre and Tilloch Weigh In / 105 \\
                 2.24. Farey's Publications / 108 \\
                 2.25. History's Grudge Against John Farey, Sr. / 112
                 \\
                 3. The Table Makers / 115 \\
                 3.1. Archibald's Mathematical Table Makers / 120 \\
                 3.2. Lehmer's Guide to the Tables in the Theory of
                 Numbers / 122 \\
                 3.3. Tables of Tables / 124 \\
                 3.4. Neville's Tables / 128 \\
                 3.5. The Farey Series of Order 1025 / 129 \\
                 3.6. Reviews of The Farey Series of Order 1025 / 133
                 \\
                 3.7. Solving Diophantine Equations / 135 \\
                 3.8. Rectangular--Polar Conversion Tables / 137 \\
                 3.9. Reviews of Rectangular--Polar Conversion Tables /
                 141 \\
                 3.10. Moritz Stern and Achille Brocot / 144 \\
                 3.11. Gears and Rational Approximation / 146 \\
                 4. Inventions and Applications / 151 \\
                 4.1. Sampling Algorithm / 153 \\
                 4.2. Dithering Algorithm / 155 \\
                 4.3. Decimal-to-Fraction Conversion / 158 \\
                 4.4. Analog-to-Digital Conversion / 158 \\
                 4.5. Slash Arithmetic and Mediant Rounding / 160 \\
                 4.6. Patterns for Weaving / 165 \\
                 4.7. Networks of Resistors / 169 \\
                 5. The Mediant and the Riemann Hypothesis / 173 \\
                 5.1. Jerome Franel, Chair for Mathematics in the French
                 Language / 175 \\
                 5.2. ``The Farey Series and the Prime Numbers Problem''
                 / 177 \\
                 5.3. A Synopsis of Franel's Proof / 182 \\
                 5.4. ``Remarks Concerning the Earlier Paper by Mr.
                 Franel'' / 186 \\
                 5.5. Neville's Search for Structure / 191 \\
                 5.6. Capturing Regularization / 195 \\
                 6. Explorations and Peregrinations / 201 \\
                 6.1. The Integer Part Function / 201 \\
                 6.2. Mediant Factorization / 206 \\
                 6.3. The Mayer--Erd{\H{o}}s Constant / 207 \\
                 6.4. Ocagne's Recursion / 210 \\
                 6.5. Primes and Twin Primes / 212 \\
                 6.6. The Fractional Part Function / 214 \\
                 6.7. Final Words / 220 \\
                 Appendix A. Landau's Proof of Franel's Two-Dimensional
                 Integral / 221 \\
                 Appendix B. ``Some Consequences of the Riemann
                 Hypothesis'' / 223 \\
                 Bibliography / 227 \\
                 Index / 241",
}


bibtype: book
filename: master.bib
label: Guthery:2012:BRC
author: Scott B. Guthery
title: Bibliography of Raymond Clare Archibald
publisher: Docent Press
address: Boston, MA, USA
pages: xv + 52
year: 2012
ISBN: 0-9837004-2-7 OR 0983700427
ISBN13: 978-0-9837004-2-5 OR 9780983700425
LCCN: QA36 .G88 2012
bibdate: Mon Jan 22 15:08:09 MST 2018
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2018.01.22 15:08:09 MST
subject: Archibald, Raymond Clare; Bibliography; Mathematics
acknowledgement: ack-nhfb
subjectdates: 1875--1955
rawauthor: Scott B. Guthery
rawtitle: Bibliography of {Raymond Clare Archibald}
entry:
@Book{Guthery:2012:BRC,
  author =       "Scott B. Guthery",
  title =        "Bibliography of {Raymond Clare Archibald}",
  publisher =    "Docent Press",
  address =      "Boston, MA, USA",
  pages =        "xv + 52",
  year =         "2012",
  ISBN =         "0-9837004-2-7",
  ISBN-13 =      "978-0-9837004-2-5",
  LCCN =         "QA36 .G88 2012",
  bibdate =      "Mon Jan 22 15:08:09 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Archibald, Raymond Clare; Bibliography; Mathematics",
  subject-dates = "1875--1955",
}


bibtype: book
filename: master.bib
label: Gutmann:2004:CSA
author: Peter Gutmann
title: Cryptographic Security Architecture: Design and Verification
publisher: pub-SV
address: pub-SV:adr
pages: xviii + 320
year: 2004
ISBN: 0-387-95387-6 OR 0387953876
ISBN13: 978-0-387-95387-8 OR 9780387953878
LCCN: QA76.9.A25 G88 2002
bibdate: Mon Oct 20 17:55:18 2003
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; http://www.springer-ny.com/
bibtimestamp: 2003.10.20 17:55:18 ???
acknowledgement: ack-nhfb
rawauthor: Peter Gutmann
rawtitle: Cryptographic Security Architecture: Design and Verification
abstract:
A cryptographic security architecture is the collection of hardware and software that protects and controls the use of encryption keys and similar cryptovariables. It is the foundation for enforcing computer security policies and controls and preempting system misuse. This book provides a comprehensive design for a portable, flexible high-security cryptographic architecture, with particular emphasis on incorporating rigorous security models and practices. booktitle Cryptographic Security Architecture unveils an alternative means of building a trustworthy system based on concepts from established software engineering principles and cognitive psychology. Its novel security-kernel design implements a reference monitor that controls access to security-relevant objects and attributes based on a configurable security policy. Topics and features: Builds a concise architectural design that can be easily extended in the future Develops an application-specific security kernel that enforces a fully customizable, rule-based security policy Presents a new verification technique that allows verification from the high-level specification down to the running code Describes effective security assurance in random number generation, and the pitfalls associated therewith Examines the generation and protection of cryptovariables, as well as application of the architectural design to cryptographic hardware The work provides an in-depth presentation of a flexible, platform-independent cryptographic security architecture suited to software, hardware, and hybrid implementations. Security design practitioners, professionals, researchers, and advanced students will find the work an essential resource.

TOC:
Cover Contents Preface Overview and Goals Organisation and Features Intended Audience Acknowledgements 1 The Software Architecture 1.1 Introduction 1.2 An Introduction to Software Architecture 1.3 Architecture Design Goals 1.4 The Object Model 1.5 Object Internals 1.6 Interobject Communications 1.7 The Message Dispatcher 1.8 Object Reuse 1.9 Object Management Message Flow 1.10 Other Kernel Mechanisms 1.11 References 2 The Security Architecture 2.1 Security Features of the Architecture 2.2 Introduction to Security Mechanisms 2.3 The cryptlib Security Kernel 2.4 The Object Life Cycle 2.5 Object Access Control 2.6 Object Usage Control 2.7 Protecting Objects Outside the Architecture 2.8 Object Attribute security 2.9 References 3 The Kernel Implementation 3.1 Kernel Message Processing 3.2 Filter Rule Structure 3.3 Attribute ACL Structure 3.4 Mechanism ACL Structure 3.5 Message Filter Implementation 3.6 Customising the Rule-Based Policy 3.7 Miscellaneous Implementation Issues 3.8 Performance 3.9 References 4 Verification Techniques 4.1 Introduction 4.2 Formal Security Verification 4.3 Problems with Formal Verification 4.4 Problems with other Software Engineering Methods 4.5 Alternative Approaches 4.6 References 5 Verification of the cryptlib Kernel 5.1 An Analytical Approach to Verification Methods 5.2 Making the Specification and Implementation Comprehensible 5.3 Verification All the Way Down 5.4 The Verification Process 5.5 Conclusion 5.6 References 6 Random Number Generation 6.1 Introduction 6.2 Requirements and Limitations of the Generator 6.3 Existing Generator Designs and Problems 6.4 The cryptlib Generator 6.5 The Entropy Accumulator 6.6 Randomness-Polling Results 6.7 Extensions to the Basic Polling Model 6.8 Protecting the Randomness Pool 6.9 Conclusion 6.10 References 7 Hardware Encryption Modules 7.1 Problems with Crypto on End-User Systems 7.2 The Coprocessor 7.3 Crypto Functionality Implementation 7.4 Extended Security Functionality 7.5 Conclusion 7.6 References 8 Conclusion 8.1 Conclusion 8.2 Future Research 9 Glossary Index

rawabstract:
A cryptographic security architecture is the collection of hardware and software that protects and controls the use of encryption keys and similar cryptovariables. It is the foundation for enforcing computer security policies and controls and preempting system misuse. This book provides a comprehensive design for a portable, flexible high-security cryptographic architecture, with particular emphasis on incorporating rigorous security models and practices. \booktitle{Cryptographic Security Architecture} unveils an alternative means of building a trustworthy system based on concepts from established software engineering principles and cognitive psychology. Its novel security-kernel design implements a reference monitor that controls access to security-relevant objects and attributes based on a configurable security policy. Topics and features: Builds a concise architectural design that can be easily extended in the future Develops an application-specific security kernel that enforces a fully customizable, rule-based security policy Presents a new verification technique that allows verification from the high-level specification down to the running code Describes effective security assurance in random number generation, and the pitfalls associated therewith Examines the generation and protection of cryptovariables, as well as application of the architectural design to cryptographic hardware The work provides an in-depth presentation of a flexible, platform-independent cryptographic security architecture suited to software, hardware, and hybrid implementations. Security design practitioners, professionals, researchers, and advanced students will find the work an essential resource.

rawTOC:
Cover \\ Contents \\ Preface \\ Overview and Goals \\ Organisation and Features \\ Intended Audience \\ Acknowledgements \\ 1 The Software Architecture \\ 1.1 Introduction \\ 1.2 An Introduction to Software Architecture \\ 1.3 Architecture Design Goals \\ 1.4 The Object Model \\ 1.5 Object Internals \\ 1.6 Interobject Communications \\ 1.7 The Message Dispatcher \\ 1.8 Object Reuse \\ 1.9 Object Management Message Flow \\ 1.10 Other Kernel Mechanisms \\ 1.11 References \\ 2 The Security Architecture \\ 2.1 Security Features of the Architecture \\ 2.2 Introduction to Security Mechanisms \\ 2.3 The cryptlib Security Kernel \\ 2.4 The Object Life Cycle \\ 2.5 Object Access Control \\ 2.6 Object Usage Control \\ 2.7 Protecting Objects Outside the Architecture \\ 2.8 Object Attribute security \\ 2.9 References \\ 3 The Kernel Implementation \\ 3.1 Kernel Message Processing \\ 3.2 Filter Rule Structure \\ 3.3 Attribute ACL Structure \\ 3.4 Mechanism ACL Structure \\ 3.5 Message Filter Implementation \\ 3.6 Customising the Rule-Based Policy \\ 3.7 Miscellaneous Implementation Issues \\ 3.8 Performance \\ 3.9 References \\ 4 Verification Techniques \\ 4.1 Introduction \\ 4.2 Formal Security Verification \\ 4.3 Problems with Formal Verification \\ 4.4 Problems with other Software Engineering Methods \\ 4.5 Alternative Approaches \\ 4.6 References \\ 5 Verification of the cryptlib Kernel \\ 5.1 An Analytical Approach to Verification Methods \\ 5.2 Making the Specification and Implementation Comprehensible \\ 5.3 Verification All the Way Down \\ 5.4 The Verification Process \\ 5.5 Conclusion \\ 5.6 References \\ 6 Random Number Generation \\ 6.1 Introduction \\ 6.2 Requirements and Limitations of the Generator \\ 6.3 Existing Generator Designs and Problems \\ 6.4 The cryptlib Generator \\ 6.5 The Entropy Accumulator \\ 6.6 Randomness-Polling Results \\ 6.7 Extensions to the Basic Polling Model \\ 6.8 Protecting the Randomness Pool \\ 6.9 Conclusion \\ 6.10 References \\ 7 Hardware Encryption Modules \\ 7.1 Problems with Crypto on End-User Systems \\ 7.2 The Coprocessor \\ 7.3 Crypto Functionality Implementation \\ 7.4 Extended Security Functionality \\ 7.5 Conclusion \\ 7.6 References \\ 8 Conclusion \\ 8.1 Conclusion \\ 8.2 Future Research \\ 9 Glossary \\ Index

entry:
@Book{Gutmann:2004:CSA,
  author =       "Peter Gutmann",
  title =        "Cryptographic Security Architecture: Design and
                 Verification",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xviii + 320",
  year =         "2004",
  ISBN =         "0-387-95387-6",
  ISBN-13 =      "978-0-387-95387-8",
  LCCN =         "QA76.9.A25 G88 2002",
  bibdate =      "Mon Oct 20 17:55:18 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.springer-ny.com/",
  abstract =     "A cryptographic security architecture is the
                 collection of hardware and software that protects and
                 controls the use of encryption keys and similar
                 cryptovariables. It is the foundation for enforcing
                 computer security policies and controls and preempting
                 system misuse. This book provides a comprehensive
                 design for a portable, flexible high-security
                 cryptographic architecture, with particular emphasis on
                 incorporating rigorous security models and practices.
                 \booktitle{Cryptographic Security Architecture} unveils
                 an alternative means of building a trustworthy system
                 based on concepts from established software engineering
                 principles and cognitive psychology. Its novel
                 security-kernel design implements a reference monitor
                 that controls access to security-relevant objects and
                 attributes based on a configurable security policy.
                 Topics and features: Builds a concise architectural
                 design that can be easily extended in the future
                 Develops an application-specific security kernel that
                 enforces a fully customizable, rule-based security
                 policy Presents a new verification technique that
                 allows verification from the high-level specification
                 down to the running code Describes effective security
                 assurance in random number generation, and the pitfalls
                 associated therewith Examines the generation and
                 protection of cryptovariables, as well as application
                 of the architectural design to cryptographic hardware
                 The work provides an in-depth presentation of a
                 flexible, platform-independent cryptographic security
                 architecture suited to software, hardware, and hybrid
                 implementations. Security design practitioners,
                 professionals, researchers, and advanced students will
                 find the work an essential resource.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Cover \\
                 Contents \\
                 Preface \\
                 Overview and Goals \\
                 Organisation and Features \\
                 Intended Audience \\
                 Acknowledgements \\
                 1 The Software Architecture \\
                 1.1 Introduction \\
                 1.2 An Introduction to Software Architecture \\
                 1.3 Architecture Design Goals \\
                 1.4 The Object Model \\
                 1.5 Object Internals \\
                 1.6 Interobject Communications \\
                 1.7 The Message Dispatcher \\
                 1.8 Object Reuse \\
                 1.9 Object Management Message Flow \\
                 1.10 Other Kernel Mechanisms \\
                 1.11 References \\
                 2 The Security Architecture \\
                 2.1 Security Features of the Architecture \\
                 2.2 Introduction to Security Mechanisms \\
                 2.3 The cryptlib Security Kernel \\
                 2.4 The Object Life Cycle \\
                 2.5 Object Access Control \\
                 2.6 Object Usage Control \\
                 2.7 Protecting Objects Outside the Architecture \\
                 2.8 Object Attribute security \\
                 2.9 References \\
                 3 The Kernel Implementation \\
                 3.1 Kernel Message Processing \\
                 3.2 Filter Rule Structure \\
                 3.3 Attribute ACL Structure \\
                 3.4 Mechanism ACL Structure \\
                 3.5 Message Filter Implementation \\
                 3.6 Customising the Rule-Based Policy \\
                 3.7 Miscellaneous Implementation Issues \\
                 3.8 Performance \\
                 3.9 References \\
                 4 Verification Techniques \\
                 4.1 Introduction \\
                 4.2 Formal Security Verification \\
                 4.3 Problems with Formal Verification \\
                 4.4 Problems with other Software Engineering Methods
                 \\
                 4.5 Alternative Approaches \\
                 4.6 References \\
                 5 Verification of the cryptlib Kernel \\
                 5.1 An Analytical Approach to Verification Methods \\
                 5.2 Making the Specification and Implementation
                 Comprehensible \\
                 5.3 Verification All the Way Down \\
                 5.4 The Verification Process \\
                 5.5 Conclusion \\
                 5.6 References \\
                 6 Random Number Generation \\
                 6.1 Introduction \\
                 6.2 Requirements and Limitations of the Generator \\
                 6.3 Existing Generator Designs and Problems \\
                 6.4 The cryptlib Generator \\
                 6.5 The Entropy Accumulator \\
                 6.6 Randomness-Polling Results \\
                 6.7 Extensions to the Basic Polling Model \\
                 6.8 Protecting the Randomness Pool \\
                 6.9 Conclusion \\
                 6.10 References \\
                 7 Hardware Encryption Modules \\
                 7.1 Problems with Crypto on End-User Systems \\
                 7.2 The Coprocessor \\
                 7.3 Crypto Functionality Implementation \\
                 7.4 Extended Security Functionality \\
                 7.5 Conclusion \\
                 7.6 References \\
                 8 Conclusion \\
                 8.1 Conclusion \\
                 8.2 Future Research \\
                 9 Glossary \\
                 Index",
}


bibtype: book
filename: master.bib
label: Gutmans:2005:PPP
author: Andi Gutmans and Stig Sae ther Bakken and Derick Rethans
title: PHP 5 power programming
publisher: pub-PHPTR
address: pub-PHPTR:adr
pages: xxviii + 689
year: 2005
ISBN: 0-13-147149-X (paperback) OR 013147149X (paperback)
ISBN13: 978-0-13-147149-8 (paperback) OR 9780131471498 (paperback)
LCCN: QA76.73.P224 G88 2005
bibdate: Wed Oct 5 06:33:36 MDT 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2005.10.05 06:33:36 MDT
series: Bruce Perens' Open Source series
subject: PHP (Computer program language); Web sites; Design
acknowledgement: ack-nhfb
rawauthor: Andi Gutmans and Stig S{\ae}ther Bakken and Derick Rethans
rawtitle: {PHP 5} power programming
abstract:
PHP 5's co-creator and two leading PHP developers show you how to make the most of PHP 5's industrial-strength enhancements in any project-no matter how large or complex. Their unique insights and realistic examples illuminate PHP 5's new object model, powerful design patterns, improved XML Web services support, and much more. Whether you're creating web applications, extensions, packages, or shell scripts-or migrating PHP 4 code-here are high-powered solutions you won't find anywhere else. If you're a software developer new to PHP, you'll leap quickly into PHP and its new object-oriented capabilities. If you're an experienced PHP programmer, you already recognize PHP's convenience and simplicity. Now, discover all of its extraordinary power!.

TOC:
1: What is new in PHP 5? 2: PHP 5 basic language 3: PHP 5 OO language 4: PHP 5 advanced OOP and design patterns 5: How to write a Web application with PHP 6: Databases with PHP 5 7: Error handling 8: XML with PHP 5 9: Mainstream extensions 10: Using PEAR 11: Important PEAR packages 12: Building PEAR components 13: Making the move 14: Performance 15: An introduction to writing PHP extensions 16: PHP shell scripting A: PEAR and PECL package index B: PhpDocumentor format reference C: Zend studio quick start guide

rawabstract:
PHP 5's co-creator and two leading PHP developers show you how to make the most of PHP 5's industrial-strength enhancements in any project-no matter how large or complex. Their unique insights and realistic examples illuminate PHP 5's new object model, powerful design patterns, improved XML Web services support, and much more. Whether you're creating web applications, extensions, packages, or shell scripts-or migrating PHP 4 code-here are high-powered solutions you won't find anywhere else. If you're a software developer new to PHP, you'll leap quickly into PHP and its new object-oriented capabilities. If you're an experienced PHP programmer, you already recognize PHP's convenience and simplicity. Now, discover all of its extraordinary power!.

rawTOC:
1: What is new in PHP 5? \\ 2: PHP 5 basic language \\ 3: PHP 5 OO language \\ 4: PHP 5 advanced OOP and design patterns \\ 5: How to write a Web application with PHP \\ 6: Databases with PHP 5 \\ 7: Error handling \\ 8: XML with PHP 5 \\ 9: Mainstream extensions \\ 10: Using PEAR \\ 11: Important PEAR packages \\ 12: Building PEAR components \\ 13: Making the move \\ 14: Performance \\ 15: An introduction to writing PHP extensions \\ 16: PHP shell scripting \\ A: PEAR and PECL package index \\ B: PhpDocumentor format reference \\ C: Zend studio quick start guide

entry:
@Book{Gutmans:2005:PPP,
  author =       "Andi Gutmans and Stig S{\ae}ther Bakken and Derick
                 Rethans",
  title =        "{PHP 5} power programming",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  pages =        "xxviii + 689",
  year =         "2005",
  ISBN =         "0-13-147149-X (paperback)",
  ISBN-13 =      "978-0-13-147149-8 (paperback)",
  LCCN =         "QA76.73.P224 G88 2005",
  bibdate =      "Wed Oct 5 06:33:36 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Bruce Perens' Open Source series",
  abstract =     "PHP 5's co-creator and two leading PHP developers show
                 you how to make the most of PHP 5's industrial-strength
                 enhancements in any project-no matter how large or
                 complex. Their unique insights and realistic examples
                 illuminate PHP 5's new object model, powerful design
                 patterns, improved XML Web services support, and much
                 more. Whether you're creating web applications,
                 extensions, packages, or shell scripts-or migrating PHP
                 4 code-here are high-powered solutions you won't find
                 anywhere else. If you're a software developer new to
                 PHP, you'll leap quickly into PHP and its new
                 object-oriented capabilities. If you're an experienced
                 PHP programmer, you already recognize PHP's convenience
                 and simplicity. Now, discover all of its extraordinary
                 power!.",
  acknowledgement = ack-nhfb,
  subject =      "PHP (Computer program language); Web sites; Design",
  tableofcontents = "1: What is new in PHP 5? \\
                 2: PHP 5 basic language \\
                 3: PHP 5 OO language \\
                 4: PHP 5 advanced OOP and design patterns \\
                 5: How to write a Web application with PHP \\
                 6: Databases with PHP 5 \\
                 7: Error handling \\
                 8: XML with PHP 5 \\
                 9: Mainstream extensions \\
                 10: Using PEAR \\
                 11: Important PEAR packages \\
                 12: Building PEAR components \\
                 13: Making the move \\
                 14: Performance \\
                 15: An introduction to writing PHP extensions \\
                 16: PHP shell scripting \\
                 A: PEAR and PECL package index \\
                 B: PhpDocumentor format reference \\
                 C: Zend studio quick start guide",
}


bibtype: article
filename: master.bib
label: Gwennup:1996:DMA
author: Linley Gwennup
journal: j-MICROPROC-REP
pages: 24--28
day: 18
month: nov
monthnumber: 11
year: 1996
ISSN: 0899-9341 OR 08999341
bibdate: Sat Dec 12 12:45:31 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.12.12 12:45:31 ???
acknowledgement: ack-nhfb
rawauthor: Linley Gwennup
title:
Digital, MIPS Add Multimedia Extensions: Digital Focuses on Video, MIPS on 3-D Graphics; Vendors Debate Differences

URL:
http://www.chipanalyst.com/q/@12083418zrryvm/mpr/abstracts/abs10_15.html; http://www.chipanalyst.com/q/@12083418zrryvm/mpr/mpr/ARTICLES/101505.pdf

rawtitle:
{Digital}, {MIPS} Add Multimedia Extensions: {Digital} Focuses on Video, {MIPS} on {3-D} Graphics; Vendors Debate Differences

entry:
@Article{Gwennup:1996:DMA,
  author =       "Linley Gwennup",
  title =        "{Digital}, {MIPS} Add Multimedia Extensions: {Digital}
                 Focuses on Video, {MIPS} on {3-D} Graphics; Vendors
                 Debate Differences",
  journal =      j-MICROPROC-REP,
  volume =       "??",
  number =       "??",
  pages =        "24--28",
  day =          "18",
  month =        nov,
  year =         "1996",
  ISSN =         "0899-9341",
  bibdate =      "Sat Dec 12 12:45:31 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://www.chipanalyst.com/q/@12083418zrryvm/mpr/abstracts/abs10_15.html;
                 http://www.chipanalyst.com/q/@12083418zrryvm/mpr/mpr/ARTICLES/101505.pdf",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Hafner:1996:WWS
author: Katie Hafner and Matthew Lyon
title: Where Wizards Stay Up Late: the Origins of the Internet
publisher: pub-SIMON-SCHUSTER
address: pub-SIMON-SCHUSTER:adr
pages: 304
year: 1996
LCCN: TK5105.875.I57H338 1996
bibdate: Thu May 13 08:22:15 1999
bibtimestamp: 1999.05.13 08:22:15 ???
keywords: Internet (Computer network)
acknowledgement: ack-nhfb
rawauthor: Katie Hafner and Matthew Lyon
rawtitle: Where Wizards Stay Up Late: the Origins of the {Internet}
ISBN:
0-684-81201-0 (hardcover), 0-684-83267-4 (paperback), 0-684-87216-1 (e-book), 0-7567-9221-5 (paperback) OR 0684812010 (hardcover), 0684832674 (paperback), 0684872161 (ebook), 0756792215 (paperback)

ISBN13:
978-0-684-81201-4 (hardcover), 978-0-684-83267-8 (paperback), 978-0-684-87216-2 (e-book), 978-0-7567-9221-3 (paperback) OR 9780684812014 (hardcover), 9780684832678 (paperback), 9780684872162 (ebook), 9780756792213 (paperback)

bibsource:
https://www.math.utah.edu/pub/tex/bib/internet.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
In the late 1960s, the Defense Department's Advanced Research Projects Agency funded at project to create computer communication among its university-based researchers. The experiment was inspired by J. C. R. Licklider, a brilliant scientist from MIT who saw the potential of computers as communications devices. This is the story of the small group of researchers and engineers who laid the foundation for the Internet. In 1969, Arpa awarded the contract for the most integral part of this network --- the Interface Message Processor (IMP) switch --- to Bolt Beranek and Newman, a small Cambridge, Mass., company. Out of their efforts a nationwide network called the ARPANET grew from four initial sites, eventually merging in 1990 with the Internet it had spawned.

TOC:
Fastest million dollars Block here, some stones there Third university Head down in the bits Do it to it Truett Hacking away and hollering E-Mail Rocket on our hands

rawabstract:
In the late 1960s, the Defense Department's Advanced Research Projects Agency funded at project to create computer communication among its university-based researchers. The experiment was inspired by J. C. R. Licklider, a brilliant scientist from MIT who saw the potential of computers as communications devices. This is the story of the small group of researchers and engineers who laid the foundation for the Internet. In 1969, Arpa awarded the contract for the most integral part of this network --- the Interface Message Processor (IMP) switch --- to Bolt Beranek and Newman, a small Cambridge, Mass., company. Out of their efforts a nationwide network called the ARPANET grew from four initial sites, eventually merging in 1990 with the Internet it had spawned.

rawTOC:
Fastest million dollars \\ Block here, some stones there \\ Third university \\ Head down in the bits \\ Do it to it Truett \\ Hacking away and hollering \\ E-Mail \\ Rocket on our hands

entry:
@Book{Hafner:1996:WWS,
  author =       "Katie Hafner and Matthew Lyon",
  title =        "Where Wizards Stay Up Late: the Origins of the
                 {Internet}",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "304",
  year =         "1996",
  ISBN =         "0-684-81201-0 (hardcover), 0-684-83267-4 (paperback),
                 0-684-87216-1 (e-book), 0-7567-9221-5 (paperback)",
  ISBN-13 =      "978-0-684-81201-4 (hardcover), 978-0-684-83267-8
                 (paperback), 978-0-684-87216-2 (e-book),
                 978-0-7567-9221-3 (paperback)",
  LCCN =         "TK5105.875.I57H338 1996",
  bibdate =      "Thu May 13 08:22:15 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/internet.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "In the late 1960s, the Defense Department's Advanced
                 Research Projects Agency funded at project to create
                 computer communication among its university-based
                 researchers. The experiment was inspired by J. C. R.
                 Licklider, a brilliant scientist from MIT who saw the
                 potential of computers as communications devices. This
                 is the story of the small group of researchers and
                 engineers who laid the foundation for the Internet. In
                 1969, Arpa awarded the contract for the most integral
                 part of this network --- the Interface Message
                 Processor (IMP) switch --- to Bolt Beranek and Newman,
                 a small Cambridge, Mass., company. Out of their efforts
                 a nationwide network called the ARPANET grew from four
                 initial sites, eventually merging in 1990 with the
                 Internet it had spawned.",
  acknowledgement = ack-nhfb,
  keywords =     "Internet (Computer network)",
  tableofcontents = "Fastest million dollars \\
                 Block here, some stones there \\
                 Third university \\
                 Head down in the bits \\
                 Do it to it Truett \\
                 Hacking away and hollering \\
                 E-Mail \\
                 Rocket on our hands",
}


bibtype: book
filename: master.bib
label: Hageman:1981:AIM
author: Louis A. Hageman and David M. Young
title: Applied Iterative Methods
publisher: pub-ACADEMIC
address: pub-ACADEMIC:adr
pages: xvii + 386
year: 1981
ISBN: 0-12-313340-8 OR 0123133408
ISBN13: 978-0-12-313340-3 OR 9780123133403
LCCN: QA297.8 .H34 1981
MRclass: 65F10 (65-01 65-02)
MRnumber: 83c:65064
MRreviewer: Themistocles M. Rassias
bibdate: Tue Dec 14 22:54:41 1993
bibtimestamp: 1993.12.14 22:54:41 ???
series: Computer Science and Applied Mathematics, Editor: Werner Rheinboldt
acknowledgement: ack-nhfb
rawauthor: Louis A. Hageman and David M. Young
rawtitle: Applied Iterative Methods
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/y/young-david-m.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

TOC:
Background on linear algebra and related topics Background on basic iterative methods Polynomial acceleration Chebyshev acceleration An adaptive Chebyshev procedure using special norms Adaptive Chebyshev acceleration Conjugate gradient acceleration Special methods for red/black partitionings Adaptive procedures for the successive overrelaxation method The use of iterative methods in the solution of partial differential equations Case studies The nonsymmetrizable case Chebyshev acceleration subroutine CCSI subroutine SOR subroutine

rawTOC:
Background on linear algebra and related topics \\ Background on basic iterative methods \\ Polynomial acceleration \\ Chebyshev acceleration \\ An adaptive Chebyshev procedure using special norms \\ Adaptive Chebyshev acceleration \\ Conjugate gradient acceleration \\ Special methods for red/black partitionings \\ Adaptive procedures for the successive overrelaxation method \\ The use of iterative methods in the solution of partial differential equations \\ Case studies \\ The nonsymmetrizable case \\ Chebyshev acceleration subroutine \\ CCSI subroutine \\ SOR subroutine

entry:
@Book{Hageman:1981:AIM,
  author =       "Louis A. Hageman and David M. Young",
  title =        "Applied Iterative Methods",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xvii + 386",
  year =         "1981",
  ISBN =         "0-12-313340-8",
  ISBN-13 =      "978-0-12-313340-3",
  LCCN =         "QA297.8 .H34 1981",
  MRclass =      "65F10 (65-01 65-02)",
  MRnumber =     "83c:65064",
  MRreviewer =   "Themistocles M. Rassias",
  bibdate =      "Tue Dec 14 22:54:41 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/y/young-david-m.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Computer Science and Applied Mathematics, Editor:
                 Werner Rheinboldt",
  acknowledgement = ack-nhfb,
  tableofcontents = "Background on linear algebra and related topics \\
                 Background on basic iterative methods \\
                 Polynomial acceleration \\
                 Chebyshev acceleration \\
                 An adaptive Chebyshev procedure using special norms \\
                 Adaptive Chebyshev acceleration \\
                 Conjugate gradient acceleration \\
                 Special methods for red/black partitionings \\
                 Adaptive procedures for the successive overrelaxation
                 method \\
                 The use of iterative methods in the solution of partial
                 differential equations \\
                 Case studies \\
                 The nonsymmetrizable case \\
                 Chebyshev acceleration subroutine \\
                 CCSI subroutine \\
                 SOR subroutine",
}


bibtype: book
filename: master.bib
label: Hahn:1991:LE
author: Jane Hahn
title: LaTeX for Everyone
publisher: pub-PTI
address: pub-PTI:adr
pages: xi + 346
year: 1991
ISBN: 0-9631044-0-3 OR 0963104403
ISBN13: 978-0-9631044-0-3 OR 9780963104403
LCCN: Z253.4.L38 H34 1991
bibdate: Tue Dec 14 22:54:48 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:54:48 ???
acknowledgement: ack-nhfb
rawauthor: Jane Hahn
rawtitle: {\LaTeX{}} for Everyone
TOC:
1: Introduction 2: The very beginning 3: Matters of style 4: Typesetting mathematics 5: Rows and columns 6: Customization 7: Floating objects 8: Preparing large documents A: Defining your own commands B: Customizing counters C: Style parameters D: The picture environment E: Errors F: Examples G: Making slides with SliTEX

rawTOC:
1: Introduction \\ 2: The very beginning \\ 3: Matters of style \\ 4: Typesetting mathematics \\ 5: Rows and columns \\ 6: Customization \\ 7: Floating objects \\ 8: Preparing large documents \\ A: Defining your own commands \\ B: Customizing counters \\ C: Style parameters \\ D: The picture environment \\ E: Errors \\ F: Examples \\ G: Making slides with SliTEX

entry:
@Book{Hahn:1991:LE,
  author =       "Jane Hahn",
  title =        "{\LaTeX{}} for Everyone",
  publisher =    pub-PTI,
  address =      pub-PTI:adr,
  pages =        "xi + 346",
  year =         "1991",
  ISBN =         "0-9631044-0-3",
  ISBN-13 =      "978-0-9631044-0-3",
  LCCN =         "Z253.4.L38 H34 1991",
  bibdate =      "Tue Dec 14 22:54:48 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$19.95",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction \\
                 2: The very beginning \\
                 3: Matters of style \\
                 4: Typesetting mathematics \\
                 5: Rows and columns \\
                 6: Customization \\
                 7: Floating objects \\
                 8: Preparing large documents \\
                 A: Defining your own commands \\
                 B: Customizing counters \\
                 C: Style parameters \\
                 D: The picture environment \\
                 E: Errors \\
                 F: Examples \\
                 G: Making slides with SliTEX",
}


bibtype: book
filename: master.bib
label: Haigh:2016:EAM
author: Thomas Haigh and Mark (Peter Mark) Priestley and Crispin Rope
title: ENIAC in action: making and remaking the modern computer
publisher: pub-MIT
address: pub-MIT:adr
pages: xvii + 341
year: 2016
DOI: https://doi.org/10.7551/mitpress/9780262033985.001.0001
ISBN: 0-262-03398-4 (hardcover) OR 0262033984 (hardcover)
ISBN13: 978-0-262-03398-5 (hardcover) OR 9780262033985 (hardcover)
LCCN: QA76.8.E53 H34 2016
bibdate: Mon Jun 4 09:10:53 MDT 2018
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2018.06.04 09:10:53 MDT
series: History of computing
subject: ENIAC (Computer); History
acknowledgement: ack-nhfb
authordates: 1972--
rawauthor: Thomas Haigh and Mark (Peter Mark) Priestley and Crispin Rope
rawtitle: {ENIAC} in action: making and remaking the modern computer
abstract:
Conceived in 1943, completed in 1945, and decommissioned in 1955, ENIAC (Electronic Numerical Integrator and Computer) was the first general-purpose programmable electronic computer. But ENIAC was more than just a milestone on the road to the modern computer. During its decade of operational life, ENIAC calculated sines and cosines and tested for statistical outliers, plotted the trajectories of bombs and shells, and ran the first numerical weather simulations. ENIAC in Action tells the whole story for the first time, from ENIAC's design, construction, testing, and use to its afterlife as part of computing folklore. It highlights the complex relationship of ENIAC and its designers to the revolutionary approaches to computer architecture and coding first documented by John von Neumann in 1945. Within this broad sweep, the authors emphasize the crucial but previously neglected years of 1947 and 1948, when ENIAC was reconfigured to run what the authors claim was the first modern computer program to be executed: a simulation of atomic fission for Los Alamos researchers. The authors look at ENIAC as a machine of war, as the ``first computer,'' as a material artifact constantly remade by its users, and as a subject of (contradictory) historical narratives. They integrate the history of ENIAC and its applications, describing the mathematicians, scientists, and engineers who proposed and designed the machine as well as the men --- and particularly the women --- who built it, programmed it, and operated it.

TOC:
Introduction / 1 Imagining ENIAC / 17 Structuring ENIAC / 35 Bringing ENIAC to life / 59 Putting ENIAC to work / 85 ENIAC arrives at the Ballistic Research Lab / 111 EDVAC and the first draft / 129 Converting ENIAC / 153 ENIAC goes to Monte Carlo / 173 ENIAC tries its luck / 193 ENIAC settles down to work / 207 ENIAC and its contemporaries meet the ``stored program concept'' / 231 Remembering ENIAC / 259 Conclusion / 275 Notes / 289 Index / 339

rawabstract:
Conceived in 1943, completed in 1945, and decommissioned in 1955, ENIAC (Electronic Numerical Integrator and Computer) was the first general-purpose programmable electronic computer. But ENIAC was more than just a milestone on the road to the modern computer. During its decade of operational life, ENIAC calculated sines and cosines and tested for statistical outliers, plotted the trajectories of bombs and shells, and ran the first numerical weather simulations. ENIAC in Action tells the whole story for the first time, from ENIAC's design, construction, testing, and use to its afterlife as part of computing folklore. It highlights the complex relationship of ENIAC and its designers to the revolutionary approaches to computer architecture and coding first documented by John von Neumann in 1945. Within this broad sweep, the authors emphasize the crucial but previously neglected years of 1947 and 1948, when ENIAC was reconfigured to run what the authors claim was the first modern computer program to be executed: a simulation of atomic fission for Los Alamos researchers. The authors look at ENIAC as a machine of war, as the ``first computer,'' as a material artifact constantly remade by its users, and as a subject of (contradictory) historical narratives. They integrate the history of ENIAC and its applications, describing the mathematicians, scientists, and engineers who proposed and designed the machine as well as the men --- and particularly the women --- who built it, programmed it, and operated it.

rawTOC:
Introduction / 1 \\ Imagining ENIAC / 17 \\ Structuring ENIAC / 35 \\ Bringing ENIAC to life / 59 \\ Putting ENIAC to work / 85 \\ ENIAC arrives at the Ballistic Research Lab / 111 \\ EDVAC and the first draft / 129 \\ Converting ENIAC / 153 \\ ENIAC goes to Monte Carlo / 173 \\ ENIAC tries its luck / 193 \\ ENIAC settles down to work / 207 \\ ENIAC and its contemporaries meet the ``stored program concept'' / 231 \\ Remembering ENIAC / 259 \\ Conclusion / 275 \\ Notes / 289 \\ Index / 339

entry:
@Book{Haigh:2016:EAM,
  author =       "Thomas Haigh and Mark (Peter Mark) Priestley and
                 Crispin Rope",
  title =        "{ENIAC} in action: making and remaking the modern
                 computer",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xvii + 341",
  year =         "2016",
  DOI =          "https://doi.org/10.7551/mitpress/9780262033985.001.0001",
  ISBN =         "0-262-03398-4 (hardcover)",
  ISBN-13 =      "978-0-262-03398-5 (hardcover)",
  LCCN =         "QA76.8.E53 H34 2016",
  bibdate =      "Mon Jun 4 09:10:53 MDT 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "History of computing",
  abstract =     "Conceived in 1943, completed in 1945, and
                 decommissioned in 1955, ENIAC (Electronic Numerical
                 Integrator and Computer) was the first general-purpose
                 programmable electronic computer. But ENIAC was more
                 than just a milestone on the road to the modern
                 computer. During its decade of operational life, ENIAC
                 calculated sines and cosines and tested for statistical
                 outliers, plotted the trajectories of bombs and shells,
                 and ran the first numerical weather simulations. ENIAC
                 in Action tells the whole story for the first time,
                 from ENIAC's design, construction, testing, and use to
                 its afterlife as part of computing folklore. It
                 highlights the complex relationship of ENIAC and its
                 designers to the revolutionary approaches to computer
                 architecture and coding first documented by John von
                 Neumann in 1945. Within this broad sweep, the authors
                 emphasize the crucial but previously neglected years of
                 1947 and 1948, when ENIAC was reconfigured to run what
                 the authors claim was the first modern computer program
                 to be executed: a simulation of atomic fission for Los
                 Alamos researchers. The authors look at ENIAC as a
                 machine of war, as the ``first computer,'' as a
                 material artifact constantly remade by its users, and
                 as a subject of (contradictory) historical narratives.
                 They integrate the history of ENIAC and its
                 applications, describing the mathematicians,
                 scientists, and engineers who proposed and designed the
                 machine as well as the men --- and particularly the
                 women --- who built it, programmed it, and operated
                 it.",
  acknowledgement = ack-nhfb,
  author-dates = "1972--",
  remark-1 =     "From the front matter: ``dedicated to Douglas R.
                 Hartree, who could do a great deal with ten million
                 multiplications.''",
  remark-2 =     "From page 217: ``ENIAC lacked some of the refinements
                 planned for the Institute for Advanced Studies' machine
                 --- particularly floating-point arithmetic, which, as
                 Aspray noted, meant that `large blocks of time prior to
                 calculation were consumed in trial-and-error attempts
                 to scale the variables' manually.''",
  subject =      "ENIAC (Computer); History",
  tableofcontents = "Introduction / 1 \\
                 Imagining ENIAC / 17 \\
                 Structuring ENIAC / 35 \\
                 Bringing ENIAC to life / 59 \\
                 Putting ENIAC to work / 85 \\
                 ENIAC arrives at the Ballistic Research Lab / 111 \\
                 EDVAC and the first draft / 129 \\
                 Converting ENIAC / 153 \\
                 ENIAC goes to Monte Carlo / 173 \\
                 ENIAC tries its luck / 193 \\
                 ENIAC settles down to work / 207 \\
                 ENIAC and its contemporaries meet the ``stored program
                 concept'' / 231 \\
                 Remembering ENIAC / 259 \\
                 Conclusion / 275 \\
                 Notes / 289 \\
                 Index / 339",
}


bibtype: book
filename: master.bib
label: Haigh:2021:NHM
author: Thomas Haigh and Paul E. Ceruzzi
title: A New History of Modern Computing
publisher: pub-MIT
address: pub-MIT:adr
pages: x + 528
year: 2021
ISBN: 0-262-54290-0 (paperback), 0-262-36647-9 (e-book) OR 0262542900 (paperback), 0262366479 (ebook)
LCCN: QA76.17 .H34 2021
bibdate: Mon Nov 15 15:00:52 MST 2021
bibtimestamp: 2021.11.15 15:00:52 MST
series: History of computing
remark: See also earlier editions cite Ceruzzi:1998:HMC,Ceruzzi:2003:HMC.
subject: Computer science; History; Electronic digital computers; Informatique; Histoire; Ordinateurs
acknowledgement: ack-nhfb
rawauthor: Thomas Haigh and Paul E. Ceruzzi
rawtitle: A New History of Modern Computing
ISBN13:
978-0-262-54290-6 (paperback), 978-0-262-36647-2 (e-book) OR 9780262542906 (paperback), 9780262366472 (ebook)

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

abstract:
Bringing the history of modern computing fully up to date, from new applications to scientific computation to video games and the ubiquitous smartphone.

TOC:
Acknowledgments / ix Inventing the computer / 1 The computer becomes a scientific supertool / 29 The computer becomes a data processing device / 55 The computer becomes a real-time control system / 83 The computer becomes an interactive tool / 109 The computer becomes a communications platform / 139 The computer becomes a personal plaything / 167 The computer becomes office equipment / 207 The computer becomes a graphical tool / 243 The pc becomes a minicomputer / 263 The computer becomes a universal media device / 293 The computer becomes a publishing platform / 329 The computer becomes a network / 359 The computer is everywhere and nowhere / 385 Epilogue: a Tesla in the Valley / 409 Notes / 425 Bibliography / 467 Index / 495

rawabstract:
Bringing the history of modern computing fully up to date, from new applications to scientific computation to video games and the ubiquitous smartphone.

rawTOC:
Acknowledgments / ix \\ Inventing the computer / 1 \\ The computer becomes a scientific supertool / 29 \\ The computer becomes a data processing device / 55 \\ The computer becomes a real-time control system / 83 \\ The computer becomes an interactive tool / 109 \\ The computer becomes a communications platform / 139 \\ The computer becomes a personal plaything / 167 \\ The computer becomes office equipment / 207 \\ The computer becomes a graphical tool / 243 \\ The pc becomes a minicomputer / 263 \\ The computer becomes a universal media device / 293 \\ The computer becomes a publishing platform / 329 \\ The computer becomes a network / 359 \\ The computer is everywhere and nowhere / 385 \\ Epilogue: a Tesla in the Valley / 409 \\ Notes / 425 \\ Bibliography / 467 \\ Index / 495

entry:
@Book{Haigh:2021:NHM,
  author =       "Thomas Haigh and Paul E. Ceruzzi",
  title =        "A New History of Modern Computing",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "x + 528",
  year =         "2021",
  ISBN =         "0-262-54290-0 (paperback), 0-262-36647-9 (e-book)",
  ISBN-13 =      "978-0-262-54290-6 (paperback), 978-0-262-36647-2
                 (e-book)",
  LCCN =         "QA76.17 .H34 2021",
  bibdate =      "Mon Nov 15 15:00:52 MST 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "History of computing",
  abstract =     "Bringing the history of modern computing fully up to
                 date, from new applications to scientific computation
                 to video games and the ubiquitous smartphone.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  remark =       "See also earlier editions
                 \cite{Ceruzzi:1998:HMC,Ceruzzi:2003:HMC}.",
  subject =      "Computer science; History; Electronic digital
                 computers; Informatique; Histoire; Ordinateurs",
  tableofcontents = "Acknowledgments / ix \\
                 Inventing the computer / 1 \\
                 The computer becomes a scientific supertool / 29 \\
                 The computer becomes a data processing device / 55 \\
                 The computer becomes a real-time control system / 83
                 \\
                 The computer becomes an interactive tool / 109 \\
                 The computer becomes a communications platform / 139
                 \\
                 The computer becomes a personal plaything / 167 \\
                 The computer becomes office equipment / 207 \\
                 The computer becomes a graphical tool / 243 \\
                 The pc becomes a minicomputer / 263 \\
                 The computer becomes a universal media device / 293 \\
                 The computer becomes a publishing platform / 329 \\
                 The computer becomes a network / 359 \\
                 The computer is everywhere and nowhere / 385 \\
                 Epilogue: a Tesla in the Valley / 409 \\
                 Notes / 425 \\
                 Bibliography / 467 \\
                 Index / 495",
}


bibtype: book
filename: master.bib
label: Hall:1990:SAS
author: Mark Hall and John Barry
title: Sunburst: The Ascent of Sun Microsystems
publisher: pub-CBI
address: pub-CBI:adr
pages: xvii + 297
year: 1990
ISBN: 0-8092-3989-2, 0-8092-4368-7 OR 0809239892, 0809243687
ISBN13: 978-0-8092-3989-4, 978-0-8092-4368-6 OR 9780809239894, 9780809243686
LCCN: HD9696.C64 S794 1990
bibdate: Tue Dec 14 22:54:54 1993
bibtimestamp: 1993.12.14 22:54:54 ???
keywords: computer industry --- United States; Sun Microsystems
acknowledgement: ack-nhfb
rawauthor: Mark Hall and John Barry
rawtitle: Sunburst: The Ascent of {Sun Microsystems}
bibsource:
https://www.math.utah.edu/pub/tex/bib/annhistcomput.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

entry:
@Book{Hall:1990:SAS,
  author =       "Mark Hall and John Barry",
  title =        "Sunburst: The Ascent of {Sun Microsystems}",
  publisher =    pub-CBI,
  address =      pub-CBI:adr,
  pages =        "xvii + 297",
  year =         "1990",
  ISBN =         "0-8092-3989-2, 0-8092-4368-7",
  ISBN-13 =      "978-0-8092-3989-4, 978-0-8092-4368-6",
  LCCN =         "HD9696.C64 S794 1990",
  bibdate =      "Tue Dec 14 22:54:54 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/annhistcomput.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  keywords =     "computer industry --- United States; Sun
                 Microsystems",
}


bibtype: book
filename: master.bib
label: Hall:1990:SP
author: Mark Hall and John Barry
title: The SunTechnology Papers
publisher: pub-SV
address: pub-SV:adr
pages: x + 250
year: 1990
ISBN: 0-387-97145-9, 3-540-97145-9 OR 0387971459, 3540971459
ISBN13: 978-0-387-97145-2, 978-3-540-97145-0 OR 9780387971452, 9783540971450
LCCN: HD9696.C64 S796 1990; QA76.754 .S86 1990
bibdate: Sat Aug 27 10:56:30 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.08.27 10:56:30 ???
acknowledgement: ack-nhfb
rawauthor: Mark Hall and John Barry
rawtitle: The {SunTechnology} Papers
remark:
Selection of articles from ``SunTechnology: the journal for Sun users,'' a quarterly technical journal.

TOC:
The open network computing environment / Larry Garlick [and others] SunOS on SPARC / Steve Kleiman and Dock Williams NSE highlights / William Courington, Jonathan Feiber, and Masahiro Honda Optimizing compilers for SPARC / Steven S. Muchnick Sun's compiler technology / Steven S. Muchnick and Richard Schell SPARC: scalable processor architecture / Robert B. Garner SPARCstation 1: beyond the 3M horizon / Andreas V. Bechtolsheim and Edward H. Frank SCRAM cache in the Sun-4-110 / Ed Kelly DOS on the Sun386i / John Lazarus and Jim Lerner Address space in the Sun386i / John Lazarus A framework for network security / Bradley Taylor TOPS: an introduction / Gary Stroud Network applications and NeWS / James Gosling, David Rosenthal, and Michelle Arden Network bookstrap loading / Robert E. Gilligan Network programming made simple / Bradley Taylor OPEN LOOK: industry outlook-overview / Jon Kannegaard OPEN LOOK toolkits / Richard Probst SunLink CG3270: a NeWS application implementation / Grant Tegtmeier Painter: a simple NeWS program / David LaVallee

rawTOC:
The open network computing environment / Larry Garlick [and others] \\ SunOS on SPARC / Steve Kleiman and Dock Williams \\ NSE highlights / William Courington, Jonathan Feiber, and Masahiro Honda \\ Optimizing compilers for SPARC / Steven S. Muchnick \\ Sun's compiler technology / Steven S. Muchnick and Richard Schell \\ SPARC: scalable processor architecture / Robert B. Garner \\ SPARCstation 1: beyond the 3M horizon / Andreas V. Bechtolsheim and Edward H. Frank \\ SCRAM cache in the Sun-4-110 / Ed Kelly \\ DOS on the Sun386i / John Lazarus and Jim Lerner \\ Address space in the Sun386i / John Lazarus \\ A framework for network security / Bradley Taylor \\ TOPS: an introduction / Gary Stroud \\ Network applications and NeWS / James Gosling, David Rosenthal, and Michelle Arden \\ Network bookstrap loading / Robert E. Gilligan \\ Network programming made simple / Bradley Taylor \\ OPEN LOOK: industry outlook-overview / Jon Kannegaard \\ OPEN LOOK toolkits / Richard Probst \\ SunLink CG3270: a NeWS application implementation / Grant Tegtmeier \\ Painter: a simple NeWS program / David LaVall{\'e}e

entry:
@Book{Hall:1990:SP,
  author =       "Mark Hall and John Barry",
  title =        "The {SunTechnology} Papers",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "x + 250",
  year =         "1990",
  ISBN =         "0-387-97145-9, 3-540-97145-9",
  ISBN-13 =      "978-0-387-97145-2, 978-3-540-97145-0",
  LCCN =         "HD9696.C64 S796 1990; QA76.754 .S86 1990",
  bibdate =      "Sat Aug 27 10:56:30 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  remark =       "Selection of articles from ``SunTechnology: the
                 journal for Sun users,'' a quarterly technical
                 journal.",
  tableofcontents = "The open network computing environment / Larry
                 Garlick [and others] \\
                 SunOS on SPARC / Steve Kleiman and Dock Williams \\
                 NSE highlights / William Courington, Jonathan Feiber,
                 and Masahiro Honda \\
                 Optimizing compilers for SPARC / Steven S. Muchnick \\
                 Sun's compiler technology / Steven S. Muchnick and
                 Richard Schell \\
                 SPARC: scalable processor architecture / Robert B.
                 Garner \\
                 SPARCstation 1: beyond the 3M horizon / Andreas V.
                 Bechtolsheim and Edward H. Frank \\
                 SCRAM cache in the Sun-4-110 / Ed Kelly \\
                 DOS on the Sun386i / John Lazarus and Jim Lerner \\
                 Address space in the Sun386i / John Lazarus \\
                 A framework for network security / Bradley Taylor \\
                 TOPS: an introduction / Gary Stroud \\
                 Network applications and NeWS / James Gosling, David
                 Rosenthal, and Michelle Arden \\
                 Network bookstrap loading / Robert E. Gilligan \\
                 Network programming made simple / Bradley Taylor \\
                 OPEN LOOK: industry outlook-overview / Jon Kannegaard
                 \\
                 OPEN LOOK toolkits / Richard Probst \\
                 SunLink CG3270: a NeWS application implementation /
                 Grant Tegtmeier \\
                 Painter: a simple NeWS program / David LaVall{\'e}e",
}


bibtype: techreport
filename: master.bib
label: Hall:pfort
author: A. D. Hall
title: A Portable Fortran IV Subset
institution: pub-ATT-BELL
address: pub-ATT-BELL:adr
pages: x + 250
year: 1969
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: A. D. Hall
rawtitle: A Portable {Fortran IV} Subset
entry:
@TechReport{Hall:pfort,
  author =       "A. D. Hall",
  title =        "A Portable {Fortran IV} Subset",
  institution =  pub-ATT-BELL,
  address =      pub-ATT-BELL:adr,
  year =         "1969",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Hamming:1973:NMS
author: R. W. Hamming
title: Numerical Methods for Scientists and Engineers
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
edition: Second
pages: ix + 721
year: 1973
ISBN: 0-07-025887-2 OR 0070258872
ISBN13: 978-0-07-025887-7 OR 9780070258877
MRclass: 65-01 65Dxx 65F15
MRnumber: 0351023
bibdate: Mon Aug 6 07:24:38 2018
bibtimestamp: 2018.08.06 07:24:38 ???
note: International Series in Pure and Applied Mathematics
ZMnumber: 0262.65001
acknowledgement: ack-nhfb
authordates: Richard Wesley Hamming (1915--1998)
rawauthor: R. W. Hamming
rawnote: International Series in Pure and Applied Mathematics
rawtitle: Numerical Methods for Scientists and Engineers
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/h/hamming-richard-w.bib; https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

TOC:
Preface I Fundamentals and Algorithms 1 An Essay on Numerical Methods 2 Numbers 3 Function Evaluation 4 Real Zeros 5 Complex Zeros *6 Zeros of Polynomials 7 Linear Equations and Matrix Inversion *8 Random Numbers 9 The Difference Calculus 10 Roundoff *11 The Summation Calculus *12 Infinite Series 13 Difference Equations II Polynomial Approximation-Classical Theory 14 Polynomial Interpolation 15 Formulas Using Function Values 16 Error Terms 17 Formulas Using Derivatives 18 Formulas Using Differences *19 Formulas Using the Sample Points as Parameters 20 Composite Formulas 21 Indefinite Integrals-Feedback 22 Introduction to Differential Equations 23 A General Theory of Predictor-Corrector Methods 24 Special Methods of Integrating Ordinary Differential Equations 25 Least Squares: Practice Theory 26 Orthogonal Functions 27 Least Squares: Practice 28 Chebyshev Approximation: Theory 29 Chebyshev Approximation: Practice *30 Rational Function Approximation III Fourier Approximation-Modern Theory 31 Fourier Series: Periodic Functions 32 Convergence of Fourier Series 33 The Fast Fourier Transform 34 The Fourier Integral: Nonperiodic Functions 35 A Second Look at Polynomial Approximation-Filters *36 Integrals and Differential Equations *37 Design of Digital Filters *38 Quantization of Signals IV Exponential Approximation 39 Sums of Exponentials *40 The Laplace Transform *41 Simulation and the Method of Zeros and Poles V Miscellaneous 42 Approximations to Singularities 43 Optimization 44 Linear Independence 45 Eigenvalues and Eigenvectors of Hermitian Matrices N + 1 The Art of Computing for Scientists and Engineers Index

rawTOC:
Preface \\ I Fundamentals and Algorithms \\ 1 An Essay on Numerical Methods \\ 2 Numbers \\ 3 Function Evaluation \\ 4 Real Zeros \\ 5 Complex Zeros \\ *6 Zeros of Polynomials \\ 7 Linear Equations and Matrix Inversion \\ *8 Random Numbers \\ 9 The Difference Calculus \\ 10 Roundoff \\ *11 The Summation Calculus \\ *12 Infinite Series \\ 13 Difference Equations \\ II Polynomial Approximation-Classical Theory \\ 14 Polynomial Interpolation \\ 15 Formulas Using Function Values \\ 16 Error Terms \\ 17 Formulas Using Derivatives \\ 18 Formulas Using Differences \\ *19 Formulas Using the Sample Points as Parameters \\ 20 Composite Formulas \\ 21 Indefinite Integrals-Feedback \\ 22 Introduction to Differential Equations \\ 23 A General Theory of Predictor-Corrector Methods \\ 24 Special Methods of Integrating Ordinary Differential Equations \\ 25 Least Squares: Practice Theory \\ 26 Orthogonal Functions \\ 27 Least Squares: Practice \\ 28 Chebyshev Approximation: Theory \\ 29 Chebyshev Approximation: Practice \\ *30 Rational Function Approximation \\ III Fourier Approximation-Modern Theory \\ 31 Fourier Series: Periodic Functions \\ 32 Convergence of Fourier Series \\ 33 The Fast Fourier Transform \\ 34 The Fourier Integral: Nonperiodic Functions \\ 35 A Second Look at Polynomial Approximation-Filters \\ *36 Integrals and Differential Equations \\ *37 Design of Digital Filters \\ *38 Quantization of Signals \\ IV Exponential Approximation \\ 39 Sums of Exponentials \\ *40 The Laplace Transform \\ *41 Simulation and the Method of Zeros and Poles \\ V Miscellaneous \\ 42 Approximations to Singularities \\ 43 Optimization \\ 44 Linear Independence \\ 45 Eigenvalues and Eigenvectors of Hermitian Matrices \\ N + 1 The Art of Computing for Scientists and Engineers \\ Index

entry:
@Book{Hamming:1973:NMS,
  author =       "R. W. Hamming",
  title =        "Numerical Methods for Scientists and Engineers",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Second",
  pages =        "ix + 721",
  year =         "1973",
  ISBN =         "0-07-025887-2",
  ISBN-13 =      "978-0-07-025887-7",
  MRclass =      "65-01 65Dxx 65F15",
  MRnumber =     "0351023",
  bibdate =      "Mon Aug 6 07:24:38 2018",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/h/hamming-richard-w.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "International Series in Pure and Applied Mathematics",
  ZMnumber =     "0262.65001",
  acknowledgement = ack-nhfb,
  author-dates = "Richard Wesley Hamming (1915--1998)",
  tableofcontents = "Preface \\
                 I Fundamentals and Algorithms \\
                 1 An Essay on Numerical Methods \\
                 2 Numbers \\
                 3 Function Evaluation \\
                 4 Real Zeros \\
                 5 Complex Zeros \\
                 *6 Zeros of Polynomials \\
                 7 Linear Equations and Matrix Inversion \\
                 *8 Random Numbers \\
                 9 The Difference Calculus \\
                 10 Roundoff \\
                 *11 The Summation Calculus \\
                 *12 Infinite Series \\
                 13 Difference Equations \\
                 II Polynomial Approximation-Classical Theory \\
                 14 Polynomial Interpolation \\
                 15 Formulas Using Function Values \\
                 16 Error Terms \\
                 17 Formulas Using Derivatives \\
                 18 Formulas Using Differences \\
                 *19 Formulas Using the Sample Points as Parameters \\
                 20 Composite Formulas \\
                 21 Indefinite Integrals-Feedback \\
                 22 Introduction to Differential Equations \\
                 23 A General Theory of Predictor-Corrector Methods \\
                 24 Special Methods of Integrating Ordinary Differential
                 Equations \\
                 25 Least Squares: Practice Theory \\
                 26 Orthogonal Functions \\
                 27 Least Squares: Practice \\
                 28 Chebyshev Approximation: Theory \\
                 29 Chebyshev Approximation: Practice \\
                 *30 Rational Function Approximation \\
                 III Fourier Approximation-Modern Theory \\
                 31 Fourier Series: Periodic Functions \\
                 32 Convergence of Fourier Series \\
                 33 The Fast Fourier Transform \\
                 34 The Fourier Integral: Nonperiodic Functions \\
                 35 A Second Look at Polynomial Approximation-Filters
                 \\
                 *36 Integrals and Differential Equations \\
                 *37 Design of Digital Filters \\
                 *38 Quantization of Signals \\
                 IV Exponential Approximation \\
                 39 Sums of Exponentials \\
                 *40 The Laplace Transform \\
                 *41 Simulation and the Method of Zeros and Poles \\
                 V Miscellaneous \\
                 42 Approximations to Singularities \\
                 43 Optimization \\
                 44 Linear Independence \\
                 45 Eigenvalues and Eigenvectors of Hermitian Matrices
                 \\
                 N + 1 The Art of Computing for Scientists and Engineers
                 \\
                 Index",
  xxpages =      "x + 721",
}


bibtype: book
filename: master.bib
label: Hancock:1982:CP
author: Les Hancock and Morris Krieger
title: The C Primer
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
pages: ix + 235
year: 1982
ISBN: 0-07-025981-X OR 007025981X
ISBN13: 978-0-07-025981-2 OR 9780070259812
LCCN: QA76.73.C15 H36 1982
bibdate: Tue Dec 14 22:54:58 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:54:58 ???
acknowledgement: ack-nhfb
rawauthor: Les Hancock and Morris Krieger
rawtitle: The {C} Primer
entry:
@Book{Hancock:1982:CP,
  author =       "Les Hancock and Morris Krieger",
  title =        "The {C} Primer",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "ix + 235",
  year =         "1982",
  ISBN =         "0-07-025981-X",
  ISBN-13 =      "978-0-07-025981-2",
  LCCN =         "QA76.73.C15 H36 1982",
  bibdate =      "Tue Dec 14 22:54:58 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Hanna:1963:QMC
author: Melvin W. Hanna
title: Quantum Mechanics in Chemistry
publisher: pub-BENJAMIN
address: pub-BENJAMIN:adr
pages: xiii + 253
year: 1963
LCCN: QD462 .H3
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: Melvin W. Hanna
rawtitle: Quantum Mechanics in Chemistry
entry:
@Book{Hanna:1963:QMC,
  author =       "Melvin W. Hanna",
  title =        "Quantum Mechanics in Chemistry",
  publisher =    pub-BENJAMIN,
  address =      pub-BENJAMIN:adr,
  pages =        "xiii + 253",
  year =         "1963",
  LCCN =         "QD462 .H3",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: article
filename: master.bib
label: Hanson:parsing
author: David R. Hanson
title: Compact Recursive-descent Parsing of Expressions
journal: j-SPE
volume: 15
number: 12
pages: 1205--1212
month: dec
monthnumber: 12
year: 1985
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: David R. Hanson
rawtitle: Compact Recursive-descent Parsing of Expressions
entry:
@Article{Hanson:parsing,
  author =       "David R. Hanson",
  title =        "Compact Recursive-descent Parsing of Expressions",
  journal =      j-SPE,
  volume =       "15",
  number =       "12",
  pages =        "1205--1212",
  month =        dec,
  year =         "1985",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Hanson:1997:CII
author: David R. Hanson
title: C Interfaces and Implementations: Techniques for Creating Reusable Software
publisher: pub-AW
address: pub-AW:adr
pages: xvii + 519
year: 1997
ISBN: 0-201-49841-3 OR 0201498413
ISBN13: 978-0-201-49841-7 OR 9780201498417
LCCN: QA76.73.C15H37 1997
bibdate: Fri Feb 27 16:08:11 1998
bibtimestamp: 1998.02.27 16:08:11 ???
series: Addison-Wesley Professional Computing Series
URL: http://www.cs.princeton.edu/software/cii/
subject: C (Computer program language); Computer software; Reusability; Literate Programming
acknowledgement: ack-nhfb
rawauthor: David R. Hanson
rawtitle: {C} Interfaces and Implementations: Techniques for Creating Reusable Software
bibsource:
https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/litprog.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

TOC:
1. Introduction 2. Interfaces and Implementations 3. Atoms 4. Exceptions and Assertions 5. Memory Management 6. More Memory Management 7. Lists 8. Tables 9. Sets 10. Dynamic Arrays 11. Sequences 12. Rings 13. Bit Vectors 14. Formatting 15. Low-Level Strings 16. High-Level Strings 17. Extended-Precision Arithmetic 18. Arbitrary-Precision Arithmetic 19. Multiple-Precision Arithmetic 20. Threads

rawTOC:
1. Introduction \\ 2. Interfaces and Implementations \\ 3. Atoms \\ 4. Exceptions and Assertions \\ 5. Memory Management \\ 6. More Memory Management \\ 7. Lists \\ 8. Tables \\ 9. Sets \\ 10. Dynamic Arrays \\ 11. Sequences \\ 12. Rings \\ 13. Bit Vectors \\ 14. Formatting \\ 15. Low-Level Strings \\ 16. High-Level Strings \\ 17. Extended-Precision Arithmetic \\ 18. Arbitrary-Precision Arithmetic \\ 19. Multiple-Precision Arithmetic \\ 20. Threads

entry:
@Book{Hanson:1997:CII,
  author =       "David R. Hanson",
  title =        "{C} Interfaces and Implementations: Techniques for
                 Creating Reusable Software",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xvii + 519",
  year =         "1997",
  ISBN =         "0-201-49841-3",
  ISBN-13 =      "978-0-201-49841-7",
  LCCN =         "QA76.73.C15H37 1997",
  bibdate =      "Fri Feb 27 16:08:11 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/litprog.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Addison-Wesley Professional Computing Series",
  URL =          "http://www.cs.princeton.edu/software/cii/",
  acknowledgement = ack-nhfb,
  subject =      "C (Computer program language); Computer software;
                 Reusability; Literate Programming",
  tableofcontents = "1. Introduction \\
                 2. Interfaces and Implementations \\
                 3. Atoms \\
                 4. Exceptions and Assertions \\
                 5. Memory Management \\
                 6. More Memory Management \\
                 7. Lists \\
                 8. Tables \\
                 9. Sets \\
                 10. Dynamic Arrays \\
                 11. Sequences \\
                 12. Rings \\
                 13. Bit Vectors \\
                 14. Formatting \\
                 15. Low-Level Strings \\
                 16. High-Level Strings \\
                 17. Extended-Precision Arithmetic \\
                 18. Arbitrary-Precision Arithmetic \\
                 19. Multiple-Precision Arithmetic \\
                 20. Threads",
}


bibtype: book
filename: master.bib
label: Haralambous:2004:FCG
author: Yannis Haralambous
title: Fontes & codages: Glyphes et caracteres a l'ere du numerique
publisher: pub-ORA-FRANCE
address: pub-ORA-FRANCE:adr
pages: xx + 990
year: 2004
ISBN: 2-84177-273-X OR 284177273X
ISBN13: 978-2-84177-273-5 OR 9782841772735
LCCN: Z699.35C48 H37.2004
bibdate: Fri May 20 06:49:11 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2005.05.20 06:49:11 ???
acknowledgement: ack-nhfb
rawauthor: Yannis Haralambous
rawtitle: Fontes \& codages: Glyphes et caract{\`e}res {\`a} l'{\`e}re du num{\'e}rique
entry:
@Book{Haralambous:2004:FCG,
  author =       "Yannis Haralambous",
  title =        "Fontes \& codages: Glyphes et caract{\`e}res {\`a}
                 l'{\`e}re du num{\'e}rique",
  publisher =    pub-ORA-FRANCE,
  address =      pub-ORA-FRANCE:adr,
  pages =        "xx + 990",
  year =         "2004",
  EAN =          "978-2-84177-273-5",
  ISBN =         "2-84177-273-X",
  ISBN-13 =      "978-2-84177-273-5",
  LCCN =         "Z699.35C48 H37.2004",
  bibdate =      "Fri May 20 06:49:11 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Harari:2015:SBH
author: Yuval N. Harari
title: Sapiens: a brief history of humankind
publisher: Harper
address: New York, NY, USA
pages: ix + 443
year: 2015
ISBN: 0-06-231609-5 (hardcover), 0-06-231611-7 (e-book) OR 0062316095 (hardcover), 0062316117 (ebook)
LCCN: CB113.H4 H3713 2015
bibdate: Thu Nov 11 18:32:31 MST 2021
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2021.11.11 18:32:31 MST
note: Translation from the Hebrew original by Yuval N. Harari and John Purcell and Haim Watzman.
acknowledgement: ack-nhfb
rawauthor: Yuval N. Harari
rawnote: Translation from the Hebrew original by Yuval N. Harari and John Purcell and Haim Watzman.
rawtitle: {Sapiens}: a brief history of humankind
ISBN13:
978-0-06-231609-7 (hardcover), 978-0-06-231610-3 (e-book), 978-0-06-231611-0 (trade paperback) OR 9780062316097 (hardcover), 9780062316103 (ebook), 9780062316110 (trade paperback)

abstract:
From a renowned historian comes a groundbreaking narrative of humanity's creation and evolution--a #1 international bestseller--that explores the ways in which biology and history have defined us and enhanced our understanding of what it means to be `human.' One hundred thousand years ago, at least six different species of humans inhabited Earth. Yet today there is only one--homo sapiens. What happened to the others? And what may happen to us? Most books about the history of humanity pursue either a historical or a biological approach, but Dr. Yuval Noah Harari breaks the mold with this highly original book that begins about 70,000 years ago with the appearance of modern cognition. From examining the role evolving humans have played in the global ecosystem to charting the rise of empires, Sapiens integrates history and science to reconsider accepted narratives, connect past developments with contemporary concerns, and examine specific events within the context of larger ideas. Dr. Harari also compels us to look ahead, because over the last few decades humans have begun to bend laws of natural selection that have governed life for the past four billion years. We are acquiring the ability to design not only the world around us, but also ourselves. Where is this leading us, and what do we want to become? Featuring 27 photographs, 6 maps, and 25 illustrations/diagrams, this provocative and insightful work is sure to spark debate and is essential reading for aficionados of Jared Diamond, James Gleick, Matt Ridley, Robert Wright, and Sharon Moalem.

subject:
Civilizacion; Historia; Seres humanos; Historia moderna; Cronologia historica; Tecnologia y civilizacion

TOC:
Timeline of history Part One: The cognitive revolution An animal of no significance The tree of knowledge A day in the life of Adam and Eve The flood Part Two. The agricultural revolution History's biggest fraud Building pyramids Memory overload There is no justice in history Part Three. The unification of humankind The arrow of history The scent of money Imperial visions The law of religion The secret of success Part Four. The scientific revolution The discovery of ignorance The marriage of science and empire The capitalist creed The wheels of industry A permanent revolution And they lived happily ever after The end of Homo sapiens Afterword: The animal that became a god

rawabstract:
From a renowned historian comes a groundbreaking narrative of humanity's creation and evolution--a \#1 international bestseller--that explores the ways in which biology and history have defined us and enhanced our understanding of what it means to be `human.' One hundred thousand years ago, at least six different species of humans inhabited Earth. Yet today there is only one--homo sapiens. What happened to the others? And what may happen to us? Most books about the history of humanity pursue either a historical or a biological approach, but Dr. Yuval Noah Harari breaks the mold with this highly original book that begins about 70,000 years ago with the appearance of modern cognition. From examining the role evolving humans have played in the global ecosystem to charting the rise of empires, Sapiens integrates history and science to reconsider accepted narratives, connect past developments with contemporary concerns, and examine specific events within the context of larger ideas. Dr. Harari also compels us to look ahead, because over the last few decades humans have begun to bend laws of natural selection that have governed life for the past four billion years. We are acquiring the ability to design not only the world around us, but also ourselves. Where is this leading us, and what do we want to become? Featuring 27 photographs, 6 maps, and 25 illustrations/diagrams, this provocative and insightful work is sure to spark debate and is essential reading for aficionados of Jared Diamond, James Gleick, Matt Ridley, Robert Wright, and Sharon Moalem.

rawTOC:
Timeline of history \\ Part One: The cognitive revolution \\ An animal of no significance \\ The tree of knowledge \\ A day in the life of Adam and Eve \\ The flood \\ Part Two. The agricultural revolution \\ History's biggest fraud \\ Building pyramids \\ Memory overload \\ There is no justice in history \\ Part Three. The unification of humankind \\ The arrow of history \\ The scent of money \\ Imperial visions \\ The law of religion \\ The secret of success \\ Part Four. The scientific revolution \\ The discovery of ignorance \\ The marriage of science and empire \\ The capitalist creed \\ The wheels of industry \\ A permanent revolution \\ And they lived happily ever after \\ The end of Homo sapiens \\ Afterword: The animal that became a god

entry:
@Book{Harari:2015:SBH,
  author =       "Yuval N. Harari",
  title =        "{Sapiens}: a brief history of humankind",
  publisher =    "Harper",
  address =      "New York, NY, USA",
  pages =        "ix + 443",
  year =         "2015",
  ISBN =         "0-06-231609-5 (hardcover), 0-06-231611-7 (e-book)",
  ISBN-13 =      "978-0-06-231609-7 (hardcover), 978-0-06-231610-3
                 (e-book), 978-0-06-231611-0 (trade paperback)",
  LCCN =         "CB113.H4 H3713 2015",
  bibdate =      "Thu Nov 11 18:32:31 MST 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Translation from the Hebrew original by Yuval N.
                 Harari and John Purcell and Haim Watzman.",
  abstract =     "From a renowned historian comes a groundbreaking
                 narrative of humanity's creation and evolution--a \#1
                 international bestseller--that explores the ways in
                 which biology and history have defined us and enhanced
                 our understanding of what it means to be `human.' One
                 hundred thousand years ago, at least six different
                 species of humans inhabited Earth. Yet today there is
                 only one--homo sapiens. What happened to the others?
                 And what may happen to us? Most books about the history
                 of humanity pursue either a historical or a biological
                 approach, but Dr. Yuval Noah Harari breaks the mold
                 with this highly original book that begins about 70,000
                 years ago with the appearance of modern cognition. From
                 examining the role evolving humans have played in the
                 global ecosystem to charting the rise of empires,
                 Sapiens integrates history and science to reconsider
                 accepted narratives, connect past developments with
                 contemporary concerns, and examine specific events
                 within the context of larger ideas. Dr. Harari also
                 compels us to look ahead, because over the last few
                 decades humans have begun to bend laws of natural
                 selection that have governed life for the past four
                 billion years. We are acquiring the ability to design
                 not only the world around us, but also ourselves. Where
                 is this leading us, and what do we want to become?
                 Featuring 27 photographs, 6 maps, and 25
                 illustrations/diagrams, this provocative and insightful
                 work is sure to spark debate and is essential reading
                 for aficionados of Jared Diamond, James Gleick, Matt
                 Ridley, Robert Wright, and Sharon Moalem.",
  acknowledgement = ack-nhfb,
  subject =      "Civilizaci{\'o}n; Historia; Seres humanos; Historia
                 moderna; Cronolog{\'i}a hist{\'o}rica; Tecnolog{\'i}a y
                 civilizaci{\'o}n",
  tableofcontents = "Timeline of history \\
                 Part One: The cognitive revolution \\
                 An animal of no significance \\
                 The tree of knowledge \\
                 A day in the life of Adam and Eve \\
                 The flood \\
                 Part Two. The agricultural revolution \\
                 History's biggest fraud \\
                 Building pyramids \\
                 Memory overload \\
                 There is no justice in history \\
                 Part Three. The unification of humankind \\
                 The arrow of history \\
                 The scent of money \\
                 Imperial visions \\
                 The law of religion \\
                 The secret of success \\
                 Part Four. The scientific revolution \\
                 The discovery of ignorance \\
                 The marriage of science and empire \\
                 The capitalist creed \\
                 The wheels of industry \\
                 A permanent revolution \\
                 And they lived happily ever after \\
                 The end of Homo sapiens \\
                 Afterword: The animal that became a god",
}


bibtype: book
filename: master.bib
label: Harbison:1984:CRM
author: Samuel P. Harbison and Guy L. Steele Jr.
title: C: a Reference Manual
publisher: pub-PH
address: pub-PH:adr
pages: x + 352
year: 1984
LCCN: QA76.73.C15 H38 1984
bibdate: Tue Dec 14 22:55:00 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:55:00 ???
acknowledgement: ack-nhfb
rawauthor: Samuel P. Harbison and Guy L. {Steele Jr.}
rawtitle: {C}: a Reference Manual
ISBN:
0-13-110008-4 (paperback), 0-13-110016-5 (hardcover) OR 0131100084 (paperback), 0131100165 (hardcover)

ISBN13:
978-0-13-110008-4 (paperback), 978-0-13-110016-9 (hardcover) OR 9780131100084 (paperback), 9780131100169 (hardcover)

TOC:
Introduction to C Lexical elements The C processor Declarations Types Type conversions Expressions Statements Functions Program structure The run-time library THE ASCII character set Syntax of the C languages LALR (1) grammar for C Index

rawTOC:
Introduction to C \\ Lexical elements \\ The C processor \\ Declarations \\ Types \\ Type conversions \\ Expressions \\ Statements \\ Functions \\ Program structure \\ The run-time library \\ THE ASCII character set \\ Syntax of the C languages \\ LALR (1) grammar for C \\ Index

entry:
@Book{Harbison:1984:CRM,
  author =       "Samuel P. Harbison and Guy L. {Steele Jr.}",
  title =        "{C}: a Reference Manual",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "x + 352",
  year =         "1984",
  ISBN =         "0-13-110008-4 (paperback), 0-13-110016-5 (hardcover)",
  ISBN-13 =      "978-0-13-110008-4 (paperback), 978-0-13-110016-9
                 (hardcover)",
  LCCN =         "QA76.73.C15 H38 1984",
  bibdate =      "Tue Dec 14 22:55:00 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction to C \\
                 Lexical elements \\
                 The C processor \\
                 Declarations \\
                 Types \\
                 Type conversions \\
                 Expressions \\
                 Statements \\
                 Functions \\
                 Program structure \\
                 The run-time library \\
                 THE ASCII character set \\
                 Syntax of the C languages \\
                 LALR (1) grammar for C \\
                 Index",
}


bibtype: book
filename: master.bib
label: Harbison:1987:CRM
author: Samuel P. Harbison and Guy L. Steele Jr.
title: C: A Reference Manual
publisher: pub-PH
address: pub-PH:adr
edition: Second
pages: xii + 404
year: 1987
ISBN: 0-13-109802-0 OR 0131098020
ISBN13: 978-0-13-109802-2 OR 9780131098022
LCCN: QA76.73.C15 H38 1987
bibdate: Wed Dec 15 08:02:04 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 08:02:04 ???
acknowledgement: ack-nhfb
rawauthor: Samuel P. Harbison and Guy L. {Steele Jr.}
rawtitle: {C}: {A} Reference Manual
entry:
@Book{Harbison:1987:CRM,
  author =       "Samuel P. Harbison and Guy L. {Steele Jr.}",
  title =        "{C}: {A} Reference Manual",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Second",
  pages =        "xii + 404",
  year =         "1987",
  ISBN =         "0-13-109802-0",
  ISBN-13 =      "978-0-13-109802-2",
  LCCN =         "QA76.73.C15 H38 1987",
  bibdate =      "Wed Dec 15 08:02:04 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Harbison:1991:CRM
author: Samuel P. Harbison and Guy L. Steele Jr.
title: C: a Reference Manual
publisher: pub-PH
address: pub-PH:adr
edition: Third
pages: viii + 392
year: 1991
LCCN: QA76.73.C15 H38 1991
bibdate: Tue Dec 14 22:55:01 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 1993.12.14 22:55:01 ???
acknowledgement: ack-nhfb
rawauthor: Samuel P. Harbison and Guy L. {Steele Jr.}
rawtitle: {C}: a Reference Manual
ISBN:
0-13-110933-2 (paperback), 0-13-110941-3 (hardcover), 0-13-116807-X (international) OR 0131109332 (paperback), 0131109413 (hardcover), 013116807X (international)

ISBN13:
978-0-13-110933-9 (paperback), 978-0-13-110941-4 (hardcover), 978-0-13-116807-7 (international) OR 9780131109339 (paperback), 9780131109414 (hardcover), 9780131168077 (international)

remark:
An authoritative reference to the C programming language, and a good companion to Kernighan and Ritchie.

entry:
@Book{Harbison:1991:CRM,
  author =       "Samuel P. Harbison and Guy L. {Steele Jr.}",
  title =        "{C}: a Reference Manual",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Third",
  pages =        "viii + 392",
  year =         "1991",
  ISBN =         "0-13-110933-2 (paperback), 0-13-110941-3 (hardcover),
                 0-13-116807-X (international)",
  ISBN-13 =      "978-0-13-110933-9 (paperback), 978-0-13-110941-4
                 (hardcover), 978-0-13-116807-7 (international)",
  LCCN =         "QA76.73.C15 H38 1991",
  bibdate =      "Tue Dec 14 22:55:01 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "An authoritative reference to the {C} programming
                 language, and a good companion to Kernighan and
                 Ritchie.",
}


bibtype: book
filename: master.bib
label: Harbison:1995:CRM
author: Samuel P. Harbison and Guy L. Steele Jr.
title: C --- a Reference Manual
publisher: pub-PH
address: pub-PH:adr
edition: Fourth
pages: xx + 455
year: 1995
LCCN: QA76.73.C15 H38 1995
bibdate: Mon Feb 20 17:04:05 1995
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1995.02.20 17:04:05 ???
acknowledgement: ack-nhfb
rawauthor: Samuel P. Harbison and Guy L. {Steele Jr.}
rawtitle: {C} --- a Reference Manual
ISBN:
0-13-326232-4 (hardcover), 0-13-326224-3 (paperback) OR 0133262324 (hardcover), 0133262243 (paperback)

ISBN13:
978-0-13-326232-2 (hardcover), 978-0-13-326224-7 (paperback) OR 9780133262322 (hardcover), 9780133262247 (paperback)

abstract:
This best-selling, authoritative reference manual provides a complete description of the C language, the run-time libraries, and a style of C programming that emphasizes correctness, portability, and maintainability. Describing the C language more clearly and in more detail than any other book, authors Samuel P. Harbison and Guy L. Steele Jr. provide in a single manual: Standard C --- the ANSI/ISO standard now supported by all new C compilers; Traditional C --- common practice for twenty years, with millions of lines of code in use every day and the complete Standard and Traditional C run-time libraries. Thoroughly revised and updated, the Fourth Edition adds two important developments: the ANSI/ISO description has been updated with ISO C Amendment 1 (1994), which adds new facilities for writing portable international programs and each language chapter now discusses C++ compatibility, so you can write C programs that will be maximally portable and reusable in C and C++ environments --- an important consideration for software developers.

TOC:
1: Introduction 2: Lexical Elements 3: The C Preprocessor 4: Declarations 5: Types 6: Conversions and Representations 7: Expressions 8: Statements 9: Functions 10: Introduction to the Libraries 11: Standard Language Additions 12: Character Processing 13: String Processing 14: Memory Functions 15: Input/Output Facilities 16: Storage Allocation 17: Mathematical Functions 18: Time and Date Functions 19: Control Functions 20: Miscellaneous Functions A: The ASCII Character Set B: Syntax of the C Language C: Answers to the Exercises

rawabstract:
This best-selling, authoritative reference manual provides a complete description of the C language, the run-time libraries, and a style of C programming that emphasizes correctness, portability, and maintainability. Describing the C language more clearly and in more detail than any other book, authors Samuel P. Harbison and Guy L. Steele Jr. provide in a single manual: Standard C --- the ANSI/ISO standard now supported by all new C compilers; Traditional C --- common practice for twenty years, with millions of lines of code in use every day and the complete Standard and Traditional C run-time libraries. Thoroughly revised and updated, the Fourth Edition adds two important developments: the ANSI/ISO description has been updated with ISO C Amendment 1 (1994), which adds new facilities for writing portable international programs and each language chapter now discusses C++ compatibility, so you can write C programs that will be maximally portable and reusable in C and C++ environments --- an important consideration for software developers.

rawTOC:
1: Introduction \\ 2: Lexical Elements \\ 3: The C Preprocessor \\ 4: Declarations \\ 5: Types \\ 6: Conversions and Representations \\ 7: Expressions \\ 8: Statements \\ 9: Functions \\ 10: Introduction to the Libraries \\ 11: Standard Language Additions \\ 12: Character Processing \\ 13: String Processing \\ 14: Memory Functions \\ 15: Input/Output Facilities \\ 16: Storage Allocation \\ 17: Mathematical Functions \\ 18: Time and Date Functions \\ 19: Control Functions \\ 20: Miscellaneous Functions \\ A: The ASCII Character Set \\ B: Syntax of the C Language \\ C: Answers to the Exercises

entry:
@Book{Harbison:1995:CRM,
  author =       "Samuel P. Harbison and Guy L. {Steele Jr.}",
  title =        "{C} --- a Reference Manual",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Fourth",
  pages =        "xx + 455",
  year =         "1995",
  ISBN =         "0-13-326232-4 (hardcover), 0-13-326224-3 (paperback)",
  ISBN-13 =      "978-0-13-326232-2 (hardcover), 978-0-13-326224-7
                 (paperback)",
  LCCN =         "QA76.73.C15 H38 1995",
  bibdate =      "Mon Feb 20 17:04:05 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$33.95",
  abstract =     "This best-selling, authoritative reference manual
                 provides a complete description of the C language, the
                 run-time libraries, and a style of C programming that
                 emphasizes correctness, portability, and
                 maintainability. Describing the C language more clearly
                 and in more detail than any other book, authors Samuel
                 P. Harbison and Guy L. Steele Jr. provide in a single
                 manual: Standard C --- the ANSI/ISO standard now
                 supported by all new C compilers; Traditional C ---
                 common practice for twenty years, with millions of
                 lines of code in use every day and the complete
                 Standard and Traditional C run-time libraries.
                 Thoroughly revised and updated, the Fourth Edition adds
                 two important developments: the ANSI/ISO description
                 has been updated with ISO C Amendment 1 (1994), which
                 adds new facilities for writing portable international
                 programs and each language chapter now discusses C++
                 compatibility, so you can write C programs that will be
                 maximally portable and reusable in C and C++
                 environments --- an important consideration for
                 software developers.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction \\
                 2: Lexical Elements \\
                 3: The C Preprocessor \\
                 4: Declarations \\
                 5: Types \\
                 6: Conversions and Representations \\
                 7: Expressions \\
                 8: Statements \\
                 9: Functions \\
                 10: Introduction to the Libraries \\
                 11: Standard Language Additions \\
                 12: Character Processing \\
                 13: String Processing \\
                 14: Memory Functions \\
                 15: Input/Output Facilities \\
                 16: Storage Allocation \\
                 17: Mathematical Functions \\
                 18: Time and Date Functions \\
                 19: Control Functions \\
                 20: Miscellaneous Functions \\
                 A: The ASCII Character Set \\
                 B: Syntax of the C Language \\
                 C: Answers to the Exercises",
}


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",
}


