# bibtab

bibtype: book
filename: master.bib
label: Sedgewick:1993:AM
author: Robert Sedgewick
title: Algorithms in Modula-3
publisher: pub-AW
address: pub-AW:adr
pages: xiv + 656
year: 1993
ISBN: 0-201-53351-0 OR 0201533510
ISBN13: 978-0-201-53351-4 OR 9780201533514
LCCN: QA76.73.M63 S43 1993
bibdate: Mon Jan 3 12:10:05 1994
bibtimestamp: 1994.01.03 12:10:05 ???
acknowledgement: ack-nhfb
rawauthor: Robert Sedgewick
rawtitle: Algorithms in {Modula-3}
TOC:
1: Introduction 2: Modula-3 3: Elementary Data Structures 4: Trees 5: Recursion 6: Analysis of Algorithms 7: Implementation of Algorithms 8: Elementary Sorting Methods 9: Quicksort 10: Radix Sorting 11: Priority Queues 12: Mergesort 13: External Sorting 14: Elementary Searching Methods 15: Balanced Trees 16: Hashing 17: Radix Searching 18: External Searching 19: String Searching 20: Pattern Matching 21: Parsing 22: File Compression 23: Cryptology 24: Elementary Geometric Methods 25: Finding the Convex Hull 26: Range Searching 27: Geometric Intersection 28: Closest-Point Problems 29: Elementary Graph Algorithms 30: Connectivity 31: Weighted Graphs 32: Directed Graphs 33: Network Flow 34: Matching 35: Random Numbers 36: Arithmetic 37: Gaussian Elimination 38: Curve Fitting 39: Integration 40: Parallel Algorithms 41: The Fast Fourier Transform 42: Dynamic Programming 43: Linear Programming 44: Exhaustive Search 45: NP-Complete Problems

rawTOC:
1: Introduction \\ 2: Modula-3 \\ 3: Elementary Data Structures \\ 4: Trees \\ 5: Recursion \\ 6: Analysis of Algorithms \\ 7: Implementation of Algorithms \\ 8: Elementary Sorting Methods \\ 9: Quicksort \\ 10: Radix Sorting \\ 11: Priority Queues \\ 12: Mergesort \\ 13: External Sorting \\ 14: Elementary Searching Methods \\ 15: Balanced Trees \\ 16: Hashing \\ 17: Radix Searching \\ 18: External Searching \\ 19: String Searching \\ 20: Pattern Matching \\ 21: Parsing \\ 22: File Compression \\ 23: Cryptology \\ 24: Elementary Geometric Methods \\ 25: Finding the Convex Hull \\ 26: Range Searching \\ 27: Geometric Intersection \\ 28: Closest-Point Problems \\ 29: Elementary Graph Algorithms \\ 30: Connectivity \\ 31: Weighted Graphs \\ 32: Directed Graphs \\ 33: Network Flow \\ 34: Matching \\ 35: Random Numbers \\ 36: Arithmetic \\ 37: Gaussian Elimination \\ 38: Curve Fitting \\ 39: Integration \\ 40: Parallel Algorithms \\ 41: The Fast Fourier Transform \\ 42: Dynamic Programming \\ 43: Linear Programming \\ 44: Exhaustive Search \\ 45: NP-Complete Problems

entry:
@Book{Sedgewick:1993:AM,
  author =       "Robert Sedgewick",
  title =        "Algorithms in {Modula-3}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiv + 656",
  year =         "1993",
  ISBN =         "0-201-53351-0",
  ISBN-13 =      "978-0-201-53351-4",
  LCCN =         "QA76.73.M63 S43 1993",
  bibdate =      "Mon Jan 3 12:10:05 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "1: Introduction \\
                 2: Modula-3 \\
                 3: Elementary Data Structures \\
                 4: Trees \\
                 5: Recursion \\
                 6: Analysis of Algorithms \\
                 7: Implementation of Algorithms \\
                 8: Elementary Sorting Methods \\
                 9: Quicksort \\
                 10: Radix Sorting \\
                 11: Priority Queues \\
                 12: Mergesort \\
                 13: External Sorting \\
                 14: Elementary Searching Methods \\
                 15: Balanced Trees \\
                 16: Hashing \\
                 17: Radix Searching \\
                 18: External Searching \\
                 19: String Searching \\
                 20: Pattern Matching \\
                 21: Parsing \\
                 22: File Compression \\
                 23: Cryptology \\
                 24: Elementary Geometric Methods \\
                 25: Finding the Convex Hull \\
                 26: Range Searching \\
                 27: Geometric Intersection \\
                 28: Closest-Point Problems \\
                 29: Elementary Graph Algorithms \\
                 30: Connectivity \\
                 31: Weighted Graphs \\
                 32: Directed Graphs \\
                 33: Network Flow \\
                 34: Matching \\
                 35: Random Numbers \\
                 36: Arithmetic \\
                 37: Gaussian Elimination \\
                 38: Curve Fitting \\
                 39: Integration \\
                 40: Parallel Algorithms \\
                 41: The Fast Fourier Transform \\
                 42: Dynamic Programming \\
                 43: Linear Programming \\
                 44: Exhaustive Search \\
                 45: NP-Complete Problems",
}


bibtype: book
filename: master.bib
label: Sedgewick:1998:ACP
author: Robert Sedgewick
title: Algorithms in C: Parts 1--4: Fundamentals, data structures, sorting, searching
publisher: pub-AW
address: pub-AW:adr
pages: xvii + 702
year: 1998
ISBN: 0-201-31452-5 (paperback) OR 0201314525 (paperback)
ISBN13: 978-0-201-31452-6 (paperback) OR 9780201314526 (paperback)
LCCN: QA76.73.C15 S43 1998
bibdate: Tue Aug 25 17:20:35 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.08.25 17:20:35 ???
acknowledgement: ack-nhfb
rawauthor: Robert Sedgewick
rawtitle: Algorithms in {C}: Parts 1--4: Fundamentals, data structures, sorting, searching
shortTOC: Part 1: Fundamentals Part 2: Data structures Part 3: Sorting Part 4: Searching
rawshortTOC: Part 1: Fundamentals \\ Part 2: Data structures \\ Part 3: Sorting \\ Part 4: Searching
abstract:
Robert Sedgewick has thoroughly rewritten and substantially expanded his popular work to provide current and comprehensive coverage of important algorithms and data structures. Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers! Whether you are a student learning the algorithms for the first time or a professional interested in having up-to-date reference material, you will find a wealth of useful information in this book.

TOC:
Fundamentals 1. Introduction / 3 1.1 Algorithms / 4 1.2 A Sample Problem--Connectivity / 6 1.3 Union-Find Algorithms / 11 1.4 Perspective / 22 1.5 Summary of Topics / 23 2. Principles of Algorithm Analysis / 27 2.1 Implementation and Empirical Analysis / 28 2.2 Analysis of Algorithms / 33 2.3 Growth of Functions / 36 2.4 Big-Oh notation / 44 2.5 Basic Recurrences / 49 2.6 Examples of Algorithm Analysis / 53 2.7 Guarantees, Predictions, and Limitations / 60 Data Structures 3. Elementary Data Structures / 69 3.1 Building Blocks / 70 3.2 Arrays / 83 3.3 Linked Lists / 90 3.4 Elementary List Processing / 96 3.5 Memory Allocation for Lists / 105 3.6 Strings / 108 3.7 Compound Data Structures / 115 4. Abstract Data Types / 127 4.1 Abstract Objects and Collections of Objects / 131 4.2 Pushdown Stack ADT / 135 4.3 Examples of Stack ADT Clients / 138 4.4 Stack ADT Implementations / 145 4.5 Creation of a New ADT / 149 4.6 FIFO Queues and Generalized Queues / 153 4.7 Duplicate and Index Items / 161 4.8 First-Class ADTs / 166 4.9 Application-Based ADT Example / 179 4.10 Perspective / 185 5. Recursion and Trees / 187 5.1 Recursive Algorithms / 188 5.2 Divide and Conquer / 196 5.3 Dynamic Programming / 209 5.4 Trees / 217 5.5 Mathematical Properties of Trees / 226 5.6 Tree Traversal / 230 5.7 Recursive Binary-Tree Algorithms / 236 5.8 Graph Traversal / 241 5.9 Perspective / 248 6. Elementary Sorting Methods / 253 6.1 Rules of the Game / 255 6.2 Selection Sort / 261 6.3 Insertion Sort / 262 6.4 Bubble Sort / 265 6.5 Performance Characteristics of Elementary Sorts / 267 6.6 Shellsort / 273 6.7 Sorting Other Types of Data / 282 6.8 Index and Pointer Sorting / 287 6.9 Sorting Linked Lists / 295 6.10 Key-Indexed Counting / 298 7. Quicksort / 303 7.1 The Basic Algorithm / 304 7.2 Performance Characteristics of Quicksort / 309 7.3 Stack Size / 313 7.4 Small Subfiles / 316 7.5 Median-of-Three Partitioning / 319 7.6 Duplicate Keys / 324 7.7 Strings and Vectors / 327 7.8 Selection / 329 8. Mergesort / 335 8.1 Two-Way Merging / 336 8.2 Abstract In-place Merge / 339 8.3 Top-Down Mergesort / 341 8.4 Improvements to the Basic Algorithm / 344 8.5 Bottom-Up Mergesort / 347 8.6 Performance Characteristics of Mergesort / 351 8.7 Linked-List Implementations of Mergesort / 354 8.8 Recursion Revisited / 357 9. Priority Queues and Heapsort / 361 9.1 Elementary Implementations / 365 9.2 Heap Data Structure / 369 9.3 Algorithms on Heaps / 371 9.4 Heapsort / 377 9.5 Priority-Queue ADT / 384 9.6 Priority Queues for Index Items / 389 9.7 Binomial Queues / 392 10. Radix Sorting / 403 10.1 Bits, Bytes, and Words / 405 10.2 Binary Quicksort / 409 10.3 MSD Radix Sort / 413 10.4 Three-Way Radix Quicksort / 421 10.5 LSD Radix Sort / 425 10.6 Performance Characteristics of Radix Sorts / 429 10.7 Sublinear-Time Sorts / 433 11. Special-Purpose Sorts / 439 11.1 Batcher's Odd-Even Mergesort / 441 11.2 Sorting Networks / 446 11.3 External Sorting / 454 11.4 Sort-Merge Implementations / 460 11.5 Parallel Sort/Merge / 467 Searching 12. Symbol Tables and BSTs / 477 12.1 Symbol-Table Abstract Data Type / 479 12.2 Key-Indexed Search / 485 12.3 Sequential Search / 489 12.4 Binary Search / 497 12.5 Binary Search Trees (BSTs) / 502 12.6 Performance Characteristics of BSTs / 508 12.7 Index Implementations with Symbol Tables / 511 12.8 Insertion at the Root in BSTs / 516 12.9 BST Implementations of Other ADT Functions / 520 13. Balanced Trees / 529 13.1 Randomized BSTs / 533 13.2 Splay BSTs / 540 13.3 Top-Down 2-3-4 Trees / 546 13.4 Red-Black Trees / 551 13.5 Skip Lists / 561 13.6 Performance Characteristics / 569 14. Hashing / 573 14.1 Hash Functions / 574 14.2 Separate Chaining / 583 14.3 Linear Probing / 588 14.4 Double Hashing / 594 14.5 Dynamic Hash Tables / 599 14.6 Perspective / 603 15. Radix Search / 609 15.1 Digital Search Trees / 610 15.2 Tries / 614 15.3 Patricia Tries / 623 15.4 Multiway Tries and TSTs / 632 15.5 Text String Index Applications / 649 16. External Searching / 655 16.1 Rules of the Game / 657 16.2 Indexed Sequential Access / 660 16.3 B Trees / 662 16.4 Extendible Hashing / 676 16.5 Perspective / 689 Index / 693

rawabstract:
Robert Sedgewick has thoroughly rewritten and substantially expanded his popular work to provide current and comprehensive coverage of important algorithms and data structures. Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers! Whether you are a student learning the algorithms for the first time or a professional interested in having up-to-date reference material, you will find a wealth of useful information in this book.

rawTOC:
Fundamentals \\ 1. Introduction / 3 \\ 1.1 Algorithms / 4 \\ 1.2 A Sample Problem--Connectivity / 6 \\ 1.3 Union-Find Algorithms / 11 \\ 1.4 Perspective / 22 \\ 1.5 Summary of Topics / 23 \\ 2. Principles of Algorithm Analysis / 27 \\ 2.1 Implementation and Empirical Analysis / 28 \\ 2.2 Analysis of Algorithms / 33 \\ 2.3 Growth of Functions / 36 \\ 2.4 Big-Oh notation / 44 \\ 2.5 Basic Recurrences / 49 \\ 2.6 Examples of Algorithm Analysis / 53 \\ 2.7 Guarantees, Predictions, and Limitations / 60 \\ Data Structures \\ 3. Elementary Data Structures / 69 \\ 3.1 Building Blocks / 70 \\ 3.2 Arrays / 83 \\ 3.3 Linked Lists / 90 \\ 3.4 Elementary List Processing / 96 \\ 3.5 Memory Allocation for Lists / 105 \\ 3.6 Strings / 108 \\ 3.7 Compound Data Structures / 115 \\ 4. Abstract Data Types / 127 \\ 4.1 Abstract Objects and Collections of Objects / 131 \\ 4.2 Pushdown Stack ADT / 135 \\ 4.3 Examples of Stack ADT Clients / 138 \\ 4.4 Stack ADT Implementations / 145 \\ 4.5 Creation of a New ADT / 149 \\ 4.6 FIFO Queues and Generalized Queues / 153 \\ 4.7 Duplicate and Index Items / 161 \\ 4.8 First-Class ADTs / 166 \\ 4.9 Application-Based ADT Example / 179 \\ 4.10 Perspective / 185 \\ 5. Recursion and Trees / 187 \\ 5.1 Recursive Algorithms / 188 \\ 5.2 Divide and Conquer / 196 \\ 5.3 Dynamic Programming / 209 \\ 5.4 Trees / 217 \\ 5.5 Mathematical Properties of Trees / 226 \\ 5.6 Tree Traversal / 230 \\ 5.7 Recursive Binary-Tree Algorithms / 236 \\ 5.8 Graph Traversal / 241 \\ 5.9 Perspective / 248 \\ 6. Elementary Sorting Methods / 253 \\ 6.1 Rules of the Game / 255 \\ 6.2 Selection Sort / 261 \\ 6.3 Insertion Sort / 262 \\ 6.4 Bubble Sort / 265 \\ 6.5 Performance Characteristics of Elementary Sorts / 267 \\ 6.6 Shellsort / 273 \\ 6.7 Sorting Other Types of Data / 282 \\ 6.8 Index and Pointer Sorting / 287 \\ 6.9 Sorting Linked Lists / 295 \\ 6.10 Key-Indexed Counting / 298 \\ 7. Quicksort / 303 \\ 7.1 The Basic Algorithm / 304 \\ 7.2 Performance Characteristics of Quicksort / 309 \\ 7.3 Stack Size / 313 \\ 7.4 Small Subfiles / 316 \\ 7.5 Median-of-Three Partitioning / 319 \\ 7.6 Duplicate Keys / 324 \\ 7.7 Strings and Vectors / 327 \\ 7.8 Selection / 329 \\ 8. Mergesort / 335 \\ 8.1 Two-Way Merging / 336 \\ 8.2 Abstract In-place Merge / 339 \\ 8.3 Top-Down Mergesort / 341 \\ 8.4 Improvements to the Basic Algorithm / 344 \\ 8.5 Bottom-Up Mergesort / 347 \\ 8.6 Performance Characteristics of Mergesort / 351 \\ 8.7 Linked-List Implementations of Mergesort / 354 \\ 8.8 Recursion Revisited / 357 \\ 9. Priority Queues and Heapsort / 361 \\ 9.1 Elementary Implementations / 365 \\ 9.2 Heap Data Structure / 369 \\ 9.3 Algorithms on Heaps / 371 \\ 9.4 Heapsort / 377 \\ 9.5 Priority-Queue ADT / 384 \\ 9.6 Priority Queues for Index Items / 389 \\ 9.7 Binomial Queues / 392 \\ 10. Radix Sorting / 403 \\ 10.1 Bits, Bytes, and Words / 405 \\ 10.2 Binary Quicksort / 409 \\ 10.3 MSD Radix Sort / 413 \\ 10.4 Three-Way Radix Quicksort / 421 \\ 10.5 LSD Radix Sort / 425 \\ 10.6 Performance Characteristics of Radix Sorts / 429 \\ 10.7 Sublinear-Time Sorts / 433 \\ 11. Special-Purpose Sorts / 439 \\ 11.1 Batcher's Odd-Even Mergesort / 441 \\ 11.2 Sorting Networks / 446 \\ 11.3 External Sorting / 454 \\ 11.4 Sort-Merge Implementations / 460 \\ 11.5 Parallel Sort/Merge / 467 \\ Searching \\ 12. Symbol Tables and BSTs / 477 \\ 12.1 Symbol-Table Abstract Data Type / 479 \\ 12.2 Key-Indexed Search / 485 \\ 12.3 Sequential Search / 489 \\ 12.4 Binary Search / 497 \\ 12.5 Binary Search Trees (BSTs) / 502 \\ 12.6 Performance Characteristics of BSTs / 508 \\ 12.7 Index Implementations with Symbol Tables / 511 \\ 12.8 Insertion at the Root in BSTs / 516 \\ 12.9 BST Implementations of Other ADT Functions / 520 \\ 13. Balanced Trees / 529 \\ 13.1 Randomized BSTs / 533 \\ 13.2 Splay BSTs / 540 \\ 13.3 Top-Down 2-3-4 Trees / 546 \\ 13.4 Red-Black Trees / 551 \\ 13.5 Skip Lists / 561 \\ 13.6 Performance Characteristics / 569 \\ 14. Hashing / 573 \\ 14.1 Hash Functions / 574 \\ 14.2 Separate Chaining / 583 \\ 14.3 Linear Probing / 588 \\ 14.4 Double Hashing / 594 \\ 14.5 Dynamic Hash Tables / 599 \\ 14.6 Perspective / 603 \\ 15. Radix Search / 609 \\ 15.1 Digital Search Trees / 610 \\ 15.2 Tries / 614 \\ 15.3 Patricia Tries / 623 \\ 15.4 Multiway Tries and TSTs / 632 \\ 15.5 Text String Index Applications / 649 \\ 16. External Searching / 655 \\ 16.1 Rules of the Game / 657 \\ 16.2 Indexed Sequential Access / 660 \\ 16.3 B Trees / 662 \\ 16.4 Extendible Hashing / 676 \\ 16.5 Perspective / 689 \\ Index / 693

entry:
@Book{Sedgewick:1998:ACP,
  author =       "Robert Sedgewick",
  title =        "Algorithms in {C}: Parts 1--4: Fundamentals, data
                 structures, sorting, searching",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xvii + 702",
  year =         "1998",
  ISBN =         "0-201-31452-5 (paperback)",
  ISBN-13 =      "978-0-201-31452-6 (paperback)",
  LCCN =         "QA76.73.C15 S43 1998",
  bibdate =      "Tue Aug 25 17:20:35 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$33.50",
  abstract =     "Robert Sedgewick has thoroughly rewritten and
                 substantially expanded his popular work to provide
                 current and comprehensive coverage of important
                 algorithms and data structures. Many new algorithms are
                 presented, and the explanations of each algorithm are
                 much more detailed than in previous editions. A new
                 text design and detailed, innovative figures, with
                 accompanying commentary, greatly enhance the
                 presentation. The third edition retains the successful
                 blend of theory and practice that has made Sedgewick's
                 work an invaluable resource for more than 250,000
                 programmers! Whether you are a student learning the
                 algorithms for the first time or a professional
                 interested in having up-to-date reference material, you
                 will find a wealth of useful information in this
                 book.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Part 1: Fundamentals \\
                 Part 2: Data structures \\
                 Part 3: Sorting \\
                 Part 4: Searching",
  tableofcontents = "Fundamentals \\
                 1. Introduction / 3 \\
                 1.1 Algorithms / 4 \\
                 1.2 A Sample Problem--Connectivity / 6 \\
                 1.3 Union-Find Algorithms / 11 \\
                 1.4 Perspective / 22 \\
                 1.5 Summary of Topics / 23 \\
                 2. Principles of Algorithm Analysis / 27 \\
                 2.1 Implementation and Empirical Analysis / 28 \\
                 2.2 Analysis of Algorithms / 33 \\
                 2.3 Growth of Functions / 36 \\
                 2.4 Big-Oh notation / 44 \\
                 2.5 Basic Recurrences / 49 \\
                 2.6 Examples of Algorithm Analysis / 53 \\
                 2.7 Guarantees, Predictions, and Limitations / 60 \\
                 Data Structures \\
                 3. Elementary Data Structures / 69 \\
                 3.1 Building Blocks / 70 \\
                 3.2 Arrays / 83 \\
                 3.3 Linked Lists / 90 \\
                 3.4 Elementary List Processing / 96 \\
                 3.5 Memory Allocation for Lists / 105 \\
                 3.6 Strings / 108 \\
                 3.7 Compound Data Structures / 115 \\
                 4. Abstract Data Types / 127 \\
                 4.1 Abstract Objects and Collections of Objects / 131
                 \\
                 4.2 Pushdown Stack ADT / 135 \\
                 4.3 Examples of Stack ADT Clients / 138 \\
                 4.4 Stack ADT Implementations / 145 \\
                 4.5 Creation of a New ADT / 149 \\
                 4.6 FIFO Queues and Generalized Queues / 153 \\
                 4.7 Duplicate and Index Items / 161 \\
                 4.8 First-Class ADTs / 166 \\
                 4.9 Application-Based ADT Example / 179 \\
                 4.10 Perspective / 185 \\
                 5. Recursion and Trees / 187 \\
                 5.1 Recursive Algorithms / 188 \\
                 5.2 Divide and Conquer / 196 \\
                 5.3 Dynamic Programming / 209 \\
                 5.4 Trees / 217 \\
                 5.5 Mathematical Properties of Trees / 226 \\
                 5.6 Tree Traversal / 230 \\
                 5.7 Recursive Binary-Tree Algorithms / 236 \\
                 5.8 Graph Traversal / 241 \\
                 5.9 Perspective / 248 \\
                 6. Elementary Sorting Methods / 253 \\
                 6.1 Rules of the Game / 255 \\
                 6.2 Selection Sort / 261 \\
                 6.3 Insertion Sort / 262 \\
                 6.4 Bubble Sort / 265 \\
                 6.5 Performance Characteristics of Elementary Sorts /
                 267 \\
                 6.6 Shellsort / 273 \\
                 6.7 Sorting Other Types of Data / 282 \\
                 6.8 Index and Pointer Sorting / 287 \\
                 6.9 Sorting Linked Lists / 295 \\
                 6.10 Key-Indexed Counting / 298 \\
                 7. Quicksort / 303 \\
                 7.1 The Basic Algorithm / 304 \\
                 7.2 Performance Characteristics of Quicksort / 309 \\
                 7.3 Stack Size / 313 \\
                 7.4 Small Subfiles / 316 \\
                 7.5 Median-of-Three Partitioning / 319 \\
                 7.6 Duplicate Keys / 324 \\
                 7.7 Strings and Vectors / 327 \\
                 7.8 Selection / 329 \\
                 8. Mergesort / 335 \\
                 8.1 Two-Way Merging / 336 \\
                 8.2 Abstract In-place Merge / 339 \\
                 8.3 Top-Down Mergesort / 341 \\
                 8.4 Improvements to the Basic Algorithm / 344 \\
                 8.5 Bottom-Up Mergesort / 347 \\
                 8.6 Performance Characteristics of Mergesort / 351 \\
                 8.7 Linked-List Implementations of Mergesort / 354 \\
                 8.8 Recursion Revisited / 357 \\
                 9. Priority Queues and Heapsort / 361 \\
                 9.1 Elementary Implementations / 365 \\
                 9.2 Heap Data Structure / 369 \\
                 9.3 Algorithms on Heaps / 371 \\
                 9.4 Heapsort / 377 \\
                 9.5 Priority-Queue ADT / 384 \\
                 9.6 Priority Queues for Index Items / 389 \\
                 9.7 Binomial Queues / 392 \\
                 10. Radix Sorting / 403 \\
                 10.1 Bits, Bytes, and Words / 405 \\
                 10.2 Binary Quicksort / 409 \\
                 10.3 MSD Radix Sort / 413 \\
                 10.4 Three-Way Radix Quicksort / 421 \\
                 10.5 LSD Radix Sort / 425 \\
                 10.6 Performance Characteristics of Radix Sorts / 429
                 \\
                 10.7 Sublinear-Time Sorts / 433 \\
                 11. Special-Purpose Sorts / 439 \\
                 11.1 Batcher's Odd-Even Mergesort / 441 \\
                 11.2 Sorting Networks / 446 \\
                 11.3 External Sorting / 454 \\
                 11.4 Sort-Merge Implementations / 460 \\
                 11.5 Parallel Sort/Merge / 467 \\
                 Searching \\
                 12. Symbol Tables and BSTs / 477 \\
                 12.1 Symbol-Table Abstract Data Type / 479 \\
                 12.2 Key-Indexed Search / 485 \\
                 12.3 Sequential Search / 489 \\
                 12.4 Binary Search / 497 \\
                 12.5 Binary Search Trees (BSTs) / 502 \\
                 12.6 Performance Characteristics of BSTs / 508 \\
                 12.7 Index Implementations with Symbol Tables / 511 \\
                 12.8 Insertion at the Root in BSTs / 516 \\
                 12.9 BST Implementations of Other ADT Functions / 520
                 \\
                 13. Balanced Trees / 529 \\
                 13.1 Randomized BSTs / 533 \\
                 13.2 Splay BSTs / 540 \\
                 13.3 Top-Down 2-3-4 Trees / 546 \\
                 13.4 Red-Black Trees / 551 \\
                 13.5 Skip Lists / 561 \\
                 13.6 Performance Characteristics / 569 \\
                 14. Hashing / 573 \\
                 14.1 Hash Functions / 574 \\
                 14.2 Separate Chaining / 583 \\
                 14.3 Linear Probing / 588 \\
                 14.4 Double Hashing / 594 \\
                 14.5 Dynamic Hash Tables / 599 \\
                 14.6 Perspective / 603 \\
                 15. Radix Search / 609 \\
                 15.1 Digital Search Trees / 610 \\
                 15.2 Tries / 614 \\
                 15.3 Patricia Tries / 623 \\
                 15.4 Multiway Tries and TSTs / 632 \\
                 15.5 Text String Index Applications / 649 \\
                 16. External Searching / 655 \\
                 16.1 Rules of the Game / 657 \\
                 16.2 Indexed Sequential Access / 660 \\
                 16.3 B Trees / 662 \\
                 16.4 Extendible Hashing / 676 \\
                 16.5 Perspective / 689 \\
                 Index / 693",
}


bibtype: book
filename: master.bib
label: Sedgewick:2002:ACP
author: Robert Sedgewick
title: Algorithms in C: Part 5: Graph algorithms
publisher: pub-AW
address: pub-AW:adr
pages: xiii + 482
year: 2002
ISBN: 0-201-31663-3 (paperback) OR 0201316633 (paperback)
ISBN13: 978-0-201-31663-6 (paperback) OR 9780201316636 (paperback)
LCCN: QA76.73.C15 S43 2002
bibdate: Sat May 11 09:27:02 2002
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2002.05.11 09:27:02 ???
acknowledgement: ack-nhfb
rawauthor: Robert Sedgewick
rawtitle: Algorithms in {C}: Part 5: Graph algorithms
abstract:
Once again, Robert Sedgewick provides a current and comprehensive introduction to important algorithms. The focus this time is on graph algorithms, which are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In this book, Sedgewick offers the same successful blend of theory and practice with concise implementations that can be tested on real applications, which has made his work popular with programmers for many years. booktitle Algorithms in C, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewick's thoroughly revised and rewritten series. The first book, Parts 1--4, addresses fundamental algorithms, data structures, sorting, and searching. A forthcoming third book will focus on strings, geometry, and a range of advanced algorithms. Each book's expanded coverage features new algorithms and implementations, enhanced descriptions and diagrams, and a wealth of new exercises for polishing skills. A focus on abstract data types makes the programs more broadly useful and relevant for the modern object-oriented programming environment. Coverage includes: A complete overview of graph properties and types Diagraphs and DAGs Minimum spanning trees Shortest paths Network flows Diagrams, sample C code, and detailed algorithm descriptions The Web site for this book (http://www.cs.princeton.edu/~rs/) provides additional source code for programmers along with numerous support materials for educators. A landmark revision, booktitle Algorithms in C, Third Edition, Part 5 provides a complete tool set for programmers to implement, debug, and use graph algorithms across a wide range of computer applications.

TOC:
17: Graph Properties and Types / 3 17.2: Graph ADT / 16 17.3: Adjacency-Matrix Representation / 21 17.4: Adjacency-Lists Representation / 27 17.5: Variations, Extensions, and Costs / 31 17.6: Graph Generators / 40 17.7: Simple, Euler, and Hamilton Paths / 50 17.8: Graph-Processing Problems / 64 18: Graph Search / 75 18.1: Exploring a Maze / 76 18.2: Depth-First Search / 81 18.3: Graph-Search ADT Functions / 86 18.4: Properties of DFS Forests / 91 18.5: DFS Algorithms / 99 18.6: Separability and Biconnectivity / 106 18.7: Breadth-First Search / 114 18.8: Generalized Graph Search / 124 18.9: Analysis of Graph Algorithms / 133 19: Digraphs and DAGs / 141 19.1: Glossary and Rules of the Game / 144 19.2: Anatomy of DFS in Digraphs / 152 19.3: Reachability and Transitive Closure / 161 19.4: Equivalence Relations and Partial Orders / 174 19.5: DAGs / 178 19.6: Topological Sorting / 183 19.7: Reachability in DAGs / 193 19.8: Strong Components in Digraphs / 196 19.9: Transitive Closure Revisited / 208 19.10: Perspective / 212 20: Minimum Spanning Trees / 219 20.1: Representations / 222 20.2: Underlying Principles of MST Algorithms / 228 20.3: Prim's Algorithm and Priority-First Search / 235 20.4: Kruskal's Algorithm / 246 20.5: Boruvka's Algorithm / 252 20.6: Comparisons and Improvements / 255 20.7: Euclidean MST / 261 21: Shortest Paths / 265 21.1: Underlying Principles / 273 21.2: Dijkstra's algorithm / 280 21.3: All-Pairs Shortest Paths / 290 21.4: Shortest Paths in Acyclic Networks / 300 21.5: Euclidean Networks / 308 21.6: Reduction / 314 21.7: Negative Weights / 331 21.8: Perspective / 350 22: Network Flows / 353 22.1: Flow Networks / 359 22.2: Augmenting-Path Maxflow Algorithms / 370 22.3: Preflow-Push Maxflow Algorithms / 396 22.4: Maxflow Reductions / 411 22.5: Mincost Flows / 429 22.6: Network Simplex Algorithm / 439 22.7: Mincost-Flow Reductions / 457 22.8: Perspective / 467 References for Part Five / 473 Index / 475

rawabstract:
Once again, Robert Sedgewick provides a current and comprehensive introduction to important algorithms. The focus this time is on graph algorithms, which are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In this book, Sedgewick offers the same successful blend of theory and practice with concise implementations that can be tested on real applications, which has made his work popular with programmers for many years. \booktitle{Algorithms in C}, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewick's thoroughly revised and rewritten series. The first book, Parts 1--4, addresses fundamental algorithms, data structures, sorting, and searching. A forthcoming third book will focus on strings, geometry, and a range of advanced algorithms. Each book's expanded coverage features new algorithms and implementations, enhanced descriptions and diagrams, and a wealth of new exercises for polishing skills. A focus on abstract data types makes the programs more broadly useful and relevant for the modern object-oriented programming environment. Coverage includes: A complete overview of graph properties and types Diagraphs and DAGs Minimum spanning trees Shortest paths Network flows Diagrams, sample C code, and detailed algorithm descriptions The Web site for this book (http://www.cs.princeton.edu/~rs/) provides additional source code for programmers along with numerous support materials for educators. A landmark revision, \booktitle{Algorithms in C}, Third Edition, Part 5 provides a complete tool set for programmers to implement, debug, and use graph algorithms across a wide range of computer applications.

rawTOC:
17: Graph Properties and Types / 3 \\ 17.2: Graph ADT / 16 \\ 17.3: Adjacency-Matrix Representation / 21 \\ 17.4: Adjacency-Lists Representation / 27 \\ 17.5: Variations, Extensions, and Costs / 31 \\ 17.6: Graph Generators / 40 \\ 17.7: Simple, Euler, and Hamilton Paths / 50 \\ 17.8: Graph-Processing Problems / 64 \\ 18: Graph Search / 75 \\ 18.1: Exploring a Maze / 76 \\ 18.2: Depth-First Search / 81 \\ 18.3: Graph-Search ADT Functions / 86 \\ 18.4: Properties of DFS Forests / 91 \\ 18.5: DFS Algorithms / 99 \\ 18.6: Separability and Biconnectivity / 106 \\ 18.7: Breadth-First Search / 114 \\ 18.8: Generalized Graph Search / 124 \\ 18.9: Analysis of Graph Algorithms / 133 \\ 19: Digraphs and DAGs / 141 \\ 19.1: Glossary and Rules of the Game / 144 \\ 19.2: Anatomy of DFS in Digraphs / 152 \\ 19.3: Reachability and Transitive Closure / 161 \\ 19.4: Equivalence Relations and Partial Orders / 174 \\ 19.5: DAGs / 178 \\ 19.6: Topological Sorting / 183 \\ 19.7: Reachability in DAGs / 193 \\ 19.8: Strong Components in Digraphs / 196 \\ 19.9: Transitive Closure Revisited / 208 \\ 19.10: Perspective / 212 \\ 20: Minimum Spanning Trees / 219 \\ 20.1: Representations / 222 \\ 20.2: Underlying Principles of MST Algorithms / 228 \\ 20.3: Prim's Algorithm and Priority-First Search / 235 \\ 20.4: Kruskal's Algorithm / 246 \\ 20.5: Boruvka's Algorithm / 252 \\ 20.6: Comparisons and Improvements / 255 \\ 20.7: Euclidean MST / 261 \\ 21: Shortest Paths / 265 \\ 21.1: Underlying Principles / 273 \\ 21.2: Dijkstra's algorithm / 280 \\ 21.3: All-Pairs Shortest Paths / 290 \\ 21.4: Shortest Paths in Acyclic Networks / 300 \\ 21.5: Euclidean Networks / 308 \\ 21.6: Reduction / 314 \\ 21.7: Negative Weights / 331 \\ 21.8: Perspective / 350 \\ 22: Network Flows / 353 \\ 22.1: Flow Networks / 359 \\ 22.2: Augmenting-Path Maxflow Algorithms / 370 \\ 22.3: Preflow-Push Maxflow Algorithms / 396 \\ 22.4: Maxflow Reductions / 411 \\ 22.5: Mincost Flows / 429 \\ 22.6: Network Simplex Algorithm / 439 \\ 22.7: Mincost-Flow Reductions / 457 \\ 22.8: Perspective / 467 \\ References for Part Five / 473 \\ Index / 475

entry:
@Book{Sedgewick:2002:ACP,
  author =       "Robert Sedgewick",
  title =        "Algorithms in {C}: Part 5: Graph algorithms",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiii + 482",
  year =         "2002",
  ISBN =         "0-201-31663-3 (paperback)",
  ISBN-13 =      "978-0-201-31663-6 (paperback)",
  LCCN =         "QA76.73.C15 S43 2002",
  bibdate =      "Sat May 11 09:27:02 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$34.99",
  abstract =     "Once again, Robert Sedgewick provides a current and
                 comprehensive introduction to important algorithms. The
                 focus this time is on graph algorithms, which are
                 increasingly critical for a wide range of applications,
                 such as network connectivity, circuit design,
                 scheduling, transaction processing, and resource
                 allocation. In this book, Sedgewick offers the same
                 successful blend of theory and practice with concise
                 implementations that can be tested on real
                 applications, which has made his work popular with
                 programmers for many years. \booktitle{Algorithms in
                 C}, Third Edition, Part 5: Graph Algorithms is the
                 second book in Sedgewick's thoroughly revised and
                 rewritten series. The first book, Parts 1--4, addresses
                 fundamental algorithms, data structures, sorting, and
                 searching. A forthcoming third book will focus on
                 strings, geometry, and a range of advanced algorithms.
                 Each book's expanded coverage features new algorithms
                 and implementations, enhanced descriptions and
                 diagrams, and a wealth of new exercises for polishing
                 skills. A focus on abstract data types makes the
                 programs more broadly useful and relevant for the
                 modern object-oriented programming environment.
                 Coverage includes: A complete overview of graph
                 properties and types Diagraphs and DAGs Minimum
                 spanning trees Shortest paths Network flows Diagrams,
                 sample C code, and detailed algorithm descriptions The
                 Web site for this book
                 (http://www.cs.princeton.edu/~rs/) provides additional
                 source code for programmers along with numerous support
                 materials for educators. A landmark revision,
                 \booktitle{Algorithms in C}, Third Edition, Part 5
                 provides a complete tool set for programmers to
                 implement, debug, and use graph algorithms across a
                 wide range of computer applications.",
  acknowledgement = ack-nhfb,
  tableofcontents = "17: Graph Properties and Types / 3 \\
                 17.2: Graph ADT / 16 \\
                 17.3: Adjacency-Matrix Representation / 21 \\
                 17.4: Adjacency-Lists Representation / 27 \\
                 17.5: Variations, Extensions, and Costs / 31 \\
                 17.6: Graph Generators / 40 \\
                 17.7: Simple, Euler, and Hamilton Paths / 50 \\
                 17.8: Graph-Processing Problems / 64 \\
                 18: Graph Search / 75 \\
                 18.1: Exploring a Maze / 76 \\
                 18.2: Depth-First Search / 81 \\
                 18.3: Graph-Search ADT Functions / 86 \\
                 18.4: Properties of DFS Forests / 91 \\
                 18.5: DFS Algorithms / 99 \\
                 18.6: Separability and Biconnectivity / 106 \\
                 18.7: Breadth-First Search / 114 \\
                 18.8: Generalized Graph Search / 124 \\
                 18.9: Analysis of Graph Algorithms / 133 \\
                 19: Digraphs and DAGs / 141 \\
                 19.1: Glossary and Rules of the Game / 144 \\
                 19.2: Anatomy of DFS in Digraphs / 152 \\
                 19.3: Reachability and Transitive Closure / 161 \\
                 19.4: Equivalence Relations and Partial Orders / 174
                 \\
                 19.5: DAGs / 178 \\
                 19.6: Topological Sorting / 183 \\
                 19.7: Reachability in DAGs / 193 \\
                 19.8: Strong Components in Digraphs / 196 \\
                 19.9: Transitive Closure Revisited / 208 \\
                 19.10: Perspective / 212 \\
                 20: Minimum Spanning Trees / 219 \\
                 20.1: Representations / 222 \\
                 20.2: Underlying Principles of MST Algorithms / 228 \\
                 20.3: Prim's Algorithm and Priority-First Search / 235
                 \\
                 20.4: Kruskal's Algorithm / 246 \\
                 20.5: Boruvka's Algorithm / 252 \\
                 20.6: Comparisons and Improvements / 255 \\
                 20.7: Euclidean MST / 261 \\
                 21: Shortest Paths / 265 \\
                 21.1: Underlying Principles / 273 \\
                 21.2: Dijkstra's algorithm / 280 \\
                 21.3: All-Pairs Shortest Paths / 290 \\
                 21.4: Shortest Paths in Acyclic Networks / 300 \\
                 21.5: Euclidean Networks / 308 \\
                 21.6: Reduction / 314 \\
                 21.7: Negative Weights / 331 \\
                 21.8: Perspective / 350 \\
                 22: Network Flows / 353 \\
                 22.1: Flow Networks / 359 \\
                 22.2: Augmenting-Path Maxflow Algorithms / 370 \\
                 22.3: Preflow-Push Maxflow Algorithms / 396 \\
                 22.4: Maxflow Reductions / 411 \\
                 22.5: Mincost Flows / 429 \\
                 22.6: Network Simplex Algorithm / 439 \\
                 22.7: Mincost-Flow Reductions / 457 \\
                 22.8: Perspective / 467 \\
                 References for Part Five / 473 \\
                 Index / 475",
}


bibtype: book
filename: master.bib
label: Sedgewick:2011:A
author: Robert Sedgewick and Kevin Daniel Wayne
title: Algorithms
publisher: pub-AW
address: pub-AW:adr
edition: Fourth
pages: xii + 955
year: 2011
LCCN: QA76.9.A43 S429 2011
bibdate: Sat Nov 30 16:59:04 MST 2013
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2013.11.30 16:59:04 MST
URL: http://proquestcombo.safaribooksonline.com/9780132762571
subject: Computer algorithms; Textbooks
TOC: Fundamentals Sorting Searching Graphs Strings Context
acknowledgement: ack-nhfb
rawauthor: Robert Sedgewick and Kevin Daniel Wayne
rawtitle: Algorithms
rawTOC: Fundamentals \\ Sorting \\ Searching \\ Graphs \\ Strings \\ Context
ISBN:
0-13-276257-9, 0-321-57351-X (hardcover), 6-6130-0155-4 (e-book) OR 0132762579, 032157351X (hardcover), 6613001554 (ebook)

ISBN13:
978-0-13-276257-1, 978-0-321-57351-3 (hardcover), 978-6-6130-0155-9 (e-book) OR 9780132762571, 9780321573513 (hardcover), 9786613001559 (ebook)

entry:
@Book{Sedgewick:2011:A,
  author =       "Robert Sedgewick and Kevin Daniel Wayne",
  title =        "Algorithms",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Fourth",
  pages =        "xii + 955",
  year =         "2011",
  ISBN =         "0-13-276257-9, 0-321-57351-X (hardcover),
                 6-6130-0155-4 (e-book)",
  ISBN-13 =      "978-0-13-276257-1, 978-0-321-57351-3 (hardcover),
                 978-6-6130-0155-9 (e-book)",
  LCCN =         "QA76.9.A43 S429 2011",
  bibdate =      "Sat Nov 30 16:59:04 MST 2013",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://proquestcombo.safaribooksonline.com/9780132762571",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Computer algorithms; Textbooks",
  tableofcontents = "Fundamentals \\
                 Sorting \\
                 Searching \\
                 Graphs \\
                 Strings \\
                 Context",
}


bibtype: book
filename: master.bib
label: Segre:2007:FCS
author: Gino Segre
title: Faust in Copenhagen: a struggle for the soul of physics
publisher: pub-VIKING
address: pub-VIKING:adr
pages: x + 310
year: 2007
ISBN: 0-670-03858-X OR 067003858X
ISBN13: 978-0-670-03858-9 OR 9780670038589
LCCN: QC15 .S427 2007
bibdate: Tue Feb 12 15:11:07 MST 2008
bibtimestamp: 2008.02.12 15:11:07 MST
subject: Physicists; Psychology; Intellectual life; 20th century; Quantum theory; History
acknowledgement: ack-nhfb
rawauthor: Gino Segr{\`e}
rawtitle: {Faust} in {Copenhagen}: a struggle for the soul of physics
URL:
http://www.loc.gov/catdir/enhancements/fy0743/2006052807-b.html; http://www.loc.gov/catdir/enhancements/fy0743/2006052807-d.html

abstract:
Known to physicists as the ``miracle year,'' 1932 saw the discovery of the neutron and the first artificially induced nuclear transmutation. However, while physicists celebrated these momentous discoveries --- which presaged the era of big science and nuclear bombs --- Europe was moving inexorably toward totalitarianism and war. In April of that year, about forty of the world's leading physicists --- including Werner Heisenberg, Lise Meitner, and Paul Dirac --- came to Niels Bohr's Copenhagen Institute for their annual informal meeting about the frontiers of physics. Physicist Gino Segre brings to life this historic gathering, which ended with a humorous skit based on Goethe's Faust --- little knowing the Faustian bargains they would face in the near future. Capturing the interplay between the great scientists as well as the discoveries they discussed and debated, Segre evokes the moment when physics --- and the world --- was about to lose its innocence.

TOC:
1. Munich now and then 2. The changing times: The 1920s; The birth of the quantum; Why Copenhagen?; The meetings begin; The 1932 meeting 3. Goethe and Faust: In the glow of Goethe; The ``Copenhagen Faust'' 4. The front row: the old guard: Niels Bohr; Paul Ehrenfest; Lise Meitner The front row: the revolutionaries: Old age is a cold fever; Werner Heisenberg; Wolfgang Pauli; Paul Dirac; Classical mechanics versus quantum mechanics 6. The front row: the young ones: The curse of the Knabenphysik; Max Delbruck 7. The coming storm: The periodic table; The new Kepler; Gottingen in 1922; Triumph and crisis; The new optimism 8. The revolution begins: Helgoland; Another sleepless night; Waves or particles; Heinsenberg versus Schrodinger; Uncertainty and complementarity 9. The king in decline: The crucial Solvay Conference; Einstein --- the king 10. The great synthesis: Dirac's equation; How Max Delbruck joined Knabenphysik; Physics begins to split; Delbruck's choices 11. Conservation of energy: The mysteries of the nucleus; The barrier is too high; Heaven and earth; The revolutionary proposals; The three young geniuses each write a book 12. The new generation comes of age: The apprenticeship; Copenhagen 1932; The ``Blegdamsvej Faust'' Delbruck's dilemma 13. The miracle year: The discovery of the neutron; Copenhagen and the neutron; The miracle year; Big science is born; The hammer and the needle 14. Ehrenfest's end Epilogue, Or what happened afterward to the Front Row's other six: How Meitner discovered nuclear fission; How Bohr lived happily ever after; How Dirac got married; How Heisenberg inspired his friend to paint like Titian; How Pauli's anima made him leave the United States; How Delbruck became a biologist

rawabstract:
Known to physicists as the ``miracle year,'' 1932 saw the discovery of the neutron and the first artificially induced nuclear transmutation. However, while physicists celebrated these momentous discoveries --- which presaged the era of big science and nuclear bombs --- Europe was moving inexorably toward totalitarianism and war. In April of that year, about forty of the world's leading physicists --- including Werner Heisenberg, Lise Meitner, and Paul Dirac --- came to Niels Bohr's Copenhagen Institute for their annual informal meeting about the frontiers of physics. Physicist Gino Segr{\`e} brings to life this historic gathering, which ended with a humorous skit based on Goethe's Faust --- little knowing the Faustian bargains they would face in the near future. Capturing the interplay between the great scientists as well as the discoveries they discussed and debated, Segr{\`e} evokes the moment when physics --- and the world --- was about to lose its innocence.

rawTOC:
1. Munich now and then \\ 2. The changing times: The 1920s; The birth of the quantum; Why Copenhagen?; The meetings begin; The 1932 meeting \\ 3. Goethe and Faust: In the glow of Goethe; The ``Copenhagen Faust'' \\ 4. The front row: the old guard: Niels Bohr; Paul Ehrenfest; Lise Meitner \\ The front row: the revolutionaries: Old age is a cold fever; Werner Heisenberg; Wolfgang Pauli; Paul Dirac; Classical mechanics versus quantum mechanics \\ 6. The front row: the young ones: The curse of the Knabenphysik; Max Delbr{\"u}ck \\ 7. The coming storm: The periodic table; The new Kepler; G{\"o}ttingen in 1922; Triumph and crisis; The new optimism \\ 8. The revolution begins: Helgoland; Another sleepless night; Waves or particles; Heinsenberg versus Schr{\"o}dinger; Uncertainty and complementarity \\ 9. The king in decline: The crucial Solvay Conference; Einstein --- the king \\ 10. The great synthesis: Dirac's equation; How Max Delbr{\"u}ck joined Knabenphysik; Physics begins to split; Delbr{\"u}ck's choices \\ 11. Conservation of energy: The mysteries of the nucleus; The barrier is too high; Heaven and earth; The revolutionary proposals; The three young geniuses each write a book \\ 12. The new generation comes of age: The apprenticeship; Copenhagen 1932; The ``Blegdamsvej Faust'' \\ Delbr{\"u}ck's dilemma \\ 13. The miracle year: The discovery of the neutron; Copenhagen and the neutron; The miracle year; Big science is born; The hammer and the needle \\ 14. Ehrenfest's end \\ Epilogue, Or what happened afterward to the Front Row's other six: How Meitner discovered nuclear fission; How Bohr lived happily ever after; How Dirac got married; How Heisenberg inspired his friend to paint like Titian; How Pauli's anima made him leave the United States; How Delbr{\"u}ck became a biologist

entry:
@Book{Segre:2007:FCS,
  author =       "Gino Segr{\`e}",
  title =        "{Faust} in {Copenhagen}: a struggle for the soul of
                 physics",
  publisher =    pub-VIKING,
  address =      pub-VIKING:adr,
  pages =        "x + 310",
  year =         "2007",
  ISBN =         "0-670-03858-X",
  ISBN-13 =      "978-0-670-03858-9",
  LCCN =         "QC15 .S427 2007",
  bibdate =      "Tue Feb 12 15:11:07 MST 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/physperspect.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0743/2006052807-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0743/2006052807-d.html",
  abstract =     "Known to physicists as the ``miracle year,'' 1932 saw
                 the discovery of the neutron and the first artificially
                 induced nuclear transmutation. However, while
                 physicists celebrated these momentous discoveries ---
                 which presaged the era of big science and nuclear bombs
                 --- Europe was moving inexorably toward totalitarianism
                 and war. In April of that year, about forty of the
                 world's leading physicists --- including Werner
                 Heisenberg, Lise Meitner, and Paul Dirac --- came to
                 Niels Bohr's Copenhagen Institute for their annual
                 informal meeting about the frontiers of physics.
                 Physicist Gino Segr{\`e} brings to life this historic
                 gathering, which ended with a humorous skit based on
                 Goethe's Faust --- little knowing the Faustian bargains
                 they would face in the near future. Capturing the
                 interplay between the great scientists as well as the
                 discoveries they discussed and debated, Segr{\`e}
                 evokes the moment when physics --- and the world ---
                 was about to lose its innocence.",
  acknowledgement = ack-nhfb,
  subject =      "Physicists; Psychology; Intellectual life; 20th
                 century; Quantum theory; History",
  tableofcontents = "1. Munich now and then \\
                 2. The changing times: The 1920s; The birth of the
                 quantum; Why Copenhagen?; The meetings begin; The 1932
                 meeting \\
                 3. Goethe and Faust: In the glow of Goethe; The
                 ``Copenhagen Faust'' \\
                 4. The front row: the old guard: Niels Bohr; Paul
                 Ehrenfest; Lise Meitner \\
                 The front row: the revolutionaries: Old age is a cold
                 fever; Werner Heisenberg; Wolfgang Pauli; Paul Dirac;
                 Classical mechanics versus quantum mechanics \\
                 6. The front row: the young ones: The curse of the
                 Knabenphysik; Max Delbr{\"u}ck \\
                 7. The coming storm: The periodic table; The new
                 Kepler; G{\"o}ttingen in 1922; Triumph and crisis; The
                 new optimism \\
                 8. The revolution begins: Helgoland; Another sleepless
                 night; Waves or particles; Heinsenberg versus
                 Schr{\"o}dinger; Uncertainty and complementarity \\
                 9. The king in decline: The crucial Solvay Conference;
                 Einstein --- the king \\
                 10. The great synthesis: Dirac's equation; How Max
                 Delbr{\"u}ck joined Knabenphysik; Physics begins to
                 split; Delbr{\"u}ck's choices \\
                 11. Conservation of energy: The mysteries of the
                 nucleus; The barrier is too high; Heaven and earth; The
                 revolutionary proposals; The three young geniuses each
                 write a book \\
                 12. The new generation comes of age: The
                 apprenticeship; Copenhagen 1932; The ``Blegdamsvej
                 Faust'' \\
                 Delbr{\"u}ck's dilemma \\
                 13. The miracle year: The discovery of the neutron;
                 Copenhagen and the neutron; The miracle year; Big
                 science is born; The hammer and the needle \\
                 14. Ehrenfest's end \\
                 Epilogue, Or what happened afterward to the Front Row's
                 other six: How Meitner discovered nuclear fission; How
                 Bohr lived happily ever after; How Dirac got married;
                 How Heisenberg inspired his friend to paint like
                 Titian; How Pauli's anima made him leave the United
                 States; How Delbr{\"u}ck became a biologist",
}


bibtype: book
filename: master.bib
label: Segre:2011:OGM
author: Gino Segre
title: Ordinary geniuses: Max Delbruck, George Gamow, and the origins of genomics and Big Bang cosmology
publisher: pub-VIKING
address: pub-VIKING:adr
pages: xxi + 330
year: 2011
ISBN: 0-670-02276-4 OR 0670022764
ISBN13: 978-0-670-02276-2 OR 9780670022762
LCCN: QH31.D434 S44 2011
bibdate: Sat Sep 17 16:39:42 MDT 2011
bibtimestamp: 2011.09.17 16:39:42 MDT
acknowledgement: ack-nhfb
subjectdates: 1904--1968
rawauthor: Gino Segr{\`e}
abstract:
A biography of two maverick scientists whose intellectual wanderlust kick-started modern genomics and cosmology. Max Delbruck and George Gamow, the so-called ordinary geniuses of Segre's third book, were not as famous or as decorated as some of their colleagues in mid-twentieth-century physics, yet these two friends had a profound influence on how we now see the world, both on its largest scale (the universe) and its smallest (genetic code). Their maverick approach to research resulted in truly pioneering science. Wherever these men ventured, they were catalysts for great discoveries. Here Segre honors them in his typically inviting and elegant style and shows readers how they were far from ``ordinary''. While portraying their personal lives Segre, a scientist himself, gives readers an inside look at how science is done--collaboration, competition, the influence of politics, the role of intuition and luck, and the sense of wonder and curiosity that fuels these extraordinary minds. Ordinary Geniuses will appeal to the readers of Simon Singh, Amir Aczel, and other writers exploring the history of scientific ideas and the people behind them.

subject:
Delbruck, Max; Molecular biologists; United States; Biography; Gamow, George; Physicists; SCIENCE / Physics; biography and autobiography / Science and Technology

TOC:
When Max and Geo first met Max grows up Geo grows up Gottingen and Copenhagen Particle or wave? Max's and Geo's early careers Copenhagen, 1931 Zurich, 1931 Max, Bohr, and biology Max, Berlin, and biology Geo escapes from Russia The Russia Geo left behind Geo comes to America The sun's mysteries revealed Max leaves Germany Max in the New World Fission Supernovae and neutron stars Max meets Manny and Sal Hitting the jackpot What is life? The phage grows up Geo and the universe Gamow's game Bohr, Geo, and Max Back to Germany The new Manchester Alpha, beta, gamma Big Bang versus steady state DNA The double helix Geo and DNA Geo begins again Max begins again The molecular biology that was The Phage Church Trinity goes to Stockholm The triumph of the Big Bang The cosmic microwave background radiation Cosmology's new age Einstein's biggest blunder Duckling or swan? After the Golden Age The unavoidable and the unfashionable Mr. Tompkins arrives Geo's and Max's final messages

rawabstract:
A biography of two maverick scientists whose intellectual wanderlust kick-started modern genomics and cosmology. Max Delbr{\"u}ck and George Gamow, the so-called ordinary geniuses of Segr{\`e}'s third book, were not as famous or as decorated as some of their colleagues in mid-twentieth-century physics, yet these two friends had a profound influence on how we now see the world, both on its largest scale (the universe) and its smallest (genetic code). Their maverick approach to research resulted in truly pioneering science. Wherever these men ventured, they were catalysts for great discoveries. Here Segr{\`e} honors them in his typically inviting and elegant style and shows readers how they were far from ``ordinary''. While portraying their personal lives Segr{\`e}, a scientist himself, gives readers an inside look at how science is done--collaboration, competition, the influence of politics, the role of intuition and luck, and the sense of wonder and curiosity that fuels these extraordinary minds. Ordinary Geniuses will appeal to the readers of Simon Singh, Amir Aczel, and other writers exploring the history of scientific ideas and the people behind them.

rawtitle:
Ordinary geniuses: {Max Delbr{\"u}ck}, {George Gamow}, and the origins of genomics and {Big Bang} cosmology

rawTOC:
When Max and Geo first met \\ Max grows up \\ Geo grows up \\ G{\"o}ttingen and Copenhagen \\ Particle or wave? \\ Max's and Geo's early careers \\ Copenhagen, 1931 \\ Zurich, 1931 \\ Max, Bohr, and biology \\ Max, Berlin, and biology \\ Geo escapes from Russia \\ The Russia Geo left behind \\ Geo comes to America \\ The sun's mysteries revealed \\ Max leaves Germany \\ Max in the New World \\ Fission \\ Supernovae and neutron stars \\ Max meets Manny and Sal \\ Hitting the jackpot \\ What is life? \\ The phage grows up \\ Geo and the universe \\ Gamow's game \\ Bohr, Geo, and Max \\ Back to Germany \\ The new Manchester \\ Alpha, beta, gamma \\ Big Bang versus steady state \\ DNA \\ The double helix \\ Geo and DNA \\ Geo begins again \\ Max begins again \\ The molecular biology that was \\ The Phage Church Trinity goes to Stockholm \\ The triumph of the Big Bang \\ The cosmic microwave background radiation \\ Cosmology's new age \\ Einstein's biggest blunder \\ Duckling or swan? \\ After the Golden Age \\ The unavoidable and the unfashionable \\ Mr. Tompkins arrives \\ Geo's and Max's final messages

entry:
@Book{Segre:2011:OGM,
  author =       "Gino Segr{\`e}",
  title =        "Ordinary geniuses: {Max Delbr{\"u}ck}, {George Gamow},
                 and the origins of genomics and {Big Bang} cosmology",
  publisher =    pub-VIKING,
  address =      pub-VIKING:adr,
  pages =        "xxi + 330",
  year =         "2011",
  ISBN =         "0-670-02276-4",
  ISBN-13 =      "978-0-670-02276-2",
  LCCN =         "QH31.D434 S44 2011",
  bibdate =      "Sat Sep 17 16:39:42 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/physperspect.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "A biography of two maverick scientists whose
                 intellectual wanderlust kick-started modern genomics
                 and cosmology. Max Delbr{\"u}ck and George Gamow, the
                 so-called ordinary geniuses of Segr{\`e}'s third book,
                 were not as famous or as decorated as some of their
                 colleagues in mid-twentieth-century physics, yet these
                 two friends had a profound influence on how we now see
                 the world, both on its largest scale (the universe) and
                 its smallest (genetic code). Their maverick approach to
                 research resulted in truly pioneering science. Wherever
                 these men ventured, they were catalysts for great
                 discoveries. Here Segr{\`e} honors them in his
                 typically inviting and elegant style and shows readers
                 how they were far from ``ordinary''. While portraying
                 their personal lives Segr{\`e}, a scientist himself,
                 gives readers an inside look at how science is
                 done--collaboration, competition, the influence of
                 politics, the role of intuition and luck, and the sense
                 of wonder and curiosity that fuels these extraordinary
                 minds. Ordinary Geniuses will appeal to the readers of
                 Simon Singh, Amir Aczel, and other writers exploring
                 the history of scientific ideas and the people behind
                 them.",
  acknowledgement = ack-nhfb,
  subject =      "Delbr{\"u}ck, Max; Molecular biologists; United
                 States; Biography; Gamow, George; Physicists; SCIENCE /
                 Physics; biography and autobiography / Science and
                 Technology",
  subject-dates = "1904--1968",
  tableofcontents = "When Max and Geo first met \\
                 Max grows up \\
                 Geo grows up \\
                 G{\"o}ttingen and Copenhagen \\
                 Particle or wave? \\
                 Max's and Geo's early careers \\
                 Copenhagen, 1931 \\
                 Zurich, 1931 \\
                 Max, Bohr, and biology \\
                 Max, Berlin, and biology \\
                 Geo escapes from Russia \\
                 The Russia Geo left behind \\
                 Geo comes to America \\
                 The sun's mysteries revealed \\
                 Max leaves Germany \\
                 Max in the New World \\
                 Fission \\
                 Supernovae and neutron stars \\
                 Max meets Manny and Sal \\
                 Hitting the jackpot \\
                 What is life? \\
                 The phage grows up \\
                 Geo and the universe \\
                 Gamow's game \\
                 Bohr, Geo, and Max \\
                 Back to Germany \\
                 The new Manchester \\
                 Alpha, beta, gamma \\
                 Big Bang versus steady state \\
                 DNA \\
                 The double helix \\
                 Geo and DNA \\
                 Geo begins again \\
                 Max begins again \\
                 The molecular biology that was \\
                 The Phage Church Trinity goes to Stockholm \\
                 The triumph of the Big Bang \\
                 The cosmic microwave background radiation \\
                 Cosmology's new age \\
                 Einstein's biggest blunder \\
                 Duckling or swan? \\
                 After the Golden Age \\
                 The unavoidable and the unfashionable \\
                 Mr. Tompkins arrives \\
                 Geo's and Max's final messages",
}


bibtype: book
filename: master.bib
label: Segre:2016:PPE
author: Gino Segre and Bettina Hoerlin
title: The Pope of Physics: Enrico Fermi and the birth of the atomic age
publisher: Henry Holt and Company
address: New York, NY, USA
pages: xi + 351
year: 2016
ISBN: 1-62779-005-5, 1-62779-006-3 (e-book) OR 1627790055, 1627790063 (ebook)
ISBN13: 978-1-62779-005-5, 978-1-62779-006-2 (e-book) OR 9781627790055, 9781627790062 (ebook)
LCCN: QC16.F46 S44 2016
bibdate: Thu Mar 23 08:22:05 MDT 2017
bibtimestamp: 2017.03.23 08:22:05 MDT
subject: Fermi, Enrico; Physicists; Italy; Biography; United States
acknowledgement: ack-nhfb
subjectdates: 1901--1954
rawauthor: Gino Segr{\`e} and Bettina Hoerlin
rawtitle: The {Pope} of Physics: {Enrico Fermi} and the birth of the atomic age
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib; https://www.math.utah.edu/pub/bibnet/authors/m/majorana-ettore.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager

abstract:
The first full-scale biography of the Nobel Prize-winning physicist and one of the fathers of the atomic age, Enrico Fermi. Enrico Fermi is unquestionably the most famous scientist to come from Italy since Galileo, so revered that he's known as The Pope of Physics. A modest, unassuming man, Fermi was nevertheless one of the most productive and creative scientists of the twentieth century, one of the fathers of the Atomic Bomb and a Nobel Prize winner whose contributions to physics and nuclear technology live on today, with the largest particle accelerator in the United States and the nation's most significant science and technology award both bearing his name. In this, the first major biography of Fermi in English, Gino Segre, professor of Physics and Astronomy at the University of Pennsylvania, brings this scientific visionary to life. An examination of the human dramas that touched Fermi's life as well as a thrilling history of scientific innovation in the twentieth century --- including the birth of one of its most controversial disciplines, nuclear physics --- this is the comprehensive biography that Fermi deserves

TOC:
Family roots The Little Match (Il Piccolo Fiammifero) Leaning in: physics and Pisa Student days The young protege The summer of 1924 Florence Quantum leaps Enrico and Laura The boys of Via Panisperna The Royal Academy Crossing the Atlantic Bombarding the neutron Decay The neutron comes to Rome The rise and fall of the boys Transitions Stockholm calls Fission News travels Chain reaction The race begins New Americans and the birth of the pile The sleeping giant Chicago bound Critical pile (CP-1) The day the atomic age was born The Manhattan project: a three-legged stool Signor Fermi becomes Mister Farmer Gotterdammerung The hill ``No acceptable alternative'' Aftershock Goodbye, Mr. Farmer Physicist with a capital `F' The Fermi method The super Circling back Summer of '54 Farewell to the navigator

rawabstract:
The first full-scale biography of the Nobel Prize-winning physicist and one of the fathers of the atomic age, Enrico Fermi. Enrico Fermi is unquestionably the most famous scientist to come from Italy since Galileo, so revered that he's known as The Pope of Physics. A modest, unassuming man, Fermi was nevertheless one of the most productive and creative scientists of the twentieth century, one of the fathers of the Atomic Bomb and a Nobel Prize winner whose contributions to physics and nuclear technology live on today, with the largest particle accelerator in the United States and the nation's most significant science and technology award both bearing his name. In this, the first major biography of Fermi in English, Gino Segre, professor of Physics and Astronomy at the University of Pennsylvania, brings this scientific visionary to life. An examination of the human dramas that touched Fermi's life as well as a thrilling history of scientific innovation in the twentieth century --- including the birth of one of its most controversial disciplines, nuclear physics --- this is the comprehensive biography that Fermi deserves

rawTOC:
Family roots \\ The Little Match (Il Piccolo Fiammifero) \\ Leaning in: physics and Pisa \\ Student days \\ The young prot{\'e}g{\'e} \\ The summer of 1924 \\ Florence \\ Quantum leaps \\ Enrico and Laura \\ The boys of Via Panisperna \\ The Royal Academy \\ Crossing the Atlantic \\ Bombarding the neutron \\ Decay \\ The neutron comes to Rome \\ The rise and fall of the boys \\ Transitions \\ Stockholm calls \\ Fission \\ News travels \\ Chain reaction \\ The race begins \\ New Americans and the birth of the pile \\ The sleeping giant \\ Chicago bound \\ Critical pile (CP-1) \\ The day the atomic age was born \\ The Manhattan project: a three-legged stool \\ Signor Fermi becomes Mister Farmer \\ G{\"o}tterd{\"a}mmerung \\ The hill \\ ``No acceptable alternative'' \\ Aftershock \\ Goodbye, Mr. Farmer \\ Physicist with a capital `F' \\ The Fermi method \\ The super \\ Circling back \\ Summer of '54 \\ Farewell to the navigator

entry:
@Book{Segre:2016:PPE,
  author =       "Gino Segr{\`e} and Bettina Hoerlin",
  title =        "The {Pope} of Physics: {Enrico Fermi} and the birth of
                 the atomic age",
  publisher =    "Henry Holt and Company",
  address =      "New York, NY, USA",
  pages =        "xi + 351",
  year =         "2016",
  ISBN =         "1-62779-005-5, 1-62779-006-3 (e-book)",
  ISBN-13 =      "978-1-62779-005-5, 978-1-62779-006-2 (e-book)",
  LCCN =         "QC16.F46 S44 2016",
  bibdate =      "Thu Mar 23 08:22:05 MDT 2017",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/majorana-ettore.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "The first full-scale biography of the Nobel
                 Prize-winning physicist and one of the fathers of the
                 atomic age, Enrico Fermi. Enrico Fermi is
                 unquestionably the most famous scientist to come from
                 Italy since Galileo, so revered that he's known as The
                 Pope of Physics. A modest, unassuming man, Fermi was
                 nevertheless one of the most productive and creative
                 scientists of the twentieth century, one of the fathers
                 of the Atomic Bomb and a Nobel Prize winner whose
                 contributions to physics and nuclear technology live on
                 today, with the largest particle accelerator in the
                 United States and the nation's most significant science
                 and technology award both bearing his name. In this,
                 the first major biography of Fermi in English, Gino
                 Segre, professor of Physics and Astronomy at the
                 University of Pennsylvania, brings this scientific
                 visionary to life. An examination of the human dramas
                 that touched Fermi's life as well as a thrilling
                 history of scientific innovation in the twentieth
                 century --- including the birth of one of its most
                 controversial disciplines, nuclear physics --- this is
                 the comprehensive biography that Fermi deserves",
  acknowledgement = ack-nhfb # "\slash " # ack-wl,
  subject =      "Fermi, Enrico; Physicists; Italy; Biography; United
                 States",
  subject-dates = "1901--1954",
  tableofcontents = "Family roots \\
                 The Little Match (Il Piccolo Fiammifero) \\
                 Leaning in: physics and Pisa \\
                 Student days \\
                 The young prot{\'e}g{\'e} \\
                 The summer of 1924 \\
                 Florence \\
                 Quantum leaps \\
                 Enrico and Laura \\
                 The boys of Via Panisperna \\
                 The Royal Academy \\
                 Crossing the Atlantic \\
                 Bombarding the neutron \\
                 Decay \\
                 The neutron comes to Rome \\
                 The rise and fall of the boys \\
                 Transitions \\
                 Stockholm calls \\
                 Fission \\
                 News travels \\
                 Chain reaction \\
                 The race begins \\
                 New Americans and the birth of the pile \\
                 The sleeping giant \\
                 Chicago bound \\
                 Critical pile (CP-1) \\
                 The day the atomic age was born \\
                 The Manhattan project: a three-legged stool \\
                 Signor Fermi becomes Mister Farmer \\
                 G{\"o}tterd{\"a}mmerung \\
                 The hill \\
                 ``No acceptable alternative'' \\
                 Aftershock \\
                 Goodbye, Mr. Farmer \\
                 Physicist with a capital `F' \\
                 The Fermi method \\
                 The super \\
                 Circling back \\
                 Summer of '54 \\
                 Farewell to the navigator",
}


bibtype: book
filename: master.bib
label: Seife:2008:SBS
author: Charles Seife
title: Sun in a bottle: the strange history of fusion and the science of wishful thinking
publisher: pub-VIKING
address: pub-VIKING:adr
pages: vi + 294
year: 2008
ISBN: 0-670-02033-8 OR 0670020338
ISBN13: 978-0-670-02033-1 OR 9780670020331
LCCN: QC791 .S45 2008
bibdate: Tue Jan 24 14:06:59 MST 2012
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2012.01.24 14:06:59 MST
subject: Kernfusion; Nuclear fusion; History; Kernfusion; Geschichte
acknowledgement: ack-nhfb
rawauthor: Charles Seife
rawtitle: {Sun} in a bottle: the strange history of fusion and the science of wishful thinking
TOC:
Sword of Michael The valley of iron Project plowshare and the sunshine units Kinks, instabilities, and baloney bombs Heat and light The cold shoulder Secrets Bubble trouble Nothing like the Sun The science of wishful thinking

rawTOC:
Sword of Michael \\ The valley of iron \\ Project plowshare and the sunshine units \\ Kinks, instabilities, and baloney bombs \\ Heat and light \\ The cold shoulder \\ Secrets \\ Bubble trouble \\ Nothing like the Sun \\ The science of wishful thinking

entry:
@Book{Seife:2008:SBS,
  author =       "Charles Seife",
  title =        "{Sun} in a bottle: the strange history of fusion and
                 the science of wishful thinking",
  publisher =    pub-VIKING,
  address =      pub-VIKING:adr,
  pages =        "vi + 294",
  year =         "2008",
  ISBN =         "0-670-02033-8",
  ISBN-13 =      "978-0-670-02033-1",
  LCCN =         "QC791 .S45 2008",
  bibdate =      "Tue Jan 24 14:06:59 MST 2012",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  subject =      "Kernfusion; Nuclear fusion; History; Kernfusion;
                 Geschichte",
  tableofcontents = "Sword of Michael \\
                 The valley of iron \\
                 Project plowshare and the sunshine units \\
                 Kinks, instabilities, and baloney bombs \\
                 Heat and light \\
                 The cold shoulder \\
                 Secrets \\
                 Bubble trouble \\
                 Nothing like the Sun \\
                 The science of wishful thinking",
}


bibtype: book
filename: master.bib
label: Seifer:1996:WLT
author: Marc J. Seifer
title: Wizard: The Life and Times of Nikola Tesla: Biography of a Genius
publisher: Birch Lane Press, Carol Publishing Group
address: 120 Enterprise Avenue, Secaucus, NJ, USA
pages: xiv + 542
year: 1996
ISBN: 1-55972-329-7 OR 1559723297
ISBN13: 978-1-55972-329-9 OR 9781559723299
LCCN: TK140.T4 S65 1996
bibdate: Sat Mar 08 20:37:02 1997
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1997.03.08 20:37:02 ???
acknowledgement: ack-nhfb
subjectdates: Nikola Tesla (1856--1943)
rawauthor: Marc J. Seifer
rawtitle: Wizard: The Life and Times of {Nikola Tesla}: Biography of a Genius
abstract:
Nikola Tesla (1856--1943), credited as the inspiration for radio, robots, and even radar, has been called the patron saint of modern electricity. Based on original material and previously unavailable documents, Wizard is the definitive biography of the man considered by many to be the founding father of modern electrical technology. Wizard reveals the details of Tesla's struggles with competing contemporary inventors such as Edison, Steinmetz, and Marconi and with financial giants such as J. P. Morgan and John Jacob Astor as they were underwriting his laboratory work. (Tesla even worked for the Edison Company for several years.). Wizard brings to the fore an extraordinary man and recreates his life during one of the most exciting and innovative eras in America's history. The book is illustrated with 16 pages of photographs and drawings, including the July 20, 1931, Time magazine cover for an issue celebrating the inventor's career.

TOC:
Heritage Childhood (1856--74) College years (1875--82) Tesla meets the Wizard of Menlo Park (1882--85) Liberty Street (1886--88) Induction at Pittsburgh (1889) Bogus inventors (1889--90) South Fifth Avenue (1890--91) Revising the past (1891) The Royal Society (1892) Father of the wireless (1893) Electric sorcerer (1893) The Filipovs (1894) Niagara power (1894) Effulgent glory (1894) Fire at the lab (1895) Martian fever (1895--96) High society (1894--97) Shadowgraphs (1896) Falls speech (1897) Luminaries (1896--98) Sorcerer's apprentice (1896--97) Vril power (1898) Waldorf--Astoria (1898) Colorado Springs (1899) Contact (1899) Thor's emissary (1899) The hero's return (1900) The house of Morgan (1901) World Telegraphy Center (1901) Clash of the Titans (1901) The passing of the torch (1902) Wardenclyffe (1902--1903) The web (1903--1904) Dissolution (1904--1906) The child of his dreams (1907--1908) Bladeless turbines (1909--10) The Hammond connection (1909--13) J. P. Morgan Jr. (1912--14) Fifth column (1914--16) The invisible audience (1915--21) Transmutation (1918--21) The Roaring Twenties (1918--27) Faster than the speed of light (1927--40) Living on credit (1925--40) Loose ends (1931--43) The FBI and the Tesla papers (1943--56) The Wizard's legacy Appendix: The magnifying transmitter: a technical discussion

rawabstract:
Nikola Tesla (1856--1943), credited as the inspiration for radio, robots, and even radar, has been called the patron saint of modern electricity. Based on original material and previously unavailable documents, Wizard is the definitive biography of the man considered by many to be the founding father of modern electrical technology. Wizard reveals the details of Tesla's struggles with competing contemporary inventors such as Edison, Steinmetz, and Marconi and with financial giants such as J. P. Morgan and John Jacob Astor as they were underwriting his laboratory work. (Tesla even worked for the Edison Company for several years.). Wizard brings to the fore an extraordinary man and recreates his life during one of the most exciting and innovative eras in America's history. The book is illustrated with 16 pages of photographs and drawings, including the July 20, 1931, Time magazine cover for an issue celebrating the inventor's career.

rawTOC:
Heritage \\ Childhood (1856--74) \\ College years (1875--82) \\ Tesla meets the Wizard of Menlo Park (1882--85) \\ Liberty Street (1886--88) \\ Induction at Pittsburgh (1889) \\ Bogus inventors (1889--90) \\ South Fifth Avenue (1890--91) \\ Revising the past (1891) \\ The Royal Society (1892) \\ Father of the wireless (1893) \\ Electric sorcerer (1893) \\ The Filipovs (1894) \\ Niagara power (1894) \\ Effulgent glory (1894) \\ Fire at the lab (1895) \\ Martian fever (1895--96) \\ High society (1894--97) \\ Shadowgraphs (1896) \\ Falls speech (1897) \\ Luminaries (1896--98) \\ Sorcerer's apprentice (1896--97) \\ Vril power (1898) \\ Waldorf--Astoria (1898) \\ Colorado Springs (1899) \\ Contact (1899) \\ Thor's emissary (1899) \\ The hero's return (1900) \\ The house of Morgan (1901) \\ World Telegraphy Center (1901) \\ Clash of the Titans (1901) \\ The passing of the torch (1902) \\ Wardenclyffe (1902--1903) \\ The web (1903--1904) \\ Dissolution (1904--1906) \\ The child of his dreams (1907--1908) \\ Bladeless turbines (1909--10) \\ The Hammond connection (1909--13) \\ J. P. Morgan Jr. (1912--14) \\ Fifth column (1914--16) \\ The invisible audience (1915--21) \\ Transmutation (1918--21) \\ The Roaring Twenties (1918--27) \\ Faster than the speed of light (1927--40) \\ Living on credit (1925--40) \\ Loose ends (1931--43) \\ The FBI and the Tesla papers (1943--56) \\ The Wizard's legacy \\ Appendix: The magnifying transmitter: a technical discussion

entry:
@Book{Seifer:1996:WLT,
  author =       "Marc J. Seifer",
  title =        "Wizard: The Life and Times of {Nikola Tesla}:
                 Biography of a Genius",
  publisher =    "Birch Lane Press, Carol Publishing Group",
  address =      "120 Enterprise Avenue, Secaucus, NJ, USA",
  pages =        "xiv + 542",
  year =         "1996",
  ISBN =         "1-55972-329-7",
  ISBN-13 =      "978-1-55972-329-9",
  LCCN =         "TK140.T4 S65 1996",
  bibdate =      "Sat Mar 08 20:37:02 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$32.00, CDN\$41.95",
  abstract =     "Nikola Tesla (1856--1943), credited as the inspiration
                 for radio, robots, and even radar, has been called the
                 patron saint of modern electricity. Based on original
                 material and previously unavailable documents, Wizard
                 is the definitive biography of the man considered by
                 many to be the founding father of modern electrical
                 technology. Wizard reveals the details of Tesla's
                 struggles with competing contemporary inventors such as
                 Edison, Steinmetz, and Marconi and with financial
                 giants such as J. P. Morgan and John Jacob Astor as
                 they were underwriting his laboratory work. (Tesla even
                 worked for the Edison Company for several years.).
                 Wizard brings to the fore an extraordinary man and
                 recreates his life during one of the most exciting and
                 innovative eras in America's history. The book is
                 illustrated with 16 pages of photographs and drawings,
                 including the July 20, 1931, Time magazine cover for an
                 issue celebrating the inventor's career.",
  acknowledgement = ack-nhfb,
  subject-dates = "Nikola Tesla (1856--1943)",
  tableofcontents = "Heritage \\
                 Childhood (1856--74) \\
                 College years (1875--82) \\
                 Tesla meets the Wizard of Menlo Park (1882--85) \\
                 Liberty Street (1886--88) \\
                 Induction at Pittsburgh (1889) \\
                 Bogus inventors (1889--90) \\
                 South Fifth Avenue (1890--91) \\
                 Revising the past (1891) \\
                 The Royal Society (1892) \\
                 Father of the wireless (1893) \\
                 Electric sorcerer (1893) \\
                 The Filipovs (1894) \\
                 Niagara power (1894) \\
                 Effulgent glory (1894) \\
                 Fire at the lab (1895) \\
                 Martian fever (1895--96) \\
                 High society (1894--97) \\
                 Shadowgraphs (1896) \\
                 Falls speech (1897) \\
                 Luminaries (1896--98) \\
                 Sorcerer's apprentice (1896--97) \\
                 Vril power (1898) \\
                 Waldorf--Astoria (1898) \\
                 Colorado Springs (1899) \\
                 Contact (1899) \\
                 Thor's emissary (1899) \\
                 The hero's return (1900) \\
                 The house of Morgan (1901) \\
                 World Telegraphy Center (1901) \\
                 Clash of the Titans (1901) \\
                 The passing of the torch (1902) \\
                 Wardenclyffe (1902--1903) \\
                 The web (1903--1904) \\
                 Dissolution (1904--1906) \\
                 The child of his dreams (1907--1908) \\
                 Bladeless turbines (1909--10) \\
                 The Hammond connection (1909--13) \\
                 J. P. Morgan Jr. (1912--14) \\
                 Fifth column (1914--16) \\
                 The invisible audience (1915--21) \\
                 Transmutation (1918--21) \\
                 The Roaring Twenties (1918--27) \\
                 Faster than the speed of light (1927--40) \\
                 Living on credit (1925--40) \\
                 Loose ends (1931--43) \\
                 The FBI and the Tesla papers (1943--56) \\
                 The Wizard's legacy \\
                 Appendix: The magnifying transmitter: a technical
                 discussion",
}


bibtype: book
filename: master.bib
label: Seifert:1998:GET
author: Rich Seifert
title: Gigabit Ethernet: Technology and Applications for High-Speed LANs
publisher: pub-AW
address: pub-AW:adr
pages: xv + 411
year: 1998
ISBN: 0-201-18553-9 OR 0201185539
ISBN13: 978-0-201-18553-9 OR 9780201185539
LCCN: TK5105.8.E83S45 1998
bibdate: Wed May 27 07:20:38 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.05.27 07:20:38 ???
acknowledgement: ack-nhfb
rawauthor: Rich Seifert
rawtitle: Gigabit {Ethernet}: Technology and Applications for High-Speed {LANs}
abstract:
Appropriate for anyone involved with LAN technologies --- network planners, designers and administrators, equipment and applications developers, technical salespeople, students --- this book provides a thorough explanation of Gigabit Ethernet and the principles on which it was built. Gigabit Ethernet explains the technology in clear terms, exploring the implications for its application and operation in real-world LANs. You will learn how to identify appropriate application environments for Gigabit Ethernet, as well as how to integrate it with other technologies, make intelligent choices about products and features, and set realistic expectations about performance.

TOC:
Part I: Foundations of Gigabit Ethernet 1: Ethernet before Gigabit 2: From Shared to Dedicated Media 3: From Shared to Dedicated LANs 4: Full-Duplex Ethernet 5: Frame Formats 6: Ethernet Flow Control 7: Ethernet Medium Independence 8: Automatic Configuration Part II: Gigabit Ethernet Technology 9: Architecture and Overview of Gigabit Ethernet 10: Gigabit Ethernet Media Access Control 11: Gigabit Ethernet Hubs 12: Gigabit Ethernet Physical Layer 13: The Hitchhiker's Guide to the Gigabit Ethernet Standard Part III: Applying Gigabit Ethernet 14: Application Environments 15: Performance Considerations 16: Technology Alternatives Appendix A: 8B/10B Code Tables

rawabstract:
Appropriate for anyone involved with LAN technologies --- network planners, designers and administrators, equipment and applications developers, technical salespeople, students --- this book provides a thorough explanation of Gigabit Ethernet and the principles on which it was built. Gigabit Ethernet explains the technology in clear terms, exploring the implications for its application and operation in real-world LANs. You will learn how to identify appropriate application environments for Gigabit Ethernet, as well as how to integrate it with other technologies, make intelligent choices about products and features, and set realistic expectations about performance.

rawTOC:
Part I: Foundations of Gigabit Ethernet \\ 1: Ethernet before Gigabit \\ 2: From Shared to Dedicated Media \\ 3: From Shared to Dedicated LANs \\ 4: Full-Duplex Ethernet \\ 5: Frame Formats \\ 6: Ethernet Flow Control \\ 7: Ethernet Medium Independence \\ 8: Automatic Configuration \\ Part II: Gigabit Ethernet Technology \\ 9: Architecture and Overview of Gigabit Ethernet \\ 10: Gigabit Ethernet Media Access Control \\ 11: Gigabit Ethernet Hubs \\ 12: Gigabit Ethernet Physical Layer \\ 13: The Hitchhiker's Guide to the Gigabit Ethernet Standard \\ Part III: Applying Gigabit Ethernet \\ 14: Application Environments \\ 15: Performance Considerations \\ 16: Technology Alternatives \\ Appendix A: 8B/10B Code Tables

entry:
@Book{Seifert:1998:GET,
  author =       "Rich Seifert",
  title =        "Gigabit {Ethernet}: Technology and Applications for
                 High-Speed {LANs}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xv + 411",
  year =         "1998",
  ISBN =         "0-201-18553-9",
  ISBN-13 =      "978-0-201-18553-9",
  LCCN =         "TK5105.8.E83S45 1998",
  bibdate =      "Wed May 27 07:20:38 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$49.95",
  abstract =     "Appropriate for anyone involved with LAN technologies
                 --- network planners, designers and administrators,
                 equipment and applications developers, technical
                 salespeople, students --- this book provides a thorough
                 explanation of Gigabit Ethernet and the principles on
                 which it was built. Gigabit Ethernet explains the
                 technology in clear terms, exploring the implications
                 for its application and operation in real-world LANs.
                 You will learn how to identify appropriate application
                 environments for Gigabit Ethernet, as well as how to
                 integrate it with other technologies, make intelligent
                 choices about products and features, and set realistic
                 expectations about performance.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Part I: Foundations of Gigabit Ethernet \\
                 1: Ethernet before Gigabit \\
                 2: From Shared to Dedicated Media \\
                 3: From Shared to Dedicated LANs \\
                 4: Full-Duplex Ethernet \\
                 5: Frame Formats \\
                 6: Ethernet Flow Control \\
                 7: Ethernet Medium Independence \\
                 8: Automatic Configuration \\
                 Part II: Gigabit Ethernet Technology \\
                 9: Architecture and Overview of Gigabit Ethernet \\
                 10: Gigabit Ethernet Media Access Control \\
                 11: Gigabit Ethernet Hubs \\
                 12: Gigabit Ethernet Physical Layer \\
                 13: The Hitchhiker's Guide to the Gigabit Ethernet
                 Standard \\
                 Part III: Applying Gigabit Ethernet \\
                 14: Application Environments \\
                 15: Performance Considerations \\
                 16: Technology Alternatives \\
                 Appendix A: 8B/10B Code Tables",
}


bibtype: book
filename: master.bib
label: Seltzer:1997:ASR
author: Richard Seltzer and Deborah S. Ray and Eric J. Ray
title: The AltaVista Search Revolution: How to Find Anything on the Internet
publisher: pub-OSBORNE-MCGRAW-HILL
address: pub-OSBORNE-MCGRAW-HILL:adr
pages: xxii + 274
year: 1997
ISBN: 0-07-882235-1 OR 0078822351
ISBN13: 978-0-07-882235-3 OR 9780078822353
LCCN: TK5105.875 .I57 S44 1997
bibdate: Mon Jul 21 14:34:59 1997
bibtimestamp: 1997.07.21 14:34:59 ???
acknowledgement: ack-nhfb
rawauthor: Richard Seltzer and Deborah S. Ray and Eric J. Ray
rawtitle: The {AltaVista} Search Revolution: How to Find Anything on the {Internet}
TOC:
Introduction to AltaVista Search Getting started with AltaVista Search Advanced Search Searching Usenet newsgroups Providing information the AltaVista way Using the AltaVista Search A to Z reference The AltaVista story The top 1,000 most common words on the World Wide Web A sample of 1,000 queries Frequency of words used in AltaVista Search queries Index

rawTOC:
Introduction to AltaVista Search \\ Getting started with AltaVista Search \\ Advanced Search \\ Searching Usenet newsgroups \\ Providing information the AltaVista way \\ Using the AltaVista Search A to Z reference \\ The AltaVista story \\ The top 1,000 most common words on the World Wide Web \\ A sample of 1,000 queries \\ Frequency of words used in AltaVista Search queries \\ Index

entry:
@Book{Seltzer:1997:ASR,
  author =       "Richard Seltzer and Deborah S. Ray and Eric J. Ray",
  title =        "The {AltaVista} Search Revolution: How to Find
                 Anything on the {Internet}",
  publisher =    pub-OSBORNE-MCGRAW-HILL,
  address =      pub-OSBORNE-MCGRAW-HILL:adr,
  pages =        "xxii + 274",
  year =         "1997",
  ISBN =         "0-07-882235-1",
  ISBN-13 =      "978-0-07-882235-3",
  LCCN =         "TK5105.875 .I57 S44 1997",
  bibdate =      "Mon Jul 21 14:34:59 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/internet.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$16.99",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction to AltaVista Search \\
                 Getting started with AltaVista Search \\
                 Advanced Search \\
                 Searching Usenet newsgroups \\
                 Providing information the AltaVista way \\
                 Using the AltaVista Search A to Z reference \\
                 The AltaVista story \\
                 The top 1,000 most common words on the World Wide Web
                 \\
                 A sample of 1,000 queries \\
                 Frequency of words used in AltaVista Search queries \\
                 Index",
}


bibtype: book
filename: master.bib
label: Sen:2021:EFH
author: Paul Sen
title: Einstein's fridge: how the difference between hot and cold explains the universe
publisher: Scribner
address: New York, NY, USA
pages: xii + 305
year: 2021
ISBN: 1-5011-8130-0 (hardcover), 1-5011-8132-7 (e-book) OR 1501181300 (hardcover), 1501181327 (ebook)
LCCN: QC311 .S5118 2021
bibdate: Fri Mar 5 22:16:38 MST 2021
bibtimestamp: 2021.03.05 22:16:38 MST
subject: Thermodynamics
acknowledgement: ack-nhfb
rawauthor: Paul Sen
rawtitle: {Einstein}'s fridge: how the difference between hot and cold explains the universe
ISBN13:
978-1-5011-8130-6 (hardcover), 978-1-5011-8132-0 (e-book) OR 9781501181306 (hardcover), 9781501181320 (ebook)

abstract:
booktitle Einstein's Fridge tells the incredible epic story of the scientists who, over two centuries, harnessed the power of heat and ice and formulated a theory essential to comprehending our universe. Thermodynamics --- the branch of physics that deals with energy and entropy --- is the least known and yet most consequential of all the sciences. It governs everything from the behavior of living cells to the black hole at the center of our galaxy. Not only that, but thermodynamics explains why we must eat and breathe, how lights turn on, the limits of computing, and how the universe will end. The brilliant people who decoded its laws came from every branch of the sciences; they were engineers, physicists, chemists, biologists, cosmologists, and mathematicians. From French military engineer and physicist Sadi Carnot to Lord Kelvin, James Joule, Albert Einstein, Emmy Noether, Alan Turing, and Stephen Hawking, author Paul Sen introduces us to all of the players who passed the baton of scientific progress through time and across nations. Incredibly driven and idealistic, these brave pioneers performed groundbreaking work often in the face of torment and tragedy. Their discoveries helped create the modern world and transformed every branch of science, from biology to cosmology. Einstein's Fridge brings to life one of the most important scientific revolutions of all time and captures the thrill of discovery and the power of scientific progress to shape the course of history.

TOC:
Prologue / ix 1; A Tour of Britain / 1 2; The Motive Power of Fire / 7 3; The Creator's Fiat / 23 4; The Valley of the Clyde / 33 5; The Principal Problem of Physics / 41 6; The Flow of Heat and the End of Time / 51 7; Entropy / 63 8; The Motion We Call Heat / 75 9; Collisions / 83 IO; Counting the Ways / 95 11; ``The Terroristic Nimbus'' / 115 12; Boltzmann Brains / 127 13; Quanta / 133 14; Sugar and Pollen / 143 IS; Symmetry / 155 16; Information Is Physical / 167 17; Demons / 187 18; The Mathematics of Life / 199 19; Event Horizon / 219 Epilogue / 241 Acknowledgments / 245 Appendix I: The Carnot Cycle / 247 Appendix II: How Clausius Reconciled the Conservation of Energy with the Ideas of Sadi Carnot / 253 Appendix III: The Four Laws of Thermodynamics / 257 Notes / 259 Bibliography / 283 Index / 287

rawabstract:
\booktitle{Einstein's Fridge} tells the incredible epic story of the scientists who, over two centuries, harnessed the power of heat and ice and formulated a theory essential to comprehending our universe. Thermodynamics --- the branch of physics that deals with energy and entropy --- is the least known and yet most consequential of all the sciences. It governs everything from the behavior of living cells to the black hole at the center of our galaxy. Not only that, but thermodynamics explains why we must eat and breathe, how lights turn on, the limits of computing, and how the universe will end. The brilliant people who decoded its laws came from every branch of the sciences; they were engineers, physicists, chemists, biologists, cosmologists, and mathematicians. From French military engineer and physicist Sadi Carnot to Lord Kelvin, James Joule, Albert Einstein, Emmy Noether, Alan Turing, and Stephen Hawking, author Paul Sen introduces us to all of the players who passed the baton of scientific progress through time and across nations. Incredibly driven and idealistic, these brave pioneers performed groundbreaking work often in the face of torment and tragedy. Their discoveries helped create the modern world and transformed every branch of science, from biology to cosmology. Einstein's Fridge brings to life one of the most important scientific revolutions of all time and captures the thrill of discovery and the power of scientific progress to shape the course of history.

rawTOC:
Prologue / ix \\ 1; A Tour of Britain / 1 \\ 2; The Motive Power of Fire / 7 \\ 3; The Creator's Fiat / 23 \\ 4; The Valley of the Clyde / 33 \\ 5; The Principal Problem of Physics / 41 \\ 6; The Flow of Heat and the End of Time / 51 \\ 7; Entropy / 63 \\ 8; The Motion We Call Heat / 75 \\ 9; Collisions / 83 \\ IO; Counting the Ways / 95 \\ 11; ``The Terroristic Nimbus'' / 115 \\ 12; Boltzmann Brains / 127 \\ 13; Quanta / 133 \\ 14; Sugar and Pollen / 143 \\ IS; Symmetry / 155 \\ 16; Information Is Physical / 167 \\ 17; Demons / 187 \\ 18; The Mathematics of Life / 199 \\ 19; Event Horizon / 219 \\ Epilogue / 241 \\ Acknowledgments / 245 \\ Appendix I: The Carnot Cycle / 247 \\ Appendix II: How Clausius Reconciled the Conservation of Energy with the Ideas of Sadi Carnot / 253 \\ Appendix III: The Four Laws of Thermodynamics / 257 \\ Notes / 259 \\ Bibliography / 283 \\ Index / 287

entry:
@Book{Sen:2021:EFH,
  author =       "Paul Sen",
  title =        "{Einstein}'s fridge: how the difference between hot
                 and cold explains the universe",
  publisher =    "Scribner",
  address =      "New York, NY, USA",
  pages =        "xii + 305",
  year =         "2021",
  ISBN =         "1-5011-8130-0 (hardcover), 1-5011-8132-7 (e-book)",
  ISBN-13 =      "978-1-5011-8130-6 (hardcover), 978-1-5011-8132-0
                 (e-book)",
  LCCN =         "QC311 .S5118 2021",
  bibdate =      "Fri Mar 5 22:16:38 MST 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "\booktitle{Einstein's Fridge} tells the incredible
                 epic story of the scientists who, over two centuries,
                 harnessed the power of heat and ice and formulated a
                 theory essential to comprehending our universe.
                 Thermodynamics --- the branch of physics that deals
                 with energy and entropy --- is the least known and yet
                 most consequential of all the sciences. It governs
                 everything from the behavior of living cells to the
                 black hole at the center of our galaxy. Not only that,
                 but thermodynamics explains why we must eat and
                 breathe, how lights turn on, the limits of computing,
                 and how the universe will end. The brilliant people who
                 decoded its laws came from every branch of the
                 sciences; they were engineers, physicists, chemists,
                 biologists, cosmologists, and mathematicians. From
                 French military engineer and physicist Sadi Carnot to
                 Lord Kelvin, James Joule, Albert Einstein, Emmy
                 Noether, Alan Turing, and Stephen Hawking, author Paul
                 Sen introduces us to all of the players who passed the
                 baton of scientific progress through time and across
                 nations. Incredibly driven and idealistic, these brave
                 pioneers performed groundbreaking work often in the
                 face of torment and tragedy. Their discoveries helped
                 create the modern world and transformed every branch of
                 science, from biology to cosmology. Einstein's Fridge
                 brings to life one of the most important scientific
                 revolutions of all time and captures the thrill of
                 discovery and the power of scientific progress to shape
                 the course of history.",
  acknowledgement = ack-nhfb,
  subject =      "Thermodynamics",
  tableofcontents = "Prologue / ix \\
                 1; A Tour of Britain / 1 \\
                 2; The Motive Power of Fire / 7 \\
                 3; The Creator's Fiat / 23 \\
                 4; The Valley of the Clyde / 33 \\
                 5; The Principal Problem of Physics / 41 \\
                 6; The Flow of Heat and the End of Time / 51 \\
                 7; Entropy / 63 \\
                 8; The Motion We Call Heat / 75 \\
                 9; Collisions / 83 \\
                 IO; Counting the Ways / 95 \\
                 11; ``The Terroristic Nimbus'' / 115 \\
                 12; Boltzmann Brains / 127 \\
                 13; Quanta / 133 \\
                 14; Sugar and Pollen / 143 \\
                 IS; Symmetry / 155 \\
                 16; Information Is Physical / 167 \\
                 17; Demons / 187 \\
                 18; The Mathematics of Life / 199 \\
                 19; Event Horizon / 219 \\
                 Epilogue / 241 \\
                 Acknowledgments / 245 \\
                 Appendix I: The Carnot Cycle / 247 \\
                 Appendix II: How Clausius Reconciled the Conservation
                 of Energy with the Ideas of Sadi Carnot / 253 \\
                 Appendix III: The Four Laws of Thermodynamics / 257 \\
                 Notes / 259 \\
                 Bibliography / 283 \\
                 Index / 287",
}


bibtype: book
filename: master.bib
label: Senor:2009:SNS
author: Dan Senor and Saul Singer
title: Start-up Nation: the Story of Israel's Economic Miracle
publisher: Twelve
address: New York, NY, USA
pages: x + 304
year: 2009
LCCN: HC415.25 .S455 2009eb
bibdate: Mon Feb 11 08:55:54 MST 2019
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2019.02.11 08:55:54 MST
abstract: What the world can learn from Israel's meteoric economic success.
rawabstract: What the world can learn from Israel's meteoric economic success.
rawauthor: Dan Senor and Saul Singer
rawtitle: Start-up Nation: the Story of {Israel}'s Economic Miracle
ISBN:
0-446-54146-X, 0-446-54147-8 (paperback), 1-4555-0346-0 (e-book), 1-59995-857-0 (e-book) OR 044654146X, 0446541478 (paperback), 1455503460 (ebook), 1599958570 (ebook)

ISBN13:
978-0-446-54146-6, 978-0-446-54147-3 (paperback), 978-1-4555-0346-9 (e-book X11), 978-1-59995-857-6 (e-book X11) OR 9780446541466, 9780446541473 (paperback), 9781455503469 (ebook X11), 9781599958576 (ebook X11)

TOC:
Foreword by Shimon Peres / xi Authors' Note / xv Maps / xvii Introduction / 1 Part I: The Little Nation That Could / 1: Persistance / 23 2: Battlefield entrepreneurs / 41 Part ii: Seeding a Culture of Innovation / 3: The people of the book / 57 4: Harvard, Princeton and Yale / 67 5: Where order meets random chaos / 84 Part III: Beginnings 6: An industrial policy that worked / 103 7: Immigration: the Google guys' challenge / 121 8: The Diaspora: stealing airplanes / 135 9: The Buffett test / 145 10: Yozma: the match / 159 Part IV: Country With a Motive 11: Betrayal and opportunity / 177 12: From nose cones to geysers / 184 13: The sheikh's dilemma / 194 14: Threats to the economic miracle / 215 Conclusion: Farmers of high tech / 225 Afterword / 237 Acknowledgments / 245 Notes / 251 Bibliography / 273 Index / 299 About the Authors / 311

rawTOC:
Foreword by Shimon Peres / xi \\ Authors' Note / xv \\ Maps / xvii \\ Introduction / 1 \\ Part I: The Little Nation That Could / \\ 1: Persistance / 23 \\ 2: Battlefield entrepreneurs / 41 \\ Part ii: Seeding a Culture of Innovation / \\ 3: The people of the book / 57 \\ 4: Harvard, Princeton and Yale / 67 \\ 5: Where order meets random chaos / 84 \\ Part III: Beginnings \\ 6: An industrial policy that worked / 103 \\ 7: Immigration: the Google guys' challenge / 121 \\ 8: The Diaspora: stealing airplanes / 135 \\ 9: The Buffett test / 145 \\ 10: Yozma: the match / 159 \\ Part IV: Country With a Motive \\ 11: Betrayal and opportunity / 177 \\ 12: From nose cones to geysers / 184 \\ 13: The sheikh's dilemma / 194 \\ 14: Threats to the economic miracle / 215 \\ Conclusion: Farmers of high tech / 225 \\ Afterword / 237 \\ Acknowledgments / 245 \\ Notes / 251 \\ Bibliography / 273 \\ Index / 299 \\ About the Authors / 311

entry:
@Book{Senor:2009:SNS,
  author =       "Dan Senor and Saul Singer",
  title =        "Start-up Nation: the Story of {Israel}'s Economic
                 Miracle",
  publisher =    "Twelve",
  address =      "New York, NY, USA",
  pages =        "x + 304",
  year =         "2009",
  ISBN =         "0-446-54146-X, 0-446-54147-8 (paperback),
                 1-4555-0346-0 (e-book), 1-59995-857-0 (e-book)",
  ISBN-13 =      "978-0-446-54146-6, 978-0-446-54147-3 (paperback),
                 978-1-4555-0346-9 (e-book X11), 978-1-59995-857-6
                 (e-book X11)",
  LCCN =         "HC415.25 .S455 2009eb",
  bibdate =      "Mon Feb 11 08:55:54 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "What the world can learn from Israel's meteoric
                 economic success.",
  libnote =      "Not in my library.",
  tableofcontents = "Foreword by Shimon Peres / xi \\
                 Authors' Note / xv \\
                 Maps / xvii \\
                 Introduction / 1 \\
                 Part I: The Little Nation That Could / \\
                 1: Persistance / 23 \\
                 2: Battlefield entrepreneurs / 41 \\
                 Part ii: Seeding a Culture of Innovation / \\
                 3: The people of the book / 57 \\
                 4: Harvard, Princeton and Yale / 67 \\
                 5: Where order meets random chaos / 84 \\
                 Part III: Beginnings \\
                 6: An industrial policy that worked / 103 \\
                 7: Immigration: the Google guys' challenge / 121 \\
                 8: The Diaspora: stealing airplanes / 135 \\
                 9: The Buffett test / 145 \\
                 10: Yozma: the match / 159 \\
                 Part IV: Country With a Motive \\
                 11: Betrayal and opportunity / 177 \\
                 12: From nose cones to geysers / 184 \\
                 13: The sheikh's dilemma / 194 \\
                 14: Threats to the economic miracle / 215 \\
                 Conclusion: Farmers of high tech / 225 \\
                 Afterword / 237 \\
                 Acknowledgments / 245 \\
                 Notes / 251 \\
                 Bibliography / 273 \\
                 Index / 299 \\
                 About the Authors / 311",
}


bibtype: book
filename: master.bib
label: Seroul:1989:PLT
author: Raymond Seroul
title: Le petit Livre de TeX
publisher: pub-IE
address: pub-IE:adr
pages: 317
year: 1989
ISBN: 2-7296-0233-X OR 272960233X
ISBN13: 978-2-7296-0233-8 OR 9782729602338
LCCN: Z253.4 T47 S47 1989
bibdate: Sun May 02 07:53:23 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1999.05.02 07:53:23 ???
note: English translation available as cite Seroul:1991:BBT.
acknowledgement: ack-nhfb
rawauthor: Raymond Seroul
rawnote: English translation available as \cite{Seroul:1991:BBT}.
rawtitle: Le petit Livre de {\TeX}
entry:
@Book{Seroul:1989:PLT,
  author =       "Raymond Seroul",
  title =        "Le petit Livre de {\TeX}",
  publisher =    pub-IE,
  address =      pub-IE:adr,
  pages =        "317",
  year =         "1989",
  ISBN =         "2-7296-0233-X",
  ISBN-13 =      "978-2-7296-0233-8",
  LCCN =         "Z253.4 T47 S47 1989",
  bibdate =      "Sun May 02 07:53:23 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "English translation available as
                 \cite{Seroul:1991:BBT}.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Seroul:1991:BBT
author: Raymond Seroul and Silvio Levy
title: A Beginner's Book of TeX
publisher: pub-SV
address: pub-SV:adr
pages: xii + 282
year: 1991
DOI: https://doi.org/10.1007/978-1-4419-8654-2
ISBN: 0-387-97562-4, 3-540-97562-4 OR 0387975624, 3540975624
ISBN13: 978-0-387-97562-7, 978-3-540-97562-5 OR 9780387975627, 9783540975625
LCCN: Z253.4.T47 S47 1991
bibdate: Sun Mar 27 19:05:51 1994
bibtimestamp: 1994.03.27 19:05:51 ???
note: This is a translation and adaption by Silvio Levy of cite Seroul:1989:PLT.
acknowledgement: ack-nhfb
rawauthor: Raymond Seroul and Silvio Levy
rawnote: This is a translation and adaption by Silvio Levy of \cite{Seroul:1989:PLT}.
rawtitle: A Beginner's Book of {\TeX}
abstract:
This book is a friendly introduction to TeX , the powerful typesetting system designed by Donald Knuth. It is addressed primarily to beginners, but it contains much information that will be useful to aspiring TeX ``wizards''. Moreover, the authors kept firmly in mind the diversity of backgrounds that characterizes TeX users: authors in the sciences and in the humanities, secretaries, technical typists. The book contains a careful explanation of all fundamental concepts and commands, but also a wealth of commented examples and ``tricks'' based on the authors' long experience with TeX . The attentive reader will quickly be able to create a table, or customize the appearance of the page, or code even the most complicated formula. The last third of the book is devoted to a Dictionary/Index, summarizing all the material in the text and going into greater depth in many areas.

TOC:
1: What is TeX 1.1 The birth of TeX 1.2 How TeX works 1.3 The good news and bad news about TeX 1.4 TeX who and what for? 1.5 TeX processing: an overview 1.6 Looking ahead 1.7 Creating a master file 1.8 Error messages 2: The characters of TeX 2.1 Characters that are special to TeX 2.2 Quotes 2.3 Ligatures and special characters 2.4 Accents 2.5 Two exercises 3: Groups and modes 3.1 Groups 3.2 Modes 3.3 For the aspiring wizard 4: The fonts TeX uses 4.1 TeX 's fonts 4.2 Preloaded fonts 4.3 Loading other fonts 4.4 A cornucopia of fonts 4.5 Scaling of fonts 4.6 Global scaling 4.7 For the aspiring wizard 4.8 Exercise 5: Spacing, glue and springs 5.1 Horizontal spacing 5.2 Vertical spacing 5.3 Glue, or, spaces that stretch and shrink 5.4 Springs 5.5 Spacing and breaks 5.6 Summary of basic spacing commands 5.7 Spacing between paragraphs 5.8 More spring like creatures 5.9 Leaders in their full glory 5.10 For the experienced user 5.11 Examples 6: Paragraphs 6.1 Beginning and ending a paragraph 6.2 What's in a paragraph? 6.3 Automatic indentation 6.4 Obeying lines 6.5 Left and right margins 6.6 Ragged margins 6.7 Quotations 6.8 Centering text 6.9 Series of items 6.10 More on hanging indentation 6.11 Paragraphs with fancy shapes 6.12 Footnotes 6.13 Two new macros for the aspiring wizard 7: Page layout 7.1 Page layout in plain TeX 7.2 A more elaborate layout 7.3 The title page 7.4 Starting a fresh page and leaving a blank page 7.5 Placing a title 7.6 Choosing line and page breaks by hand 7.7 Floats 7.8 A complete example 7.9 Penalties: or, the carrot and the stick 8: Boxes 8.1 What is a box? 8.2 Putting boxes together 8.3 What goes in a box? 8.4 Creating a box: summary 8.5 Storing a box 8.6 The baseline 8.7 The dimensions of a box 8.8 Some practical situations 8.9 Spacing between boxes 8.10 Rules 8.11 More practical examples 8.12 For the aspiring wizard 9: Alignments 9.1 The preamble, a.k.a. recipe 9.2 Simple alignments 9.3 Some practical suggestions 9.4 Treating special cases 9.5 Excessively wide entries 9.6 Inserting material between rows 9.7 Combining columns 9.8 Aligning digits 9.9 Horizontal rules and spacing 9.10 Vertical rules 9.11 Braces and tables 9.12 Fixing the width of an alignment 9.13 Vertical alignments 10: Tabbing 10.1 Setting tabs 10.2 Centering 10.3 Choosing column widths 10.4 Equally spaced tabs 10.5 Clearing tabs 10.6 Tabs and rules 10.7 Tabs and springs 10.8 Typesetting code 10.9 Tabs and alignments: a comparison 11: Typesetting mathematics 11.1 Generalities 11.2 Math symbols 11.3 Fonts in math mode 11.4 Subscripts and superscripts 11.5 Accents 11.6 Spacing in math mode 11.7 The four styles 11.8 Function names 11.9 Fractions 11.10 Large operators and limits 11.11 Radicals 11.12 Horizontally extensible symbols 11.13 Vertically extensible symbols 11.14 Stacking up symbols 11.15 Combining relations 11.16 More custom-made symbols: limits 11.17 Phantoms 11.18 Displaying several formulas 11.19 Aligning several formulas 11.20 Labeling formulas 11.21 Matrices 11.22 Adjusting the spacing 11.23 Ellipses 11.24 Diagrams 12: TeX Programming 12.1 Generalities 12.2 Abbreviations and clones 12.3 Macros with arguments 12.4 Fine points of macro syntax 12.5 Category codes 12.6 Active characters 12.7 How TeX reads and stores your text 12.8 Registers 12.9 Conditionals 12.10 For the aspiring wizard 13: Dictionary and Index

rawabstract:
This book is a friendly introduction to \TeX{}, the powerful typesetting system designed by Donald Knuth. It is addressed primarily to beginners, but it contains much information that will be useful to aspiring \TeX{} ``wizards''. Moreover, the authors kept firmly in mind the diversity of backgrounds that characterizes \TeX{} users: authors in the sciences and in the humanities, secretaries, technical typists. The book contains a careful explanation of all fundamental concepts and commands, but also a wealth of commented examples and ``tricks'' based on the authors' long experience with \TeX{}. The attentive reader will quickly be able to create a table, or customize the appearance of the page, or code even the most complicated formula. The last third of the book is devoted to a Dictionary/Index, summarizing all the material in the text and going into greater depth in many areas.

shortTOC:
What is TeX? The characters of TeX Groups and modes The fonts TeX uses Spacing, glue and springs Paragraphs Page layout Boxes Alignments Tabbing Typesetting mathematics TeX programming Dictionary and index

rawshortTOC:
What is TeX? \\ The characters of TeX \\ Groups and modes \\ The fonts TeX uses \\ Spacing, glue and springs \\ Paragraphs \\ Page layout \\ Boxes \\ Alignments \\ Tabbing \\ Typesetting mathematics \\ TeX programming \\ Dictionary and index

rawTOC:
1: What is \TeX{} \\ 1.1 The birth of \TeX{} \\ 1.2 How \TeX{} works \\ 1.3 The good news and bad news about \TeX{} \\ 1.4 \TeX{} who and what for? \\ 1.5 \TeX{} processing: an overview \\ 1.6 Looking ahead \\ 1.7 Creating a master file \\ 1.8 Error messages \\ 2: The characters of \TeX{} \\ 2.1 Characters that are special to \TeX{} \\ 2.2 Quotes \\ 2.3 Ligatures and special characters \\ 2.4 Accents \\ 2.5 Two exercises \\ 3: Groups and modes \\ 3.1 Groups \\ 3.2 Modes \\ 3.3 For the aspiring wizard \\ 4: The fonts \TeX{} uses \\ 4.1 \TeX{}'s fonts \\ 4.2 Preloaded fonts \\ 4.3 Loading other fonts \\ 4.4 A cornucopia of fonts \\ 4.5 Scaling of fonts \\ 4.6 Global scaling \\ 4.7 For the aspiring wizard \\ 4.8 Exercise \\ 5: Spacing, glue and springs \\ 5.1 Horizontal spacing \\ 5.2 Vertical spacing \\ 5.3 Glue, or, spaces that stretch and shrink \\ 5.4 Springs \\ 5.5 Spacing and breaks \\ 5.6 Summary of basic spacing commands \\ 5.7 Spacing between paragraphs \\ 5.8 More spring like creatures \\ 5.9 Leaders in their full glory \\ 5.10 For the experienced user \\ 5.11 Examples \\ 6: Paragraphs \\ 6.1 Beginning and ending a paragraph \\ 6.2 What's in a paragraph? \\ 6.3 Automatic indentation \\ 6.4 Obeying lines \\ 6.5 Left and right margins \\ 6.6 Ragged margins \\ 6.7 Quotations \\ 6.8 Centering text \\ 6.9 Series of items \\ 6.10 More on hanging indentation \\ 6.11 Paragraphs with fancy shapes \\ 6.12 Footnotes \\ 6.13 Two new macros for the aspiring wizard \\ 7: Page layout \\ 7.1 Page layout in plain \TeX{} \\ 7.2 A more elaborate layout \\ 7.3 The title page \\ 7.4 Starting a fresh page and leaving a blank page \\ 7.5 Placing a title \\ 7.6 Choosing line and page breaks by hand \\ 7.7 Floats \\ 7.8 A complete example \\ 7.9 Penalties: or, the carrot and the stick \\ 8: Boxes \\ 8.1 What is a box? \\ 8.2 Putting boxes together \\ 8.3 What goes in a box? \\ 8.4 Creating a box: summary \\ 8.5 Storing a box \\ 8.6 The baseline \\ 8.7 The dimensions of a box \\ 8.8 Some practical situations \\ 8.9 Spacing between boxes \\ 8.10 Rules \\ 8.11 More practical examples \\ 8.12 For the aspiring wizard \\ 9: Alignments \\ 9.1 The preamble, a.k.a. recipe \\ 9.2 Simple alignments \\ 9.3 Some practical suggestions \\ 9.4 Treating special cases \\ 9.5 Excessively wide entries \\ 9.6 Inserting material between rows \\ 9.7 Combining columns \\ 9.8 Aligning digits \\ 9.9 Horizontal rules and spacing \\ 9.10 Vertical rules \\ 9.11 Braces and tables \\ 9.12 Fixing the width of an alignment \\ 9.13 Vertical alignments \\ 10: Tabbing \\ 10.1 Setting tabs \\ 10.2 Centering \\ 10.3 Choosing column widths \\ 10.4 Equally spaced tabs \\ 10.5 Clearing tabs \\ 10.6 Tabs and rules \\ 10.7 Tabs and springs \\ 10.8 Typesetting code \\ 10.9 Tabs and alignments: a comparison \\ 11: Typesetting mathematics \\ 11.1 Generalities \\ 11.2 Math symbols \\ 11.3 Fonts in math mode \\ 11.4 Subscripts and superscripts \\ 11.5 Accents \\ 11.6 Spacing in math mode \\ 11.7 The four styles \\ 11.8 Function names \\ 11.9 Fractions \\ 11.10 Large operators and limits \\ 11.11 Radicals \\ 11.12 Horizontally extensible symbols \\ 11.13 Vertically extensible symbols \\ 11.14 Stacking up symbols \\ 11.15 Combining relations \\ 11.16 More custom-made symbols: limits \\ 11.17 Phantoms \\ 11.18 Displaying several formulas \\ 11.19 Aligning several formulas \\ 11.20 Labeling formulas \\ 11.21 Matrices \\ 11.22 Adjusting the spacing \\ 11.23 Ellipses \\ 11.24 Diagrams \\ 12: \TeX{} Programming \\ 12.1 Generalities \\ 12.2 Abbreviations and clones \\ 12.3 Macros with arguments \\ 12.4 Fine points of macro syntax \\ 12.5 Category codes \\ 12.6 Active characters \\ 12.7 How \TeX{} reads and stores your text \\ 12.8 Registers \\ 12.9 Conditionals \\ 12.10 For the aspiring wizard \\ 13: Dictionary and Index

entry:
@Book{Seroul:1991:BBT,
  author =       "Raymond Seroul and Silvio Levy",
  title =        "A Beginner's Book of {\TeX}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 282",
  year =         "1991",
  DOI =          "https://doi.org/10.1007/978-1-4419-8654-2",
  ISBN =         "0-387-97562-4, 3-540-97562-4",
  ISBN-13 =      "978-0-387-97562-7, 978-3-540-97562-5",
  LCCN =         "Z253.4.T47 S47 1991",
  bibdate =      "Sun Mar 27 19:05:51 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  note =         "This is a translation and adaption by Silvio Levy of
                 \cite{Seroul:1989:PLT}.",
  abstract =     "This book is a friendly introduction to \TeX{}, the
                 powerful typesetting system designed by Donald Knuth.
                 It is addressed primarily to beginners, but it contains
                 much information that will be useful to aspiring \TeX{}
                 ``wizards''. Moreover, the authors kept firmly in mind
                 the diversity of backgrounds that characterizes \TeX{}
                 users: authors in the sciences and in the humanities,
                 secretaries, technical typists. The book contains a
                 careful explanation of all fundamental concepts and
                 commands, but also a wealth of commented examples and
                 ``tricks'' based on the authors' long experience with
                 \TeX{}. The attentive reader will quickly be able to
                 create a table, or customize the appearance of the
                 page, or code even the most complicated formula. The
                 last third of the book is devoted to a
                 Dictionary/Index, summarizing all the material in the
                 text and going into greater depth in many areas.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "What is TeX? \\
                 The characters of TeX \\
                 Groups and modes \\
                 The fonts TeX uses \\
                 Spacing, glue and springs \\
                 Paragraphs \\
                 Page layout \\
                 Boxes \\
                 Alignments \\
                 Tabbing \\
                 Typesetting mathematics \\
                 TeX programming \\
                 Dictionary and index",
  tableofcontents = "1: What is \TeX{} \\
                 1.1 The birth of \TeX{} \\
                 1.2 How \TeX{} works \\
                 1.3 The good news and bad news about \TeX{} \\
                 1.4 \TeX{} who and what for? \\
                 1.5 \TeX{} processing: an overview \\
                 1.6 Looking ahead \\
                 1.7 Creating a master file \\
                 1.8 Error messages \\
                 2: The characters of \TeX{} \\
                 2.1 Characters that are special to \TeX{} \\
                 2.2 Quotes \\
                 2.3 Ligatures and special characters \\
                 2.4 Accents \\
                 2.5 Two exercises \\
                 3: Groups and modes \\
                 3.1 Groups \\
                 3.2 Modes \\
                 3.3 For the aspiring wizard \\
                 4: The fonts \TeX{} uses \\
                 4.1 \TeX{}'s fonts \\
                 4.2 Preloaded fonts \\
                 4.3 Loading other fonts \\
                 4.4 A cornucopia of fonts \\
                 4.5 Scaling of fonts \\
                 4.6 Global scaling \\
                 4.7 For the aspiring wizard \\
                 4.8 Exercise \\
                 5: Spacing, glue and springs \\
                 5.1 Horizontal spacing \\
                 5.2 Vertical spacing \\
                 5.3 Glue, or, spaces that stretch and shrink \\
                 5.4 Springs \\
                 5.5 Spacing and breaks \\
                 5.6 Summary of basic spacing commands \\
                 5.7 Spacing between paragraphs \\
                 5.8 More spring like creatures \\
                 5.9 Leaders in their full glory \\
                 5.10 For the experienced user \\
                 5.11 Examples \\
                 6: Paragraphs \\
                 6.1 Beginning and ending a paragraph \\
                 6.2 What's in a paragraph? \\
                 6.3 Automatic indentation \\
                 6.4 Obeying lines \\
                 6.5 Left and right margins \\
                 6.6 Ragged margins \\
                 6.7 Quotations \\
                 6.8 Centering text \\
                 6.9 Series of items \\
                 6.10 More on hanging indentation \\
                 6.11 Paragraphs with fancy shapes \\
                 6.12 Footnotes \\
                 6.13 Two new macros for the aspiring wizard \\
                 7: Page layout \\
                 7.1 Page layout in plain \TeX{} \\
                 7.2 A more elaborate layout \\
                 7.3 The title page \\
                 7.4 Starting a fresh page and leaving a blank page \\
                 7.5 Placing a title \\
                 7.6 Choosing line and page breaks by hand \\
                 7.7 Floats \\
                 7.8 A complete example \\
                 7.9 Penalties: or, the carrot and the stick \\
                 8: Boxes \\
                 8.1 What is a box? \\
                 8.2 Putting boxes together \\
                 8.3 What goes in a box? \\
                 8.4 Creating a box: summary \\
                 8.5 Storing a box \\
                 8.6 The baseline \\
                 8.7 The dimensions of a box \\
                 8.8 Some practical situations \\
                 8.9 Spacing between boxes \\
                 8.10 Rules \\
                 8.11 More practical examples \\
                 8.12 For the aspiring wizard \\
                 9: Alignments \\
                 9.1 The preamble, a.k.a. recipe \\
                 9.2 Simple alignments \\
                 9.3 Some practical suggestions \\
                 9.4 Treating special cases \\
                 9.5 Excessively wide entries \\
                 9.6 Inserting material between rows \\
                 9.7 Combining columns \\
                 9.8 Aligning digits \\
                 9.9 Horizontal rules and spacing \\
                 9.10 Vertical rules \\
                 9.11 Braces and tables \\
                 9.12 Fixing the width of an alignment \\
                 9.13 Vertical alignments \\
                 10: Tabbing \\
                 10.1 Setting tabs \\
                 10.2 Centering \\
                 10.3 Choosing column widths \\
                 10.4 Equally spaced tabs \\
                 10.5 Clearing tabs \\
                 10.6 Tabs and rules \\
                 10.7 Tabs and springs \\
                 10.8 Typesetting code \\
                 10.9 Tabs and alignments: a comparison \\
                 11: Typesetting mathematics \\
                 11.1 Generalities \\
                 11.2 Math symbols \\
                 11.3 Fonts in math mode \\
                 11.4 Subscripts and superscripts \\
                 11.5 Accents \\
                 11.6 Spacing in math mode \\
                 11.7 The four styles \\
                 11.8 Function names \\
                 11.9 Fractions \\
                 11.10 Large operators and limits \\
                 11.11 Radicals \\
                 11.12 Horizontally extensible symbols \\
                 11.13 Vertically extensible symbols \\
                 11.14 Stacking up symbols \\
                 11.15 Combining relations \\
                 11.16 More custom-made symbols: limits \\
                 11.17 Phantoms \\
                 11.18 Displaying several formulas \\
                 11.19 Aligning several formulas \\
                 11.20 Labeling formulas \\
                 11.21 Matrices \\
                 11.22 Adjusting the spacing \\
                 11.23 Ellipses \\
                 11.24 Diagrams \\
                 12: \TeX{} Programming \\
                 12.1 Generalities \\
                 12.2 Abbreviations and clones \\
                 12.3 Macros with arguments \\
                 12.4 Fine points of macro syntax \\
                 12.5 Category codes \\
                 12.6 Active characters \\
                 12.7 How \TeX{} reads and stores your text \\
                 12.8 Registers \\
                 12.9 Conditionals \\
                 12.10 For the aspiring wizard \\
                 13: Dictionary and Index",
}


bibtype: book
filename: master.bib
label: Service:2018:LTN
author: Robert Service
title: The Last of the Tsars: Nicholas II and the Russia Revolution
publisher: Pegasus Books
address: New York, NY, USA
pages: xviii + 382
year: 2018
ISBN: 1-68177-883-1 (paperback) OR 1681778831 (paperback)
ISBN13: 978-1-68177-883-9 (paperback) OR 9781681778839 (paperback)
bibdate: Wed Jan 2 08:07:56 MST 2019
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2019.01.02 08:07:56 MST
acknowledgement: ack-nhfb
rawauthor: Robert Service
rawtitle: The Last of the Tsars: {Nicholas II} and the {Russia} Revolution
TOC:
List of Illustrations / xi Maps / xiii Acknowledgements / xvii Introduction / 1 1. Tsar of All Russia / 5 2. At GHQ / 11 3. The February Revolution / 17 4. Abdication / 21 5. Tsarskoe Selo / 32 6. Family Life / 39 7. The Provisional Government / 44 8. The British Offer / 49 9. Rules and Routines / 54 10. On the Lives of Rulers / 59 11. Kerensky's Dilemma / 67 12. Distant Transfer / 73 13. Destination Tobolsk / 80 14. Plenipotentiary Pankratov / 85 15. The October Revolution / 93 16. The Romanov dispersal / 100 17. Freedom House / 104 18. Learning from Others / 108 19. Time on their Hands / 113 20. `October' in January / 118 21. The Moscow Discussions / 126 22. Rescue Plans / 132 23. The Russian Future / 140 24. Comrades on the March / 145 25. Tobolsk and Moscow / 152 26. Commissar Yakovlev / 158 27. The Order to Move / 163 28. South to Tyumen / 169 29. Destination to be Confirmed / 176 30. To the Ipatev House / 184 31. The Urals and its Bolsheviks / 191 32. Meanwhile, in Tobolsk / 198 33. Enduring Ekaterinburg / 203 / 34. A Sense of the World / 211 35. Civil War / 216 36. German Manoeuvres / 221 37. Last Days in the House / 228 38. The Ekaterinburg Trap / 233 39. The Moscow Fulcrum / 238 40. The Man Who Would Not be Tsar / 243 41. Narrowed Options / 248 42. Death in the Cellar / 254 43. Red Evacuation / 258 44. Murders, Cover-ups, Pretenders / 263 45. The Czechoslovak Occupation / 268 46. Romanov survivors / 274 47. The Anti-Bolshevik Inquiry / 280 48. Dispute Without Bones / 288 49. Afterword / 295 Bibliography / 301 Notes / 311 Index / 363

rawTOC:
List of Illustrations / xi \\ Maps / xiii \\ Acknowledgements / xvii \\ Introduction / 1 \\ 1. Tsar of All Russia / 5 \\ 2. At GHQ / 11 \\ 3. The February Revolution / 17 \\ 4. Abdication / 21 \\ 5. Tsarskoe Selo / 32 \\ 6. Family Life / 39 \\ 7. The Provisional Government / 44 \\ 8. The British Offer / 49 \\ 9. Rules and Routines / 54 \\ 10. On the Lives of Rulers / 59 \\ 11. Kerensky's Dilemma / 67 \\ 12. Distant Transfer / 73 \\ 13. Destination Tobolsk / 80 \\ 14. Plenipotentiary Pankratov / 85 \\ 15. The October Revolution / 93 \\ 16. The Romanov dispersal / 100 \\ 17. Freedom House / 104 \\ 18. Learning from Others / 108 \\ 19. Time on their Hands / 113 \\ 20. `October' in January / 118 \\ 21. The Moscow Discussions / 126 \\ 22. Rescue Plans / 132 \\ 23. The Russian Future / 140 \\ 24. Comrades on the March / 145 \\ 25. Tobolsk and Moscow / 152 \\ 26. Commissar Yakovlev / 158 \\ 27. The Order to Move / 163 \\ 28. South to Tyumen / 169 \\ 29. Destination to be Confirmed / 176 \\ 30. To the Ipatev House / 184 \\ 31. The Urals and its Bolsheviks / 191 \\ 32. Meanwhile, in Tobolsk / 198 \\ 33. Enduring Ekaterinburg / 203 / \\ 34. A Sense of the World / 211 \\ 35. Civil War / 216 \\ 36. German Manoeuvres / 221 \\ 37. Last Days in the House / 228 \\ 38. The Ekaterinburg Trap / 233 \\ 39. The Moscow Fulcrum / 238 \\ 40. The Man Who Would Not be Tsar / 243 \\ 41. Narrowed Options / 248 \\ 42. Death in the Cellar / 254 \\ 43. Red Evacuation / 258 \\ 44. Murders, Cover-ups, Pretenders / 263 \\ 45. The Czechoslovak Occupation / 268 \\ 46. Romanov survivors / 274 \\ 47. The Anti-Bolshevik Inquiry / 280 \\ 48. Dispute Without Bones / 288 \\ 49. Afterword / 295 \\ Bibliography / 301 \\ Notes / 311 \\ Index / 363

entry:
@Book{Service:2018:LTN,
  author =       "Robert Service",
  title =        "The Last of the Tsars: {Nicholas II} and the {Russia}
                 Revolution",
  publisher =    "Pegasus Books",
  address =      "New York, NY, USA",
  pages =        "xviii + 382",
  year =         "2018",
  ISBN =         "1-68177-883-1 (paperback)",
  ISBN-13 =      "978-1-68177-883-9 (paperback)",
  LCCN =         "????",
  bibdate =      "Wed Jan 2 08:07:56 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "List of Illustrations / xi \\
                 Maps / xiii \\
                 Acknowledgements / xvii \\
                 Introduction / 1 \\
                 1. Tsar of All Russia / 5 \\
                 2. At GHQ / 11 \\
                 3. The February Revolution / 17 \\
                 4. Abdication / 21 \\
                 5. Tsarskoe Selo / 32 \\
                 6. Family Life / 39 \\
                 7. The Provisional Government / 44 \\
                 8. The British Offer / 49 \\
                 9. Rules and Routines / 54 \\
                 10. On the Lives of Rulers / 59 \\
                 11. Kerensky's Dilemma / 67 \\
                 12. Distant Transfer / 73 \\
                 13. Destination Tobolsk / 80 \\
                 14. Plenipotentiary Pankratov / 85 \\
                 15. The October Revolution / 93 \\
                 16. The Romanov dispersal / 100 \\
                 17. Freedom House / 104 \\
                 18. Learning from Others / 108 \\
                 19. Time on their Hands / 113 \\
                 20. `October' in January / 118 \\
                 21. The Moscow Discussions / 126 \\
                 22. Rescue Plans / 132 \\
                 23. The Russian Future / 140 \\
                 24. Comrades on the March / 145 \\
                 25. Tobolsk and Moscow / 152 \\
                 26. Commissar Yakovlev / 158 \\
                 27. The Order to Move / 163 \\
                 28. South to Tyumen / 169 \\
                 29. Destination to be Confirmed / 176 \\
                 30. To the Ipatev House / 184 \\
                 31. The Urals and its Bolsheviks / 191 \\
                 32. Meanwhile, in Tobolsk / 198 \\
                 33. Enduring Ekaterinburg / 203 / \\
                 34. A Sense of the World / 211 \\
                 35. Civil War / 216 \\
                 36. German Manoeuvres / 221 \\
                 37. Last Days in the House / 228 \\
                 38. The Ekaterinburg Trap / 233 \\
                 39. The Moscow Fulcrum / 238 \\
                 40. The Man Who Would Not be Tsar / 243 \\
                 41. Narrowed Options / 248 \\
                 42. Death in the Cellar / 254 \\
                 43. Red Evacuation / 258 \\
                 44. Murders, Cover-ups, Pretenders / 263 \\
                 45. The Czechoslovak Occupation / 268 \\
                 46. Romanov survivors / 274 \\
                 47. The Anti-Bolshevik Inquiry / 280 \\
                 48. Dispute Without Bones / 288 \\
                 49. Afterword / 295 \\
                 Bibliography / 301 \\
                 Notes / 311 \\
                 Index / 363",
}


bibtype: book
filename: master.bib
label: Sewell:1989:WPL
author: E. Wayne Sewell
title: Weaving a Program: Literate Programming in WEB
publisher: pub-VAN-NOSTRAND-REINHOLD
address: pub-VAN-NOSTRAND-REINHOLD:adr
pages: xx + 556
year: 1989
ISBN: 0-442-31946-0 OR 0442319460
ISBN13: 978-0-442-31946-5 OR 9780442319465
LCCN: QA76.73.W24 S491 1989
bibdate: Wed Dec 15 10:41:40 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:41:40 ???
acknowledgement: ack-nhfb
rawauthor: E. Wayne Sewell
rawtitle: Weaving a Program: Literate Programming in {\WEB}
entry:
@Book{Sewell:1989:WPL,
  author =       "E. Wayne Sewell",
  title =        "Weaving a Program: Literate Programming in {\WEB}",
  publisher =    pub-VAN-NOSTRAND-REINHOLD,
  address =      pub-VAN-NOSTRAND-REINHOLD:adr,
  pages =        "xx + 556",
  year =         "1989",
  ISBN =         "0-442-31946-0",
  ISBN-13 =      "978-0-442-31946-5",
  LCCN =         "QA76.73.W24 S491 1989",
  bibdate =      "Wed Dec 15 10:41:40 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Shachtman:1999:AZC
author: Tom Shachtman
title: Absolute Zero and the Conquest of Cold
publisher: pub-HOUGHTON-MIFFLIN
address: pub-HOUGHTON-MIFFLIN:adr
pages: 261
year: 1999
LCCN: QC278 .S48 1999
bibdate: Wed Oct 8 15:09:40 MDT 2008
bibtimestamp: 2008.10.08 15:09:40 MDT
subject: low temperature research
acknowledgement: ack-nhfb
rawauthor: Tom Shachtman
rawtitle: Absolute Zero and the Conquest of Cold
ISBN:
0-395-93888-0, 0-547-52595-8, 0-618-08239-5 (paperback), 1-299-88289-7 OR 0395938880, 0547525958, 0618082395 (paperback), 1299882897

ISBN13:
978-0-395-93888-1, 978-0-547-52595-2, 978-0-618-08239-1 (paperback), 978-1-299-88289-8 OR 9780395938881, 9780547525952, 9780618082391 (paperback), 9781299882898

URL:
http://www.loc.gov/catdir/description/hm022/99033305.html; http://www.loc.gov/catdir/enhancements/fy0735/99033305-b.html; http://www.loc.gov/catdir/samples/hm051/99033305.html

abstract:
In a sweeping science adventure story, rich with historical characters, including Galileo, Newton, and Einstein, Tom Shachtman takes us on a journey in which the extraordinary secrets of cold are teased apart and mastered, bringing advances in civilization and comfort. Starting in the 1600s with an alchemist's attempt to air condition Westminster Abbey and the invention of thermometers and scales (where should zero be set?), the story unfolds as nineteenth-century merchants sell Walden Pond ice to tropical countries and competing scientists pursue absolute zero with as much fervor as the races toward the North and South Poles aroused.

TOC:
Winter in Summer Exploring the Frontiers Battle of the Thermometers Adventures in the Ice Trade The Confraternity of the Overlooked Through Heat to Cold Of Explosions and Mysterious Mists Painting the Map of Frigor Rare and Common Gases The Fifth Step A Sudden and Profound Disappearance Three Puzzles and a Solution Mastery of the Cold

rawabstract:
In a sweeping science adventure story, rich with historical characters, including Galileo, Newton, and Einstein, Tom Shachtman takes us on a journey in which the extraordinary secrets of cold are teased apart and mastered, bringing advances in civilization and comfort. Starting in the 1600s with an alchemist's attempt to air condition Westminster Abbey and the invention of thermometers and scales (where should zero be set?), the story unfolds as nineteenth-century merchants sell Walden Pond ice to tropical countries and competing scientists pursue absolute zero with as much fervor as the races toward the North and South Poles aroused.

rawTOC:
Winter in Summer \\ Exploring the Frontiers \\ Battle of the Thermometers \\ Adventures in the Ice Trade \\ The Confraternity of the Overlooked \\ Through Heat to Cold \\ Of Explosions and Mysterious Mists \\ Painting the Map of Frigor \\ Rare and Common Gases \\ The Fifth Step \\ A Sudden and Profound Disappearance \\ Three Puzzles and a Solution \\ Mastery of the Cold

entry:
@Book{Shachtman:1999:AZC,
  author =       "Tom Shachtman",
  title =        "Absolute Zero and the Conquest of Cold",
  publisher =    pub-HOUGHTON-MIFFLIN,
  address =      pub-HOUGHTON-MIFFLIN:adr,
  pages =        "261",
  year =         "1999",
  ISBN =         "0-395-93888-0, 0-547-52595-8, 0-618-08239-5
                 (paperback), 1-299-88289-7",
  ISBN-13 =      "978-0-395-93888-1, 978-0-547-52595-2,
                 978-0-618-08239-1 (paperback), 978-1-299-88289-8",
  LCCN =         "QC278 .S48 1999",
  bibdate =      "Wed Oct 8 15:09:40 MDT 2008",
  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",
  URL =          "http://www.loc.gov/catdir/description/hm022/99033305.html;
                 http://www.loc.gov/catdir/enhancements/fy0735/99033305-b.html;
                 http://www.loc.gov/catdir/samples/hm051/99033305.html",
  abstract =     "In a sweeping science adventure story, rich with
                 historical characters, including Galileo, Newton, and
                 Einstein, Tom Shachtman takes us on a journey in which
                 the extraordinary secrets of cold are teased apart and
                 mastered, bringing advances in civilization and
                 comfort. Starting in the 1600s with an alchemist's
                 attempt to air condition Westminster Abbey and the
                 invention of thermometers and scales (where should zero
                 be set?), the story unfolds as nineteenth-century
                 merchants sell Walden Pond ice to tropical countries
                 and competing scientists pursue absolute zero with as
                 much fervor as the races toward the North and South
                 Poles aroused.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "low temperature research",
  tableofcontents = "Winter in Summer \\
                 Exploring the Frontiers \\
                 Battle of the Thermometers \\
                 Adventures in the Ice Trade \\
                 The Confraternity of the Overlooked \\
                 Through Heat to Cold \\
                 Of Explosions and Mysterious Mists \\
                 Painting the Map of Frigor \\
                 Rare and Common Gases \\
                 The Fifth Step \\
                 A Sudden and Profound Disappearance \\
                 Three Puzzles and a Solution \\
                 Mastery of the Cold",
}


bibtype: book
filename: master.bib
label: Shanley:1999:PPP
author: Tom Shanley
title: Pentium Pro and Pentium II system architecture
publisher: pub-AW
address: pub-AW:adr
edition: Second
pages: xxxv + 588
year: 1999
ISBN: 0-201-30973-4 (paperback) OR 0201309734 (paperback)
ISBN13: 978-0-201-30973-7 (paperback) OR 9780201309737 (paperback)
LCCN: QA76.8.P46S48 1998
bibdate: Tue May 11 06:45:53 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1999.05.11 06:45:53 ???
acknowledgement: ack-nhfb
rawauthor: Tom Shanley
rawtitle: {Pentium Pro} and {Pentium II} system architecture
entry:
@Book{Shanley:1999:PPP,
  author =       "Tom Shanley",
  title =        "{Pentium Pro} and {Pentium II} system architecture",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xxxv + 588",
  year =         "1999",
  ISBN =         "0-201-30973-4 (paperback)",
  ISBN-13 =      "978-0-201-30973-7 (paperback)",
  LCCN =         "QA76.8.P46S48 1998",
  bibdate =      "Tue May 11 06:45:53 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$36.95",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
}


bibtype: book
filename: master.bib
label: Shapiro:1999:IRS
author: Carl Shapiro and Hal R. Varian
title: Information Rules: a Strategic Guide to the Network Economy
publisher: Harvard Business School Press
address: Boston, MA, USA
pages: x + 352
year: 1999
LCCN: HC79.I55 S53 1999
bibdate: Mon Dec 06 16:24:14 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1999.12.06 16:24:14 ???
acknowledgement: ack-nhfb
rawauthor: Carl Shapiro and Hal R. Varian
rawtitle: Information Rules: a Strategic Guide to the Network Economy
ISBN:
0-87584-863-X (paperback), 1-4221-5462-9, 0-585-16425-8 (e-book) OR 087584863X (paperback), 1422154629, 0585164258 (ebook)

ISBN13:
978-0-87584-863-1 (paperback), 978-1-4221-5462-5, 978-0-585-16425-0 (e-book) OR 9780875848631 (paperback), 9781422154625, 9780585164250 (ebook)

abstract:
In booktitle Information Rules, authors Shapiro and Varian reveal that many classic economic concepts can provide the insight and understanding necessary to succeed in the information age. They argue that if managers seriously want to develop effective strategies for competing in the new economy, they must understand the fundamental economics of information technology. Whether information takes the form of software code or recorded music, is published in a book or magazine, or even posted on a website, managers must know how to evaluate the consequences of pricing, protecting, and planning new versions of information products, services, and systems. The first book to distill the economics of information and networks into practical business strategies, booktitle Information Rules is a guide to the winning moves that can help business leaders navigate successfully through the tough decisions of the information economy.

TOC:
1: Information economy 2: Pricing information 3: Versioning information 4: Rights management 5: Recognizing lock-in 6: Managing lock-in 7: Networks and positive feedback 8: Cooperation and compatibility 9: Waging a standards war 10: Information policy

rawabstract:
In \booktitle{Information Rules}, authors Shapiro and Varian reveal that many classic economic concepts can provide the insight and understanding necessary to succeed in the information age. They argue that if managers seriously want to develop effective strategies for competing in the new economy, they must understand the fundamental economics of information technology. Whether information takes the form of software code or recorded music, is published in a book or magazine, or even posted on a website, managers must know how to evaluate the consequences of pricing, protecting, and planning new versions of information products, services, and systems. The first book to distill the economics of information and networks into practical business strategies, \booktitle{Information Rules} is a guide to the winning moves that can help business leaders navigate successfully through the tough decisions of the information economy.

rawTOC:
1: Information economy \\ 2: Pricing information \\ 3: Versioning information \\ 4: Rights management \\ 5: Recognizing lock-in \\ 6: Managing lock-in \\ 7: Networks and positive feedback \\ 8: Cooperation and compatibility \\ 9: Waging a standards war \\ 10: Information policy

entry:
@Book{Shapiro:1999:IRS,
  author =       "Carl Shapiro and Hal R. Varian",
  title =        "Information Rules: a Strategic Guide to the Network
                 Economy",
  publisher =    "Harvard Business School Press",
  address =      "Boston, MA, USA",
  pages =        "x + 352",
  year =         "1999",
  ISBN =         "0-87584-863-X (paperback), 1-4221-5462-9,
                 0-585-16425-8 (e-book)",
  ISBN-13 =      "978-0-87584-863-1 (paperback), 978-1-4221-5462-5,
                 978-0-585-16425-0 (e-book)",
  LCCN =         "HC79.I55 S53 1999",
  bibdate =      "Mon Dec 06 16:24:14 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$29.95",
  abstract =     "In \booktitle{Information Rules}, authors Shapiro and
                 Varian reveal that many classic economic concepts can
                 provide the insight and understanding necessary to
                 succeed in the information age. They argue that if
                 managers seriously want to develop effective strategies
                 for competing in the new economy, they must understand
                 the fundamental economics of information technology.
                 Whether information takes the form of software code or
                 recorded music, is published in a book or magazine, or
                 even posted on a website, managers must know how to
                 evaluate the consequences of pricing, protecting, and
                 planning new versions of information products,
                 services, and systems. The first book to distill the
                 economics of information and networks into practical
                 business strategies, \booktitle{Information Rules} is a
                 guide to the winning moves that can help business
                 leaders navigate successfully through the tough
                 decisions of the information economy.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Information economy \\
                 2: Pricing information \\
                 3: Versioning information \\
                 4: Rights management \\
                 5: Recognizing lock-in \\
                 6: Managing lock-in \\
                 7: Networks and positive feedback \\
                 8: Cooperation and compatibility \\
                 9: Waging a standards war \\
                 10: Information policy",
}


bibtype: book
filename: master.bib
label: Sharma:2019:CRP
author: Rahul Sharma and Vesa Kaihlavirta and Claus Matzinger
publisher: pub-PACKT
address: pub-PACKT:adr
pages: xii + 679
year: 2019
ISBN: 1-83882-810-9 OR 1838828109
ISBN13: 978-1-83882-810-3 OR 9781838828103
bibdate: Tue Dec 10 05:51:46 2019
bibtimestamp: 2019.12.10 05:51:46 ???
keywords: Rust programming language
acknowledgement: ack-nhfb
rawauthor: Rahul Sharma and Vesa Kaihlavirta and Claus Matzinger
title:
The Complete Rust Programming Reference Guide: Design, Develop, and Deploy Effective Software Systems Using the Advanced Constructs of Rust

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

rawtitle:
The Complete {Rust} Programming Reference Guide: Design, Develop, and Deploy Effective Software Systems Using the Advanced Constructs of Rust

entry:
@Book{Sharma:2019:CRP,
  author =       "Rahul Sharma and Vesa Kaihlavirta and Claus
                 Matzinger",
  title =        "The Complete {Rust} Programming Reference Guide:
                 Design, Develop, and Deploy Effective Software Systems
                 Using the Advanced Constructs of Rust",
  publisher =    pub-PACKT,
  address =      pub-PACKT:adr,
  pages =        "xii + 679",
  year =         "2019",
  ISBN =         "1-83882-810-9",
  ISBN-13 =      "978-1-83882-810-3",
  LCCN =         "????",
  bibdate =      "Tue Dec 10 05:51:46 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/rust.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Rust programming language",
  libnote =      "Not in my library.",
}


bibtype: book
filename: master.bib
label: Sharma:2019:MRL
author: Rahul Sharma and Vesa Kaihlavirta
publisher: pub-PACKT
address: pub-PACKT:adr
edition: Second
pages: 543 (est.)
year: 2019
ISBN: 1-78934-118-3, 1-78934-657-6 (paperback) OR 1789341183, 1789346576 (paperback)
ISBN13: 978-1-78934-118-8, 978-1-78934-657-2 (paperback) OR 9781789341188, 9781789346572 (paperback)
LCCN: QA76.73.R87
bibdate: Tue Dec 10 05:16:44 MST 2019
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2019.12.10 05:16:44 MST
URL: http://proquest.safaribooksonline.com/?fpi=9781789346572
remark: Previous edition published: 2017.
acknowledgement: ack-nhfb
rawauthor: Rahul Sharma and Vesa Kaihlavirta
title:
Mastering Rust: Learn About Memory Safety, Type System, Concurrency, and the New Features of Rust 2018 Edition

abstract:
Rust is an empowering language that provides a rare combination of safety, speed, and zero-cost abstractions. booktitle Mastering Rust --- Second Edition is filled with clear and simple explanations of the language features along with real-world examples, showing you how you can build robust, scalable, and reliable programs. This second edition of the book improves upon the previous one and touches on all aspects that make Rust a great language. We have included the features from latest Rust 2018 edition such as the new module system, the smarter compiler, helpful error messages, and the stable procedural macros. You'll learn how Rust can be used for systems programming, network programming, and even on the web. You'll also learn techniques such as writing memory-safe code, building idiomatic Rust libraries, writing efficient asynchronous networking code, and advanced macros. The book contains a mix of theory and hands-on tasks so you acquire the skills as well as the knowledge, and it also provides exercises to hammer the concepts in. After reading this book, you will be able to implement Rust for your enterprise projects, write better tests and documentation, design for performance, and write idiomatic Rust code. What you will learn Write generic and type-safe code by using Rust's powerful type system How memory safety works without garbage collection Know the different strategies in error handling and when to use them Learn how to use concurrency primitives such as threads and channels Use advanced macros to reduce boilerplate code Create efficient web applications with the Actix-web framework Use Diesel for type-safe database interactions in your web application Who this book is for The book is aimed at beginner and intermediate programmers who already have familiarity with any imperative language and have only heard of Rust as a new language. If you are a developer who wants to write robust, efficient and maintainable software systems and want to become proficient with Rust, this book is for you.

subject:
Rust (Computer program language); Application software; Development; Development.; Rust (Computer program language)

TOC:
Preface / 1 Chapter 1: Getting Started with Rust / 7 What is Rust and why should you care? / 8 Installing the Rust compiler and toolchain / 15 Using rustup.rs / 15 A tour of the language / 18 Primitive types / 21 Declaring variables and immutability / 22 Functions / 23 Closures / 25 Strings / 26 Conditionals and decision making / 27 Match expressions / 29 Loops / 30 User-defined types / 32 Structs / 33 Enums / 35 Functions and methods on types / 37 Impl blocks on structs / 38 Impl blocks for enums / 40 Modules, imports, and use statements / 42 Collections / 42 Arrays / 43 Tuples / 43 Vectors / 44 Hashmaps / 44 Slices / 45 Iterators / 47 Exercise fixing the word counter / 48 Summary / 49 Chapter 2: Managing Projects with Cargo / 50 Package managers / 51 Modules / 51 Nested modules / 52 File as a module / 54 Directory as module / 55 Cargo and crates / 57 Creating a new Cargo project / 59 Cargo and dependencies / 61 Running tests with Cargo / 63 Running examples with Cargo / 66 Cargo workspace / 66 Extending Cargo and tools / 68 Subcommands and Cargo installation / 68 cargo-watch / 68 cargo-edit / 69 cargo-deb / 69 cargo-outdated / 70 Linting code with clippy / 70 Exploring the manifest file Cargo.toml / 71 Setting up a Rust development environment / 74 Building a project with Cargo imgtool / 78 Summary / 81 Chapter 3: Tests, Documentation, and Benchmarks / 82 Motivation for testing / 83 Organizing tests / 84 Testing primitives / 84 Attributes / 85 Assertion macros / 86 Unit tests / 87 First unit test / 87 Running tests / 88 Isolating test code / 88 Failing tests / 90 Ignoring tests / 90 Integration tests / 91 First integration test / 92 Sharing common code / 93 Documentation / 95 Writing documentation / 95 Generating and viewing documentation / 96 Hosting documentation / 96 Doc attributes / 97 Documentation tests / 98 Benchmarks / 99 Built-in micro-benchmark harness / 100 Benchmarking on stable Rust / 102 Writing and testing a crate logic gate simulator / 105 Continuous integration with Travis CI / 109 Summary / 113 Chapter 4: Types, Generics, and Traits / 114 Type systems and why they matter / 114 Generics / 116 Creating generic types / 117 Generic functions / 118 Generic types / 119 Generic implementations / 119 Using generics / 121 Abstracting behavior with traits / 123 Traits / 124 The many forms of traits / 130 Marker traits / 130 Simple traits / 131 Generic traits / 131 Associated type traits / 131 Inherited traits / 132 Using traits with generics trait bounds / 132 Trait bounds on types / 136 Trait bounds on generic functions and impl blocks / 137 Using + to compose traits as bounds / 138 Trait bounds with impl trait syntax / 139 Exploring standard library traits / 141 True polymorphism using trait objects / 148 Dispatch / 149 Trait objects / 150 Summary / 152 Chapter 5: Memory Management and Safety / 153 Programs and memory / 154 How do programs use memory? / 156 Memory management and its kinds / 157 Approaches to memory allocation / 158 The stack / 158 The heap / 160 Memory management pitfalls / 162 Memory safety / 162 Trifecta of memory safety / 165 Ownership / 165 A brief on scopes / 167 Move and copy semantics / 169 Duplicating types via traits / 170 Copy / 171 Clone / 171 Ownership in action / 173 Borrowing / 178 Borrowing rules / 180 Borrowing in action / 181 Method types based on borrowing / 183 Lifetimes / 184 Lifetime parameters / 185 Lifetime elision and the rules / 186 Lifetimes in user defined types / 188 Lifetime in impl blocks / 188 Multiple lifetimes / 189 Lifetime subtyping / 189 Specifying lifetime bounds on generic types / 190 Pointer types in Rust / 192 References safe pointers / 193 Raw pointers / 193 Smart pointers / 194 Drop / 194 Deref and DerefMut / 196 Types of smart pointers / 196 Box<T> / 197 Reference counted smart pointers / 199 Rc<T> / 200 Interior mutability / 205 Cell<T> / 205 RefCell<T> / 207 Uses of interior mutability / 208 Summary / 210 Chapter 6: Error Handling / 211 Error handling prelude / 211 Recoverable errors / 214 Option / 214 Result / 218 Combinators on Option/Result / 222 Common combinators / 223 Using combinators / 224 Converting between Option and Result / 226 Early returns and the ? operator / 226 Non-recoverable errors / 228 User-friendly panics / 232 Custom errors and the Error trait / 232 Summary / 237 Chapter 7: Advanced Concepts / 238 Type system tidbits / 238 Blocks and expressions / 239 Let statements / 242 Loop as an expression / 247 Type clarity and sign distinction in numeric types / 248 Type inference / 250 Type aliases / 252 Strings / 253 Owned strings String / 254 Borrowed strings &str / 256 Slicing and dicing strings / 258 Using strings in functions / 259 Joining strings / 260 When to use &str versus String ? / 261 Global values / 261 Constants / 262 Statics / 262 Compile time functions const fn / 263 Dynamic statics using the lazy_static! macro / 264 Iterators / 265 Implementing a custom iterator / 266 Advanced types / 270 Unsized types / 270 Function types / 271 Never type ! and diverging functions / 272 Unions / 272 Cow / 273 Advanced traits / 274 Sized and ?Sized / 274 Borrow and AsRef / 274 ToOwned / 274 From and Into / 275 Trait objects and object safety / 275 Universal function call syntax / 276 Trait rules / 277 Closures in depth / 277 Fn closures / 278 FnMut closures / 278 FnOnce closures / 279 Consts in structs, enums, and traits / 280 Modules, paths, and imports / 281 Imports / 282 Re-exports / 282 Selective privacy / 283 Advanced match patterns and guards / 283 Match guards / 284 Advanced let destructure / 284 Casting and coercion / 285 Types and memory / 286 Memory alignment / 286 Exploring the std::mem module / 287 Serialization and deserialization using serde / 289 Summary / 290 Chapter 8: Concurrency / 291 Program execution models / 292 Concurrency / 293 Approaches to concurrency / 294 Kernel-based / 294 User-level / 295 Pitfalls / 296 Concurrency in Rust / 298 Thread basics / 299 Customizing threads / 301 Accessing data from threads / 302 Concurrency models with threads / 304 Shared state model / 304 Shared ownership with Arc / 306 Mutating shared data from threads / 307 Mutex / 308 Shared mutability with Arc and Mutex / 309 RwLock / 310 Communicating through message passing / 311 Asynchronous channels / 311 Synchronous channels / 313 thread-safety in Rust / 314 What is thread-safety? / 314 Traits for thread-safety / 315 Send / 315 Sync / 316 Concurrency using the actor model / 316 Other crates / 319 Summary / 319 Chapter 9: Metaprogramming with Macros / 320 What is metaprogramming? / 320 When to use and not use Rust macros / 323 Macros in Rust and their types / 324 Types of macros / 327 Creating your first macro with macro_rules! / 328 Built-in macros in the standard library / 331 macro_rules! token types / 332 Repetitions in macros / 336 A more involved macro writing a DSL for HashMap initialization / 337 Macro use case writing tests / 339 Exercises / 341 Procedural macros / 342 Derive macros / 343 Debugging macros / 349 Useful procedural macro crates / 351 Summary / 351 Chapter 10: Unsafe Rust and Foreign Function Interfaces / 352 What is safe and unsafe really? / 352 Unsafe functions and blocks / 357 Unsafe traits and implementations / 360 Calling C code from Rust / 362 Calling Rust code from C / 366 Using external C/C++ libraries from Rust / 369 Creating native Python extensions with PyO3 / 372 Creating native extensions in Rust for Node.js / 375 Summary / 380 Chapter 11: Logging / 381 What is logging and why do we need it? / 381 The need for logging frameworks / 383 Logging frameworks and their key features / 384 Approaches to logging / 386 Unstructured logging / 386 Structured logging / 386 Logging in Rust / 387 log Rust's logging facade / 388 The env_logger / 390 log4rs / 391 Structured logging using slog / 393 Summary / 399 Chapter 12: Network Programming in Rust / 400 Network programming prelude / 400 Synchronous network I/O / 403 Building a synchronous redis server / 404 Asynchronous network I/O / 411 Async abstractions in Rust / 412 Mio / 412 Futures / 413 Tokio / 413 Building an asynchronous redis server / 414 Summary / 419 Chapter 13: Building Web Applications with Rust / 420 Web applications in Rust / 420 Typed HTTP with Hyper / 421 Hyper server APIs building a URL shortener / 422 hyper as a client building a URL shortener client / 426 Web frameworks / 428 Actix-web basics / 429 Building a bookmarks API using Actix-web / 429 Summary / 440 Chapter 14: Interacting with Databases in Rust / 441 Why do we need data persistence? / 441 SQLite / 443 PostgreSQL / 449 Connection pooling with r2d2 / 452 Postgres and the diesel ORM / 455 Summary / 462 Chapter 15: Rust on the Web with WebAssembly / 463 What is WebAssembly? / 463 Design goals of WebAssembly / 466 Getting started with WebAssembly / 467 Trying it out online / 467 Ways to generate WebAssembly / 468 Rust and WebAssembly / 468 Wasm-bindgen / 469 Other WebAssembly projects / 476 Rust / 477 Other languages / 477 Summary / 478 Chapter 16: Building Desktop Applications with Rust / 479 Introduction to GUI development / 480 GTK+ framework / 481 Building a hacker news app using gtk-rs / 482 Exercise / 495 Other emerging GUI frameworks / 495 Summary / 496 Chapter 17: Debugging / 497 Introduction to debugging / 497 Debuggers in general / 499 Prerequisites for debugging / 499 Setting up gdb / 500 A sample program buggie / 501 The gdb basics / 502 Debugger integration with Visual Studio Code / 507 RR debugger a quick overview / 513 Summary / 516 Other Books You May Enjoy / 517 Index / 520

rawabstract:
Rust is an empowering language that provides a rare combination of safety, speed, and zero-cost abstractions. \booktitle{Mastering Rust} --- Second Edition is filled with clear and simple explanations of the language features along with real-world examples, showing you how you can build robust, scalable, and reliable programs. This second edition of the book improves upon the previous one and touches on all aspects that make Rust a great language. We have included the features from latest Rust 2018 edition such as the new module system, the smarter compiler, helpful error messages, and the stable procedural macros. You'll learn how Rust can be used for systems programming, network programming, and even on the web. You'll also learn techniques such as writing memory-safe code, building idiomatic Rust libraries, writing efficient asynchronous networking code, and advanced macros. The book contains a mix of theory and hands-on tasks so you acquire the skills as well as the knowledge, and it also provides exercises to hammer the concepts in. After reading this book, you will be able to implement Rust for your enterprise projects, write better tests and documentation, design for performance, and write idiomatic Rust code. What you will learn Write generic and type-safe code by using Rust's powerful type system How memory safety works without garbage collection Know the different strategies in error handling and when to use them Learn how to use concurrency primitives such as threads and channels Use advanced macros to reduce boilerplate code Create efficient web applications with the Actix-web framework Use Diesel for type-safe database interactions in your web application Who this book is for The book is aimed at beginner and intermediate programmers who already have familiarity with any imperative language and have only heard of Rust as a new language. If you are a developer who wants to write robust, efficient and maintainable software systems and want to become proficient with Rust, this book is for you.

rawtitle:
Mastering {Rust}: Learn About Memory Safety, Type System, Concurrency, and the New Features of {Rust 2018} Edition

rawTOC:
Preface / 1 \\ Chapter 1: Getting Started with Rust / 7 \\ What is Rust and why should you care? / 8 \\ Installing the Rust compiler and toolchain / 15 \\ Using rustup.rs / 15 \\ A tour of the language / 18 \\ Primitive types / 21 \\ Declaring variables and immutability / 22 \\ Functions / 23 \\ Closures / 25 \\ Strings / 26 \\ Conditionals and decision making / 27 \\ Match expressions / 29 \\ Loops / 30 \\ User-defined types / 32 \\ Structs / 33 \\ Enums / 35 \\ Functions and methods on types / 37 \\ Impl blocks on structs / 38 \\ Impl blocks for enums / 40 \\ Modules, imports, and use statements / 42 \\ Collections / 42 \\ Arrays / 43 \\ Tuples / 43 \\ Vectors / 44 \\ Hashmaps / 44 \\ Slices / 45 \\ Iterators / 47 \\ Exercise fixing the word counter / 48 \\ Summary / 49 \\ Chapter 2: Managing Projects with Cargo / 50 \\ Package managers / 51 \\ Modules / 51 \\ Nested modules / 52 \\ File as a module / 54 \\ Directory as module / 55 \\ Cargo and crates / 57 \\ Creating a new Cargo project / 59 \\ Cargo and dependencies / 61 \\ Running tests with Cargo / 63 \\ Running examples with Cargo / 66 \\ Cargo workspace / 66 \\ Extending Cargo and tools / 68 \\ Subcommands and Cargo installation / 68 \\ cargo-watch / 68 \\ cargo-edit / 69 \\ cargo-deb / 69 \\ cargo-outdated / 70 \\ Linting code with clippy / 70 \\ Exploring the manifest file Cargo.toml / 71 \\ Setting up a Rust development environment / 74 \\ Building a project with Cargo imgtool / 78 \\ Summary / 81 \\ Chapter 3: Tests, Documentation, and Benchmarks / 82 \\ Motivation for testing / 83 \\ Organizing tests / 84 \\ Testing primitives / 84 \\ Attributes / 85 \\ Assertion macros / 86 \\ Unit tests / 87 \\ First unit test / 87 \\ Running tests / 88 \\ Isolating test code / 88 \\ Failing tests / 90 \\ Ignoring tests / 90 \\ Integration tests / 91 \\ First integration test / 92 \\ Sharing common code / 93 \\ Documentation / 95 \\ Writing documentation / 95 \\ Generating and viewing documentation / 96 \\ Hosting documentation / 96 \\ Doc attributes / 97 \\ Documentation tests / 98 \\ Benchmarks / 99 \\ Built-in micro-benchmark harness / 100 \\ Benchmarking on stable Rust / 102 \\ Writing and testing a crate logic gate simulator / 105 \\ Continuous integration with Travis CI / 109 \\ Summary / 113 \\ Chapter 4: Types, Generics, and Traits / 114 \\ Type systems and why they matter / 114 \\ Generics / 116 \\ Creating generic types / 117 \\ Generic functions / 118 \\ Generic types / 119 \\ Generic implementations / 119 \\ Using generics / 121 \\ Abstracting behavior with traits / 123 \\ Traits / 124 \\ The many forms of traits / 130 \\ Marker traits / 130 \\ Simple traits / 131 \\ Generic traits / 131 \\ Associated type traits / 131 \\ Inherited traits / 132 \\ Using traits with generics trait bounds / 132 \\ Trait bounds on types / 136 \\ Trait bounds on generic functions and impl blocks / 137 \\ Using + to compose traits as bounds / 138 \\ Trait bounds with impl trait syntax / 139 \\ Exploring standard library traits / 141 \\ True polymorphism using trait objects / 148 \\ Dispatch / 149 \\ Trait objects / 150 \\ Summary / 152 \\ Chapter 5: Memory Management and Safety / 153 \\ Programs and memory / 154 \\ How do programs use memory? / 156 \\ Memory management and its kinds / 157 \\ Approaches to memory allocation / 158 \\ The stack / 158 \\ The heap / 160 \\ Memory management pitfalls / 162 \\ Memory safety / 162 \\ Trifecta of memory safety / 165 \\ Ownership / 165 \\ A brief on scopes / 167 \\ Move and copy semantics / 169 \\ Duplicating types via traits / 170 \\ Copy / 171 \\ Clone / 171 \\ Ownership in action / 173 \\ Borrowing / 178 \\ Borrowing rules / 180 \\ Borrowing in action / 181 \\ Method types based on borrowing / 183 \\ Lifetimes / 184 \\ Lifetime parameters / 185 \\ Lifetime elision and the rules / 186 \\ Lifetimes in user defined types / 188 \\ Lifetime in impl blocks / 188 \\ Multiple lifetimes / 189 \\ Lifetime subtyping / 189 \\ Specifying lifetime bounds on generic types / 190 \\ Pointer types in Rust / 192 \\ References safe pointers / 193 \\ Raw pointers / 193 \\ Smart pointers / 194 \\ Drop / 194 \\ Deref and DerefMut / 196 \\ Types of smart pointers / 196 \\ Box<T> / 197 \\ Reference counted smart pointers / 199 \\ Rc<T> / 200 \\ Interior mutability / 205 \\ Cell<T> / 205 \\ RefCell<T> / 207 \\ Uses of interior mutability / 208 \\ Summary / 210 \\ Chapter 6: Error Handling / 211 \\ Error handling prelude / 211 \\ Recoverable errors / 214 \\ Option / 214 \\ Result / 218 \\ Combinators on Option/Result / 222 \\ Common combinators / 223 \\ Using combinators / 224 \\ Converting between Option and Result / 226 \\ Early returns and the ? operator / 226 \\ Non-recoverable errors / 228 \\ User-friendly panics / 232 \\ Custom errors and the Error trait / 232 \\ Summary / 237 \\ Chapter 7: Advanced Concepts / 238 \\ Type system tidbits / 238 \\ Blocks and expressions / 239 \\ Let statements / 242 \\ Loop as an expression / 247 \\ Type clarity and sign distinction in numeric types / 248 \\ Type inference / 250 \\ Type aliases / 252 \\ Strings / 253 \\ Owned strings String / 254 \\ Borrowed strings &str / 256 \\ Slicing and dicing strings / 258 \\ Using strings in functions / 259 \\ Joining strings / 260 \\ When to use &str versus String ? / 261 \\ Global values / 261 \\ Constants / 262 \\ Statics / 262 \\ Compile time functions const fn / 263 \\ Dynamic statics using the lazy_static! macro / 264 \\ Iterators / 265 \\ Implementing a custom iterator / 266 \\ Advanced types / 270 \\ Unsized types / 270 \\ Function types / 271 \\ Never type ! and diverging functions / 272 \\ Unions / 272 \\ Cow / 273 \\ Advanced traits / 274 \\ Sized and ?Sized / 274 \\ Borrow and AsRef / 274 \\ ToOwned / 274 \\ From and Into / 275 \\ Trait objects and object safety / 275 \\ Universal function call syntax / 276 \\ Trait rules / 277 \\ Closures in depth / 277 \\ Fn closures / 278 \\ FnMut closures / 278 \\ FnOnce closures / 279 \\ Consts in structs, enums, and traits / 280 \\ Modules, paths, and imports / 281 \\ Imports / 282 \\ Re-exports / 282 \\ Selective privacy / 283 \\ Advanced match patterns and guards / 283 \\ Match guards / 284 \\ Advanced let destructure / 284 \\ Casting and coercion / 285 \\ Types and memory / 286 \\ Memory alignment / 286 \\ Exploring the std::mem module / 287 \\ Serialization and deserialization using serde / 289 \\ Summary / 290 \\ Chapter 8: Concurrency / 291 \\ Program execution models / 292 \\ Concurrency / 293 \\ Approaches to concurrency / 294 \\ Kernel-based / 294 \\ User-level / 295 \\ Pitfalls / 296 \\ Concurrency in Rust / 298 \\ Thread basics / 299 \\ Customizing threads / 301 \\ Accessing data from threads / 302 \\ Concurrency models with threads / 304 \\ Shared state model / 304 \\ Shared ownership with Arc / 306 \\ Mutating shared data from threads / 307 \\ Mutex / 308 \\ Shared mutability with Arc and Mutex / 309 \\ RwLock / 310 \\ Communicating through message passing / 311 \\ Asynchronous channels / 311 \\ Synchronous channels / 313 \\ thread-safety in Rust / 314 \\ What is thread-safety? / 314 \\ Traits for thread-safety / 315 \\ Send / 315 \\ Sync / 316 \\ Concurrency using the actor model / 316 \\ Other crates / 319 \\ Summary / 319 \\ Chapter 9: Metaprogramming with Macros / 320 \\ What is metaprogramming? / 320 \\ When to use and not use Rust macros / 323 \\ Macros in Rust and their types / 324 \\ Types of macros / 327 \\ Creating your first macro with macro_rules! / 328 \\ Built-in macros in the standard library / 331 \\ macro_rules! token types / 332 \\ Repetitions in macros / 336 \\ A more involved macro writing a DSL for HashMap initialization / 337 \\ Macro use case writing tests / 339 \\ Exercises / 341 \\ Procedural macros / 342 \\ Derive macros / 343 \\ Debugging macros / 349 \\ Useful procedural macro crates / 351 \\ Summary / 351 \\ Chapter 10: Unsafe Rust and Foreign Function Interfaces / 352 \\ What is safe and unsafe really? / 352 \\ Unsafe functions and blocks / 357 \\ Unsafe traits and implementations / 360 \\ Calling C code from Rust / 362 \\ Calling Rust code from C / 366 \\ Using external C/C++ libraries from Rust / 369 \\ Creating native Python extensions with PyO3 / 372 \\ Creating native extensions in Rust for Node.js / 375 \\ Summary / 380 \\ Chapter 11: Logging / 381 \\ What is logging and why do we need it? / 381 \\ The need for logging frameworks / 383 \\ Logging frameworks and their key features / 384 \\ Approaches to logging / 386 \\ Unstructured logging / 386 \\ Structured logging / 386 \\ Logging in Rust / 387 \\ log Rust's logging facade / 388 \\ The env_logger / 390 \\ log4rs / 391 \\ Structured logging using slog / 393 \\ Summary / 399 \\ Chapter 12: Network Programming in Rust / 400 \\ Network programming prelude / 400 \\ Synchronous network I/O / 403 \\ Building a synchronous redis server / 404 \\ Asynchronous network I/O / 411 \\ Async abstractions in Rust / 412 \\ Mio / 412 \\ Futures / 413 \\ Tokio / 413 \\ Building an asynchronous redis server / 414 \\ Summary / 419 \\ Chapter 13: Building Web Applications with Rust / 420 \\ Web applications in Rust / 420 \\ Typed HTTP with Hyper / 421 \\ Hyper server APIs building a URL shortener / 422 \\ hyper as a client building a URL shortener client / 426 \\ Web frameworks / 428 \\ Actix-web basics / 429 \\ Building a bookmarks API using Actix-web / 429 \\ Summary / 440 \\ Chapter 14: Interacting with Databases in Rust / 441 \\ Why do we need data persistence? / 441 \\ SQLite / 443 \\ PostgreSQL / 449 \\ Connection pooling with r2d2 / 452 \\ Postgres and the diesel ORM / 455 \\ Summary / 462 \\ Chapter 15: Rust on the Web with WebAssembly / 463 \\ What is WebAssembly? / 463 \\ Design goals of WebAssembly / 466 \\ Getting started with WebAssembly / 467 \\ Trying it out online / 467 \\ Ways to generate WebAssembly / 468 \\ Rust and WebAssembly / 468 \\ Wasm-bindgen / 469 \\ Other WebAssembly projects / 476 \\ Rust / 477 \\ Other languages / 477 \\ Summary / 478 \\ Chapter 16: Building Desktop Applications with Rust / 479 \\ Introduction to GUI development / 480 \\ GTK+ framework / 481 \\ Building a hacker news app using gtk-rs / 482 \\ Exercise / 495 \\ Other emerging GUI frameworks / 495 \\ Summary / 496 \\ Chapter 17: Debugging / 497 \\ Introduction to debugging / 497 \\ Debuggers in general / 499 \\ Prerequisites for debugging / 499 \\ Setting up gdb / 500 \\ A sample program buggie / 501 \\ The gdb basics / 502 \\ Debugger integration with Visual Studio Code / 507 \\ RR debugger a quick overview / 513 \\ Summary / 516 \\ Other Books You May Enjoy / 517 \\ Index / 520

entry:
@Book{Sharma:2019:MRL,
  author =       "Rahul Sharma and Vesa Kaihlavirta",
  title =        "Mastering {Rust}: Learn About Memory Safety, Type
                 System, Concurrency, and the New Features of {Rust
                 2018} Edition",
  publisher =    pub-PACKT,
  address =      pub-PACKT:adr,
  edition =      "Second",
  pages =        "543 (est.)",
  year =         "2019",
  ISBN =         "1-78934-118-3, 1-78934-657-6 (paperback)",
  ISBN-13 =      "978-1-78934-118-8, 978-1-78934-657-2 (paperback)",
  LCCN =         "QA76.73.R87",
  bibdate =      "Tue Dec 10 05:16:44 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://proquest.safaribooksonline.com/?fpi=9781789346572",
  abstract =     "Rust is an empowering language that provides a rare
                 combination of safety, speed, and zero-cost
                 abstractions. \booktitle{Mastering Rust} --- Second
                 Edition is filled with clear and simple explanations of
                 the language features along with real-world examples,
                 showing you how you can build robust, scalable, and
                 reliable programs. This second edition of the book
                 improves upon the previous one and touches on all
                 aspects that make Rust a great language. We have
                 included the features from latest Rust 2018 edition
                 such as the new module system, the smarter compiler,
                 helpful error messages, and the stable procedural
                 macros. You'll learn how Rust can be used for systems
                 programming, network programming, and even on the web.
                 You'll also learn techniques such as writing
                 memory-safe code, building idiomatic Rust libraries,
                 writing efficient asynchronous networking code, and
                 advanced macros. The book contains a mix of theory and
                 hands-on tasks so you acquire the skills as well as the
                 knowledge, and it also provides exercises to hammer the
                 concepts in. After reading this book, you will be able
                 to implement Rust for your enterprise projects, write
                 better tests and documentation, design for performance,
                 and write idiomatic Rust code. What you will learn
                 Write generic and type-safe code by using Rust's
                 powerful type system How memory safety works without
                 garbage collection Know the different strategies in
                 error handling and when to use them Learn how to use
                 concurrency primitives such as threads and channels Use
                 advanced macros to reduce boilerplate code Create
                 efficient web applications with the Actix-web framework
                 Use Diesel for type-safe database interactions in your
                 web application Who this book is for The book is aimed
                 at beginner and intermediate programmers who already
                 have familiarity with any imperative language and have
                 only heard of Rust as a new language. If you are a
                 developer who wants to write robust, efficient and
                 maintainable software systems and want to become
                 proficient with Rust, this book is for you.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  remark =       "Previous edition published: 2017.",
  subject =      "Rust (Computer program language); Application
                 software; Development; Development.; Rust (Computer
                 program language)",
  tableofcontents = "Preface / 1 \\
                 Chapter 1: Getting Started with Rust / 7 \\
                 What is Rust and why should you care? / 8 \\
                 Installing the Rust compiler and toolchain / 15 \\
                 Using rustup.rs / 15 \\
                 A tour of the language / 18 \\
                 Primitive types / 21 \\
                 Declaring variables and immutability / 22 \\
                 Functions / 23 \\
                 Closures / 25 \\
                 Strings / 26 \\
                 Conditionals and decision making / 27 \\
                 Match expressions / 29 \\
                 Loops / 30 \\
                 User-defined types / 32 \\
                 Structs / 33 \\
                 Enums / 35 \\
                 Functions and methods on types / 37 \\
                 Impl blocks on structs / 38 \\
                 Impl blocks for enums / 40 \\
                 Modules, imports, and use statements / 42 \\
                 Collections / 42 \\
                 Arrays / 43 \\
                 Tuples / 43 \\
                 Vectors / 44 \\
                 Hashmaps / 44 \\
                 Slices / 45 \\
                 Iterators / 47 \\
                 Exercise fixing the word counter / 48 \\
                 Summary / 49 \\
                 Chapter 2: Managing Projects with Cargo / 50 \\
                 Package managers / 51 \\
                 Modules / 51 \\
                 Nested modules / 52 \\
                 File as a module / 54 \\
                 Directory as module / 55 \\
                 Cargo and crates / 57 \\
                 Creating a new Cargo project / 59 \\
                 Cargo and dependencies / 61 \\
                 Running tests with Cargo / 63 \\
                 Running examples with Cargo / 66 \\
                 Cargo workspace / 66 \\
                 Extending Cargo and tools / 68 \\
                 Subcommands and Cargo installation / 68 \\
                 cargo-watch / 68 \\
                 cargo-edit / 69 \\
                 cargo-deb / 69 \\
                 cargo-outdated / 70 \\
                 Linting code with clippy / 70 \\
                 Exploring the manifest file Cargo.toml / 71 \\
                 Setting up a Rust development environment / 74 \\
                 Building a project with Cargo imgtool / 78 \\
                 Summary / 81 \\
                 Chapter 3: Tests, Documentation, and Benchmarks / 82
                 \\
                 Motivation for testing / 83 \\
                 Organizing tests / 84 \\
                 Testing primitives / 84 \\
                 Attributes / 85 \\
                 Assertion macros / 86 \\
                 Unit tests / 87 \\
                 First unit test / 87 \\
                 Running tests / 88 \\
                 Isolating test code / 88 \\
                 Failing tests / 90 \\
                 Ignoring tests / 90 \\
                 Integration tests / 91 \\
                 First integration test / 92 \\
                 Sharing common code / 93 \\
                 Documentation / 95 \\
                 Writing documentation / 95 \\
                 Generating and viewing documentation / 96 \\
                 Hosting documentation / 96 \\
                 Doc attributes / 97 \\
                 Documentation tests / 98 \\
                 Benchmarks / 99 \\
                 Built-in micro-benchmark harness / 100 \\
                 Benchmarking on stable Rust / 102 \\
                 Writing and testing a crate logic gate simulator / 105
                 \\
                 Continuous integration with Travis CI / 109 \\
                 Summary / 113 \\
                 Chapter 4: Types, Generics, and Traits / 114 \\
                 Type systems and why they matter / 114 \\
                 Generics / 116 \\
                 Creating generic types / 117 \\
                 Generic functions / 118 \\
                 Generic types / 119 \\
                 Generic implementations / 119 \\
                 Using generics / 121 \\
                 Abstracting behavior with traits / 123 \\
                 Traits / 124 \\
                 The many forms of traits / 130 \\
                 Marker traits / 130 \\
                 Simple traits / 131 \\
                 Generic traits / 131 \\
                 Associated type traits / 131 \\
                 Inherited traits / 132 \\
                 Using traits with generics trait bounds / 132 \\
                 Trait bounds on types / 136 \\
                 Trait bounds on generic functions and impl blocks / 137
                 \\
                 Using + to compose traits as bounds / 138 \\
                 Trait bounds with impl trait syntax / 139 \\
                 Exploring standard library traits / 141 \\
                 True polymorphism using trait objects / 148 \\
                 Dispatch / 149 \\
                 Trait objects / 150 \\
                 Summary / 152 \\
                 Chapter 5: Memory Management and Safety / 153 \\
                 Programs and memory / 154 \\
                 How do programs use memory? / 156 \\
                 Memory management and its kinds / 157 \\
                 Approaches to memory allocation / 158 \\
                 The stack / 158 \\
                 The heap / 160 \\
                 Memory management pitfalls / 162 \\
                 Memory safety / 162 \\
                 Trifecta of memory safety / 165 \\
                 Ownership / 165 \\
                 A brief on scopes / 167 \\
                 Move and copy semantics / 169 \\
                 Duplicating types via traits / 170 \\
                 Copy / 171 \\
                 Clone / 171 \\
                 Ownership in action / 173 \\
                 Borrowing / 178 \\
                 Borrowing rules / 180 \\
                 Borrowing in action / 181 \\
                 Method types based on borrowing / 183 \\
                 Lifetimes / 184 \\
                 Lifetime parameters / 185 \\
                 Lifetime elision and the rules / 186 \\
                 Lifetimes in user defined types / 188 \\
                 Lifetime in impl blocks / 188 \\
                 Multiple lifetimes / 189 \\
                 Lifetime subtyping / 189 \\
                 Specifying lifetime bounds on generic types / 190 \\
                 Pointer types in Rust / 192 \\
                 References safe pointers / 193 \\
                 Raw pointers / 193 \\
                 Smart pointers / 194 \\
                 Drop / 194 \\
                 Deref and DerefMut / 196 \\
                 Types of smart pointers / 196 \\
                 Box<T> / 197 \\
                 Reference counted smart pointers / 199 \\
                 Rc<T> / 200 \\
                 Interior mutability / 205 \\
                 Cell<T> / 205 \\
                 RefCell<T> / 207 \\
                 Uses of interior mutability / 208 \\
                 Summary / 210 \\
                 Chapter 6: Error Handling / 211 \\
                 Error handling prelude / 211 \\
                 Recoverable errors / 214 \\
                 Option / 214 \\
                 Result / 218 \\
                 Combinators on Option/Result / 222 \\
                 Common combinators / 223 \\
                 Using combinators / 224 \\
                 Converting between Option and Result / 226 \\
                 Early returns and the ? operator / 226 \\
                 Non-recoverable errors / 228 \\
                 User-friendly panics / 232 \\
                 Custom errors and the Error trait / 232 \\
                 Summary / 237 \\
                 Chapter 7: Advanced Concepts / 238 \\
                 Type system tidbits / 238 \\
                 Blocks and expressions / 239 \\
                 Let statements / 242 \\
                 Loop as an expression / 247 \\
                 Type clarity and sign distinction in numeric types /
                 248 \\
                 Type inference / 250 \\
                 Type aliases / 252 \\
                 Strings / 253 \\
                 Owned strings String / 254 \\
                 Borrowed strings &str / 256 \\
                 Slicing and dicing strings / 258 \\
                 Using strings in functions / 259 \\
                 Joining strings / 260 \\
                 When to use &str versus String ? / 261 \\
                 Global values / 261 \\
                 Constants / 262 \\
                 Statics / 262 \\
                 Compile time functions const fn / 263 \\
                 Dynamic statics using the lazy_static! macro / 264 \\
                 Iterators / 265 \\
                 Implementing a custom iterator / 266 \\
                 Advanced types / 270 \\
                 Unsized types / 270 \\
                 Function types / 271 \\
                 Never type ! and diverging functions / 272 \\
                 Unions / 272 \\
                 Cow / 273 \\
                 Advanced traits / 274 \\
                 Sized and ?Sized / 274 \\
                 Borrow and AsRef / 274 \\
                 ToOwned / 274 \\
                 From and Into / 275 \\
                 Trait objects and object safety / 275 \\
                 Universal function call syntax / 276 \\
                 Trait rules / 277 \\
                 Closures in depth / 277 \\
                 Fn closures / 278 \\
                 FnMut closures / 278 \\
                 FnOnce closures / 279 \\
                 Consts in structs, enums, and traits / 280 \\
                 Modules, paths, and imports / 281 \\
                 Imports / 282 \\
                 Re-exports / 282 \\
                 Selective privacy / 283 \\
                 Advanced match patterns and guards / 283 \\
                 Match guards / 284 \\
                 Advanced let destructure / 284 \\
                 Casting and coercion / 285 \\
                 Types and memory / 286 \\
                 Memory alignment / 286 \\
                 Exploring the std::mem module / 287 \\
                 Serialization and deserialization using serde / 289 \\
                 Summary / 290 \\
                 Chapter 8: Concurrency / 291 \\
                 Program execution models / 292 \\
                 Concurrency / 293 \\
                 Approaches to concurrency / 294 \\
                 Kernel-based / 294 \\
                 User-level / 295 \\
                 Pitfalls / 296 \\
                 Concurrency in Rust / 298 \\
                 Thread basics / 299 \\
                 Customizing threads / 301 \\
                 Accessing data from threads / 302 \\
                 Concurrency models with threads / 304 \\
                 Shared state model / 304 \\
                 Shared ownership with Arc / 306 \\
                 Mutating shared data from threads / 307 \\
                 Mutex / 308 \\
                 Shared mutability with Arc and Mutex / 309 \\
                 RwLock / 310 \\
                 Communicating through message passing / 311 \\
                 Asynchronous channels / 311 \\
                 Synchronous channels / 313 \\
                 thread-safety in Rust / 314 \\
                 What is thread-safety? / 314 \\
                 Traits for thread-safety / 315 \\
                 Send / 315 \\
                 Sync / 316 \\
                 Concurrency using the actor model / 316 \\
                 Other crates / 319 \\
                 Summary / 319 \\
                 Chapter 9: Metaprogramming with Macros / 320 \\
                 What is metaprogramming? / 320 \\
                 When to use and not use Rust macros / 323 \\
                 Macros in Rust and their types / 324 \\
                 Types of macros / 327 \\
                 Creating your first macro with macro_rules! / 328 \\
                 Built-in macros in the standard library / 331 \\
                 macro_rules! token types / 332 \\
                 Repetitions in macros / 336 \\
                 A more involved macro writing a DSL for HashMap
                 initialization / 337 \\
                 Macro use case writing tests / 339 \\
                 Exercises / 341 \\
                 Procedural macros / 342 \\
                 Derive macros / 343 \\
                 Debugging macros / 349 \\
                 Useful procedural macro crates / 351 \\
                 Summary / 351 \\
                 Chapter 10: Unsafe Rust and Foreign Function Interfaces
                 / 352 \\
                 What is safe and unsafe really? / 352 \\
                 Unsafe functions and blocks / 357 \\
                 Unsafe traits and implementations / 360 \\
                 Calling C code from Rust / 362 \\
                 Calling Rust code from C / 366 \\
                 Using external C/C++ libraries from Rust / 369 \\
                 Creating native Python extensions with PyO3 / 372 \\
                 Creating native extensions in Rust for Node.js / 375
                 \\
                 Summary / 380 \\
                 Chapter 11: Logging / 381 \\
                 What is logging and why do we need it? / 381 \\
                 The need for logging frameworks / 383 \\
                 Logging frameworks and their key features / 384 \\
                 Approaches to logging / 386 \\
                 Unstructured logging / 386 \\
                 Structured logging / 386 \\
                 Logging in Rust / 387 \\
                 log Rust's logging facade / 388 \\
                 The env_logger / 390 \\
                 log4rs / 391 \\
                 Structured logging using slog / 393 \\
                 Summary / 399 \\
                 Chapter 12: Network Programming in Rust / 400 \\
                 Network programming prelude / 400 \\
                 Synchronous network I/O / 403 \\
                 Building a synchronous redis server / 404 \\
                 Asynchronous network I/O / 411 \\
                 Async abstractions in Rust / 412 \\
                 Mio / 412 \\
                 Futures / 413 \\
                 Tokio / 413 \\
                 Building an asynchronous redis server / 414 \\
                 Summary / 419 \\
                 Chapter 13: Building Web Applications with Rust / 420
                 \\
                 Web applications in Rust / 420 \\
                 Typed HTTP with Hyper / 421 \\
                 Hyper server APIs building a URL shortener / 422 \\
                 hyper as a client building a URL shortener client / 426
                 \\
                 Web frameworks / 428 \\
                 Actix-web basics / 429 \\
                 Building a bookmarks API using Actix-web / 429 \\
                 Summary / 440 \\
                 Chapter 14: Interacting with Databases in Rust / 441
                 \\
                 Why do we need data persistence? / 441 \\
                 SQLite / 443 \\
                 PostgreSQL / 449 \\
                 Connection pooling with r2d2 / 452 \\
                 Postgres and the diesel ORM / 455 \\
                 Summary / 462 \\
                 Chapter 15: Rust on the Web with WebAssembly / 463 \\
                 What is WebAssembly? / 463 \\
                 Design goals of WebAssembly / 466 \\
                 Getting started with WebAssembly / 467 \\
                 Trying it out online / 467 \\
                 Ways to generate WebAssembly / 468 \\
                 Rust and WebAssembly / 468 \\
                 Wasm-bindgen / 469 \\
                 Other WebAssembly projects / 476 \\
                 Rust / 477 \\
                 Other languages / 477 \\
                 Summary / 478 \\
                 Chapter 16: Building Desktop Applications with Rust /
                 479 \\
                 Introduction to GUI development / 480 \\
                 GTK+ framework / 481 \\
                 Building a hacker news app using gtk-rs / 482 \\
                 Exercise / 495 \\
                 Other emerging GUI frameworks / 495 \\
                 Summary / 496 \\
                 Chapter 17: Debugging / 497 \\
                 Introduction to debugging / 497 \\
                 Debuggers in general / 499 \\
                 Prerequisites for debugging / 499 \\
                 Setting up gdb / 500 \\
                 A sample program buggie / 501 \\
                 The gdb basics / 502 \\
                 Debugger integration with Visual Studio Code / 507 \\
                 RR debugger a quick overview / 513 \\
                 Summary / 516 \\
                 Other Books You May Enjoy / 517 \\
                 Index / 520",
}


bibtype: inproceedings
filename: master.bib
label: Sheldon:1952:ICP
author: J. W. Sheldon and L. Tatum
title: The IBM card-programmed electronic calculator
publisher: American Institute of Electrical Engineers
address: New York, NY, USA
pages: 30--36
year: 1952
bibdate: Wed Oct 13 11:28:45 2010
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2010.10.13 11:28:45 ???
note: Reprinted in cite [ 5.4]Randell:1982:ODC.
acknowledgement: ack-nhfb
rawauthor: J. W. Sheldon and L. Tatum
rawnote: Reprinted in \cite[\S 5.4]{Randell:1982:ODC}.
rawtitle: The {IBM} card-programmed electronic calculator
booktitle:
Review of booktitle Electronic Digital Computers. Joint AIEE--IRE Computer Conference. 10--12 December 1951

rawbooktitle:
Review of {{\booktitle{Electronic Digital Computers. Joint AIEE--IRE Computer Conference. 10--12 December 1951}}}

entry:
@InProceedings{Sheldon:1952:ICP,
  author =       "J. W. Sheldon and L. Tatum",
  booktitle =    "Review of {{\booktitle{Electronic Digital Computers.
                 Joint AIEE--IRE Computer Conference. 10--12 December
                 1951}}}",
  title =        "The {IBM} card-programmed electronic calculator",
  publisher =    "American Institute of Electrical Engineers",
  address =      "New York, NY, USA",
  pages =        "30--36",
  year =         "1952",
  bibdate =      "Wed Oct 13 11:28:45 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 5.4]{Randell:1982:ODC}.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Shertzer:1986:EG
author: Margaret Shertzer
title: The Elements of Grammar
publisher: pub-COLLIER
address: pub-COLLIER:adr
pages: 168
year: 1986
ISBN: 0-02-015440-2 (paperback) OR 0020154402 (paperback)
ISBN13: 978-0-02-015440-2 (paperback) OR 9780020154402 (paperback)
LCCN: PE1112 .S54 1986
bibdate: Wed Dec 15 18:24:52 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 1993.12.15 18:24:52 ???
subject: English language; Grammar; Handbooks, manuals, etc
acknowledgement: ack-nhfb
rawauthor: Margaret Shertzer
rawtitle: The Elements of Grammar
TOC:
Recognizing good grammar Some grammatical terms Points of grammar Capitalization Punctuation Expressing numbers Spelling and choosing words Signs and symbols

rawTOC:
Recognizing good grammar \\ Some grammatical terms \\ Points of grammar \\ Capitalization \\ Punctuation \\ Expressing numbers \\ Spelling and choosing words \\ Signs and symbols

entry:
@Book{Shertzer:1986:EG,
  author =       "Margaret Shertzer",
  title =        "The Elements of Grammar",
  publisher =    pub-COLLIER,
  address =      pub-COLLIER:adr,
  pages =        "168",
  year =         "1986",
  ISBN =         "0-02-015440-2 (paperback)",
  ISBN-13 =      "978-0-02-015440-2 (paperback)",
  LCCN =         "PE1112 .S54 1986",
  bibdate =      "Wed Dec 15 18:24:52 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "English language; Grammar; Handbooks, manuals, etc",
  tableofcontents = "Recognizing good grammar \\
                 Some grammatical terms \\
                 Points of grammar \\
                 Capitalization \\
                 Punctuation \\
                 Expressing numbers \\
                 Spelling and choosing words \\
                 Signs and symbols",
}


bibtype: book
filename: master.bib
label: Shoemaker:1962:EPC
author: David P. Shoemaker and Carl W. Garland
title: Experiments in Physical Chemistry
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
pages: ix + 471
year: 1962
LCCN: QD457 .S56
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: David P. Shoemaker and Carl W. Garland
rawtitle: Experiments in Physical Chemistry
entry:
@Book{Shoemaker:1962:EPC,
  author =       "David P. Shoemaker and Carl W. Garland",
  title =        "Experiments in Physical Chemistry",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "ix + 471",
  year =         "1962",
  LCCN =         "QD457 .S56",
  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: Shore:1968:PAS
author: Bruce W. Shore and Donald H. Menzel
title: Principles of Atomic Spectra
publisher: pub-WILEY
address: pub-WILEY:adr
pages: xiv + 538
year: 1968
LCCN: QC454 .S47
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: Bruce W. Shore and Donald H. Menzel
rawtitle: Principles of Atomic Spectra
entry:
@Book{Shore:1968:PAS,
  author =       "Bruce W. Shore and Donald H. Menzel",
  title =        "Principles of Atomic Spectra",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xiv + 538",
  year =         "1968",
  LCCN =         "QC454 .S47",
  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: Shorto:2014:AHW
author: Russell Shorto
title: Amsterdam: a history of the world's most liberal city
publisher: Vintage Books
address: New York, NY, USA
pages: 357 + 24
year: 2014
ISBN: 0-307-74375-6 OR 0307743756
ISBN13: 978-0-307-74375-6 OR 9780307743756
LCCN: DJ411.A55 S56 2014
bibdate: Wed Jan 17 07:13:17 MST 2018
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2018.01.17 07:13:17 MST
acknowledgement: ack-nhfb
rawauthor: Russell Shorto
rawtitle: {Amsterdam}: a history of the world's most liberal city
abstract:
Tourists know Amsterdam as a picturesque city of low-slung brick houses lining tidy canals; student travelers know it for its legal brothels and hash bars; art lovers know it for Rembrandt's glorious portraits. But the deeper history of Amsterdam, what makes it one of the most fascinating places on earth, is bound up in its unique geography --- the constant battle of its citizens to keep the sea at bay --- and the democratic philosophy that this enduring struggle fostered. Amsterdam is the font of liberalism, in both its senses. Tolerance for free thinking and free love make it a place where, in the words of one of its mayors, ``craziness is a value.'' But the city also fostered the deeper meaning of liberalism, one that profoundly influenced America: political and economic freedom. Amsterdam was home not only to religious dissidents and radical thinkers but to the world's first great global corporation. In this effortlessly erudite account, Russell Shorto traces the idiosyncratic evolution of Amsterdam, showing how such disparate elements as herring anatomy, naked Anabaptists parading through the streets, and an intimate gathering in a sixteenth century wine tasting room had a profound effect on Dutch --- and world --- history. Weaving in his own experiences of his adopted home, Shorto provides an ever surprising, intellectually engaging story of Amsterdam from the building of its first canals in the 1300s, through its brutal struggle for independence and its golden age as a vast empire, to its complex present in which its cherished ideals of liberalism are being questioned anew.

subject:
Liberalism; Netherlands; Amsterdam; History; Social conditions; Liberalism; Liberalismus; Amsterdam (Netherlands); Social conditions

TOC:
A bicycle trip The water problem The alteration The company The liberal city ``The rare happiness of living in a republic'' Seeds of influence The two liberalisms ``We inform you of the action of a powerful German force'' The magic center

rawabstract:
Tourists know Amsterdam as a picturesque city of low-slung brick houses lining tidy canals; student travelers know it for its legal brothels and hash bars; art lovers know it for Rembrandt's glorious portraits. But the deeper history of Amsterdam, what makes it one of the most fascinating places on earth, is bound up in its unique geography --- the constant battle of its citizens to keep the sea at bay --- and the democratic philosophy that this enduring struggle fostered. Amsterdam is the font of liberalism, in both its senses. Tolerance for free thinking and free love make it a place where, in the words of one of its mayors, ``craziness is a value.'' But the city also fostered the deeper meaning of liberalism, one that profoundly influenced America: political and economic freedom. Amsterdam was home not only to religious dissidents and radical thinkers but to the world's first great global corporation. In this effortlessly erudite account, Russell Shorto traces the idiosyncratic evolution of Amsterdam, showing how such disparate elements as herring anatomy, naked Anabaptists parading through the streets, and an intimate gathering in a sixteenth century wine tasting room had a profound effect on Dutch --- and world --- history. Weaving in his own experiences of his adopted home, Shorto provides an ever surprising, intellectually engaging story of Amsterdam from the building of its first canals in the 1300s, through its brutal struggle for independence and its golden age as a vast empire, to its complex present in which its cherished ideals of liberalism are being questioned anew.

rawTOC:
A bicycle trip \\ The water problem \\ The alteration \\ The company \\ The liberal city \\ ``The rare happiness of living in a republic'' \\ Seeds of influence \\ The two liberalisms \\ ``We inform you of the action of a powerful German force'' \\ The magic center

entry:
@Book{Shorto:2014:AHW,
  author =       "Russell Shorto",
  title =        "{Amsterdam}: a history of the world's most liberal
                 city",
  publisher =    "Vintage Books",
  address =      "New York, NY, USA",
  pages =        "357 + 24",
  year =         "2014",
  ISBN =         "0-307-74375-6",
  ISBN-13 =      "978-0-307-74375-6",
  LCCN =         "DJ411.A55 S56 2014",
  bibdate =      "Wed Jan 17 07:13:17 MST 2018",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Tourists know Amsterdam as a picturesque city of
                 low-slung brick houses lining tidy canals; student
                 travelers know it for its legal brothels and hash bars;
                 art lovers know it for Rembrandt's glorious portraits.
                 But the deeper history of Amsterdam, what makes it one
                 of the most fascinating places on earth, is bound up in
                 its unique geography --- the constant battle of its
                 citizens to keep the sea at bay --- and the democratic
                 philosophy that this enduring struggle fostered.
                 Amsterdam is the font of liberalism, in both its
                 senses. Tolerance for free thinking and free love make
                 it a place where, in the words of one of its mayors,
                 ``craziness is a value.'' But the city also fostered
                 the deeper meaning of liberalism, one that profoundly
                 influenced America: political and economic freedom.
                 Amsterdam was home not only to religious dissidents and
                 radical thinkers but to the world's first great global
                 corporation. In this effortlessly erudite account,
                 Russell Shorto traces the idiosyncratic evolution of
                 Amsterdam, showing how such disparate elements as
                 herring anatomy, naked Anabaptists parading through the
                 streets, and an intimate gathering in a sixteenth
                 century wine tasting room had a profound effect on
                 Dutch --- and world --- history. Weaving in his own
                 experiences of his adopted home, Shorto provides an
                 ever surprising, intellectually engaging story of
                 Amsterdam from the building of its first canals in the
                 1300s, through its brutal struggle for independence and
                 its golden age as a vast empire, to its complex present
                 in which its cherished ideals of liberalism are being
                 questioned anew.",
  acknowledgement = ack-nhfb,
  subject =      "Liberalism; Netherlands; Amsterdam; History; Social
                 conditions; Liberalism; Liberalismus; Amsterdam
                 (Netherlands); Social conditions",
  tableofcontents = "A bicycle trip \\
                 The water problem \\
                 The alteration \\
                 The company \\
                 The liberal city \\
                 ``The rare happiness of living in a republic'' \\
                 Seeds of influence \\
                 The two liberalisms \\
                 ``We inform you of the action of a powerful German
                 force'' \\
                 The magic center",
}


bibtype: book
filename: master.bib
label: Shriner:1964:SIO
author: Ralph L. Shriner and Reynold C. Fuson and David Y. Curtin
title: The Systematic Identification of Organic Compounds: A Laboratory Manual
publisher: pub-WILEY
address: pub-WILEY:adr
edition: Fifth
pages: ix + 458
year: 1964
LCCN: QD261 .S5 1964
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: Ralph L. Shriner and Reynold C. Fuson and David Y. Curtin
rawtitle: The Systematic Identification of Organic Compounds: {A} Laboratory Manual
entry:
@Book{Shriner:1964:SIO,
  author =       "Ralph L. Shriner and Reynold C. Fuson and David Y.
                 Curtin",
  title =        "The Systematic Identification of Organic Compounds:
                 {A} Laboratory Manual",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  edition =      "Fifth",
  pages =        "ix + 458",
  year =         "1964",
  LCCN =         "QD261 .S5 1964",
  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: Shubin:2008:YIF
author: Neil Shubin
title: Your inner fish: a journey into the 3.5-billion-year history of the human body
publisher: pub-PANTHEON
address: pub-PANTHEON:adr
pages: 229
year: 2008
ISBN: 0-375-42447-4 OR 0375424474
ISBN13: 978-0-375-42447-2 OR 9780375424472
LCCN: QM26 .S58 2008
bibdate: Wed Apr 16 08:27:55 MDT 2008
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2008.04.16 08:27:55 MDT
remark: University of Utah Frontiers of Science lecture, 2 April 2008.
subject: Human anatomy; Popular works; Human evolution
acknowledgement: ack-nhfb
rawauthor: Neil Shubin
rawtitle: Your inner fish: a journey into the 3.5-billion-year history of the human body
URL:
http://www.loc.gov/catdir/enhancements/fy0827/2007024699-b.html; http://www.loc.gov/catdir/enhancements/fy0827/2007024699-d.html; http://www.loc.gov/catdir/enhancements/fy0827/2007024699-s.html; http://www.loc.gov/catdir/toc/ecip0720/2007024699.html

abstract:
Neil Shubin, a leading paleontologist and professor of anatomy who discovered Tiktaalik --- the ``missing link'' that made headlines around the world in April 2006 --- tells the story of evolution by tracing the organs of the human body back millions of years, long before the first creatures walked the earth. By examining fossils and DNA, Shubin shows us that our hands actually resemble fish fins, our head is organized like that of a long-extinct jawless fish, and major parts of our genome look and function like those of worms and bacteria.

TOC:
Finding your inner fish Getting a grip Handy genes Teeth everywhere Getting ahead The best-laid (body) plans Adventures in bodybuilding Making scents Vision Ears The meaning of it all Epilogue

rawabstract:
Neil Shubin, a leading paleontologist and professor of anatomy who discovered Tiktaalik --- the ``missing link'' that made headlines around the world in April 2006 --- tells the story of evolution by tracing the organs of the human body back millions of years, long before the first creatures walked the earth. By examining fossils and DNA, Shubin shows us that our hands actually resemble fish fins, our head is organized like that of a long-extinct jawless fish, and major parts of our genome look and function like those of worms and bacteria.

rawTOC:
Finding your inner fish \\ Getting a grip \\ Handy genes \\ Teeth everywhere \\ Getting ahead \\ The best-laid (body) plans \\ Adventures in bodybuilding \\ Making scents \\ Vision \\ Ears \\ The meaning of it all \\ Epilogue

entry:
@Book{Shubin:2008:YIF,
  author =       "Neil Shubin",
  title =        "Your inner fish: a journey into the 3.5-billion-year
                 history of the human body",
  publisher =    pub-PANTHEON,
  address =      pub-PANTHEON:adr,
  pages =        "229",
  year =         "2008",
  ISBN =         "0-375-42447-4",
  ISBN-13 =      "978-0-375-42447-2",
  LCCN =         "QM26 .S58 2008",
  bibdate =      "Wed Apr 16 08:27:55 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0827/2007024699-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0827/2007024699-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0827/2007024699-s.html;
                 http://www.loc.gov/catdir/toc/ecip0720/2007024699.html",
  abstract =     "Neil Shubin, a leading paleontologist and professor of
                 anatomy who discovered Tiktaalik --- the ``missing
                 link'' that made headlines around the world in April
                 2006 --- tells the story of evolution by tracing the
                 organs of the human body back millions of years, long
                 before the first creatures walked the earth. By
                 examining fossils and DNA, Shubin shows us that our
                 hands actually resemble fish fins, our head is
                 organized like that of a long-extinct jawless fish, and
                 major parts of our genome look and function like those
                 of worms and bacteria.",
  acknowledgement = ack-nhfb,
  remark =       "University of Utah Frontiers of Science lecture, 2
                 April 2008.",
  subject =      "Human anatomy; Popular works; Human evolution",
  tableofcontents = "Finding your inner fish \\
                 Getting a grip \\
                 Handy genes \\
                 Teeth everywhere \\
                 Getting ahead \\
                 The best-laid (body) plans \\
                 Adventures in bodybuilding \\
                 Making scents \\
                 Vision \\
                 Ears \\
                 The meaning of it all \\
                 Epilogue",
}


bibtype: book
filename: master.bib
label: Shulman:2008:TGC
author: Seth Shulman
title: The telephone gambit: chasing Alexander Graham Bell's secret
publisher: pub-NORTON
address: pub-NORTON:adr
pages: 256
year: 2008
LCCN: TK6018.B4 S58 2008
bibdate: Mon Mar 8 20:23:02 MST 2010
bibsource: carmin.sudoc.abes.fr:210/ABES-Z39-PUBLIC; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2010.03.08 20:23:02 MST
acknowledgement: ack-nhfb
rawauthor: Seth Shulman
rawtitle: The telephone gambit: chasing {Alexander Graham Bell}'s secret
ISBN:
0-393-33368-X (paperback), 0-393-06206-6 (hardcover) OR 039333368X (paperback), 0393062066 (hardcover)

ISBN13:
978-0-393-33368-8 (paperback), 978-0-393-06206-9 (hardcover) OR 9780393333688 (paperback), 9780393062069 (hardcover)

abstract:
Although Alexander Graham Bell is widely accepted as the father of the telephone (despite the fact that rival inventor Elisha Gray submitted a similar claim the same day Bell filed his patent), Schulman provides intriguing evidence questioning if the scales were deliberately tipped in Bell's favor.

subject:
Bell, Alexander Graham; Gray, Elisha; Telephone; History; Patents; Inventors; United States; Biography

TOC:
Playing telephone Disconnected On the hook Calling home No answer Operator assistance Clear reception Person-to-person Interference Caller I.D. Tapping the phone Bad connection On the line Call waiting Party line Conference call

rawabstract:
Although Alexander Graham Bell is widely accepted as the father of the telephone (despite the fact that rival inventor Elisha Gray submitted a similar claim the same day Bell filed his patent), Schulman provides intriguing evidence questioning if the scales were deliberately tipped in Bell's favor.

rawTOC:
Playing telephone \\ Disconnected \\ On the hook \\ Calling home \\ No answer \\ Operator assistance \\ Clear reception \\ Person-to-person \\ Interference \\ Caller I.D. \\ Tapping the phone \\ Bad connection \\ On the line \\ Call waiting \\ Party line \\ Conference call

entry:
@Book{Shulman:2008:TGC,
  author =       "Seth Shulman",
  title =        "The telephone gambit: chasing {Alexander Graham
                 Bell}'s secret",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "256",
  year =         "2008",
  ISBN =         "0-393-33368-X (paperback), 0-393-06206-6 (hardcover)",
  ISBN-13 =      "978-0-393-33368-8 (paperback), 978-0-393-06206-9
                 (hardcover)",
  LCCN =         "TK6018.B4 S58 2008",
  bibdate =      "Mon Mar 8 20:23:02 MST 2010",
  bibsource =    "carmin.sudoc.abes.fr:210/ABES-Z39-PUBLIC;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Although Alexander Graham Bell is widely accepted as
                 the father of the telephone (despite the fact that
                 rival inventor Elisha Gray submitted a similar claim
                 the same day Bell filed his patent), Schulman provides
                 intriguing evidence questioning if the scales were
                 deliberately tipped in Bell's favor.",
  acknowledgement = ack-nhfb,
  subject =      "Bell, Alexander Graham; Gray, Elisha; Telephone;
                 History; Patents; Inventors; United States; Biography",
  tableofcontents = "Playing telephone \\
                 Disconnected \\
                 On the hook \\
                 Calling home \\
                 No answer \\
                 Operator assistance \\
                 Clear reception \\
                 Person-to-person \\
                 Interference \\
                 Caller I.D. \\
                 Tapping the phone \\
                 Bad connection \\
                 On the line \\
                 Call waiting \\
                 Party line \\
                 Conference call",
}


bibtype: book
filename: master.bib
label: Shultis:1994:LNP
author: J. Kenneth Shultis
title: LaTeX Notes: Practical Tips for Preparing Technical Documents
publisher: pub-PHPTR
address: pub-PHPTR:adr
pages: xi + 180
year: 1994
ISBN: 0-13-120973-6 OR 0131209736
ISBN13: 978-0-13-120973-2 OR 9780131209732
LCCN: Z253.4.L38 S48 1994
bibdate: Thu May 12 08:36:58 1994
bibtimestamp: 1994.05.12 08:36:58 ???
acknowledgement: ack-nhfb
rawauthor: J. Kenneth Shultis
rawtitle: {\LaTeX} Notes: Practical Tips for Preparing Technical Documents
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/texbook1.bib; https://www.math.utah.edu/pub/tex/bib/texbook3.bib

TOC:
Fonts Text Formatting and Lists Formatting Pages Math and Equations Tables Graphics Large Documents Useful Styles Macros and Miscellaneous Tricks Symbols Available in LaTeX Format Parameters

rawTOC:
Fonts \\ Text Formatting and Lists \\ Formatting Pages \\ Math and Equations \\ Tables \\ Graphics \\ Large Documents \\ Useful Styles \\ Macros and Miscellaneous Tricks \\ Symbols Available in LaTeX \\ Format Parameters

entry:
@Book{Shultis:1994:LNP,
  author =       "J. Kenneth Shultis",
  title =        "{\LaTeX} Notes: Practical Tips for Preparing Technical
                 Documents",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  pages =        "xi + 180",
  year =         "1994",
  ISBN =         "0-13-120973-6",
  ISBN-13 =      "978-0-13-120973-2",
  LCCN =         "Z253.4.L38 S48 1994",
  bibdate =      "Thu May 12 08:36:58 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook1.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  price =        "US\$32.00",
  acknowledgement = ack-nhfb,
  tableofcontents = "Fonts \\
                 Text Formatting and Lists \\
                 Formatting Pages \\
                 Math and Equations \\
                 Tables \\
                 Graphics \\
                 Large Documents \\
                 Useful Styles \\
                 Macros and Miscellaneous Tricks \\
                 Symbols Available in LaTeX \\
                 Format Parameters",
}


bibtype: book
filename: master.bib
label: Sienko:1964:C
author: Michell J. Sienko and Robert A. Plane
title: Chemistry
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
edition: Canadian
pages: xiii + 623
year: 1964
bibdate: Sun Oct 25 11:33:02 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.10.25 11:33:02 ???
acknowledgement: ack-nhfb
rawauthor: Michell J. Sienko and Robert A. Plane
rawtitle: Chemistry
entry:
@Book{Sienko:1964:C,
  author =       "Michell J. Sienko and Robert A. Plane",
  title =        "Chemistry",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "{Canadian}",
  pages =        "xiii + 623",
  year =         "1964",
  LCCN =         "????",
  bibdate =      "Sun Oct 25 11:33:02 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Siewiorek:1982:CSP
author: Daniel P. Siewiorek and C. Gordon Bell and Allen Newell
title: Computer Structures: Principles and Examples
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
pages: xvi + 926
year: 1982
ISBN: 0-07-057302-6 OR 0070573026
ISBN13: 978-0-07-057302-4 OR 9780070573024
LCCN: QA76.9.A73 C65
bibdate: Tue Jan 8 13:46:44 MST 2019
bibtimestamp: 2019.01.08 13:46:44 MST
series: McGraw-Hill computer science series
acknowledgement: ack-nhfb
rawauthor: Daniel P. Siewiorek and C. Gordon Bell and Allen Newell
rawtitle: Computer Structures: Principles and Examples
bibsource:
fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/internet.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/super.bib

URL:
https://archive.computerhistory.org/resources/text/bell_gordon/bell.computer_structures_principles_and_examples.1982.102630397.pdf

subject:
Newell, Allen; Ordenadores; Arquitectura; Discursos, ensayos, conferencias; diseano y construccion; Diseano y construccion.

TOC:
Preface / xiii Part 1: Fundamentals Section 1: Abstraction and Notation / 3 1: Computer Classes and Evolution / 4 2: Levels and Abstractions / 9 3: PMS Notation / 17 4: An Introduction to ISPS / 23 Section 2: The Computer Space / 33 5: Function and Performance/ 39 6: Structure / 962 Section 3: Computers of Historical Significance / 96 7: The Manchester Mark 1 / 107 8: Structural Levels of the PDP-8 / 110 9: Design of the B 5000 System / 129 10: One-Level Storage System / 135 Part 2: Regions of Computer Space Section 1: Microprogram-Based Processors / 151 // 11: Microprogramming and the Design of the Control Circuits in an Electronic Digital Computer / 158 12: Microprogramming the IBM System/360 / 164 13: Bit-Sliced Microprocessor of the Am2900 Family: The Am2901/2909 / 186 14: The Am2903/2910 / 186 15: A PDP-8 Implemented from AMD Bit-Sliced Microprocessors / 219 Section 2: Hierarchies and Multiple Processes / 227 16: Burroughs' B6500/B7500 Stack Mechanism / 244 17: An Outline of the ICL 2900 Series System / 251 Section 3: Concurrency: Single-Processor Systems / 260 18: The IBM System/360 Model 91: Machine Philosophy and Instruction-Handling / 300 19: An Efficient Algorithm for Exploiting Multiple Arithmetic Units / 293 20: The Illiac IV System / 317 21: A Productive Implementation of an Associative Array Processor: STARAN / 317 Section 4: Multiple-Processor Systems / 332 22: The C.mmp/Hydra Project: An Architectural Overview / 350 23: Pluribus: An Operational Fault-Tolerant Multiprocessor / 371 Section 5: Networks / 387 24: The Interface Message Processor for the ARPA Computer Network / 402 25: ALOHA Packet Broadcasting: A Retrospect / 416 26: Ethernet: Distributed Packet Switching for Local Computer Networks / 429 Section 6: Fault-Tolerant Systems / 439 27: The STAR (Self-Testing And Repairing) Computer: An Investigation of the Theory and Practice of Fault-Tolerant Computer Design / 448 28: Fault-Tolerant Design of Local ESS Processors / 459 29: The Tandem 16: A Fault-Tolerant Computing System / 470 Section 7: Language-Based Computers / 486 30: The SYMBOL Computer / 489 31: A Dual-Processor Desk-Top Computer: The HP 9845A / 508 32: The IBM System/38 / 533 Section 8: Personal Computing Systems / 547 33: Alto: A Personal Computer / 549 Part 3: Computer Classes Section 1: Monolithic Microcomputers / 581 34: TMS1000/1200: Chip Architecture and Operation / 587 35: PIC1650: Chip Architecture and Operation / 602 Section 2: Microcomputers / 610 36: Trends in Microcomputers / 612 37: Intel Microprocessors: 8008 to 8086 / 615 Section 3: Minicomputers / 647 38: A New Architecture for Mini-Computers: The DEC PDP-11 / 649 39: Implementation and Performance Evaluation of the PDP-11 Family / 666 Section 4: Maxicomputers / 680 40: The Structure of System/360, Part I: Outline of the Logical Structure / 695 41: The Structure of System/360, Part II: System Implementations / 711 42: VAX-11/780: A Virtual Address Extension to the DEC PDP-11 Family / 716 43: Parallel Operation in the Control Data 6600 / 730 44: The CRAY-1 Computer System / 743 45: The TI ASC: A Highly Modular and Flexible Super Computer Architecture / 753 Part 4: Family Range, Compatibility, and Evolution Section 1: Microcomputer Families / 765 Section 2: Minicomputer Families / 766 46: The PDP-8 Family 767 47: The Evolution of the PDP-11 / 776 Section 3: Evolution of HP Calculators / 785 48: The HP Model 9100A Computing Calculator / 787 49: The HP 9810/20/30 Series / 801 50: Hewlett-Packard Calculator Architectures / 824 Section 4: Evolution of Burroughs Computers / 828 Section 5: The System/360 and System/370 Family / 829 51: Architecture of the IBM System/370 / 830 52: The IBM System/360, System/370, 3030 and 4300: A Series of Planned Machines That Span a Wide Performance Range / 856 Section 6: Evolution of CDC/CRAY Computers / 893 Bibliography / 894 Acknowledgments / 915 Index / 921

rawTOC:
Preface / xiii \\ Part 1: Fundamentals \\ Section 1: Abstraction and Notation / 3 \\ 1: Computer Classes and Evolution / 4 \\ 2: Levels and Abstractions / 9 \\ 3: PMS Notation / 17 \\ 4: An Introduction to ISPS / 23 \\ Section 2: The Computer Space / 33 \\ 5: Function and Performance/ 39 \\ 6: Structure / 962 \\ Section 3: Computers of Historical Significance / 96 \\ 7: The Manchester Mark 1 / 107 \\ 8: Structural Levels of the PDP-8 / 110 \\ 9: Design of the B 5000 System / 129 \\ 10: One-Level Storage System / 135 \\ Part 2: Regions of Computer Space \\ Section 1: Microprogram-Based Processors / 151 // 11: Microprogramming and the Design of the Control Circuits in an Electronic Digital Computer / 158 \\ 12: Microprogramming the IBM System/360 / 164 \\ 13: Bit-Sliced Microprocessor of the Am2900 Family: The Am2901/2909 / 186 \\ 14: The Am2903/2910 / 186 \\ 15: A PDP-8 Implemented from AMD Bit-Sliced Microprocessors / 219 \\ Section 2: Hierarchies and Multiple Processes / 227 \\ 16: Burroughs' B6500/B7500 Stack Mechanism / 244 \\ 17: An Outline of the ICL 2900 Series System / 251 \\ Section 3: Concurrency: Single-Processor Systems / 260 \\ 18: The IBM System/360 Model 91: Machine Philosophy and Instruction-Handling / 300 \\ 19: An Efficient Algorithm for Exploiting Multiple Arithmetic Units / 293 \\ 20: The Illiac IV System / 317 \\ 21: A Productive Implementation of an Associative Array Processor: STARAN / 317 \\ Section 4: Multiple-Processor Systems / 332 \\ 22: The C.mmp/Hydra Project: An Architectural Overview / 350 \\ 23: Pluribus: An Operational Fault-Tolerant Multiprocessor / 371 \\ Section 5: Networks / 387 \\ 24: The Interface Message Processor for the ARPA Computer Network / 402 \\ 25: ALOHA Packet Broadcasting: A Retrospect / 416 \\ 26: Ethernet: Distributed Packet Switching for Local Computer Networks / 429 \\ Section 6: Fault-Tolerant Systems / 439 \\ 27: The STAR (Self-Testing And Repairing) Computer: An Investigation of the Theory and Practice of Fault-Tolerant Computer Design / 448 \\ 28: Fault-Tolerant Design of Local ESS Processors / 459 \\ 29: The Tandem 16: A Fault-Tolerant Computing System / 470 \\ Section 7: Language-Based Computers / 486 \\ 30: The SYMBOL Computer / 489 \\ 31: A Dual-Processor Desk-Top Computer: The HP 9845A / 508 \\ 32: The IBM System/38 / 533 \\ Section 8: Personal Computing Systems / 547 \\ 33: Alto: A Personal Computer / 549 \\ Part 3: Computer Classes \\ Section 1: Monolithic Microcomputers / 581 \\ 34: TMS1000/1200: Chip Architecture and Operation / 587 \\ 35: PIC1650: Chip Architecture and Operation / 602 \\ Section 2: Microcomputers / 610 \\ 36: Trends in Microcomputers / 612 \\ 37: Intel Microprocessors: 8008 to 8086 / 615 \\ Section 3: Minicomputers / 647 \\ 38: A New Architecture for Mini-Computers: The DEC PDP-11 / 649 \\ 39: Implementation and Performance Evaluation of the PDP-11 Family / 666 \\ Section 4: Maxicomputers / 680 \\ 40: The Structure of System/360, Part I: Outline of the Logical Structure / 695 \\ 41: The Structure of System/360, Part II: System Implementations / 711 \\ 42: VAX-11/780: A Virtual Address Extension to the DEC PDP-11 Family / 716 \\ 43: Parallel Operation in the Control Data 6600 / 730 \\ 44: The CRAY-1 Computer System / 743 \\ 45: The TI ASC: A Highly Modular and Flexible Super Computer Architecture / 753 \\ Part 4: Family Range, Compatibility, and Evolution \\ Section 1: Microcomputer Families / 765 \\ Section 2: Minicomputer Families / 766 \\ 46: The PDP-8 Family 767 \\ 47: The Evolution of the PDP-11 / 776 \\ Section 3: Evolution of HP Calculators / 785 \\ 48: The HP Model 9100A Computing Calculator / 787 \\ 49: The HP 9810/20/30 Series / 801 \\ 50: Hewlett-Packard Calculator Architectures / 824 \\ Section 4: Evolution of Burroughs Computers / 828 \\ Section 5: The System/360 and System/370 Family / 829 \\ 51: Architecture of the IBM System/370 / 830 \\ 52: The IBM System/360, System/370, 3030 and 4300: A Series of Planned Machines That Span a Wide Performance Range / 856 \\ Section 6: Evolution of CDC/CRAY Computers / 893 \\ Bibliography / 894 \\ Acknowledgments / 915 \\ Index / 921

entry:
@Book{Siewiorek:1982:CSP,
  author =       "Daniel P. Siewiorek and C. Gordon Bell and Allen
                 Newell",
  title =        "Computer Structures: Principles and Examples",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xvi + 926",
  year =         "1982",
  ISBN =         "0-07-057302-6",
  ISBN-13 =      "978-0-07-057302-4",
  LCCN =         "QA76.9.A73 C65",
  bibdate =      "Tue Jan 8 13:46:44 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/internet.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/super.bib",
  series =       "McGraw-Hill computer science series",
  URL =          "https://archive.computerhistory.org/resources/text/bell_gordon/bell.computer_structures_principles_and_examples.1982.102630397.pdf",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Newell, Allen; Ordenadores; Arquitectura; Discursos,
                 ensayos, conferencias; dise{\"a}no y construcci{\'o}n;
                 Dise{\"a}no y construcci{\'o}n.",
  tableofcontents = "Preface / xiii \\
                 Part 1: Fundamentals \\
                 Section 1: Abstraction and Notation / 3 \\
                 1: Computer Classes and Evolution / 4 \\
                 2: Levels and Abstractions / 9 \\
                 3: PMS Notation / 17 \\
                 4: An Introduction to ISPS / 23 \\
                 Section 2: The Computer Space / 33 \\
                 5: Function and Performance/ 39 \\
                 6: Structure / 962 \\
                 Section 3: Computers of Historical Significance / 96
                 \\
                 7: The Manchester Mark 1 / 107 \\
                 8: Structural Levels of the PDP-8 / 110 \\
                 9: Design of the B 5000 System / 129 \\
                 10: One-Level Storage System / 135 \\
                 Part 2: Regions of Computer Space \\
                 Section 1: Microprogram-Based Processors / 151 // 11:
                 Microprogramming and the Design of the Control Circuits
                 in an Electronic Digital Computer / 158 \\
                 12: Microprogramming the IBM System/360 / 164 \\
                 13: Bit-Sliced Microprocessor of the Am2900 Family: The
                 Am2901/2909 / 186 \\
                 14: The Am2903/2910 / 186 \\
                 15: A PDP-8 Implemented from AMD Bit-Sliced
                 Microprocessors / 219 \\
                 Section 2: Hierarchies and Multiple Processes / 227 \\
                 16: Burroughs' B6500/B7500 Stack Mechanism / 244 \\
                 17: An Outline of the ICL 2900 Series System / 251 \\
                 Section 3: Concurrency: Single-Processor Systems / 260
                 \\
                 18: The IBM System/360 Model 91: Machine Philosophy and
                 Instruction-Handling / 300 \\
                 19: An Efficient Algorithm for Exploiting Multiple
                 Arithmetic Units / 293 \\
                 20: The Illiac IV System / 317 \\
                 21: A Productive Implementation of an Associative Array
                 Processor: STARAN / 317 \\
                 Section 4: Multiple-Processor Systems / 332 \\
                 22: The C.mmp/Hydra Project: An Architectural Overview
                 / 350 \\
                 23: Pluribus: An Operational Fault-Tolerant
                 Multiprocessor / 371 \\
                 Section 5: Networks / 387 \\
                 24: The Interface Message Processor for the ARPA
                 Computer Network / 402 \\
                 25: ALOHA Packet Broadcasting: A Retrospect / 416 \\
                 26: Ethernet: Distributed Packet Switching for Local
                 Computer Networks / 429 \\
                 Section 6: Fault-Tolerant Systems / 439 \\
                 27: The STAR (Self-Testing And Repairing) Computer: An
                 Investigation of the Theory and Practice of
                 Fault-Tolerant Computer Design / 448 \\
                 28: Fault-Tolerant Design of Local ESS Processors / 459
                 \\
                 29: The Tandem 16: A Fault-Tolerant Computing System /
                 470 \\
                 Section 7: Language-Based Computers / 486 \\
                 30: The SYMBOL Computer / 489 \\
                 31: A Dual-Processor Desk-Top Computer: The HP 9845A /
                 508 \\
                 32: The IBM System/38 / 533 \\
                 Section 8: Personal Computing Systems / 547 \\
                 33: Alto: A Personal Computer / 549 \\
                 Part 3: Computer Classes \\
                 Section 1: Monolithic Microcomputers / 581 \\
                 34: TMS1000/1200: Chip Architecture and Operation / 587
                 \\
                 35: PIC1650: Chip Architecture and Operation / 602 \\
                 Section 2: Microcomputers / 610 \\
                 36: Trends in Microcomputers / 612 \\
                 37: Intel Microprocessors: 8008 to 8086 / 615 \\
                 Section 3: Minicomputers / 647 \\
                 38: A New Architecture for Mini-Computers: The DEC
                 PDP-11 / 649 \\
                 39: Implementation and Performance Evaluation of the
                 PDP-11 Family / 666 \\
                 Section 4: Maxicomputers / 680 \\
                 40: The Structure of System/360, Part I: Outline of the
                 Logical Structure / 695 \\
                 41: The Structure of System/360, Part II: System
                 Implementations / 711 \\
                 42: VAX-11/780: A Virtual Address Extension to the DEC
                 PDP-11 Family / 716 \\
                 43: Parallel Operation in the Control Data 6600 / 730
                 \\
                 44: The CRAY-1 Computer System / 743 \\
                 45: The TI ASC: A Highly Modular and Flexible Super
                 Computer Architecture / 753 \\
                 Part 4: Family Range, Compatibility, and Evolution \\
                 Section 1: Microcomputer Families / 765 \\
                 Section 2: Minicomputer Families / 766 \\
                 46: The PDP-8 Family 767 \\
                 47: The Evolution of the PDP-11 / 776 \\
                 Section 3: Evolution of HP Calculators / 785 \\
                 48: The HP Model 9100A Computing Calculator / 787 \\
                 49: The HP 9810/20/30 Series / 801 \\
                 50: Hewlett-Packard Calculator Architectures / 824 \\
                 Section 4: Evolution of Burroughs Computers / 828 \\
                 Section 5: The System/360 and System/370 Family / 829
                 \\
                 51: Architecture of the IBM System/370 / 830 \\
                 52: The IBM System/360, System/370, 3030 and 4300: A
                 Series of Planned Machines That Span a Wide Performance
                 Range / 856 \\
                 Section 6: Evolution of CDC/CRAY Computers / 893 \\
                 Bibliography / 894 \\
                 Acknowledgments / 915 \\
                 Index / 921",
}


bibtype: article
filename: master.bib
label: SIGGRAPH:core77
author: ACM / SIGGRAPH
title: Status Report of the Graphic Standards Planning Committee of ACM / SIGGRAPH
journal: j-SIGGRAPH
volume: 11
number: 3
pages: xvi + 926
year: 1977
bibdate: Sat Oct 28 08:26:45 2000
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2000.10.28 08:26:45 ???
acknowledgement: ack-nhfb
rawauthor: {ACM\slash SIGGRAPH}
rawtitle: Status Report of the {Graphic Standards Planning} {Committee} of {ACM\slash SIGGRAPH}
entry:
@Article{SIGGRAPH:core77,
  author =       "{ACM\slash SIGGRAPH}",
  title =        "Status Report of the {Graphic Standards Planning}
                 {Committee} of {ACM\slash SIGGRAPH}",
  journal =      j-SIGGRAPH,
  volume =       "11",
  number =       "3",
  year =         "1977",
  bibdate =      "Sat Oct 28 08:26:45 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: master.bib
label: SIGGRAPH:core79
author: ACM / SIGGRAPH
title: Status Report of the Graphic Standards Planning Committee of ACM / SIGGRAPH
journal: j-SIGGRAPH
volume: 13
number: 3
pages: xvi + 926
month: aug
monthnumber: 8
year: 1979
bibdate: Sat Oct 28 08:26:48 2000
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2000.10.28 08:26:48 ???
acknowledgement: ack-nhfb
rawauthor: {ACM\slash SIGGRAPH}
rawtitle: Status Report of the {Graphic Standards Planning} {Committee} of {ACM\slash SIGGRAPH}
entry:
@Article{SIGGRAPH:core79,
  author =       "{ACM\slash SIGGRAPH}",
  title =        "Status Report of the {Graphic Standards Planning}
                 {Committee} of {ACM\slash SIGGRAPH}",
  journal =      j-SIGGRAPH,
  volume =       "13",
  number =       "3",
  month =        aug,
  year =         "1979",
  bibdate =      "Sat Oct 28 08:26:48 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Sillen:1952:PPC
author: Lars Gunnar Sillen and Paul W. Lange and Carl O. Gabrielson
title: Problems in Physical Chemistry
publisher: pub-PH
address: pub-PH:adr
pages: xi + 370
year: 1952
LCCN: QD456 .S514
bibdate: Sat Jul 25 13:55:27 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.07.25 13:55:27 ???
note: Seventh printing, October 1965.
acknowledgement: ack-nhfb
rawauthor: Lars Gunnar Sill{\'e}n and Paul W. Lange and Carl O. Gabrielson
rawnote: Seventh printing, October 1965.
rawtitle: Problems in Physical Chemistry
entry:
@Book{Sillen:1952:PPC,
  author =       "Lars Gunnar Sill{\'e}n and Paul W. Lange and Carl O.
                 Gabrielson",
  title =        "Problems in Physical Chemistry",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xi + 370",
  year =         "1952",
  LCCN =         "QD456 .S514",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Seventh printing, October 1965.",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Simpson:1959:CLD
author: D. P. Simpson
title: Cassell's Latin Dictionary: Latin--English, English--Latin
publisher: pub-MACMILLAN
address: pub-MACMILLAN:adr
edition: Fifth
pages: xviii + 883
year: 1959
ISBN: 0-02-522570-7, 0-02-522580-4 OR 0025225707, 0025225804
ISBN13: 978-0-02-522570-1, 978-0-02-522580-0 OR 9780025225701, 9780025225800
LCCN: PA2365.E5C3 1977
bibdate: Sun Dec 28 22:28:58 1997
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1997.12.28 22:28:58 ???
note: Reprinted 1968 with new material.
subject: Dictionaries; English; English language; Latin; Latin language; Reference
acknowledgement: ack-nhfb
rawauthor: D. P. Simpson
rawnote: Reprinted 1968 with new material.
rawtitle: {Cassell}'s {Latin} Dictionary: {Latin--English}, {English--Latin}
abstract:
Since its first appearance in 1854, this dictionary has remained constant in its appeal to scholars through its many revisions. This Latin dictionary is among the best of its kind, reliable, compact and adequate for the needs of all save the specialist. Simpson has produced a book typographically easy to consult, combining elegance with utility. This edition incorporates English idioms and Latin spelling, includes general classical information where appropriate, shows long and short vowels where not immediately apparent, indicates irregular plural forms, cites and quotes ancient classical authors, and suggests paraphrases to express modern English in classical Latin form.

rawabstract:
Since its first appearance in 1854, this dictionary has remained constant in its appeal to scholars through its many revisions. This Latin dictionary is among the best of its kind, reliable, compact and adequate for the needs of all save the specialist. Simpson has produced a book typographically easy to consult, combining elegance with utility. This edition incorporates English idioms and Latin spelling, includes general classical information where appropriate, shows long and short vowels where not immediately apparent, indicates irregular plural forms, cites and quotes ancient classical authors, and suggests paraphrases to express modern English in classical Latin form.

entry:
@Book{Simpson:1959:CLD,
  author =       "D. P. Simpson",
  title =        "{Cassell}'s {Latin} Dictionary: {Latin--English},
                 {English--Latin}",
  publisher =    pub-MACMILLAN,
  address =      pub-MACMILLAN:adr,
  edition =      "Fifth",
  pages =        "xviii + 883",
  year =         "1959",
  ISBN =         "0-02-522570-7, 0-02-522580-4",
  ISBN-13 =      "978-0-02-522570-1, 978-0-02-522580-0",
  LCCN =         "PA2365.E5C3 1977",
  bibdate =      "Sun Dec 28 22:28:58 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted 1968 with new material.",
  price =        "US\$24.95",
  abstract =     "Since its first appearance in 1854, this dictionary
                 has remained constant in its appeal to scholars through
                 its many revisions. This Latin dictionary is among the
                 best of its kind, reliable, compact and adequate for
                 the needs of all save the specialist. Simpson has
                 produced a book typographically easy to consult,
                 combining elegance with utility. This edition
                 incorporates English idioms and Latin spelling,
                 includes general classical information where
                 appropriate, shows long and short vowels where not
                 immediately apparent, indicates irregular plural forms,
                 cites and quotes ancient classical authors, and
                 suggests paraphrases to express modern English in
                 classical Latin form.",
  acknowledgement = ack-nhfb,
  subject =      "Dictionaries; English; English language; Latin; Latin
                 language; Reference",
}


bibtype: book
filename: master.bib
label: Singer:2005:LSP
author: Stephanie Frank Singer
title: Linearity, Symmetry, and Prediction in the Hydrogen Atom
publisher: pub-SV
address: pub-SV:adr
pages: xiv + 396
year: 2005
DOI: https://doi.org/10.1007/b136359
ISBN: 0-387-24637-1 OR 0387246371
ISBN13: 978-0-387-24637-6 OR 9780387246376
LCCN: QC20.7.G76 S56 2005
bibdate: Sat Sep 3 18:36:12 MDT 2016
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2016.09.03 18:36:12 MDT
series: Undergraduate texts in mathematics
acknowledgement: ack-nhfb
authordates: 1964--
rawauthor: Stephanie Frank Singer
rawtitle: Linearity, Symmetry, and Prediction in the Hydrogen Atom
URL:
http://www.loc.gov/catdir/enhancements/fy0662/2005042679-d.html; http://www.loc.gov/catdir/enhancements/fy0818/2005042679-b.html; http://www.loc.gov/catdir/enhancements/fy0818/2005042679-t.html

subject:
Group theory; Hydrogen; Atoms; Linear algebraic groups; Symmetry (Physics); Representations of groups; Quantum theory

TOC:
Setting the Stage / 1--40 Linear Algebra over the Complex Numbers / 41--75 Complex Scalar Product Spaces (a.k.a. Hilbert Spaces) / 77--110 Lie Groups and Lie Group Representations / 111--152 New Representations from Old / 153--177 Irreducible Representations and Invariant Integration / 179--208 Representations and the Hydrogen Atom / 209--228 The Algebra so(4) Symmetry of the Hydrogen Atom / 229--281 The Group SO(4) Symmetry of the Hydrogen Atom / 283--297 Projective Representations and Spin / 299--338 Independent Events and Tensor Products / 339--358 A. Spherical Harmonics / B. Proof of the Correspondence / C. Suggested Paper Topics / Bibliography / Index / References

rawTOC:
Setting the Stage / 1--40 \\ Linear Algebra over the Complex Numbers / 41--75 \\ Complex Scalar Product Spaces (a.k.a. Hilbert Spaces) / 77--110 \\ Lie Groups and Lie Group Representations / 111--152 \\ New Representations from Old / 153--177 \\ Irreducible Representations and Invariant Integration / 179--208 \\ Representations and the Hydrogen Atom / 209--228 \\ The Algebra so(4) Symmetry of the Hydrogen Atom / 229--281 \\ The Group SO(4) Symmetry of the Hydrogen Atom / 283--297 \\ Projective Representations and Spin / 299--338 \\ Independent Events and Tensor Products / 339--358 \\ A. Spherical Harmonics / \\ B. Proof of the Correspondence / \\ C. Suggested Paper Topics / \\ Bibliography / \\ Index / \\ References

entry:
@Book{Singer:2005:LSP,
  author =       "Stephanie Frank Singer",
  title =        "Linearity, Symmetry, and Prediction in the Hydrogen
                 Atom",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiv + 396",
  year =         "2005",
  DOI =          "https://doi.org/10.1007/b136359",
  ISBN =         "0-387-24637-1",
  ISBN-13 =      "978-0-387-24637-6",
  LCCN =         "QC20.7.G76 S56 2005",
  bibdate =      "Sat Sep 3 18:36:12 MDT 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Undergraduate texts in mathematics",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0662/2005042679-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0818/2005042679-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0818/2005042679-t.html",
  acknowledgement = ack-nhfb,
  author-dates = "1964--",
  libnote =      "Not in my library.",
  subject =      "Group theory; Hydrogen; Atoms; Linear algebraic
                 groups; Symmetry (Physics); Representations of groups;
                 Quantum theory",
  tableofcontents = "Setting the Stage / 1--40 \\
                 Linear Algebra over the Complex Numbers / 41--75 \\
                 Complex Scalar Product Spaces (a.k.a. Hilbert Spaces) /
                 77--110 \\
                 Lie Groups and Lie Group Representations / 111--152 \\
                 New Representations from Old / 153--177 \\
                 Irreducible Representations and Invariant Integration /
                 179--208 \\
                 Representations and the Hydrogen Atom / 209--228 \\
                 The Algebra so(4) Symmetry of the Hydrogen Atom /
                 229--281 \\
                 The Group SO(4) Symmetry of the Hydrogen Atom /
                 283--297 \\
                 Projective Representations and Spin / 299--338 \\
                 Independent Events and Tensor Products / 339--358 \\
                 A. Spherical Harmonics / \\
                 B. Proof of the Correspondence / \\
                 C. Suggested Paper Topics / \\
                 Bibliography / \\
                 Index / \\
                 References",
}


bibtype: book
filename: master.bib
label: Singh:1997:FEE
author: Simon Singh
title: Fermat's Enigma: The Epic Quest to Solve the World's Greatest Mathematical Problem
publisher: pub-WALKER
address: pub-WALKER:adr
pages: xiii + 315
year: 1997
ISBN: 0-8027-1331-9 OR 0802713319
ISBN13: 978-0-8027-1331-5 OR 9780802713315
LCCN: QA244.S55 1997
bibdate: Thu Apr 16 13:08:20 1998
bibsource: http://www.walkerbooks.com/; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.04.16 13:08:20 ???
acknowledgement: ack-nhfb
rawauthor: Simon Singh
rawtitle: {Fermat}'s Enigma: The Epic Quest to Solve the World's Greatest Mathematical Problem
abstract:
Fermat's Last Theorem became the Holy Grail of mathematics. Whole and colorful lives were devoted, and even sacrificed, to finding a proof. Leonhard Euler, the greatest mathematician of the eighteenth century, had to admit defeat. Sophie Germain took on the identity of a man to do research in a field forbidden to females, and made the most significant breakthrough of the nineteenth century. The dashing Evariste Galois scribbled down the results of his research deep into the night before venturing out to die in a duel in 1832. Yutaka Taniyama, whose insights would ultimately lead to the solution, tragically killed himself in 1958. On the other hand, Paul Wolfskehl, a famous German industrialist, claimed Fermat had saved him from suicide, and established a rich prize for the first person to prove the theorem. And then came Princeton professor Andrew Wiles, who had dreamed of proving Fermat's Last Theorem ever since he first read of it as a boy of ten in his local library. In 1993, some 356 years after Fermat's challenge, and after seven years of working in isolation and secrecy --- ``a kind of private and very personal battle I was engaged in'' --- Wiles stunned the world by announcing a proof, though his own journey would be far from over. booktitle Fermat's Enigma is the story of the epic quest to solve the greatest math problem of all time. A human drama of high dreams, intellectual brilliance, and extraordinary determination, it will bring the history and culture of mathematics into exciting focus for all who read it.

TOC:
1: ``I Think I'll Stop Here'' / 1 2: The Riddler / 35 3: A Mathematical Disgrace / 71 4: Into Abstraction / 121 5: Proof by Contradiction / 171 6: The Secret Calculation / 205 7: A Slight Problem / 255 Epilogue: Grand Unified Mathematics / 279 Suggestions for Further Reading / 301 Picture Credits / 306

rawabstract:
Fermat's Last Theorem became the Holy Grail of mathematics. Whole and colorful lives were devoted, and even sacrificed, to finding a proof. Leonhard Euler, the greatest mathematician of the eighteenth century, had to admit defeat. Sophie Germain took on the identity of a man to do research in a field forbidden to females, and made the most significant breakthrough of the nineteenth century. The dashing Evariste Galois scribbled down the results of his research deep into the night before venturing out to die in a duel in 1832. Yutaka Taniyama, whose insights would ultimately lead to the solution, tragically killed himself in 1958. On the other hand, Paul Wolfskehl, a famous German industrialist, claimed Fermat had saved him from suicide, and established a rich prize for the first person to prove the theorem. And then came Princeton professor Andrew Wiles, who had dreamed of proving Fermat's Last Theorem ever since he first read of it as a boy of ten in his local library. In 1993, some 356 years after Fermat's challenge, and after seven years of working in isolation and secrecy --- ``a kind of private and very personal battle I was engaged in'' --- Wiles stunned the world by announcing a proof, though his own journey would be far from over. \booktitle{Fermat's Enigma} is the story of the epic quest to solve the greatest math problem of all time. A human drama of high dreams, intellectual brilliance, and extraordinary determination, it will bring the history and culture of mathematics into exciting focus for all who read it.

rawTOC:
1: ``I Think I'll Stop Here'' / 1 \\ 2: The Riddler / 35 \\ 3: A Mathematical Disgrace / 71 \\ 4: Into Abstraction / 121 \\ 5: Proof by Contradiction / 171 \\ 6: The Secret Calculation / 205 \\ 7: A Slight Problem / 255 \\ Epilogue: Grand Unified Mathematics / 279 \\ Suggestions for Further Reading / 301 \\ Picture Credits / 306

entry:
@Book{Singh:1997:FEE,
  author =       "Simon Singh",
  title =        "{Fermat}'s Enigma: The Epic Quest to Solve the World's
                 Greatest Mathematical Problem",
  publisher =    pub-WALKER,
  address =      pub-WALKER:adr,
  pages =        "xiii + 315",
  year =         "1997",
  ISBN =         "0-8027-1331-9",
  ISBN-13 =      "978-0-8027-1331-5",
  LCCN =         "QA244.S55 1997",
  bibdate =      "Thu Apr 16 13:08:20 1998",
  bibsource =    "http://www.walkerbooks.com/;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Fermat's Last Theorem became the Holy Grail of
                 mathematics. Whole and colorful lives were devoted, and
                 even sacrificed, to finding a proof. Leonhard Euler,
                 the greatest mathematician of the eighteenth century,
                 had to admit defeat. Sophie Germain took on the
                 identity of a man to do research in a field forbidden
                 to females, and made the most significant breakthrough
                 of the nineteenth century. The dashing Evariste Galois
                 scribbled down the results of his research deep into
                 the night before venturing out to die in a duel in
                 1832. Yutaka Taniyama, whose insights would ultimately
                 lead to the solution, tragically killed himself in
                 1958. On the other hand, Paul Wolfskehl, a famous
                 German industrialist, claimed Fermat had saved him from
                 suicide, and established a rich prize for the first
                 person to prove the theorem. And then came Princeton
                 professor Andrew Wiles, who had dreamed of proving
                 Fermat's Last Theorem ever since he first read of it as
                 a boy of ten in his local library. In 1993, some 356
                 years after Fermat's challenge, and after seven years
                 of working in isolation and secrecy --- ``a kind of
                 private and very personal battle I was engaged in'' ---
                 Wiles stunned the world by announcing a proof, though
                 his own journey would be far from over.
                 \booktitle{Fermat's Enigma} is the story of the epic
                 quest to solve the greatest math problem of all time. A
                 human drama of high dreams, intellectual brilliance,
                 and extraordinary determination, it will bring the
                 history and culture of mathematics into exciting focus
                 for all who read it.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  mynote =       "This is a very readable, and interesting, account of
                 the history and final proof of Fermat's Last Theorem,
                 namely, that the equation $x^n + y^n = z^n$ has no
                 whole number solutions for $n > 2$, and of the
                 Shimura--Taniyama conjecture about the equivalence of
                 modular forms and elliptic equations, whose validity
                 implies the correctness of Fermat's Last Theorem. The
                 final proof was published in 1995
                 \cite{Wiles:1995:MEC,Taylor:1995:RTP}.\par

                 Polished brute force numerical calculations up to the
                 1980s showed that the theorem was true for $n \leq
                 4,000,000$ [book: p. 158].\par

                 Fermat's theorem was first recorded in about 1637, but
                 went undiscovered until about 1670, five years after
                 Fermat's death on January 12, 1665. In the margin of
                 his {\em Arithmetica}, he wrote in Latin
                 \begin{quotation} Cubem autem in duos cubos, aut
                 quadratoquadratum in duos quadratoquadratos, et
                 generaliter nullam in infinitum ultra quadratum
                 potestatem in duos eiusdem nominis fas est dividere.
                 \end{quotation} or in English, \begin{quotation} It is
                 impossible for a cube to be written as a sum of two
                 cubes or a fourth power to be written as the sum of two
                 fourth powers or, in general, for any number which is a
                 power greater than the second to be written as a sum of
                 two like powers. \end{quotation} \par

                 This remark was followed by a handwritten marginal note
                 \begin{quotation} Cuius rei demonstrationem mirabilem
                 sane detexi hanc marginis exiguitas non caperet.
                 \end{quotation} or in English, \begin{quotation} I have
                 a truly marvelous demonstration of this proposition
                 which this margin is too narrow to contain.
                 \end{quotation} [excerpted from the book, pp.
                 61--62].\par

                 The proof of this proposition foiled the world's best
                 mathematicians for 358 years.",
  tableofcontents = "1: ``I Think I'll Stop Here'' / 1 \\
                 2: The Riddler / 35 \\
                 3: A Mathematical Disgrace / 71 \\
                 4: Into Abstraction / 121 \\
                 5: Proof by Contradiction / 171 \\
                 6: The Secret Calculation / 205 \\
                 7: A Slight Problem / 255 \\
                 Epilogue: Grand Unified Mathematics / 279 \\
                 Suggestions for Further Reading / 301 \\
                 Picture Credits / 306",
}


bibtype: book
filename: master.bib
label: Singh:1999:CBE
author: Simon Singh
title: The Code Book: the Evolution of Secrecy from Mary, Queen of Scots, to Quantum Cryptography
publisher: pub-DOUBLEDAY
address: pub-DOUBLEDAY:adr
pages: xiii + 402
year: 1999
ISBN: 0-385-49531-5 OR 0385495315
ISBN13: 978-0-385-49531-8 OR 9780385495318
LCCN: Z103 .S56 1999
bibdate: Mon Dec 06 16:25:40 1999
bibtimestamp: 1999.12.06 16:25:40 ???
note: See also cite Almgren:2000:HWC.
acknowledgement: ack-nhfb
rawauthor: Simon Singh
rawnote: See also \cite{Almgren:2000:HWC}.
rawtitle: The Code Book: the Evolution of Secrecy from {Mary, Queen of Scots}, to Quantum Cryptography
bibsource:
https://www.math.utah.edu/pub/tex/bib/adabooks.bib; https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

TOC:
The cipher of Mary Queen of Scots Le chiffre indechiffrable The mechanisation of secrecy Cracking the Enigma The language barrier Alice and Bob go public Pretty good privacy A quantum leap into the future

rawTOC:
The cipher of Mary Queen of Scots \\ Le chiffre ind{\'e}chiffrable \\ The mechanisation of secrecy \\ Cracking the Enigma \\ The language barrier \\ Alice and Bob go public \\ Pretty good privacy \\ A quantum leap into the future

entry:
@Book{Singh:1999:CBE,
  author =       "Simon Singh",
  title =        "The Code Book: the Evolution of Secrecy from {Mary,
                 Queen of Scots}, to Quantum Cryptography",
  publisher =    pub-DOUBLEDAY,
  address =      pub-DOUBLEDAY:adr,
  pages =        "xiii + 402",
  year =         "1999",
  ISBN =         "0-385-49531-5",
  ISBN-13 =      "978-0-385-49531-8",
  LCCN =         "Z103 .S56 1999",
  bibdate =      "Mon Dec 06 16:25:40 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/adabooks.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also \cite{Almgren:2000:HWC}.",
  price =        "US\$24.95",
  acknowledgement = ack-nhfb,
  remark-1 =     "There are 11 page-range references to Charles Babbage
                 in the index of this book, and the section on pages
                 63--78 entitled \booktitle{Mr Babbage Versus the
                 Vigen{\`e}re Cipher} describes Babbage's cracking of
                 that cipher, which had recently been rediscovered by a
                 dentist in Bristol, UK, who, unaware of its first
                 discovery by Blaise de Vigen{\`e}re about 1565, applied
                 for a patent on the cipher. Babbage's papers contain an
                 extensive collection of work on cryptography, but a
                 planned book \booktitle{The Philosophy of Deciphering}
                 was never completed. Singh suggests that Babbage was
                 requested by the British Government to keep his
                 cryptographic work secret, because the Vigen{\`e}re
                 cipher was in wartime use by the British military in
                 the Crimea. Babbage's published works in this area
                 include only two brief papers in 1854 on decryption,
                 and a section in his 1864 book \booktitle{Passages from
                 the Life of a Philosopher}. Singh is, however,
                 incorrect in asserting that the Difference Engine No. 2
                 was a programmable device; it is Babbage's Analytical
                 Engine that has that honor.",
  remark-2 =     "From page 66: ``A century later, during the course of
                 the Second World War, the first electronic incarnations
                 of Babbage's machines would have a profound effect on
                 cryptanalysis, but, in his own lifetime, Babbage made
                 an equally important contribution to codebreaking: he
                 succeeded in breaking the Vigen{\`e}re cipher, and in
                 so doing he made the greatest breakthrough in
                 cryptanalysis since the Arab scholars of the ninth
                 century broke the monoalphabetic cipher by inventing
                 frequency analysis.''",
  tableofcontents = "The cipher of Mary Queen of Scots \\
                 Le chiffre ind{\'e}chiffrable \\
                 The mechanisation of secrecy \\
                 Cracking the Enigma \\
                 The language barrier \\
                 Alice and Bob go public \\
                 Pretty good privacy \\
                 A quantum leap into the future",
}


bibtype: book
filename: master.bib
label: Singh:2007:MXI
author: Amit Singh
title: Mac OS X internals: a systems approach
publisher: pub-AW
address: pub-AW:adr
pages: xxxiii + 1641
year: 2007
ISBN: 0-321-27854-2 (hardcover) OR 0321278542 (hardcover)
ISBN13: 978-0-321-27854-8 (hardcover) OR 9780321278548 (hardcover)
LCCN: QA76.76.O63 S5645 2007
bibdate: Fri May 4 15:21:07 MDT 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; melvyl.cdlib.org:210/CDL90
bibtimestamp: 2007.05.04 15:21:07 MDT
URL: http://www.loc.gov/catdir/toc/ecip0613/2006014901.html
subject: Mac OS; Operating systems (Computers); Macintosh (Computer); Programming
acknowledgement: ack-nhfb
rawauthor: Amit Singh
rawtitle: {Mac OS X} internals: a systems approach
TOC:
1. Origins of Mac OS X 2. An overview of Mac OS X 3. Inside an Apple 4. The firmware and the bootloader 5. Kernel and user-level startup 6. The xnu kernel 7. Processes 8. Memory 9. Interprocess communication 10. Extending the kernel 11. File systems 12. The HFS plus file system Appendix A. Mac OS X on x86-based Macintosh computers

rawTOC:
1. Origins of Mac OS X \\ 2. An overview of Mac OS X \\ 3. Inside an Apple \\ 4. The firmware and the bootloader \\ 5. Kernel and user-level startup \\ 6. The xnu kernel \\ 7. Processes \\ 8. Memory \\ 9. Interprocess communication \\ 10. Extending the kernel \\ 11. File systems \\ 12. The HFS plus file system \\ Appendix A. Mac OS X on x86-based Macintosh computers

entry:
@Book{Singh:2007:MXI,
  author =       "Amit Singh",
  title =        "{Mac OS X} internals: a systems approach",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxxiii + 1641",
  year =         "2007",
  ISBN =         "0-321-27854-2 (hardcover)",
  ISBN-13 =      "978-0-321-27854-8 (hardcover)",
  LCCN =         "QA76.76.O63 S5645 2007",
  bibdate =      "Fri May 4 15:21:07 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  URL =          "http://www.loc.gov/catdir/toc/ecip0613/2006014901.html",
  acknowledgement = ack-nhfb,
  subject =      "Mac OS; Operating systems (Computers); Macintosh
                 (Computer); Programming",
  tableofcontents = "1. Origins of Mac OS X \\
                 2. An overview of Mac OS X \\
                 3. Inside an Apple \\
                 4. The firmware and the bootloader \\
                 5. Kernel and user-level startup \\
                 6. The xnu kernel \\
                 7. Processes \\
                 8. Memory \\
                 9. Interprocess communication \\
                 10. Extending the kernel \\
                 11. File systems \\
                 12. The HFS plus file system \\
                 Appendix A. Mac OS X on x86-based Macintosh computers",
}


bibtype: book
filename: master.bib
label: Sites:1992:AAR
author: Richard L. Sites
title: Alpha Architecture Reference Manual
publisher: pub-DP
pages: xxxiii + 1641
year: 1992
ISBN: 1-55558-098-X (DP), 0-13-033663-7 (PH) OR 155558098X (DP), 0130336637 (PH)
ISBN13: 978-1-55558-098-8 (DP), 978-0-13-033663-7 (PH) OR 9781555580988 (DP), 9780130336637 (PH)
LCCN: QA76.9.A73 A46 1992
bibdate: Fri May 13 17:23:12 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.05.13 17:23:12 ???
acknowledgement: ack-nhfb
rawauthor: Richard L. Sites
rawtitle: {Alpha} Architecture Reference Manual
entry:
@Book{Sites:1992:AAR,
  author =       "Richard L. Sites",
  title =        "{Alpha} Architecture Reference Manual",
  publisher =    pub-DP # " and " # pub-PH,
  year =         "1992",
  ISBN =         "1-55558-098-X (DP), 0-13-033663-7 (PH)",
  ISBN-13 =      "978-1-55558-098-8 (DP), 978-0-13-033663-7 (PH)",
  LCCN =         "QA76.9.A73 A46 1992",
  bibdate =      "Fri May 13 17:23:12 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$35.00",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}


bibtype: book
filename: master.bib
label: Sites:1995:AAA
author: Richard L. Sites and Richard L. Witek
title: Alpha AXP Architecture Reference Manual
publisher: pub-DP
address: pub-DP:adr
edition: Second
pages: various
year: 1995
ISBN: 1-55558-145-5 OR 1555581455
ISBN13: 978-1-55558-145-9 OR 9781555581459
LCCN: QA76.9.A73A46 1995
bibdate: Thu Aug 07 13:41:17 1997
bibtimestamp: 1997.08.07 13:41:17 ???
acknowledgement: ack-nhfb
rawauthor: Richard L. Sites and Richard L. Witek
rawtitle: {Alpha AXP} Architecture Reference Manual
TOC:
Foreword Preface to the First Edition Preface to the Second Edition Part 1: Common Architecture (I) 1. Introduction (I) 1.1 The Alpha AXP Approach to RISC Architecture 1.2 Data Format Overview 1.3 Instruction Format Overview 1.4 Instruction Overview 1.5 Instruction Set Characteristics 1.6 Terminology and Conventions 2. Basic Architecture (I) 2.1 Addressing 2.2 Data Types 2.3 Big-endian Addressing Support 3. Instruction Formats (I) 3.1 Alpha AXP Registers 3.2 Notation 3.3 Instruction Formats 4. Instruction Descriptions (I) 4.1 Instruction Set Overview 4.2 Memory Integer Load/Store Instructions 4.3 Control Instructions 4.4 Integer Arithmetic Instructions 4.5 Logical and Shift Instructions 4.6 Byte-Manipulation Instructions 4.7 Floating-Point Instructions 4.8 Memory Format Floating-Point Instructions 4.9 Branch Format Floating-Point Instructions 4.10 Floating-Point Operate Format Instructions 4.11 Miscellaneous Instructions 4.12 VAX Compatibility Instructions 5. System Architecture and Programming Implications 5.1 Introduction 5.2 Physical Address Space Characteristics 5.3 Translation Buffers and Virtual Caches 5.4 Caches and Write Buffers 5.5 Data Sharing 5.6 Read/Write Ordering 5.7 Arithmetic Traps 6. Common PALcode Architecture (I) 6.1 PALcode 6.2 PALcode Instructions and Functions 6.3 PALcode Environment 6.4 Special Functions Required for PALcode 6.5 PALcode Effects on System Code 6.6 PALcode Replacement 6.7 Required PALcode Instructions 7. Console Subsystem Overview (I) 8. Input/Output Overview (I) Specific Operating System PALcode Architecture (II) Part 2: OpenVMS AXP Software (II-A) 1. Introduction to OpenVMS AXP (II-A) 1.1 Register Usage 2. OpenVMS AXP PALcode Instruction Descriptions (II-A) 2.1 Unprivileged General OpenVMS AXP PALcode Instructions 2.2 OpenVMS AXP Queue Data Types 2.3 Unprivileged OpenVMS AXP Queue PALcode Instructions 2.4 Unprivileged VAX Compatibility PALcode Instructions 2.5 Unprivileged PALcode Thread Instructions 2.6 Privileged PALcode Instructions 3. OpenVMS AXP Memory Management (II-A) 3.1 Introduction 3.2 Virtual Address Space 3.3 Physical Address Space 3.4 Memory Management Control 3.5 Page Table Entries 3.6 Memory Protection 3.7 Address Translation 3.8 Translation Buffer 3.9 Address Space Numbers 3.10 Memory Management Faults 4. OpenVMS AXP Process Structure (II-A) 4.1 Process Definition 4.2 Hardware Privileged Process Context 4.3 Asynchronous System Traps (AST) 4.4 Process Context Switching 5. OpenVMS AXP Internal Processor Registers (II-A) 5.1 Internal Processor Registers 5.1 Internal Processor Registers 5.2 Stack Pointer Internal Processor Registers 5.3 IPR Summary

rawTOC:
Foreword \\ Preface to the First Edition \\ Preface to the Second Edition \\ Part 1: Common Architecture (I) \\ 1. Introduction (I) \\ 1.1 The Alpha AXP Approach to RISC Architecture \\ 1.2 Data Format Overview \\ 1.3 Instruction Format Overview \\ 1.4 Instruction Overview \\ 1.5 Instruction Set Characteristics \\ 1.6 Terminology and Conventions \\ 2. Basic Architecture (I) \\ 2.1 Addressing \\ 2.2 Data Types \\ 2.3 Big-endian Addressing Support \\ 3. Instruction Formats (I) \\ 3.1 Alpha AXP Registers \\ 3.2 Notation \\ 3.3 Instruction Formats \\ 4. Instruction Descriptions (I) \\ 4.1 Instruction Set Overview \\ 4.2 Memory Integer Load/Store Instructions \\ 4.3 Control Instructions \\ 4.4 Integer Arithmetic Instructions \\ 4.5 Logical and Shift Instructions \\ 4.6 Byte-Manipulation Instructions \\ 4.7 Floating-Point Instructions \\ 4.8 Memory Format Floating-Point Instructions \\ 4.9 Branch Format Floating-Point Instructions \\ 4.10 Floating-Point Operate Format Instructions \\ 4.11 Miscellaneous Instructions \\ 4.12 VAX Compatibility Instructions \\ 5. System Architecture and Programming Implications \\ 5.1 Introduction \\ 5.2 Physical Address Space Characteristics \\ 5.3 Translation Buffers and Virtual Caches \\ 5.4 Caches and Write Buffers \\ 5.5 Data Sharing \\ 5.6 Read/Write Ordering \\ 5.7 Arithmetic Traps \\ 6. Common PALcode Architecture (I) \\ 6.1 PALcode \\ 6.2 PALcode Instructions and Functions \\ 6.3 PALcode Environment \\ 6.4 Special Functions Required for PALcode \\ 6.5 PALcode Effects on System Code \\ 6.6 PALcode Replacement \\ 6.7 Required PALcode Instructions \\ 7. Console Subsystem Overview (I) \\ 8. Input/Output Overview (I) \\ Specific Operating System PALcode Architecture (II) \\ Part 2: OpenVMS AXP Software (II-A) \\ 1. Introduction to OpenVMS AXP (II-A) \\ 1.1 Register Usage \\ 2. OpenVMS AXP PALcode Instruction Descriptions (II-A) \\ 2.1 Unprivileged General OpenVMS AXP PALcode Instructions \\ 2.2 OpenVMS AXP Queue Data Types \\ 2.3 Unprivileged OpenVMS AXP Queue PALcode Instructions \\ 2.4 Unprivileged VAX Compatibility PALcode Instructions \\ 2.5 Unprivileged PALcode Thread Instructions \\ 2.6 Privileged PALcode Instructions \\ 3. OpenVMS AXP Memory Management (II-A) \\ 3.1 Introduction \\ 3.2 Virtual Address Space \\ 3.3 Physical Address Space \\ 3.4 Memory Management Control \\ 3.5 Page Table Entries \\ 3.6 Memory Protection \\ 3.7 Address Translation \\ 3.8 Translation Buffer \\ 3.9 Address Space Numbers \\ 3.10 Memory Management Faults \\ 4. OpenVMS AXP Process Structure (II-A) \\ 4.1 Process Definition \\ 4.2 Hardware Privileged Process Context \\ 4.3 Asynchronous System Traps (AST) \\ 4.4 Process Context Switching \\ 5. OpenVMS AXP Internal Processor Registers (II-A) \\ 5.1 Internal Processor Registers \\ 5.1 Internal Processor Registers \\ 5.2 Stack Pointer Internal Processor Registers \\ 5.3 IPR Summary

entry:
@Book{Sites:1995:AAA,
  author =       "Richard L. Sites and Richard L. Witek",
  title =        "{Alpha AXP} Architecture Reference Manual",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  edition =      "Second",
  pages =        "various",
  year =         "1995",
  ISBN =         "1-55558-145-5",
  ISBN-13 =      "978-1-55558-145-9",
  LCCN =         "QA76.9.A73A46 1995",
  bibdate =      "Thu Aug 07 13:41:17 1997",
  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",
  price =        "US\$52.95",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword \\
                 Preface to the First Edition \\
                 Preface to the Second Edition \\
                 Part 1: Common Architecture (I) \\
                 1. Introduction (I) \\
                 1.1 The Alpha AXP Approach to RISC Architecture \\
                 1.2 Data Format Overview \\
                 1.3 Instruction Format Overview \\
                 1.4 Instruction Overview \\
                 1.5 Instruction Set Characteristics \\
                 1.6 Terminology and Conventions \\
                 2. Basic Architecture (I) \\
                 2.1 Addressing \\
                 2.2 Data Types \\
                 2.3 Big-endian Addressing Support \\
                 3. Instruction Formats (I) \\
                 3.1 Alpha AXP Registers \\
                 3.2 Notation \\
                 3.3 Instruction Formats \\
                 4. Instruction Descriptions (I) \\
                 4.1 Instruction Set Overview \\
                 4.2 Memory Integer Load/Store Instructions \\
                 4.3 Control Instructions \\
                 4.4 Integer Arithmetic Instructions \\
                 4.5 Logical and Shift Instructions \\
                 4.6 Byte-Manipulation Instructions \\
                 4.7 Floating-Point Instructions \\
                 4.8 Memory Format Floating-Point Instructions \\
                 4.9 Branch Format Floating-Point Instructions \\
                 4.10 Floating-Point Operate Format Instructions \\
                 4.11 Miscellaneous Instructions \\
                 4.12 VAX Compatibility Instructions \\
                 5. System Architecture and Programming Implications \\
                 5.1 Introduction \\
                 5.2 Physical Address Space Characteristics \\
                 5.3 Translation Buffers and Virtual Caches \\
                 5.4 Caches and Write Buffers \\
                 5.5 Data Sharing \\
                 5.6 Read/Write Ordering \\
                 5.7 Arithmetic Traps \\
                 6. Common PALcode Architecture (I) \\
                 6.1 PALcode \\
                 6.2 PALcode Instructions and Functions \\
                 6.3 PALcode Environment \\
                 6.4 Special Functions Required for PALcode \\
                 6.5 PALcode Effects on System Code \\
                 6.6 PALcode Replacement \\
                 6.7 Required PALcode Instructions \\
                 7. Console Subsystem Overview (I) \\
                 8. Input/Output Overview (I) \\
                 Specific Operating System PALcode Architecture (II) \\
                 Part 2: OpenVMS AXP Software (II-A) \\
                 1. Introduction to OpenVMS AXP (II-A) \\
                 1.1 Register Usage \\
                 2. OpenVMS AXP PALcode Instruction Descriptions (II-A)
                 \\
                 2.1 Unprivileged General OpenVMS AXP PALcode
                 Instructions \\
                 2.2 OpenVMS AXP Queue Data Types \\
                 2.3 Unprivileged OpenVMS AXP Queue PALcode Instructions
                 \\
                 2.4 Unprivileged VAX Compatibility PALcode Instructions
                 \\
                 2.5 Unprivileged PALcode Thread Instructions \\
                 2.6 Privileged PALcode Instructions \\
                 3. OpenVMS AXP Memory Management (II-A) \\
                 3.1 Introduction \\
                 3.2 Virtual Address Space \\
                 3.3 Physical Address Space \\
                 3.4 Memory Management Control \\
                 3.5 Page Table Entries \\
                 3.6 Memory Protection \\
                 3.7 Address Translation \\
                 3.8 Translation Buffer \\
                 3.9 Address Space Numbers \\
                 3.10 Memory Management Faults \\
                 4. OpenVMS AXP Process Structure (II-A) \\
                 4.1 Process Definition \\
                 4.2 Hardware Privileged Process Context \\
                 4.3 Asynchronous System Traps (AST) \\
                 4.4 Process Context Switching \\
                 5. OpenVMS AXP Internal Processor Registers (II-A) \\
                 5.1 Internal Processor Registers \\
                 5.1 Internal Processor Registers \\
                 5.2 Stack Pointer Internal Processor Registers \\
                 5.3 IPR Summary",
}


bibtype: book
filename: master.bib
label: Skiena:1998:ADM
author: Steven S. Skiena
title: The Algorithm Design Manual
publisher: pub-SV
address: pub-SV:adr
pages: xvi + 486
year: 1998
ISBN: 0-387-94860-0 OR 0387948600
ISBN13: 978-0-387-94860-7 OR 9780387948607
LCCN: QA76.9.A43S55 1997
bibdate: Tue Feb 10 10:51:27 1998
bibtimestamp: 1998.02.10 10:51:27 ???
acknowledgement: ack-nhfb
rawauthor: Steven S. Skiena
rawtitle: The Algorithm Design Manual
TOC:
Preface / vii I. Techniques 1 Introduction to Algorithms / 3 1.1 Correctness and Efficiency / 4 1.1.1 Correctness / 5 1.1.2 Efficiency / 9 1.2 Expressing Algorithms / 9 1.3 Keeping Score / 10 1.3.1 The RAM Model of Computation / 10 1.3.2 Best, Worst, and Average-Case Complexity / 11 1.4 The Big Oh Notation / 13 1.5 Growth Rates / 15 1.6 Logarithms / 16 1.7 Modeling the Problem / 18 1.8 About the War Stories / 20 1.9 War Story: Psychic Modeling / 21 1.10 Exercises / 25 2 Data Structures and Sorting / 27 2.1 Fundamental Data Types / 28 2.1.1 Containers / 28 2.1.2 Dictionaries / 29 2.1.3 Binary Search Trees / 30 2.1.4 Priority Queues / 31 2.2 Specialized Data Structures / 33 2.3 Sorting / 33 2.4 Applications of Sorting / 34 2.5 Approaches to Sorting / 36 2.5.1 Data Structures / 36 2.5.2 Incremental Insertion / 36 2.5.3 Divide and Conquer / 37 2.5.4 Randomization / 37 2.5.5 Bucketing Techniques / 38 2.6 War Story: Stripping Triangulations / 39 2.7 War Story: Mystery of the Pyramids / 43 2.8 War Story: String `em Up / 46 2.9 Exercises / 50 3 Breaking Problems Down / 53 3.1 Dynamic Programming / 54 3.1.1 Fibonacci numbers / 54 3.1.2 The Partition Problem / 56 3.1.3 Approximate String Matching / 60 3.1.4 Longest Increasing Sequence / 62 3.1.5 Minimum Weight Triangulation / 64 3.2 Limitations of Dynamic Programming / 65 3.3 War Story: Evolution of the Lobster / 66 3.4 War Story: What's Past Is Prolog / 69 3.5 War Story: Text Compression for Bar Codes / 72 3.6 Divide and Conquer / 75 3.6.1 Fast Exponentiation / 75 3.6.2 Binary Search / 76 3.6.3 Square and Other Roots / 76 3.7 Exercises / 77 4 Graph Algorithms / 81 4.1 The Friendship Graph / 82 4.2 Data Structures for Graphs / 84 4.3 War Story: Getting the Graph / 86 4.4 Traversing a Graph / 88 4.4.1 Breadth-First Search / 89 4.4.2 Depth-First Search / 91 4.5 Applications of Graph Traversal / 92 4.5.1 Connected Components / 92 4.5.2 Tree and Cycle Detection / 93 4.5.3 Two-Coloring Graphs / 93 4.5.4 Topological Sorting / 94 4.5.5 Articulation Vertices / 95 4.6 Modeling graph Problems / 95 4.7 Minimum Spanning Trees / 97 4.7.1 Prim's Algorithm / 98 4.7.2 Kruskal's Algorithm / 99 4.8 Shortest Paths / 100 4.8.1 Dijkstra's Algorithm / 100 4.8.2 All-Pairs Shortest Path / 102 4.9 War Story: Nothing but Nets / 102 4.10 War Story: Dialing for Documents / 105 4.11 Exercises / 110 5 Combinatorial Search and Heuristic Methods / 115 5.1 Backtracking / 116 5.1.1 Constructing All Subsets / 117 5.1.2 Constructing All Permutations / 118 5.1.3 Constructing All Paths in a Graph / 118 5.2 Search Pruning / 119 5.3 Bandwidth Minimization / 120 5.4 War Story: Covering Chessboards / 122 5.5 Heuristic Methods / 125 5.5.1 Simulated Annealing / 125 5.5.2 Neural Networks / 129 5.5.3 Genetic Algorithms / 130 5.6 War Story: Annealing Arrays / 131 5.7 Parallel Algorithms / 134 5.8 War Story: Going Nowhere fast / 135 5.9 exercises / 136 6 Intractable Problems anal Approximations / 139 6.1 Problems and Reductions / 140 6.2 Simple Reductions / 141 6.2.1 Hamiltonian Cycle / 142 6.2.2 Independent Set and Vertex Cover / 142 6.2.3 Clique and Independent Set / 144 6.3 Satisfiability / 144 6.3.1 The Theory of NP-Completeness / 145 6.3.2 Satisfyability / 146 6.4 Difficult Reductions / 147 6.4.1 Integer Programming / 147 6.4.2 Vortex Cover / 149 6.5 Other NP-Complete Problems / 151 6.6 The Art of Proving Hardness / 152 6.7 War Story: Hard Against the Clock / 154 6.8 Approximation Algorithms / 156 6.8.1 Approximating Vertex Cover / 157 6.8.2 The Euclidean Traveling Salesman / 158 6.9 Exercises / 160 7 How to Design Algorithms / 163 II. RESOURCES 8 A Catalog of Algorithmic Problems / 171 8.1 Data Structures / 174 8.1.1 Dictionaries / 175 8.1.2 Priority Queues / 180 8.1.3 Suffix Trees and Arrays / 183 8.1.4 Graph Data Structures / 187 8.1.5 Set Data Structures / 191 8.1.6 Kd-Trees / 194 8.2 Numerical Problems / 197 8.2.1 Solving Linear Equations / 199 8.2.2 Bandwidth Reduction / 202 8.2.3 Matrix Multiplication / 204 8.2.4 Determinants and Permanents / 207 8.2.5 Constrained and Unconstrained Optimization / 209 8.2.6 Linear Programming / 213 8.2.7 Random Number Generation / 217 8.2.8 Factoring and Primality Testing / 221 8.2.9 Arbitrary-Precision Arithmetic / 224 8.2.10 Knapsack Problem / 228 8.2.11 Discrete Fourier Transform / 232 8.3 Combinatorial Problems / 235 8.3.1 Sorting / 236 8.3.2 Searching / 240 8.3.3 Median and Selection / 244 8.3.4 Generating Permutations / 246 8.3.5 Generating Subsets / 250 8.3.6 Generating Partitions / 253 8.3.7 Generating Graphs / 257 8.3.8 Calendrical Calculations / 261 8.3.9 Job Scheduling / 263 8.3.10 Satisfiability / 266 8.4 Graph Problems: Polynomiai-Time / 269 8.4.1 Connected Components / 270 8.4.2 Topological Sorting / 273 8.4.3 Minimum Spanning Tree / 275 8.4.4 Shortest Path / 279 8.4.5 Transitive Closure and Reduction / 284 8.4.6 Matching / 287 8.4.7 Eulerian Cycle / Chinese Postman / 291 8.4.8 Edge and Vertex Connectivity / 294 8.4.9 Network Flow / 297 8.4.10 Drawing Grains Nicely / 301 8.4.11 Drawing Trees / 305 8.4.12 Planarity Detection and Embedding / 308 8.5 Graph Problems: Hard Problems / 311 8.5.1 Clique / 312 8.5.2 Independent Set / 315 8.5.3 Vertex Cover / 317 8.5.4 Traveling salesman Problem / 319 8.5.5 Hamiltonian Cycle / 323 8.5.6 Graph Partition / 326 8.5.7 Vertex Coloring / 329 8.5.8 Edge Coloring / 333 8.5.9 Graph Isomorphism / 335 8.5.10 Steiner Tree / 339 8.5.11 Feedback Edge/ vertex Set / 343 8.6 Computational Geometry / 345 8.6.1 Robust geometric Primitives / 347 8.6.2 Convex Hull / 351 8.6.3 Triangulation / 355 8.6.4 Voronoi Diagrams / 358 8.6.5 Nearest Neighbor Search / 361 8.6.6 Range Search / 364 8.6.7 Point Location / 367 8.6.8 Intersection Detection / 370 8.6.9 Bin Packing / 374 8.6.10 Medial-Axis Transformation / 377 8.6.11 Polygon Partitioning / 380 8.6.12 Simplifying Polygons / 383 8.6.13 Shape Similarity / 386 8.6.14 Motion Planning / 389 8.6.15 Maintaining Line Arrangements / 392 8.6.16 Minkowski Sum / 395 8.7 Set and String Problems / 397 8.7.1 Set Cover / 398 8.7.2 Set Packing / 401 8.7.3 String Matching / 403 8.7.4 Approximate String Matching / 406 8.7.5 Text Compression / 410 8.7.6 Cryptography / 414 8.7.7 Finite State Machine Minimization / 418 8.7.8 Longest Common Substring / 422 8.7.9 Shortest Common Superstring / 425 9 Algorithmic Resources / 427 9.1 Software Systems / 427 9.1.1 LEDA / 428 9.1.2 Netlib / 428 9.1.3 The Stanford GraphBase / 429 9.1.4 Combinatorica / 430 9.1.5 Algorithm Animations with XTango / 430 9.1.6 Programs From Books / 431 9.2 Data Sources / 433 9.3 Textbooks / 434 9.4 On-Line Resources / 435 9.4.1 Literature / 436 9.4.2 People / 436 9.4.3 Software / 437 9.5 Professional Consulting Services / 437 Bibliography / 439 Index / 463

rawTOC:
Preface / vii \\ I. Techniques \\ 1 Introduction to Algorithms / 3 \\ 1.1 Correctness and Efficiency / 4 \\ 1.1.1 Correctness / 5 \\ 1.1.2 Efficiency / 9 \\ 1.2 Expressing Algorithms / 9 \\ 1.3 Keeping Score / 10 \\ 1.3.1 The RAM Model of Computation / 10 \\ 1.3.2 Best, Worst, and Average-Case Complexity / 11 \\ 1.4 The Big Oh Notation / 13 \\ 1.5 Growth Rates / 15 \\ 1.6 Logarithms / 16 \\ 1.7 Modeling the Problem / 18 \\ 1.8 About the War Stories / 20 \\ 1.9 War Story: Psychic Modeling / 21 \\ 1.10 Exercises / 25 \\ 2 Data Structures and Sorting / 27 \\ 2.1 Fundamental Data Types / 28 \\ 2.1.1 Containers / 28 \\ 2.1.2 Dictionaries / 29 \\ 2.1.3 Binary Search Trees / 30 \\ 2.1.4 Priority Queues / 31 \\ 2.2 Specialized Data Structures / 33 \\ 2.3 Sorting / 33 \\ 2.4 Applications of Sorting / 34 \\ 2.5 Approaches to Sorting / 36 \\ 2.5.1 Data Structures / 36 \\ 2.5.2 Incremental Insertion / 36 \\ 2.5.3 Divide and Conquer / 37 \\ 2.5.4 Randomization / 37 \\ 2.5.5 Bucketing Techniques / 38 \\ 2.6 War Story: Stripping Triangulations / 39 \\ 2.7 War Story: Mystery of the Pyramids / 43 \\ 2.8 War Story: String `em Up / 46 \\ 2.9 Exercises / 50 \\ 3 Breaking Problems Down / 53 \\ 3.1 Dynamic Programming / 54 \\ 3.1.1 Fibonacci numbers / 54 \\ 3.1.2 The Partition Problem / 56 \\ 3.1.3 Approximate String Matching / 60 \\ 3.1.4 Longest Increasing Sequence / 62 \\ 3.1.5 Minimum Weight Triangulation / 64 \\ 3.2 Limitations of Dynamic Programming / 65 \\ 3.3 War Story: Evolution of the Lobster / 66 \\ 3.4 War Story: What's Past Is Prolog / 69 \\ 3.5 War Story: Text Compression for Bar Codes / 72 \\ 3.6 Divide and Conquer / 75 \\ 3.6.1 Fast Exponentiation / 75 \\ 3.6.2 Binary Search / 76 \\ 3.6.3 Square and Other Roots / 76 \\ 3.7 Exercises / 77 \\ 4 Graph Algorithms / 81 \\ 4.1 The Friendship Graph / 82 \\ 4.2 Data Structures for Graphs / 84 \\ 4.3 War Story: Getting the Graph / 86 \\ 4.4 Traversing a Graph / 88 \\ 4.4.1 Breadth-First Search / 89 \\ 4.4.2 Depth-First Search / 91 \\ 4.5 Applications of Graph Traversal / 92 \\ 4.5.1 Connected Components / 92 \\ 4.5.2 Tree and Cycle Detection / 93 \\ 4.5.3 Two-Coloring Graphs / 93 \\ 4.5.4 Topological Sorting / 94 \\ 4.5.5 Articulation Vertices / 95 \\ 4.6 Modeling graph Problems / 95 \\ 4.7 Minimum Spanning Trees / 97 \\ 4.7.1 Prim's Algorithm / 98 \\ 4.7.2 Kruskal's Algorithm / 99 \\ 4.8 Shortest Paths / 100 \\ 4.8.1 Dijkstra's Algorithm / 100 \\ 4.8.2 All-Pairs Shortest Path / 102 \\ 4.9 War Story: Nothing but Nets / 102 \\ 4.10 War Story: Dialing for Documents / 105 \\ 4.11 Exercises / 110 \\ 5 Combinatorial Search and Heuristic Methods / 115 \\ 5.1 Backtracking / 116 \\ 5.1.1 Constructing All Subsets / 117 \\ 5.1.2 Constructing All Permutations / 118 \\ 5.1.3 Constructing All Paths in a Graph / 118 \\ 5.2 Search Pruning / 119 \\ 5.3 Bandwidth Minimization / 120 \\ 5.4 War Story: Covering Chessboards / 122 \\ 5.5 Heuristic Methods / 125 \\ 5.5.1 Simulated Annealing / 125 \\ 5.5.2 Neural Networks / 129 \\ 5.5.3 Genetic Algorithms / 130 \\ 5.6 War Story: Annealing Arrays / 131 \\ 5.7 Parallel Algorithms / 134 \\ 5.8 War Story: Going Nowhere fast / 135 \\ 5.9 exercises / 136 \\ 6 Intractable Problems anal Approximations / 139 \\ 6.1 Problems and Reductions / 140 \\ 6.2 Simple Reductions / 141 \\ 6.2.1 Hamiltonian Cycle / 142 \\ 6.2.2 Independent Set and Vertex Cover / 142 \\ 6.2.3 Clique and Independent Set / 144 \\ 6.3 Satisfiability / 144 \\ 6.3.1 The Theory of NP-Completeness / 145 \\ 6.3.2 Satisfyability / 146 \\ 6.4 Difficult Reductions / 147 \\ 6.4.1 Integer Programming / 147 \\ 6.4.2 Vortex Cover / 149 \\ 6.5 Other NP-Complete Problems / 151 \\ 6.6 The Art of Proving Hardness / 152 \\ 6.7 War Story: Hard Against the Clock / 154 \\ 6.8 Approximation Algorithms / 156 \\ 6.8.1 Approximating Vertex Cover / 157 \\ 6.8.2 The Euclidean Traveling Salesman / 158 \\ 6.9 Exercises / 160 \\ 7 How to Design Algorithms / 163 \\ II. RESOURCES \\ 8 A Catalog of Algorithmic Problems / 171 \\ 8.1 Data Structures / 174 \\ 8.1.1 Dictionaries / 175 \\ 8.1.2 Priority Queues / 180 \\ 8.1.3 Suffix Trees and Arrays / 183 \\ 8.1.4 Graph Data Structures / 187 \\ 8.1.5 Set Data Structures / 191 \\ 8.1.6 Kd-Trees / 194 \\ 8.2 Numerical Problems / 197 \\ 8.2.1 Solving Linear Equations / 199 \\ 8.2.2 Bandwidth Reduction / 202 \\ 8.2.3 Matrix Multiplication / 204 \\ 8.2.4 Determinants and Permanents / 207 \\ 8.2.5 Constrained and Unconstrained Optimization / 209 \\ 8.2.6 Linear Programming / 213 \\ 8.2.7 Random Number Generation / 217 \\ 8.2.8 Factoring and Primality Testing / 221 \\ 8.2.9 Arbitrary-Precision Arithmetic / 224 \\ 8.2.10 Knapsack Problem / 228 \\ 8.2.11 Discrete Fourier Transform / 232 \\ 8.3 Combinatorial Problems / 235 \\ 8.3.1 Sorting / 236 \\ 8.3.2 Searching / 240 \\ 8.3.3 Median and Selection / 244 \\ 8.3.4 Generating Permutations / 246 \\ 8.3.5 Generating Subsets / 250 \\ 8.3.6 Generating Partitions / 253 \\ 8.3.7 Generating Graphs / 257 \\ 8.3.8 Calendrical Calculations / 261 \\ 8.3.9 Job Scheduling / 263 \\ 8.3.10 Satisfiability / 266 \\ 8.4 Graph Problems: Polynomiai-Time / 269 \\ 8.4.1 Connected Components / 270 \\ 8.4.2 Topological Sorting / 273 \\ 8.4.3 Minimum Spanning Tree / 275 \\ 8.4.4 Shortest Path / 279 \\ 8.4.5 Transitive Closure and Reduction / 284 \\ 8.4.6 Matching / 287 \\ 8.4.7 Eulerian Cycle / Chinese Postman / 291 \\ 8.4.8 Edge and Vertex Connectivity / 294 \\ 8.4.9 Network Flow / 297 \\ 8.4.10 Drawing Grains Nicely / 301 \\ 8.4.11 Drawing Trees / 305 \\ 8.4.12 Planarity Detection and Embedding / 308 \\ 8.5 Graph Problems: Hard Problems / 311 \\ 8.5.1 Clique / 312 \\ 8.5.2 Independent Set / 315 \\ 8.5.3 Vertex Cover / 317 \\ 8.5.4 Traveling salesman Problem / 319 \\ 8.5.5 Hamiltonian Cycle / 323 \\ 8.5.6 Graph Partition / 326 \\ 8.5.7 Vertex Coloring / 329 \\ 8.5.8 Edge Coloring / 333 \\ 8.5.9 Graph Isomorphism / 335 \\ 8.5.10 Steiner Tree / 339 \\ 8.5.11 Feedback Edge/ vertex Set / 343 \\ 8.6 Computational Geometry / 345 \\ 8.6.1 Robust geometric Primitives / 347 \\ 8.6.2 Convex Hull / 351 \\ 8.6.3 Triangulation / 355 \\ 8.6.4 Voronoi Diagrams / 358 \\ 8.6.5 Nearest Neighbor Search / 361 \\ 8.6.6 Range Search / 364 \\ 8.6.7 Point Location / 367 \\ 8.6.8 Intersection Detection / 370 \\ 8.6.9 Bin Packing / 374 \\ 8.6.10 Medial-Axis Transformation / 377 \\ 8.6.11 Polygon Partitioning / 380 \\ 8.6.12 Simplifying Polygons / 383 \\ 8.6.13 Shape Similarity / 386 \\ 8.6.14 Motion Planning / 389 \\ 8.6.15 Maintaining Line Arrangements / 392 \\ 8.6.16 Minkowski Sum / 395 \\ 8.7 Set and String Problems / 397 \\ 8.7.1 Set Cover / 398 \\ 8.7.2 Set Packing / 401 \\ 8.7.3 String Matching / 403 \\ 8.7.4 Approximate String Matching / 406 \\ 8.7.5 Text Compression / 410 \\ 8.7.6 Cryptography / 414 \\ 8.7.7 Finite State Machine Minimization / 418 \\ 8.7.8 Longest Common Substring / 422 \\ 8.7.9 Shortest Common Superstring / 425 \\ 9 Algorithmic Resources / 427 \\ 9.1 Software Systems / 427 \\ 9.1.1 LEDA / 428 \\ 9.1.2 Netlib / 428 \\ 9.1.3 The Stanford GraphBase / 429 \\ 9.1.4 Combinatorica / 430 \\ 9.1.5 Algorithm Animations with XTango / 430 \\ 9.1.6 Programs From Books / 431 \\ 9.2 Data Sources / 433 \\ 9.3 Textbooks / 434 \\ 9.4 On-Line Resources / 435 \\ 9.4.1 Literature / 436 \\ 9.4.2 People / 436 \\ 9.4.3 Software / 437 \\ 9.5 Professional Consulting Services / 437 \\ Bibliography / 439 \\ Index / 463

entry:
@Book{Skiena:1998:ADM,
  author =       "Steven S. Skiena",
  title =        "The Algorithm Design Manual",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvi + 486",
  year =         "1998",
  ISBN =         "0-387-94860-0",
  ISBN-13 =      "978-0-387-94860-7",
  LCCN =         "QA76.9.A43S55 1997",
  bibdate =      "Tue Feb 10 10:51:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  price =        "US\$54.95",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / vii \\
                 I. Techniques \\
                 1 Introduction to Algorithms / 3 \\
                 1.1 Correctness and Efficiency / 4 \\
                 1.1.1 Correctness / 5 \\
                 1.1.2 Efficiency / 9 \\
                 1.2 Expressing Algorithms / 9 \\
                 1.3 Keeping Score / 10 \\
                 1.3.1 The RAM Model of Computation / 10 \\
                 1.3.2 Best, Worst, and Average-Case Complexity / 11 \\
                 1.4 The Big Oh Notation / 13 \\
                 1.5 Growth Rates / 15 \\
                 1.6 Logarithms / 16 \\
                 1.7 Modeling the Problem / 18 \\
                 1.8 About the War Stories / 20 \\
                 1.9 War Story: Psychic Modeling / 21 \\
                 1.10 Exercises / 25 \\
                 2 Data Structures and Sorting / 27 \\
                 2.1 Fundamental Data Types / 28 \\
                 2.1.1 Containers / 28 \\
                 2.1.2 Dictionaries / 29 \\
                 2.1.3 Binary Search Trees / 30 \\
                 2.1.4 Priority Queues / 31 \\
                 2.2 Specialized Data Structures / 33 \\
                 2.3 Sorting / 33 \\
                 2.4 Applications of Sorting / 34 \\
                 2.5 Approaches to Sorting / 36 \\
                 2.5.1 Data Structures / 36 \\
                 2.5.2 Incremental Insertion / 36 \\
                 2.5.3 Divide and Conquer / 37 \\
                 2.5.4 Randomization / 37 \\
                 2.5.5 Bucketing Techniques / 38 \\
                 2.6 War Story: Stripping Triangulations / 39 \\
                 2.7 War Story: Mystery of the Pyramids / 43 \\
                 2.8 War Story: String `em Up / 46 \\
                 2.9 Exercises / 50 \\
                 3 Breaking Problems Down / 53 \\
                 3.1 Dynamic Programming / 54 \\
                 3.1.1 Fibonacci numbers / 54 \\
                 3.1.2 The Partition Problem / 56 \\
                 3.1.3 Approximate String Matching / 60 \\
                 3.1.4 Longest Increasing Sequence / 62 \\
                 3.1.5 Minimum Weight Triangulation / 64 \\
                 3.2 Limitations of Dynamic Programming / 65 \\
                 3.3 War Story: Evolution of the Lobster / 66 \\
                 3.4 War Story: What's Past Is Prolog / 69 \\
                 3.5 War Story: Text Compression for Bar Codes / 72 \\
                 3.6 Divide and Conquer / 75 \\
                 3.6.1 Fast Exponentiation / 75 \\
                 3.6.2 Binary Search / 76 \\
                 3.6.3 Square and Other Roots / 76 \\
                 3.7 Exercises / 77 \\
                 4 Graph Algorithms / 81 \\
                 4.1 The Friendship Graph / 82 \\
                 4.2 Data Structures for Graphs / 84 \\
                 4.3 War Story: Getting the Graph / 86 \\
                 4.4 Traversing a Graph / 88 \\
                 4.4.1 Breadth-First Search / 89 \\
                 4.4.2 Depth-First Search / 91 \\
                 4.5 Applications of Graph Traversal / 92 \\
                 4.5.1 Connected Components / 92 \\
                 4.5.2 Tree and Cycle Detection / 93 \\
                 4.5.3 Two-Coloring Graphs / 93 \\
                 4.5.4 Topological Sorting / 94 \\
                 4.5.5 Articulation Vertices / 95 \\
                 4.6 Modeling graph Problems / 95 \\
                 4.7 Minimum Spanning Trees / 97 \\
                 4.7.1 Prim's Algorithm / 98 \\
                 4.7.2 Kruskal's Algorithm / 99 \\
                 4.8 Shortest Paths / 100 \\
                 4.8.1 Dijkstra's Algorithm / 100 \\
                 4.8.2 All-Pairs Shortest Path / 102 \\
                 4.9 War Story: Nothing but Nets / 102 \\
                 4.10 War Story: Dialing for Documents / 105 \\
                 4.11 Exercises / 110 \\
                 5 Combinatorial Search and Heuristic Methods / 115 \\
                 5.1 Backtracking / 116 \\
                 5.1.1 Constructing All Subsets / 117 \\
                 5.1.2 Constructing All Permutations / 118 \\
                 5.1.3 Constructing All Paths in a Graph / 118 \\
                 5.2 Search Pruning / 119 \\
                 5.3 Bandwidth Minimization / 120 \\
                 5.4 War Story: Covering Chessboards / 122 \\
                 5.5 Heuristic Methods / 125 \\
                 5.5.1 Simulated Annealing / 125 \\
                 5.5.2 Neural Networks / 129 \\
                 5.5.3 Genetic Algorithms / 130 \\
                 5.6 War Story: Annealing Arrays / 131 \\
                 5.7 Parallel Algorithms / 134 \\
                 5.8 War Story: Going Nowhere fast / 135 \\
                 5.9 exercises / 136 \\
                 6 Intractable Problems anal Approximations / 139 \\
                 6.1 Problems and Reductions / 140 \\
                 6.2 Simple Reductions / 141 \\
                 6.2.1 Hamiltonian Cycle / 142 \\
                 6.2.2 Independent Set and Vertex Cover / 142 \\
                 6.2.3 Clique and Independent Set / 144 \\
                 6.3 Satisfiability / 144 \\
                 6.3.1 The Theory of NP-Completeness / 145 \\
                 6.3.2 Satisfyability / 146 \\
                 6.4 Difficult Reductions / 147 \\
                 6.4.1 Integer Programming / 147 \\
                 6.4.2 Vortex Cover / 149 \\
                 6.5 Other NP-Complete Problems / 151 \\
                 6.6 The Art of Proving Hardness / 152 \\
                 6.7 War Story: Hard Against the Clock / 154 \\
                 6.8 Approximation Algorithms / 156 \\
                 6.8.1 Approximating Vertex Cover / 157 \\
                 6.8.2 The Euclidean Traveling Salesman / 158 \\
                 6.9 Exercises / 160 \\
                 7 How to Design Algorithms / 163 \\
                 II. RESOURCES \\
                 8 A Catalog of Algorithmic Problems / 171 \\
                 8.1 Data Structures / 174 \\
                 8.1.1 Dictionaries / 175 \\
                 8.1.2 Priority Queues / 180 \\
                 8.1.3 Suffix Trees and Arrays / 183 \\
                 8.1.4 Graph Data Structures / 187 \\
                 8.1.5 Set Data Structures / 191 \\
                 8.1.6 Kd-Trees / 194 \\
                 8.2 Numerical Problems / 197 \\
                 8.2.1 Solving Linear Equations / 199 \\
                 8.2.2 Bandwidth Reduction / 202 \\
                 8.2.3 Matrix Multiplication / 204 \\
                 8.2.4 Determinants and Permanents / 207 \\
                 8.2.5 Constrained and Unconstrained Optimization / 209
                 \\
                 8.2.6 Linear Programming / 213 \\
                 8.2.7 Random Number Generation / 217 \\
                 8.2.8 Factoring and Primality Testing / 221 \\
                 8.2.9 Arbitrary-Precision Arithmetic / 224 \\
                 8.2.10 Knapsack Problem / 228 \\
                 8.2.11 Discrete Fourier Transform / 232 \\
                 8.3 Combinatorial Problems / 235 \\
                 8.3.1 Sorting / 236 \\
                 8.3.2 Searching / 240 \\
                 8.3.3 Median and Selection / 244 \\
                 8.3.4 Generating Permutations / 246 \\
                 8.3.5 Generating Subsets / 250 \\
                 8.3.6 Generating Partitions / 253 \\
                 8.3.7 Generating Graphs / 257 \\
                 8.3.8 Calendrical Calculations / 261 \\
                 8.3.9 Job Scheduling / 263 \\
                 8.3.10 Satisfiability / 266 \\
                 8.4 Graph Problems: Polynomiai-Time / 269 \\
                 8.4.1 Connected Components / 270 \\
                 8.4.2 Topological Sorting / 273 \\
                 8.4.3 Minimum Spanning Tree / 275 \\
                 8.4.4 Shortest Path / 279 \\
                 8.4.5 Transitive Closure and Reduction / 284 \\
                 8.4.6 Matching / 287 \\
                 8.4.7 Eulerian Cycle / Chinese Postman / 291 \\
                 8.4.8 Edge and Vertex Connectivity / 294 \\
                 8.4.9 Network Flow / 297 \\
                 8.4.10 Drawing Grains Nicely / 301 \\
                 8.4.11 Drawing Trees / 305 \\
                 8.4.12 Planarity Detection and Embedding / 308 \\
                 8.5 Graph Problems: Hard Problems / 311 \\
                 8.5.1 Clique / 312 \\
                 8.5.2 Independent Set / 315 \\
                 8.5.3 Vertex Cover / 317 \\
                 8.5.4 Traveling salesman Problem / 319 \\
                 8.5.5 Hamiltonian Cycle / 323 \\
                 8.5.6 Graph Partition / 326 \\
                 8.5.7 Vertex Coloring / 329 \\
                 8.5.8 Edge Coloring / 333 \\
                 8.5.9 Graph Isomorphism / 335 \\
                 8.5.10 Steiner Tree / 339 \\
                 8.5.11 Feedback Edge/ vertex Set / 343 \\
                 8.6 Computational Geometry / 345 \\
                 8.6.1 Robust geometric Primitives / 347 \\
                 8.6.2 Convex Hull / 351 \\
                 8.6.3 Triangulation / 355 \\
                 8.6.4 Voronoi Diagrams / 358 \\
                 8.6.5 Nearest Neighbor Search / 361 \\
                 8.6.6 Range Search / 364 \\
                 8.6.7 Point Location / 367 \\
                 8.6.8 Intersection Detection / 370 \\
                 8.6.9 Bin Packing / 374 \\
                 8.6.10 Medial-Axis Transformation / 377 \\
                 8.6.11 Polygon Partitioning / 380 \\
                 8.6.12 Simplifying Polygons / 383 \\
                 8.6.13 Shape Similarity / 386 \\
                 8.6.14 Motion Planning / 389 \\
                 8.6.15 Maintaining Line Arrangements / 392 \\
                 8.6.16 Minkowski Sum / 395 \\
                 8.7 Set and String Problems / 397 \\
                 8.7.1 Set Cover / 398 \\
                 8.7.2 Set Packing / 401 \\
                 8.7.3 String Matching / 403 \\
                 8.7.4 Approximate String Matching / 406 \\
                 8.7.5 Text Compression / 410 \\
                 8.7.6 Cryptography / 414 \\
                 8.7.7 Finite State Machine Minimization / 418 \\
                 8.7.8 Longest Common Substring / 422 \\
                 8.7.9 Shortest Common Superstring / 425 \\
                 9 Algorithmic Resources / 427 \\
                 9.1 Software Systems / 427 \\
                 9.1.1 LEDA / 428 \\
                 9.1.2 Netlib / 428 \\
                 9.1.3 The Stanford GraphBase / 429 \\
                 9.1.4 Combinatorica / 430 \\
                 9.1.5 Algorithm Animations with XTango / 430 \\
                 9.1.6 Programs From Books / 431 \\
                 9.2 Data Sources / 433 \\
                 9.3 Textbooks / 434 \\
                 9.4 On-Line Resources / 435 \\
                 9.4.1 Literature / 436 \\
                 9.4.2 People / 436 \\
                 9.4.3 Software / 437 \\
                 9.5 Professional Consulting Services / 437 \\
                 Bibliography / 439 \\
                 Index / 463",
}


bibtype: book
filename: master.bib
label: Skiena:2008:ADM
author: Steven S. Skiena
title: The Algorithm Design Manual
publisher: pub-SV
address: pub-SV:adr
edition: Second
pages: xvi + 730
year: 2008
ISBN: 1-84800-069-3 (hardcover), 1-84800-070-7 (e-book) OR 1848000693 (hardcover), 1848000707 (ebook)
LCCN: QA76.9.A43 S55 2008
bibdate: Mon Aug 10 17:49:11 MDT 2009
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2009.08.10 17:49:11 MDT
subject: Computer algorithms
acknowledgement: ack-nhfb
rawauthor: Steven S. Skiena
rawtitle: The Algorithm Design Manual
ISBN13:
978-1-84800-069-8 (hardcover), 978-1-84800-070-4 (e-book) OR 9781848000698 (hardcover), 9781848000704 (ebook)

TOC:
Part I: Practical Algorithm Design Introduction to Algorithm design Algorithm Analysis Data Structures Sorting and Searching Graph Traversal Weighted Graph Algorithms Combinatorial Search and Heuristic Methods Dynamic Programming Intractable Problems and Approximation algorithms How to Design Algorithms Part II: The Hitchhiker's Guide to Algorithms: A Catalog of Algorithmic Problems Data Structures Numerical Problems Combinatorical Problem Graph Problems: Polynomial-Time Graph Problems: Hard Problems Computational Geometry Set and String Problems Algorithmic Resources Bibliography Index

rawTOC:
Part I: Practical Algorithm Design \\ Introduction to Algorithm design \\ Algorithm Analysis \\ Data Structures \\ Sorting and Searching \\ Graph Traversal \\ Weighted Graph Algorithms \\ Combinatorial Search and Heuristic Methods \\ Dynamic Programming \\ Intractable Problems and Approximation algorithms \\ How to Design Algorithms \\ Part II: The Hitchhiker's Guide to Algorithms: A Catalog of Algorithmic Problems \\ Data Structures \\ Numerical Problems \\ Combinatorical Problem \\ Graph Problems: Polynomial-Time \\ Graph Problems: Hard Problems \\ Computational Geometry \\ Set and String Problems \\ Algorithmic Resources \\ Bibliography \\ Index

entry:
@Book{Skiena:2008:ADM,
  author =       "Steven S. Skiena",
  title =        "The Algorithm Design Manual",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xvi + 730",
  year =         "2008",
  ISBN =         "1-84800-069-3 (hardcover), 1-84800-070-7 (e-book)",
  ISBN-13 =      "978-1-84800-069-8 (hardcover), 978-1-84800-070-4
                 (e-book)",
  LCCN =         "QA76.9.A43 S55 2008",
  bibdate =      "Mon Aug 10 17:49:11 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Computer algorithms",
  tableofcontents = "Part I: Practical Algorithm Design \\
                 Introduction to Algorithm design \\
                 Algorithm Analysis \\
                 Data Structures \\
                 Sorting and Searching \\
                 Graph Traversal \\
                 Weighted Graph Algorithms \\
                 Combinatorial Search and Heuristic Methods \\
                 Dynamic Programming \\
                 Intractable Problems and Approximation algorithms \\
                 How to Design Algorithms \\
                 Part II: The Hitchhiker's Guide to Algorithms: A
                 Catalog of Algorithmic Problems \\
                 Data Structures \\
                 Numerical Problems \\
                 Combinatorical Problem \\
                 Graph Problems: Polynomial-Time \\
                 Graph Problems: Hard Problems \\
                 Computational Geometry \\
                 Set and String Problems \\
                 Algorithmic Resources \\
                 Bibliography \\
                 Index",
}


bibtype: book
filename: master.bib
label: Skillin:1974:WT
author: Marjorie E. Skillin and Robert Malcolm Gay
title: Words into Type
publisher: pub-PH
address: pub-PH:adr
edition: Third
pages: xx + 583
year: 1974
ISBN: 0-13-964262-5 OR 0139642625
ISBN13: 978-0-13-964262-3 OR 9780139642623
LCCN: PN160.S52 1974
bibdate: Sun Mar 6 17:34:11 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.03.06 17:34:11 ???
keywords: Authorship --- Style manuals, Printing --- Style manuals
acknowledgement: ack-jpl
rawauthor: Marjorie E. Skillin and Robert Malcolm Gay
rawtitle: Words into Type
TOC:
Preface / xix Manuscript / 1 Technicalities of Form / 3 Physical Form / 3 Final Reading of the Manuscript / 8 Author's Alterations / 9 Editorial Marks / 10 Style / 12 Topical Heads / 14 Excerpts / 17 Footnotes / 22 Tables / 32 Bibliographies / 37 Illustrations / 43 Special Responsibilities of the Book Writer / 45 Front Matter / 46 Back Matter / 48 Legal Areas of Particular Concern to the Author / 48 The Copyright Law / 48 Libel / 52 The Right of Privacy / 54 Copy and Proof / 55 Workers on Copy and Proof / 57 The Editor / 57 Editor or Copy Editor / 57 The Production Department / 61 Layout / 61 Front Matter / 62 Back Matter / 68 Work on Proof / 69 Galley Proofs / 70 Page Proofs / 74 Indexes / 76 Indexes by Names / 77 Compiling a Dictionary-Style Index / 79 Alphabetical Order / 90 Typography of Indexes / 93 Copy-Editing Style / 97 Style / 99 Abbreviations / 100 Symbols and Signs / 120 Numbers / 125 Italics / 136 Capitalization / 142 Capitals to Mark Beginnings / 142 Titles, Headings, Legends / 146 Proper Nouns and Adjectives / 148 Punctuation / 172 Semicolon / 182 Comma / 184 Em Dash / 206 En Dash / 210 Two-Em Dash / 211 Parentheses / 211 Brackets / 212 Quotation Marks / 213 Apostrophe / 222 Hyphen / 223 Points of Ellipsis / 225 Compound Words / 226 Division of Words / 237 Typographical Style / 241 Elements of Typographical Style / 243 Leading / 243 Spacing / 244 Indention / 246 Problems of Typographical Style / 247 Headings / 247 Initials / 250 Synopses / 252 Epigraphical Quotations / 253 Excerpts / 253 Footnotes / 254 Tables / 255 Number columns / 257 Tables without figures / 258 Ditto marks / 258 Captions / 258 Column heads or boxheads / 259 Captions and Legends / 263 Bibliographies / 266 Details of Page Makeup / 269 Typography of Various Forms / 274 Fiction / 274 Poetry / 275 Plays / 276 Writings on Religion / 279 Letters / 280 Legal Writing / 281 Mathematical and Scientific Writing / 283 Composition of Foreign Languages / 288 Danish / 288 Dutch / 289 French / 289 German / 299 Classic Greek / 307 Hebrew / 310 Italian / 316 Latin / 318 Norwegian / 320 Polish / 320 Portuguese / 321 Russian / 321 Spanish / 327 Swedish / 334 Phonetics / 334 Grammar / 339 Verbs / 341 Voice / 341 Mood / 342 Tense / 344 Auxiliaries / 347 Agreement / 349 Nouns / 357 Number / 357 Possessive Case / 358 Pronouns / 361 Case / 361 Antecedents / 362 Adjectives and Adverbs / 368 Articles / 372 Indefinite Articles / 372 Definite Article / 373 Conjunctions / 374 Coordinating Conjunctions / 374 Subordinating Conjunctions / 376 Correlative Conjunctions / 380 Prepositions / 381 Sentence Structure / 384 Position of Modifiers / 385 Omissions / 389 Glossary of Grammatical Terms / 391 Use of Words / 405 Wordiness / 407 Trite Expressions / 411 Appropriateness / 415 The Right Preposition / 432 Words Likely to be Misused or Confused / 446 Spelling / 469 The ``EI'' or ``IE'' Difficulty / 469 Forming Derivatives by Adding Suffixes / 470 Troublesome Suffixes / 472 Formation of Plurals / 473 Formation of the Possessive Case / 478 Ordinary Words that Cause Trouble / 481 Foreign Words and Phrases / 481 Bibliography for Parts V and VI / 487 Book Publishers / 488 Typography and Illustration / 489 The Size of the Book / 491 Casting Off / 491 Trim Size / 493 Type Page / 494 The Mechanics of Composition / 496 Hot Metal Composition / 496 Type / 497 Type Measurement / 501 Classification of Typefaces / 504 Choice of Size and Face / 506 Computing the Length in Type / 509 Typesetting / 511 Cold Type Composition / 511 Photocomposition or Phototypesetting / 514 Sample Pages / 516 Proofs / 517 The Mechanics of Printing / 518 Letterpress / 518 Offset Lithography or Photo-Offset / 519 Illustrations / 520 Paper / 524 Book Sizes / 530 Binding / 530 Bibliography / 532 Glossary of Printing and Allied Terms / 535 Index / 549

shortTOC:
1: Manuscript 2: Copy and proof 3: Copy-editing style 4: Typographical style 5: Grammar 6: Use of words 7: Typography and illustration

rawshortTOC:
1: Manuscript \\ 2: Copy and proof \\ 3: Copy-editing style \\ 4: Typographical style \\ 5: Grammar \\ 6: Use of words \\ 7: Typography and illustration

rawTOC:
Preface / xix \\ Manuscript / 1 \\ Technicalities of Form / 3 \\ Physical Form / 3 \\ Final Reading of the Manuscript / 8 \\ Author's Alterations / 9 \\ Editorial Marks / 10 \\ Style / 12 \\ Topical Heads / 14 \\ Excerpts / 17 \\ Footnotes / 22 \\ Tables / 32 \\ Bibliographies / 37 \\ Illustrations / 43 \\ Special Responsibilities of the Book Writer / 45 \\ Front Matter / 46 \\ Back Matter / 48 \\ Legal Areas of Particular Concern to the Author / 48 \\ The Copyright Law / 48 \\ Libel / 52 \\ The Right of Privacy / 54 \\ Copy and Proof / 55 \\ Workers on Copy and Proof / 57 \\ The Editor / 57 \\ Editor or Copy Editor / 57 \\ The Production Department / 61 \\ Layout / 61 \\ Front Matter / 62 \\ Back Matter / 68 \\ Work on Proof / 69 \\ Galley Proofs / 70 \\ Page Proofs / 74 \\ Indexes / 76 \\ Indexes by Names / 77 \\ Compiling a Dictionary-Style Index / 79 \\ Alphabetical Order / 90 \\ Typography of Indexes / 93 \\ Copy-Editing Style / 97 \\ Style / 99 \\ Abbreviations / 100 \\ Symbols and Signs / 120 \\ Numbers / 125 \\ Italics / 136 \\ Capitalization / 142 \\ Capitals to Mark Beginnings / 142 \\ Titles, Headings, Legends / 146 \\ Proper Nouns and Adjectives / 148 \\ Punctuation / 172 \\ Semicolon / 182 \\ Comma / 184 \\ Em Dash / 206 \\ En Dash / 210 \\ Two-Em Dash / 211 \\ Parentheses / 211 \\ Brackets / 212 \\ Quotation Marks / 213 \\ Apostrophe / 222 \\ Hyphen / 223 \\ Points of Ellipsis / 225 \\ Compound Words / 226 \\ Division of Words / 237 \\ Typographical Style / 241 \\ Elements of Typographical Style / 243 \\ Leading / 243 \\ Spacing / 244 \\ Indention / 246 \\ Problems of Typographical Style / 247 \\ Headings / 247 \\ Initials / 250 \\ Synopses / 252 \\ Epigraphical Quotations / 253 \\ Excerpts / 253 \\ Footnotes / 254 \\ Tables / 255 \\ Number columns / 257 \\ Tables without figures / 258 \\ Ditto marks / 258 \\ Captions / 258 \\ Column heads or boxheads / 259 \\ Captions and Legends / 263 \\ Bibliographies / 266 \\ Details of Page Makeup / 269 \\ Typography of Various Forms / 274 \\ Fiction / 274 \\ Poetry / 275 \\ Plays / 276 \\ Writings on Religion / 279 \\ Letters / 280 \\ Legal Writing / 281 \\ Mathematical and Scientific Writing / 283 \\ Composition of Foreign Languages / 288 \\ Danish / 288 \\ Dutch / 289 \\ French / 289 \\ German / 299 \\ Classic Greek / 307 \\ Hebrew / 310 \\ Italian / 316 \\ Latin / 318 \\ Norwegian / 320 \\ Polish / 320 \\ Portuguese / 321 \\ Russian / 321 \\ Spanish / 327 \\ Swedish / 334 \\ Phonetics / 334 \\ Grammar / 339 \\ Verbs / 341 \\ Voice / 341 \\ Mood / 342 \\ Tense / 344 \\ Auxiliaries / 347 \\ Agreement / 349 \\ Nouns / 357 \\ Number / 357 \\ Possessive Case / 358 \\ Pronouns / 361 \\ Case / 361 \\ Antecedents / 362 \\ Adjectives and Adverbs / 368 \\ Articles / 372 \\ Indefinite Articles / 372 \\ Definite Article / 373 \\ Conjunctions / 374 \\ Coordinating Conjunctions / 374 \\ Subordinating Conjunctions / 376 \\ Correlative Conjunctions / 380 \\ Prepositions / 381 \\ Sentence Structure / 384 \\ Position of Modifiers / 385 \\ Omissions / 389 \\ Glossary of Grammatical Terms / 391 \\ Use of Words / 405 \\ Wordiness / 407 \\ Trite Expressions / 411 \\ Appropriateness / 415 \\ The Right Preposition / 432 \\ Words Likely to be Misused or Confused / 446 \\ Spelling / 469 \\ The ``EI'' or ``IE'' Difficulty / 469 \\ Forming Derivatives by Adding Suffixes / 470 \\ Troublesome Suffixes / 472 \\ Formation of Plurals / 473 \\ Formation of the Possessive Case / 478 \\ Ordinary Words that Cause Trouble / 481 \\ Foreign Words and Phrases / 481 \\ Bibliography for Parts V and VI / 487 \\ Book Publishers / 488 \\ Typography and Illustration / 489 \\ The Size of the Book / 491 \\ Casting Off / 491 \\ Trim Size / 493 \\ Type Page / 494 \\ The Mechanics of Composition / 496 \\ Hot Metal Composition / 496 \\ Type / 497 \\ Type Measurement / 501 \\ Classification of Typefaces / 504 \\ Choice of Size and Face / 506 \\ Computing the Length in Type / 509 \\ Typesetting / 511 \\ Cold Type Composition / 511 \\ Photocomposition or Phototypesetting / 514 \\ Sample Pages / 516 \\ Proofs / 517 \\ The Mechanics of Printing / 518 \\ Letterpress / 518 \\ Offset Lithography or Photo-Offset / 519 \\ Illustrations / 520 \\ Paper / 524 \\ Book Sizes / 530 \\ Binding / 530 \\ Bibliography / 532 \\ Glossary of Printing and Allied Terms / 535 \\ Index / 549

entry:
@Book{Skillin:1974:WT,
  author =       "Marjorie E. Skillin and Robert Malcolm Gay",
  title =        "Words into Type",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Third",
  pages =        "xx + 583",
  year =         "1974",
  ISBN =         "0-13-964262-5",
  ISBN-13 =      "978-0-13-964262-3",
  LCCN =         "PN160.S52 1974",
  bibdate =      "Sun Mar 6 17:34:11 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$39.95",
  acknowledgement = ack-jpl,
  idnumber =     "521",
  keywords =     "Authorship --- Style manuals, Printing --- Style
                 manuals",
  shorttableofcontents = "1: Manuscript \\
                 2: Copy and proof \\
                 3: Copy-editing style \\
                 4: Typographical style \\
                 5: Grammar \\
                 6: Use of words \\
                 7: Typography and illustration",
  tableofcontents = "Preface / xix \\
                 Manuscript / 1 \\
                 Technicalities of Form / 3 \\
                 Physical Form / 3 \\
                 Final Reading of the Manuscript / 8 \\
                 Author's Alterations / 9 \\
                 Editorial Marks / 10 \\
                 Style / 12 \\
                 Topical Heads / 14 \\
                 Excerpts / 17 \\
                 Footnotes / 22 \\
                 Tables / 32 \\
                 Bibliographies / 37 \\
                 Illustrations / 43 \\
                 Special Responsibilities of the Book Writer / 45 \\
                 Front Matter / 46 \\
                 Back Matter / 48 \\
                 Legal Areas of Particular Concern to the Author / 48
                 \\
                 The Copyright Law / 48 \\
                 Libel / 52 \\
                 The Right of Privacy / 54 \\
                 Copy and Proof / 55 \\
                 Workers on Copy and Proof / 57 \\
                 The Editor / 57 \\
                 Editor or Copy Editor / 57 \\
                 The Production Department / 61 \\
                 Layout / 61 \\
                 Front Matter / 62 \\
                 Back Matter / 68 \\
                 Work on Proof / 69 \\
                 Galley Proofs / 70 \\
                 Page Proofs / 74 \\
                 Indexes / 76 \\
                 Indexes by Names / 77 \\
                 Compiling a Dictionary-Style Index / 79 \\
                 Alphabetical Order / 90 \\
                 Typography of Indexes / 93 \\
                 Copy-Editing Style / 97 \\
                 Style / 99 \\
                 Abbreviations / 100 \\
                 Symbols and Signs / 120 \\
                 Numbers / 125 \\
                 Italics / 136 \\
                 Capitalization / 142 \\
                 Capitals to Mark Beginnings / 142 \\
                 Titles, Headings, Legends / 146 \\
                 Proper Nouns and Adjectives / 148 \\
                 Punctuation / 172 \\
                 Semicolon / 182 \\
                 Comma / 184 \\
                 Em Dash / 206 \\
                 En Dash / 210 \\
                 Two-Em Dash / 211 \\
                 Parentheses / 211 \\
                 Brackets / 212 \\
                 Quotation Marks / 213 \\
                 Apostrophe / 222 \\
                 Hyphen / 223 \\
                 Points of Ellipsis / 225 \\
                 Compound Words / 226 \\
                 Division of Words / 237 \\
                 Typographical Style / 241 \\
                 Elements of Typographical Style / 243 \\
                 Leading / 243 \\
                 Spacing / 244 \\
                 Indention / 246 \\
                 Problems of Typographical Style / 247 \\
                 Headings / 247 \\
                 Initials / 250 \\
                 Synopses / 252 \\
                 Epigraphical Quotations / 253 \\
                 Excerpts / 253 \\
                 Footnotes / 254 \\
                 Tables / 255 \\
                 Number columns / 257 \\
                 Tables without figures / 258 \\
                 Ditto marks / 258 \\
                 Captions / 258 \\
                 Column heads or boxheads / 259 \\
                 Captions and Legends / 263 \\
                 Bibliographies / 266 \\
                 Details of Page Makeup / 269 \\
                 Typography of Various Forms / 274 \\
                 Fiction / 274 \\
                 Poetry / 275 \\
                 Plays / 276 \\
                 Writings on Religion / 279 \\
                 Letters / 280 \\
                 Legal Writing / 281 \\
                 Mathematical and Scientific Writing / 283 \\
                 Composition of Foreign Languages / 288 \\
                 Danish / 288 \\
                 Dutch / 289 \\
                 French / 289 \\
                 German / 299 \\
                 Classic Greek / 307 \\
                 Hebrew / 310 \\
                 Italian / 316 \\
                 Latin / 318 \\
                 Norwegian / 320 \\
                 Polish / 320 \\
                 Portuguese / 321 \\
                 Russian / 321 \\
                 Spanish / 327 \\
                 Swedish / 334 \\
                 Phonetics / 334 \\
                 Grammar / 339 \\
                 Verbs / 341 \\
                 Voice / 341 \\
                 Mood / 342 \\
                 Tense / 344 \\
                 Auxiliaries / 347 \\
                 Agreement / 349 \\
                 Nouns / 357 \\
                 Number / 357 \\
                 Possessive Case / 358 \\
                 Pronouns / 361 \\
                 Case / 361 \\
                 Antecedents / 362 \\
                 Adjectives and Adverbs / 368 \\
                 Articles / 372 \\
                 Indefinite Articles / 372 \\
                 Definite Article / 373 \\
                 Conjunctions / 374 \\
                 Coordinating Conjunctions / 374 \\
                 Subordinating Conjunctions / 376 \\
                 Correlative Conjunctions / 380 \\
                 Prepositions / 381 \\
                 Sentence Structure / 384 \\
                 Position of Modifiers / 385 \\
                 Omissions / 389 \\
                 Glossary of Grammatical Terms / 391 \\
                 Use of Words / 405 \\
                 Wordiness / 407 \\
                 Trite Expressions / 411 \\
                 Appropriateness / 415 \\
                 The Right Preposition / 432 \\
                 Words Likely to be Misused or Confused / 446 \\
                 Spelling / 469 \\
                 The ``EI'' or ``IE'' Difficulty / 469 \\
                 Forming Derivatives by Adding Suffixes / 470 \\
                 Troublesome Suffixes / 472 \\
                 Formation of Plurals / 473 \\
                 Formation of the Possessive Case / 478 \\
                 Ordinary Words that Cause Trouble / 481 \\
                 Foreign Words and Phrases / 481 \\
                 Bibliography for Parts V and VI / 487 \\
                 Book Publishers / 488 \\
                 Typography and Illustration / 489 \\
                 The Size of the Book / 491 \\
                 Casting Off / 491 \\
                 Trim Size / 493 \\
                 Type Page / 494 \\
                 The Mechanics of Composition / 496 \\
                 Hot Metal Composition / 496 \\
                 Type / 497 \\
                 Type Measurement / 501 \\
                 Classification of Typefaces / 504 \\
                 Choice of Size and Face / 506 \\
                 Computing the Length in Type / 509 \\
                 Typesetting / 511 \\
                 Cold Type Composition / 511 \\
                 Photocomposition or Phototypesetting / 514 \\
                 Sample Pages / 516 \\
                 Proofs / 517 \\
                 The Mechanics of Printing / 518 \\
                 Letterpress / 518 \\
                 Offset Lithography or Photo-Offset / 519 \\
                 Illustrations / 520 \\
                 Paper / 524 \\
                 Book Sizes / 530 \\
                 Binding / 530 \\
                 Bibliography / 532 \\
                 Glossary of Printing and Allied Terms / 535 \\
                 Index / 549",
}


bibtype: book
filename: master.bib
label: Skinner:1985:IAL
author: Thomas P. Skinner
title: An Introduction to 8086 / 8088 Assembly Language Programming
publisher: pub-WILEY
address: pub-WILEY:adr
pages: xiii + 222
year: 1985
ISBN: 0-471-80825-3 OR 0471808253
ISBN13: 978-0-471-80825-1 OR 9780471808251
LCCN: QA76.73.A8 S57 1985
bibdate: Wed Dec 15 10:41:41 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:41:41 ???
acknowledgement: ack-nhfb
rawauthor: Thomas P. Skinner
rawtitle: An Introduction to 8086\slash 8088 Assembly Language Programming
entry:
@Book{Skinner:1985:IAL,
  author =       "Thomas P. Skinner",
  title =        "An Introduction to 8086\slash 8088 Assembly Language
                 Programming",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xiii + 222",
  year =         "1985",
  ISBN =         "0-471-80825-3",
  ISBN-13 =      "978-0-471-80825-1",
  LCCN =         "QA76.73.A8 S57 1985",
  bibdate =      "Wed Dec 15 10:41:41 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$17.95",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Skoog:1980:PIA
author: Douglas A. Skoog and Donald M. West
title: Principles of Instrumental Analysis
publisher: Saunders College
address: Philadelphia, PA, USA
edition: Second
pages: xi + 769
year: 1980
ISBN: 0-03-021161-1 OR 0030211611
ISBN13: 978-0-03-021161-4 OR 9780030211614
LCCN: QD79.I5S58 1980
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: Douglas A. Skoog and Donald M. West
rawtitle: Principles of Instrumental Analysis
entry:
@Book{Skoog:1980:PIA,
  author =       "Douglas A. Skoog and Donald M. West",
  title =        "Principles of Instrumental Analysis",
  publisher =    "Saunders College",
  address =      "Philadelphia, PA, USA",
  edition =      "Second",
  pages =        "xi + 769",
  year =         "1980",
  ISBN =         "0-03-021161-1",
  ISBN-13 =      "978-0-03-021161-4",
  LCCN =         "QD79.I5S58 1980",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Slater:1942:MT
author: John C. (John Clarke) Slater
title: Microwave Transmission
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
pages: x + 309
year: 1942
LCCN: QC661 .S635
bibdate: Sat Jul 25 13:55:27 1998
bibtimestamp: 1998.07.25 13:55:27 ???
series: International series in physics
subject: Electric waves
acknowledgement: ack-nhfb
authordates: John Clarke Slater (1900--1976)
rawauthor: John C. (John Clarke) Slater
rawtitle: Microwave Transmission
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/s/slater-john-clarke.bib; https://www.math.utah.edu/pub/tex/bib/einstein.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager

TOC:
Preface / v Introduction / 1 I: Transmission Lines 1. The Infinite Line / 8 2. The Infinite Line with Distributed Parameters / 17 3. The Terminated Line and Reflection / 21 4. Impedance of the Terminated Line / 25 5. Composite Lines and Impedance Matching / 42 6. The Line with Continuously Varying Parameters / 69 II: Maxwell's Equations, Plane Waves, and Reflection 7. Maxwell's Equations / 79 8. Poynting's Vector, the Wave Equation, the Potentials / 90 9. Undamped Plane Waves / 93 10. Reflection of Plane Waves at Oblique Incidence / 100 11. Poynting's Vector and Plane Waves / 108 12. Undamped Plane Waves, Normal Incidence / 111 13. Damped Plane Waves, Oblique Incidence / 117 III: Rectangular Wave Guides 14. Wave Propagation between Parallel Perfectly Conducting Planes / 124 15. Undamped Waves in Rectangular Pipes / 130 16. Attenuation in Rectangular Wave Guides / 138 IV: The General Transmission Line Problem 17. General Formulation of the Transmission Line Problem / 151 18. The Principal Wave in the Parallel-wire Transmission Line / 156 19. The Principal Wave in the Coaxial Line / 158 20. General Wave Propagation in the Circular Wave Guide and the Coaxial Line / 162 21. Composite Transmission Lines and Impedance Matching / 168 22. Reflections at Changes in Properties of Dielectric / 173 23. Reflections at Changes of Cross Section with the Principal Mode / 178 24. Reflection at Changes of Cross Section in Hollow Pipes, and Iris Diaphragms / 183 25. Gradual Change of Cross Section with the Principal Mode / 187 26. Survey of Other Problems of Composite Lines / 193 V: Radiation from Antennas 27. Maxwell's Equations in Spherical Coordinates / 196 28. The Principal or TEM Wave / 202 29. The Field of an Electric Dipole / 205 30. The Field of a Finite Antenna / 209 31. The Field of Metallic Antennas / 219 32. The Magnetic Dipole Antenna / 232 VI: Directive Devices for Antennas 33. Absorption and Scattering by a Dipole / 235 34. Directional Properties of a Finite Antenna in Emission and Absorption / 245 35. Directional Patterns of Current Distributions / 256 36. Reflection and Scattering from Mirrors and Dummy Antennas / 269 VII: Coupling of Coaxial Lines and Wave Guides 37. Radiation Field of a Dipole in a Rectangular Wave Guide / 280 38. Radiation Resistance, Absorption, and Scattering for a Dipole in a Rectangular Wave Guide / 288 39. Properties of a Dipole in a Wave Guide Closed at One End / 296 40. A Dipole in a Wave Guide Closed at Both Ends / 300 Index / 305

rawTOC:
Preface / v \\ Introduction / 1 \\ I: Transmission Lines 1. The Infinite Line / 8 \\ 2. The Infinite Line with Distributed Parameters / 17 \\ 3. The Terminated Line and Reflection / 21 \\ 4. Impedance of the Terminated Line / 25 \\ 5. Composite Lines and Impedance Matching / 42 \\ 6. The Line with Continuously Varying Parameters / 69 \\ II: Maxwell's Equations, Plane Waves, and Reflection \\ 7. Maxwell's Equations / 79 \\ 8. Poynting's Vector, the Wave Equation, the Potentials / 90 \\ 9. Undamped Plane Waves / 93 \\ 10. Reflection of Plane Waves at Oblique Incidence / 100 \\ 11. Poynting's Vector and Plane Waves / 108 \\ 12. Undamped Plane Waves, Normal Incidence / 111 \\ 13. Damped Plane Waves, Oblique Incidence / 117 \\ III: Rectangular Wave Guides \\ 14. Wave Propagation between Parallel Perfectly Conducting Planes / 124 \\ 15. Undamped Waves in Rectangular Pipes / 130 \\ 16. Attenuation in Rectangular Wave Guides / 138 \\ IV: The General Transmission Line Problem \\ 17. General Formulation of the Transmission Line Problem / 151 \\ 18. The Principal Wave in the Parallel-wire Transmission Line / 156 \\ 19. The Principal Wave in the Coaxial Line / 158 \\ 20. General Wave Propagation in the Circular Wave Guide and the Coaxial Line / 162 \\ 21. Composite Transmission Lines and Impedance Matching / 168 \\ 22. Reflections at Changes in Properties of Dielectric / 173 \\ 23. Reflections at Changes of Cross Section with the Principal Mode / 178 \\ 24. Reflection at Changes of Cross Section in Hollow Pipes, and Iris Diaphragms / 183 \\ 25. Gradual Change of Cross Section with the Principal Mode / 187 \\ 26. Survey of Other Problems of Composite Lines / 193 \\ V: Radiation from Antennas \\ 27. Maxwell's Equations in Spherical Coordinates / 196 \\ 28. The Principal or TEM Wave / 202 \\ 29. The Field of an Electric Dipole / 205 \\ 30. The Field of a Finite Antenna / 209 \\ 31. The Field of Metallic Antennas / 219 \\ 32. The Magnetic Dipole Antenna / 232 \\ VI: Directive Devices for Antennas \\ 33. Absorption and Scattering by a Dipole / 235 \\ 34. Directional Properties of a Finite Antenna in Emission and Absorption / 245 \\ 35. Directional Patterns of Current Distributions / 256 \\ 36. Reflection and Scattering from Mirrors and Dummy Antennas / 269 \\ VII: Coupling of Coaxial Lines and Wave Guides \\ 37. Radiation Field of a Dipole in a Rectangular Wave Guide / 280 \\ 38. Radiation Resistance, Absorption, and Scattering for a Dipole in a Rectangular Wave Guide / 288 \\ 39. Properties of a Dipole in a Wave Guide Closed at One End / 296 \\ 40. A Dipole in a Wave Guide Closed at Both Ends / 300 \\ Index / 305

entry:
@Book{Slater:1942:MT,
  author =       "John C. (John Clarke) Slater",
  title =        "Microwave Transmission",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "x + 309",
  year =         "1942",
  LCCN =         "QC661 .S635",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/s/slater-john-clarke.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "International series in physics",
  acknowledgement = ack-nhfb,
  author-dates = "John Clarke Slater (1900--1976)",
  subject =      "Electric waves",
  tableofcontents = "Preface / v \\
                 Introduction / 1 \\
                 I: Transmission Lines 1. The Infinite Line / 8 \\
                 2. The Infinite Line with Distributed Parameters / 17
                 \\
                 3. The Terminated Line and Reflection / 21 \\
                 4. Impedance of the Terminated Line / 25 \\
                 5. Composite Lines and Impedance Matching / 42 \\
                 6. The Line with Continuously Varying Parameters / 69
                 \\
                 II: Maxwell's Equations, Plane Waves, and Reflection
                 \\
                 7. Maxwell's Equations / 79 \\
                 8. Poynting's Vector, the Wave Equation, the Potentials
                 / 90 \\
                 9. Undamped Plane Waves / 93 \\
                 10. Reflection of Plane Waves at Oblique Incidence /
                 100 \\
                 11. Poynting's Vector and Plane Waves / 108 \\
                 12. Undamped Plane Waves, Normal Incidence / 111 \\
                 13. Damped Plane Waves, Oblique Incidence / 117 \\
                 III: Rectangular Wave Guides \\
                 14. Wave Propagation between Parallel Perfectly
                 Conducting Planes / 124 \\
                 15. Undamped Waves in Rectangular Pipes / 130 \\
                 16. Attenuation in Rectangular Wave Guides / 138 \\
                 IV: The General Transmission Line Problem \\
                 17. General Formulation of the Transmission Line
                 Problem / 151 \\
                 18. The Principal Wave in the Parallel-wire
                 Transmission Line / 156 \\
                 19. The Principal Wave in the Coaxial Line / 158 \\
                 20. General Wave Propagation in the Circular Wave Guide
                 and the Coaxial Line / 162 \\
                 21. Composite Transmission Lines and Impedance Matching
                 / 168 \\
                 22. Reflections at Changes in Properties of Dielectric
                 / 173 \\
                 23. Reflections at Changes of Cross Section with the
                 Principal Mode / 178 \\
                 24. Reflection at Changes of Cross Section in Hollow
                 Pipes, and Iris Diaphragms / 183 \\
                 25. Gradual Change of Cross Section with the Principal
                 Mode / 187 \\
                 26. Survey of Other Problems of Composite Lines / 193
                 \\
                 V: Radiation from Antennas \\
                 27. Maxwell's Equations in Spherical Coordinates / 196
                 \\
                 28. The Principal or TEM Wave / 202 \\
                 29. The Field of an Electric Dipole / 205 \\
                 30. The Field of a Finite Antenna / 209 \\
                 31. The Field of Metallic Antennas / 219 \\
                 32. The Magnetic Dipole Antenna / 232 \\
                 VI: Directive Devices for Antennas \\
                 33. Absorption and Scattering by a Dipole / 235 \\
                 34. Directional Properties of a Finite Antenna in
                 Emission and Absorption / 245 \\
                 35. Directional Patterns of Current Distributions / 256
                 \\
                 36. Reflection and Scattering from Mirrors and Dummy
                 Antennas / 269 \\
                 VII: Coupling of Coaxial Lines and Wave Guides \\
                 37. Radiation Field of a Dipole in a Rectangular Wave
                 Guide / 280 \\
                 38. Radiation Resistance, Absorption, and Scattering
                 for a Dipole in a Rectangular Wave Guide / 288 \\
                 39. Properties of a Dipole in a Wave Guide Closed at
                 One End / 296 \\
                 40. A Dipole in a Wave Guide Closed at Both Ends / 300
                 \\
                 Index / 305",
}


bibtype: book
filename: master.bib
label: Slater:1963:QTM
author: John C. Slater
title: Quantum Theory of Molecules and Solids: Electronic-Structure of Molecules
volume: 1
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
pages: xv + 485
year: 1963
LCCN: QC174.1 .S551
bibdate: Sat Jul 25 13:55:27 1998
bibtimestamp: 1998.07.25 13:55:27 ???
acknowledgement: ack-nhfb
authordates: John Clarke Slater (1900--1976)
rawauthor: John C. Slater
rawtitle: Quantum Theory of Molecules and Solids: Electronic-Structure of Molecules
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/s/slater-john-clarke.bib; https://www.math.utah.edu/pub/tex/bib/einstein.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

TOC:
Preface / v 1: The Hydrogen Molecular Ion / 1 1-1. Energy Levels and Wave Functions for H$_2^+$ / 1 1-2. The Born--Oppenheimer Approximation and the Separation of Nuclear and Electronic Motion / 9 1-3. The Vibrations and Rotations of Diatomic Molecules / 14 1-4. The Morse Curve / 17 1-5. General Nature of the Energy Levels of Diatomic Molecules / 19 2: LCAO and Variation Methods, and the Virial Theorem, for H$_2^+$ / 22 2-1. Introduction / 22 2-2. The Overlap Charge / 23 2-3. Calculation of the Energy / 26 2-4. The Variation Method and the Virial Theorem / 29 2-5. Kinetic and Potential Energies in Diatomic Molecules / 34 2-6. Feynman's Theorem and the Bond between Atoms / 39 3: The Heitler--London Method for the Hydrogen Molecule / 41 3-1. The Many-electron Problem in Quantum Mechanics / 41 3-2. The Heitler--London Method for Hydrogen --- General Formulation / 45 3-3. The Heitler--London Method for Hydrogen --- Detailed Calculation / 49 3-4. Improvements of the Heitler--London Method / 64 4: The Molecular-orbital Method for Hydrogen, and Its Extensions / 60 4-1. Molecular Orbitals and Self-consistent Fields / 60 4-2. Configurations Formed from $1s$ Hydrogen Orbitals / 62 4-3. The Secular Problem Using the Molecular-orbital Method / 66 4-4. Variation Method for the Molecular-orbital Calculation / 70 4-6. The Coulson--Fischer Method, and Orthogonalized Atomic Orbitals / 71 4-6. The James--Coolidge Calculation for the Hydrogen Molecule / 74 4-7. Extended Configuration Interaction in the Hydrogen Molecule / 76 4-8. Details of Configuration-interaction Calculations in Hydrogen / 80 5: The Method of Molecular Orbitals / 85 5-1. The Historical Development of Molecular Theory / 86 5-2. The Hartree--Fock Equations and the Molecular-orbital Method / 92 5-3. Roothaan's Method for the Hartree--Fock Problem / 97 6: Homonuclear Diatomic Molecules / 102 6-1. Introduction / 102 6-2. One- electron Energies of Homonuclear Diatomic Molecules / 103 6-3. Molecular Orbitals and Their Bonding Properties / 109 6-4. The Repulsion of Two Helium Atoms / 111 6-6. The Oxygen Molecule / 117 6-6. Linear Polyatomic Molecules: The CO$_2$ Molecule / 127 7: Heteronuclear Diatomic Molecules / 131 One-electron Energies and Dipole Moments of Heteronuclear Diatomic Molecules / 131 7-2. The Molecular-orbital Method for the Lithium Hydride Molecule / 136 7-3. The Heitler--London Method for the LiH Molecule / 142 8: Group Theory and the Symmetry of Wave Functions / 151 8-1. Group Theory and Atomic Structure / 161 8-2. The Groups $C_N_v$ and $D_N_h$ as Examples of Finite Groups / 167 8-3. The Conditions for Formation of a Group / 162 8-4. Irreducible Representations and Basis Functions / 164 8-6. Basis Functions for the Irreducible Representations of the Groups $C_N_v$ and $C_N$ / 167 8-6. Relation of the Group $C_N_v$ to the Problem of Cylindrical Symmetry / 169 9: Bloch's Method for the Construction of Symmetry Orbitals / 172 9-1. Introduction / 172 9-2. Bloch's Method for Constructing Symmetry Orbitals / 173 9-3. Matrix Elements of One-electron Symmetric Operators with Respect to Bloch Functions / 176 9-4. Energy Bands and the Theory of Solids / 181 9-5. Orthogonalized Atomic Orbitals, or Wannier Functions / 184 10: The Ammonia Molecule / 188 10-1. Experimental Methods of Studying Molecular Configurations / 188 10-2. Molecular Orbitals for the Ammonia Molecule / 189 10-3. Directed Orbitals and Covalent Binding in Polyatomic Molecules / 193 10-4. The Valence-bond Function / 196 10-5. The Formula of Hurley, Lennard-Jones, and Pople for the Extended Valence-bond Method / 198 10-6. Construction of the Orbitals $A_i$ and $B_i$ / 202 10-7. Configuration Interaction in Ammonia / 207 11: The Methane and Water Molecules / 209 11-1. Molecular and Equivalent Orbitals for Methane / 209 11-2. Configuration Interaction in Methane --- General Discussion / 213 11-3. Configuration Interaction in Methane --- Analogy to Neon / 216 11-4. The Water Molecule / 221 12: The Ethylene and Benzene Molecules / 227 12-1. The Ethylene Molecule / 227 12-2. The Benzene Molecule / 232 12-3. The Method of Alternant Molecular Orbitals for Benzene / 240 12-4. Excited Energy Levels in Benzene / 246 Appendix 1. The H$_2^+$ Problem / 247 Appendix 2. The Born--Oppenheimer Theorem and Feynman's Theorem / 252 Appendix 3. The Virial Theorem / 254 Appendix 4. The Hartree--Fock Method / 256 Appendix 5. The Variation Principle for Nonorthogonal Basis Functions / 261 Appendix 6. Two-center Integrals / 263 Generalization of Results for Two-center Integrals / 274 Appendix 7. Roothaan's Method / 277 Appendix 8. Determinantal Functions Formed from Linear Combinations of Orbitals / 283 Appendix 9. Matrix Elements of the Hamiltonian and Other Operators for Determinantal Functions Composed of Nonorthogonal Orbitals / 286 Appendix 10. The Repulsion of Two Helium Atoms / 290 Appendix 11. Configuration Interaction in the Oxygen Molecule / 294 A11-1. Tabulation of Multiplets Involved in the Configuration Interaction / 294 A11-2. Method of Finding Multiplets in the Molecular-orbital Scheme / 294 A11-3. Multiplets in the Oxygen Configuration Interaction, Atomic-orbital Basis / 302 A11-4. Method of Finding Multiplets in the Atomic-orbital Scheme / 304 Appendix 12. The Group Theory / 315 A12-1. Introduction: The Group $C_3v$ / 316 A12-2. General Properties of Representations / 318 A12-3. The Regular Representation and Projection Operators / 323 A12-4. Irreducible Representations and Schrodinger's Equation / 333 A12-5. The Two-dimensional Rotation and Reflection Groups / 336 A12-6. The Three-dimensional Rotation and Reflection Groups / 340 A12-7. The Tetrahedral and Cubic Point Groups / 346 A12-8. The Splitting of Atomic Energy Levels in Cubic or Tetrahedral Fields / 363 Appendix 13. Multiplet Structure and Configuration Interaction in the Ring of Six Hydrogen Atoms / 367 A13-1. Introduction / 367 A13-2. The Molecular-orbital Approach for Multiplets in the Ring of Hydrogen Atoms / 372 A13-3. The Atomic-orbital Approach for the H$_6$ Molecule / 381 A13-4. General Discussion of the Problem of H$_6$ / 388 Appendix 14. The Method of Hurley, Lennard-Jones, and Pople / 390 Appendix 15. Three- and Four-center Integrals / 397 Bibliography / 401 Index / 481

rawTOC:
Preface / v \\ 1: The Hydrogen Molecular Ion / 1 \\ 1-1. Energy Levels and Wave Functions for H$_2^+$ / 1 \\ 1-2. The Born--Oppenheimer Approximation and the Separation of Nuclear and Electronic Motion / 9 \\ 1-3. The Vibrations and Rotations of Diatomic Molecules / 14 \\ 1-4. The Morse Curve / 17 \\ 1-5. General Nature of the Energy Levels of Diatomic Molecules / 19 \\ 2: LCAO and Variation Methods, and the Virial Theorem, for H$_2^+$ / 22 \\ 2-1. Introduction / 22 \\ 2-2. The Overlap Charge / 23 \\ 2-3. Calculation of the Energy / 26 \\ 2-4. The Variation Method and the Virial Theorem / 29 \\ 2-5. Kinetic and Potential Energies in Diatomic Molecules / 34 \\ 2-6. Feynman's Theorem and the Bond between Atoms / 39 \\ 3: The Heitler--London Method for the Hydrogen Molecule / 41 \\ 3-1. The Many-electron Problem in Quantum Mechanics / 41 \\ 3-2. The Heitler--London Method for Hydrogen --- General Formulation / 45 \\ 3-3. The Heitler--London Method for Hydrogen --- Detailed Calculation / 49 \\ 3-4. Improvements of the Heitler--London Method / 64 \\ 4: The Molecular-orbital Method for Hydrogen, and Its Extensions / 60 \\ 4-1. Molecular Orbitals and Self-consistent Fields / 60 \\ 4-2. Configurations Formed from $1s$ Hydrogen Orbitals / 62 \\ 4-3. The Secular Problem Using the Molecular-orbital Method / 66 \\ 4-4. Variation Method for the Molecular-orbital Calculation / 70 \\ 4-6. The Coulson--Fischer Method, and Orthogonalized Atomic Orbitals / 71 \\ 4-6. The James--Coolidge Calculation for the Hydrogen Molecule / 74 \\ 4-7. Extended Configuration Interaction in the Hydrogen Molecule / 76 \\ 4-8. Details of Configuration-interaction Calculations in Hydrogen / 80 \\ 5: The Method of Molecular Orbitals / 85 \\ 5-1. The Historical Development of Molecular Theory / 86 \\ 5-2. The Hartree--Fock Equations and the Molecular-orbital Method / 92 \\ 5-3. Roothaan's Method for the Hartree--Fock Problem / 97 \\ 6: Homonuclear Diatomic Molecules / 102 \\ 6-1. Introduction / 102 \\ 6-2. One- electron Energies of Homonuclear Diatomic Molecules / 103 \\ 6-3. Molecular Orbitals and Their Bonding Properties / 109 \\ 6-4. The Repulsion of Two Helium Atoms / 111 \\ 6-6. The Oxygen Molecule / 117 \\ 6-6. Linear Polyatomic Molecules: The CO$_2$ Molecule / 127 \\ 7: Heteronuclear Diatomic Molecules / 131 \\ One-electron Energies and Dipole Moments of Heteronuclear Diatomic Molecules / 131 \\ 7-2. The Molecular-orbital Method for the Lithium Hydride Molecule / 136 \\ 7-3. The Heitler--London Method for the LiH Molecule / 142 \\ 8: Group Theory and the Symmetry of Wave Functions / 151 \\ 8-1. Group Theory and Atomic Structure / 161 \\ 8-2. The Groups $C_{N_v}$ and $D_{N_h}$ as Examples of Finite Groups / 167 \\ 8-3. The Conditions for Formation of a Group / 162 \\ 8-4. Irreducible Representations and Basis Functions / 164 \\ 8-6. Basis Functions for the Irreducible Representations of the Groups $C_{N_v}$ and $C_N$ / 167 \\ 8-6. Relation of the Group $C_{N_v}$ to the Problem of Cylindrical Symmetry / 169 \\ 9: Bloch's Method for the Construction of Symmetry Orbitals / 172 \\ 9-1. Introduction / 172 \\ 9-2. Bloch's Method for Constructing Symmetry Orbitals / 173 \\ 9-3. Matrix Elements of One-electron Symmetric Operators with Respect to Bloch Functions / 176 \\ 9-4. Energy Bands and the Theory of Solids / 181 \\ 9-5. Orthogonalized Atomic Orbitals, or Wannier Functions / 184 \\ 10: The Ammonia Molecule / 188 \\ 10-1. Experimental Methods of Studying Molecular Configurations / 188 \\ 10-2. Molecular Orbitals for the Ammonia Molecule / 189 \\ 10-3. Directed Orbitals and Covalent Binding in Polyatomic Molecules / 193 \\ 10-4. The Valence-bond Function / 196 \\ 10-5. The Formula of Hurley, Lennard-Jones, and Pople for the Extended Valence-bond Method / 198 \\ 10-6. Construction of the Orbitals $A_i$ and $B_i$ / 202 \\ 10-7. Configuration Interaction in Ammonia / 207 \\ 11: The Methane and Water Molecules / 209 \\ 11-1. Molecular and Equivalent Orbitals for Methane / 209 \\ 11-2. Configuration Interaction in Methane --- General Discussion / 213 \\ 11-3. Configuration Interaction in Methane --- Analogy to Neon / 216 \\ 11-4. The Water Molecule / 221 \\ 12: The Ethylene and Benzene Molecules / 227 \\ 12-1. The Ethylene Molecule / 227 \\ 12-2. The Benzene Molecule / 232 \\ 12-3. The Method of Alternant Molecular Orbitals for Benzene / 240 \\ 12-4. Excited Energy Levels in Benzene / 246 \\ Appendix 1. The H$_2^+$ Problem / 247 \\ Appendix 2. The Born--Oppenheimer Theorem and Feynman's Theorem / 252 \\ Appendix 3. The Virial Theorem / 254 \\ Appendix 4. The Hartree--Fock Method / 256 \\ Appendix 5. The Variation Principle for Nonorthogonal Basis Functions / 261 \\ Appendix 6. Two-center Integrals / 263 \\ Generalization of Results for Two-center Integrals / 274 \\ Appendix 7. Roothaan's Method / 277 \\ Appendix 8. Determinantal Functions Formed from Linear Combinations of Orbitals / 283 \\ Appendix 9. Matrix Elements of the Hamiltonian and Other Operators for Determinantal Functions Composed of Nonorthogonal Orbitals / 286 \\ Appendix 10. The Repulsion of Two Helium Atoms / 290 \\ Appendix 11. Configuration Interaction in the Oxygen Molecule / 294 \\ A11-1. Tabulation of Multiplets Involved in the Configuration Interaction / 294 \\ A11-2. Method of Finding Multiplets in the Molecular-orbital Scheme / 294 \\ A11-3. Multiplets in the Oxygen Configuration Interaction, Atomic-orbital Basis / 302 \\ A11-4. Method of Finding Multiplets in the Atomic-orbital Scheme / 304 \\ Appendix 12. The Group Theory / 315 \\ A12-1. Introduction: The Group $C_{3v}$ / 316 \\ A12-2. General Properties of Representations / 318 \\ A12-3. The Regular Representation and Projection Operators / 323 \\ A12-4. Irreducible Representations and Schr{\"o}dinger's Equation / 333 \\ A12-5. The Two-dimensional Rotation and Reflection Groups / 336 \\ A12-6. The Three-dimensional Rotation and Reflection Groups / 340 \\ A12-7. The Tetrahedral and Cubic Point Groups / 346 \\ A12-8. The Splitting of Atomic Energy Levels in Cubic or Tetrahedral Fields / 363 \\ Appendix 13. Multiplet Structure and Configuration Interaction in the Ring of Six Hydrogen Atoms / 367 \\ A13-1. Introduction / 367 \\ A13-2. The Molecular-orbital Approach for Multiplets in the Ring of Hydrogen Atoms / 372 \\ A13-3. The Atomic-orbital Approach for the H$_6$ Molecule / 381 \\ A13-4. General Discussion of the Problem of H$_6$ / 388 \\ Appendix 14. The Method of Hurley, Lennard-Jones, and Pople / 390 \\ Appendix 15. Three- and Four-center Integrals / 397 \\ Bibliography / 401 \\ Index / 481

entry:
@Book{Slater:1963:QTM,
  author =       "John C. Slater",
  title =        "Quantum Theory of Molecules and Solids:
                 Electronic-Structure of Molecules",
  volume =       "1",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xv + 485",
  year =         "1963",
  LCCN =         "QC174.1 .S551",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/s/slater-john-clarke.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  author-dates = "John Clarke Slater (1900--1976)",
  tableofcontents = "Preface / v \\
                 1: The Hydrogen Molecular Ion / 1 \\
                 1-1. Energy Levels and Wave Functions for H$_2^+$ / 1
                 \\
                 1-2. The Born--Oppenheimer Approximation and the
                 Separation of Nuclear and Electronic Motion / 9 \\
                 1-3. The Vibrations and Rotations of Diatomic Molecules
                 / 14 \\
                 1-4. The Morse Curve / 17 \\
                 1-5. General Nature of the Energy Levels of Diatomic
                 Molecules / 19 \\
                 2: LCAO and Variation Methods, and the Virial Theorem,
                 for H$_2^+$ / 22 \\
                 2-1. Introduction / 22 \\
                 2-2. The Overlap Charge / 23 \\
                 2-3. Calculation of the Energy / 26 \\
                 2-4. The Variation Method and the Virial Theorem / 29
                 \\
                 2-5. Kinetic and Potential Energies in Diatomic
                 Molecules / 34 \\
                 2-6. Feynman's Theorem and the Bond between Atoms / 39
                 \\
                 3: The Heitler--London Method for the Hydrogen Molecule
                 / 41 \\
                 3-1. The Many-electron Problem in Quantum Mechanics /
                 41 \\
                 3-2. The Heitler--London Method for Hydrogen ---
                 General Formulation / 45 \\
                 3-3. The Heitler--London Method for Hydrogen ---
                 Detailed Calculation / 49 \\
                 3-4. Improvements of the Heitler--London Method / 64
                 \\
                 4: The Molecular-orbital Method for Hydrogen, and Its
                 Extensions / 60 \\
                 4-1. Molecular Orbitals and Self-consistent Fields / 60
                 \\
                 4-2. Configurations Formed from $1s$ Hydrogen Orbitals
                 / 62 \\
                 4-3. The Secular Problem Using the Molecular-orbital
                 Method / 66 \\
                 4-4. Variation Method for the Molecular-orbital
                 Calculation / 70 \\
                 4-6. The Coulson--Fischer Method, and Orthogonalized
                 Atomic Orbitals / 71 \\
                 4-6. The James--Coolidge Calculation for the Hydrogen
                 Molecule / 74 \\
                 4-7. Extended Configuration Interaction in the Hydrogen
                 Molecule / 76 \\
                 4-8. Details of Configuration-interaction Calculations
                 in Hydrogen / 80 \\
                 5: The Method of Molecular Orbitals / 85 \\
                 5-1. The Historical Development of Molecular Theory /
                 86 \\
                 5-2. The Hartree--Fock Equations and the
                 Molecular-orbital Method / 92 \\
                 5-3. Roothaan's Method for the Hartree--Fock Problem /
                 97 \\
                 6: Homonuclear Diatomic Molecules / 102 \\
                 6-1. Introduction / 102 \\
                 6-2. One- electron Energies of Homonuclear Diatomic
                 Molecules / 103 \\
                 6-3. Molecular Orbitals and Their Bonding Properties /
                 109 \\
                 6-4. The Repulsion of Two Helium Atoms / 111 \\
                 6-6. The Oxygen Molecule / 117 \\
                 6-6. Linear Polyatomic Molecules: The CO$_2$ Molecule /
                 127 \\
                 7: Heteronuclear Diatomic Molecules / 131 \\
                 One-electron Energies and Dipole Moments of
                 Heteronuclear Diatomic Molecules / 131 \\
                 7-2. The Molecular-orbital Method for the Lithium
                 Hydride Molecule / 136 \\
                 7-3. The Heitler--London Method for the LiH Molecule /
                 142 \\
                 8: Group Theory and the Symmetry of Wave Functions /
                 151 \\
                 8-1. Group Theory and Atomic Structure / 161 \\
                 8-2. The Groups $C_{N_v}$ and $D_{N_h}$ as Examples of
                 Finite Groups / 167 \\
                 8-3. The Conditions for Formation of a Group / 162 \\
                 8-4. Irreducible Representations and Basis Functions /
                 164 \\
                 8-6. Basis Functions for the Irreducible
                 Representations of the Groups $C_{N_v}$ and $C_N$ / 167
                 \\
                 8-6. Relation of the Group $C_{N_v}$ to the Problem of
                 Cylindrical Symmetry / 169 \\
                 9: Bloch's Method for the Construction of Symmetry
                 Orbitals / 172 \\
                 9-1. Introduction / 172 \\
                 9-2. Bloch's Method for Constructing Symmetry Orbitals
                 / 173 \\
                 9-3. Matrix Elements of One-electron Symmetric
                 Operators with Respect to Bloch Functions / 176 \\
                 9-4. Energy Bands and the Theory of Solids / 181 \\
                 9-5. Orthogonalized Atomic Orbitals, or Wannier
                 Functions / 184 \\
                 10: The Ammonia Molecule / 188 \\
                 10-1. Experimental Methods of Studying Molecular
                 Configurations / 188 \\
                 10-2. Molecular Orbitals for the Ammonia Molecule / 189
                 \\
                 10-3. Directed Orbitals and Covalent Binding in
                 Polyatomic Molecules / 193 \\
                 10-4. The Valence-bond Function / 196 \\
                 10-5. The Formula of Hurley, Lennard-Jones, and Pople
                 for the Extended Valence-bond Method / 198 \\
                 10-6. Construction of the Orbitals $A_i$ and $B_i$ /
                 202 \\
                 10-7. Configuration Interaction in Ammonia / 207 \\
                 11: The Methane and Water Molecules / 209 \\
                 11-1. Molecular and Equivalent Orbitals for Methane /
                 209 \\
                 11-2. Configuration Interaction in Methane --- General
                 Discussion / 213 \\
                 11-3. Configuration Interaction in Methane --- Analogy
                 to Neon / 216 \\
                 11-4. The Water Molecule / 221 \\
                 12: The Ethylene and Benzene Molecules / 227 \\
                 12-1. The Ethylene Molecule / 227 \\
                 12-2. The Benzene Molecule / 232 \\
                 12-3. The Method of Alternant Molecular Orbitals for
                 Benzene / 240 \\
                 12-4. Excited Energy Levels in Benzene / 246 \\
                 Appendix 1. The H$_2^+$ Problem / 247 \\
                 Appendix 2. The Born--Oppenheimer Theorem and Feynman's
                 Theorem / 252 \\
                 Appendix 3. The Virial Theorem / 254 \\
                 Appendix 4. The Hartree--Fock Method / 256 \\
                 Appendix 5. The Variation Principle for Nonorthogonal
                 Basis Functions / 261 \\
                 Appendix 6. Two-center Integrals / 263 \\
                 Generalization of Results for Two-center Integrals /
                 274 \\
                 Appendix 7. Roothaan's Method / 277 \\
                 Appendix 8. Determinantal Functions Formed from Linear
                 Combinations of Orbitals / 283 \\
                 Appendix 9. Matrix Elements of the Hamiltonian and
                 Other Operators for Determinantal Functions Composed of
                 Nonorthogonal Orbitals / 286 \\
                 Appendix 10. The Repulsion of Two Helium Atoms / 290
                 \\
                 Appendix 11. Configuration Interaction in the Oxygen
                 Molecule / 294 \\
                 A11-1. Tabulation of Multiplets Involved in the
                 Configuration Interaction / 294 \\
                 A11-2. Method of Finding Multiplets in the
                 Molecular-orbital Scheme / 294 \\
                 A11-3. Multiplets in the Oxygen Configuration
                 Interaction, Atomic-orbital Basis / 302 \\
                 A11-4. Method of Finding Multiplets in the
                 Atomic-orbital Scheme / 304 \\
                 Appendix 12. The Group Theory / 315 \\
                 A12-1. Introduction: The Group $C_{3v}$ / 316 \\
                 A12-2. General Properties of Representations / 318 \\
                 A12-3. The Regular Representation and Projection
                 Operators / 323 \\
                 A12-4. Irreducible Representations and
                 Schr{\"o}dinger's Equation / 333 \\
                 A12-5. The Two-dimensional Rotation and Reflection
                 Groups / 336 \\
                 A12-6. The Three-dimensional Rotation and Reflection
                 Groups / 340 \\
                 A12-7. The Tetrahedral and Cubic Point Groups / 346 \\
                 A12-8. The Splitting of Atomic Energy Levels in Cubic
                 or Tetrahedral Fields / 363 \\
                 Appendix 13. Multiplet Structure and Configuration
                 Interaction in the Ring of Six Hydrogen Atoms / 367 \\
                 A13-1. Introduction / 367 \\
                 A13-2. The Molecular-orbital Approach for Multiplets in
                 the Ring of Hydrogen Atoms / 372 \\
                 A13-3. The Atomic-orbital Approach for the H$_6$
                 Molecule / 381 \\
                 A13-4. General Discussion of the Problem of H$_6$ / 388
                 \\
                 Appendix 14. The Method of Hurley, Lennard-Jones, and
                 Pople / 390 \\
                 Appendix 15. Three- and Four-center Integrals / 397 \\
                 Bibliography / 401 \\
                 Index / 481",
}


bibtype: book
filename: master.bib
label: Smail:1923:ETI
author: Lloyd L. Smail
title: Elements of the Theory of Infinite Processes
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
pages: vi + 339
year: 1923
LCCN: QA295.S52
bibdate: Wed Jul 6 14:56:16 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.07.06 14:56:16 ???
acknowledgement: ack-nhfb
rawauthor: Lloyd L. Smail
rawtitle: Elements of the Theory of Infinite Processes
entry:
@Book{Smail:1923:ETI,
  author =       "Lloyd L. Smail",
  title =        "Elements of the Theory of Infinite Processes",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "vi + 339",
  year =         "1923",
  LCCN =         "QA295.S52",
  bibdate =      "Wed Jul 6 14:56:16 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Smiley:2010:MWI
author: Jane Smiley
title: The man who invented the computer: the biography of John Atanasoff, digital pioneer
publisher: pub-DOUBLEDAY
address: pub-DOUBLEDAY:adr
pages: 246 + 8
year: 2010
LCCN: QA76.2.A75 S64 2010
bibdate: Mon Oct 25 10:49:42 MDT 2010
bibtimestamp: 2010.10.25 10:49:42 MDT
acknowledgement: ack-nhfb
rawauthor: Jane Smiley
rawtitle: The man who invented the computer: the biography of {John Atanasoff}, digital pioneer
ISBN:
0-385-52713-6, 0-385-53372-1 (e-book), 1-299-11995-6 (e-book) OR 0385527136, 0385533721 (ebook), 1299119956 (ebook)

ISBN13:
978-0-385-52713-2, 978-0-385-53372-0 (e-book), 978-1-299-11995-6 (e-book) OR 9780385527132, 9780385533720 (ebook), 9781299119956 (ebook)

bibsource:
fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/bibnet/authors/t/teller-edward.bib; https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib; https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib; https://www.math.utah.edu/pub/tex/bib/annhistcomput.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
One night in the late 1930s, in a bar on the Illinois--Iowa border, John Vincent Atanasoff, a professor of physics at Iowa State University, after a frustrating day performing tedious mathematical calculations in his lab, hit on the idea that the binary number system and electronic switches, combined with an array of capacitors on a moving drum to serve as memory, could yield a computing machine that would make his life easier. Then he went back and built the machine. It worked, but he never patented the device, and the developers of the far-better-known ENIAC almost certainly stole critical ideas from him. But in 1973 a court declared that the patent on that Sperry Rand device was invalid, opening the gates to the computer revolution. Biographer Jane Smiley makes the race to develop digital computing as gripping as a real-life techno-thriller.

keywords:
ABC computer; Alan Turing; Charles Babbage; Clifford Berry; J. Presper Eckert; John V (John Vincent) Atanasoff; John von Neumann; John W. Mauchly; Konrad Zuse; Max Newman

subject:
Atanasoff, John V (John Vincent); Computer scientists; United States; Biography; Inventors; Physicists; Iowa; College teachers; Electronic digital computers; History; 20th century; Patents; Intellectual property

rawabstract:
One night in the late 1930s, in a bar on the Illinois--Iowa border, John Vincent Atanasoff, a professor of physics at Iowa State University, after a frustrating day performing tedious mathematical calculations in his lab, hit on the idea that the binary number system and electronic switches, combined with an array of capacitors on a moving drum to serve as memory, could yield a computing machine that would make his life easier. Then he went back and built the machine. It worked, but he never patented the device, and the developers of the far-better-known ENIAC almost certainly stole critical ideas from him. But in 1973 a court declared that the patent on that Sperry Rand device was invalid, opening the gates to the computer revolution. Biographer Jane Smiley makes the race to develop digital computing as gripping as a real-life techno-thriller.

entry:
@Book{Smiley:2010:MWI,
  author =       "Jane Smiley",
  title =        "The man who invented the computer: the biography of
                 {John Atanasoff}, digital pioneer",
  publisher =    pub-DOUBLEDAY,
  address =      pub-DOUBLEDAY:adr,
  pages =        "246 + 8",
  year =         "2010",
  ISBN =         "0-385-52713-6, 0-385-53372-1 (e-book), 1-299-11995-6
                 (e-book)",
  ISBN-13 =      "978-0-385-52713-2, 978-0-385-53372-0 (e-book),
                 978-1-299-11995-6 (e-book)",
  LCCN =         "QA76.2.A75 S64 2010",
  bibdate =      "Mon Oct 25 10:49:42 MDT 2010",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/t/teller-edward.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/tex/bib/annhistcomput.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$25.95",
  abstract =     "One night in the late 1930s, in a bar on the
                 Illinois--Iowa border, John Vincent Atanasoff, a
                 professor of physics at Iowa State University, after a
                 frustrating day performing tedious mathematical
                 calculations in his lab, hit on the idea that the
                 binary number system and electronic switches, combined
                 with an array of capacitors on a moving drum to serve
                 as memory, could yield a computing machine that would
                 make his life easier. Then he went back and built the
                 machine. It worked, but he never patented the device,
                 and the developers of the far-better-known ENIAC almost
                 certainly stole critical ideas from him. But in 1973 a
                 court declared that the patent on that Sperry Rand
                 device was invalid, opening the gates to the computer
                 revolution. Biographer Jane Smiley makes the race to
                 develop digital computing as gripping as a real-life
                 techno-thriller.",
  acknowledgement = ack-nhfb,
  keywords =     "ABC computer; Alan Turing; Charles Babbage; Clifford
                 Berry; J. Presper Eckert; John V (John Vincent)
                 Atanasoff; John von Neumann; John W. Mauchly; Konrad
                 Zuse; Max Newman",
  remark-1 =     "This book contains discussions of the patent battles
                 over early computer designs (pp 131--133 and Chapter
                 9), and some limited information about arithmetic
                 choices, such as on pp. 162--163 ``Howard Aiken, who
                 was still advocating for decimal numbers for
                 computers''. It also contains statements of how Konrad
                 Zuse's early work on electromechanical computers was
                 finally made known in the 1950s in the US (see p.
                 159).",
  remark-2 =     "The chapters are numbered, but without titles, so
                 there is no tableofcontents field in this entry.",
  remark-3 =     "Chapters 10--12 on the Honeywell vs Sperry lawsuit
                 (1968--1971) over who discovered the computer present a
                 strong rebuttal to the views in
                 \cite{McCartney:2001:ETT}.",
  remark-4 =     "Pages 188--189 mention Edward Teller's testimony in
                 August 1971 in the Honeywell vs Sperry lawsuit that the
                 ENIAC had been used for calculations by Los Alamos
                 scientists in 1945--1945, almost two years before the
                 Mauchly and Eckert (i.e., Sperry) patent claims on
                 ENIAC technology. That is `prior art' that led to
                 Sperry losing its patent claims for ENIAC.",
  subject =      "Atanasoff, John V (John Vincent); Computer scientists;
                 United States; Biography; Inventors; Physicists; Iowa;
                 College teachers; Electronic digital computers;
                 History; 20th century; Patents; Intellectual property",
}


bibtype: book
filename: master.bib
label: Smith:1976:MER
title: Matrix Eigensystem Routines: EISPACK Guide
volume: 6
publisher: pub-SV
address: pub-SV:adr
pages: vii + 387
year: 1976
DOI: https://doi.org/10.1007/978-3-540-38004-7
ISBN: 0-387-06710-8 OR 0387067108
ISBN13: 978-0-387-06710-0 OR 9780387067100
LCCN: QA193 .M37, QA267.A1 L43 no.6
bibdate: Mon Dec 13 15:15:20 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.13 15:15:20 ???
series: Lecture Notes in Computer Science, Editors: G. Goos and J. Hartmanis
URL: http://link.springer.com/10.1007/3-540-07546-1
subject: EISPACK; EISPACK (Logiciel); Engineering and Applied Sciences; Computer Science, general
acknowledgement: ack-nhfb
rawtitle: Matrix Eigensystem Routines: {EISPACK} Guide
author:
B. T. Smith and J. M. Boyle and J. J. Dongarra and B. S. Garbow and Y. Ikebe and V. C. Klema and C. B. Moler

TOC:
1: Introduction 2: How to Use EISPACK 3: Validation of EISPACK 4: Execution Times for EISPACK 5: Certification and Availability of EISPACK 6: Differences Between the EISPACK Subroutines and the Handbook Algol Procedures 7: Documentation and Source Listings

rawauthor:
B. T. Smith and J. M. Boyle and J. J. Dongarra and B. S. Garbow and Y. Ikebe and V. C. Klema and C. B. Moler

rawTOC:
1: Introduction \\ 2: How to Use EISPACK \\ 3: Validation of EISPACK \\ 4: Execution Times for EISPACK \\ 5: Certification and Availability of EISPACK \\ 6: Differences Between the EISPACK Subroutines and the Handbook Algol Procedures \\ 7: Documentation and Source Listings

entry:
@Book{Smith:1976:MER,
  author =       "B. T. Smith and J. M. Boyle and J. J. Dongarra and B.
                 S. Garbow and Y. Ikebe and V. C. Klema and C. B.
                 Moler",
  title =        "Matrix Eigensystem Routines: {EISPACK} Guide",
  volume =       "6",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "vii + 387",
  year =         "1976",
  DOI =          "https://doi.org/10.1007/978-3-540-38004-7",
  ISBN =         "0-387-06710-8",
  ISBN-13 =      "978-0-387-06710-0",
  LCCN =         "QA193 .M37, QA267.A1 L43 no.6",
  bibdate =      "Mon Dec 13 15:15:20 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Lecture Notes in Computer Science, Editors: G. Goos
                 and J. Hartmanis",
  URL =          "http://link.springer.com/10.1007/3-540-07546-1",
  acknowledgement = ack-nhfb,
  subject =      "EISPACK; EISPACK (Logiciel); Engineering and Applied
                 Sciences; Computer Science, general",
  tableofcontents = "1: Introduction \\
                 2: How to Use EISPACK \\
                 3: Validation of EISPACK \\
                 4: Execution Times for EISPACK \\
                 5: Certification and Availability of EISPACK \\
                 6: Differences Between the EISPACK Subroutines and the
                 Handbook Algol Procedures \\
                 7: Documentation and Source Listings",
}


bibtype: book
filename: master.bib
label: Smith:1987:SGMa
author: Joan M. Smith
title: The Standard Generalized Markup Language and Related Issues
publisher: British National Bibliography Research Fund
address: London, UK
pages: 63
year: 1987
ISBN: 0-7123-3082-8 OR 0712330828
ISBN13: 978-0-7123-3082-4 OR 9780712330824
LCCN: Z286 .E43 S65 1986
bibdate: Thu Jul 7 16:16:39 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.07.07 16:16:39 ???
acknowledgement: ack-nhfb
rawauthor: Joan M. Smith
rawtitle: The {Standard Generalized Markup Language} and Related Issues
entry:
@Book{Smith:1987:SGMa,
  author =       "Joan M. Smith",
  title =        "The {Standard Generalized Markup Language} and Related
                 Issues",
  publisher =    "British National Bibliography Research Fund",
  address =      "London, UK",
  pages =        "63",
  year =         "1987",
  ISBN =         "0-7123-3082-8",
  ISBN-13 =      "978-0-7123-3082-4",
  LCCN =         "Z286 .E43 S65 1986",
  bibdate =      "Thu Jul 7 16:16:39 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}


bibtype: book
filename: master.bib
label: Smith:1987:SGMb
author: Joan M. Smith
title: The Standard Generalized Markup Language (SGML): guidelines for authors
publisher: British Library Publications Sales Unit
address: Wolfeboro, NH, USA
pages: ix + 66
year: 1987
ISBN: 0-7123-3112-3 OR 0712331123
ISBN13: 978-0-7123-3112-8 OR 9780712331128
LCCN: QA76.73.S44 S65x 1987
bibdate: Thu Jul 7 16:16:35 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.07.07 16:16:35 ???
acknowledgement: ack-nhfb
rawauthor: Joan M. Smith
rawtitle: The {Standard Generalized Markup Language} ({SGML}): guidelines for authors
entry:
@Book{Smith:1987:SGMb,
  author =       "Joan M. Smith",
  title =        "The {Standard Generalized Markup Language} ({SGML}):
                 guidelines for authors",
  publisher =    "British Library Publications Sales Unit",
  address =      "Wolfeboro, NH, USA",
  pages =        "ix + 66",
  year =         "1987",
  ISBN =         "0-7123-3112-3",
  ISBN-13 =      "978-0-7123-3112-8",
  LCCN =         "QA76.73.S44 S65x 1987",
  bibdate =      "Thu Jul 7 16:16:35 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}


bibtype: book
filename: master.bib
label: Smith:1988:SUG
author: Joan M. Smith and Robert Stutely
title: SGML: The User's Guide to ISO 8879
publisher: pub-ELLIS-HORWOOD
address: pub-ELLIS-HORWOOD:adr
pages: 175
year: 1988
ISBN: 0-470-21126-1 (Halsted Press), 0-7458-0221-4 OR 0470211261 (Halsted Press), 0745802214
LCCN: QA76.73.S44 S441 1988
bibdate: Wed Aug 10 19:00:18 MDT 1994
bibtimestamp: 1994.08.10 19:00:18 MDT
series: Ellis Horwood series in computers and their applications
keywords: algorithms; documentation; languages; SGML (computer program language)
acknowledgement: ack-nhfb
rawauthor: Joan M. Smith and Robert Stutely
rawtitle: {SGML}: The User's Guide to {ISO} 8879
ISBN13:
978-0-470-21126-7 (Halsted Press), 978-0-7458-0221-3 OR 9780470211267 (Halsted Press), 9780745802213

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

subject:
I.3.6 Computing Methodologies, COMPUTER GRAPHICS, Methodology and Techniques, Languages J.7 Computer Applications, COMPUTERS IN OTHER SYSTEMS, Publishing

entry:
@Book{Smith:1988:SUG,
  author =       "Joan M. Smith and Robert Stutely",
  title =        "{SGML}: The User's Guide to {ISO} 8879",
  publisher =    pub-ELLIS-HORWOOD # " and " # pub-HALSTED,
  address =      pub-ELLIS-HORWOOD:adr # " and " # pub-HALSTED:adr,
  pages =        "175",
  year =         "1988",
  ISBN =         "0-470-21126-1 (Halsted Press), 0-7458-0221-4",
  ISBN-13 =      "978-0-470-21126-7 (Halsted Press), 978-0-7458-0221-3",
  LCCN =         "QA76.73.S44 S441 1988",
  bibdate =      "Wed Aug 10 19:00:18 MDT 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sgml.bib;
                 https://www.math.utah.edu/pub/tex/bib/standard.bib",
  price =        "UK\pounds22.50",
  series =       "Ellis Horwood series in computers and their
                 applications",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; documentation; languages; SGML (computer
                 program language)",
  libnote =      "Not yet in my library.",
  subject =      "I.3.6 Computing Methodologies, COMPUTER GRAPHICS,
                 Methodology and Techniques, Languages \\ J.7 Computer
                 Applications, COMPUTERS IN OTHER SYSTEMS, Publishing",
}


bibtype: book
filename: master.bib
label: Smith:1990:LPV
author: Ross Smith
title: Learning PostScript: A Visual Approach
publisher: pub-PEACHPIT
address: pub-PEACHPIT:adr
pages: 175
year: 1990
ISBN: 0-938151-12-6 OR 0938151126
ISBN13: 978-0-938151-12-8 OR 9780938151128
LCCN: QA76.73.P67 S55 1990
bibdate: Sat Aug 27 10:55:20 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.08.27 10:55:20 ???
acknowledgement: ack-nhfb
rawauthor: Ross Smith
rawtitle: Learning {PostScript}: {A} Visual Approach
entry:
@Book{Smith:1990:LPV,
  author =       "Ross Smith",
  title =        "Learning {PostScript}: {A} Visual Approach",
  publisher =    pub-PEACHPIT,
  address =      pub-PEACHPIT:adr,
  year =         "1990",
  ISBN =         "0-938151-12-6",
  ISBN-13 =      "978-0-938151-12-8",
  LCCN =         "QA76.73.P67 S55 1990",
  bibdate =      "Sat Aug 27 10:55:20 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Smith:1992:SRS
author: Joan M. Smith
title: SGML and Related Standards: Document Description and Processing Languages
publisher: pub-ELLIS-HORWOOD
address: pub-ELLIS-HORWOOD:adr
pages: xviii + 151
year: 1992
ISBN: 0-13-441056-4 (paperback), 0-13-806506-3 OR 0134410564 (paperback), 0138065063
ISBN13: 978-0-13-441056-2 (paperback), 978-0-13-806506-5 OR 9780134410562 (paperback), 9780138065065
LCCN: QA76.73 .S42 1992
MRclass: 68U15, 68-01
bibdate: Wed Aug 10 11:33:23 1994
bibtimestamp: 1994.08.10 11:33:23 ???
series: The Ellis Horwood series in computers and their applications
ZMnumber: 0818.68146
acknowledgement: ack-nhfb
rawauthor: Joan M. Smith
rawtitle: {SGML} and Related Standards: Document Description and Processing Languages
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/sgml.bib; https://www.math.utah.edu/pub/tex/bib/standard.bib

TOC:
Preface Acronyms and abbreviations Introduction / 1 Background / 1 Standardization aspects / 2 Objectives of SGML / 6 Uses of SGML / 7 The Standard Generalized Markup Language / 12 Concepts on which SGML is based / 12 The notion of markup / 13 What SGML is / 14 How SGML works / 15 Features of SGML / 20 An SGML document / 24 SGML declaration / 24 Document type definition / 27 Document instance / 30 Reducing overheads / 31 Some application considerations / 35 General remarks / 35 Avoidance of presentation issues / 36 Numbering schemes / 37 Cross-referencing / 37 Indexing / 37 Lists / 38 Tables / 39 Mathematics / 41 Libraries of information / 41 Hypermedia links / 41 Security / 42 The integrated information base / 45 Some possibilities / 45 Organizational aspects / 46 Output considerations / 46 Functionality / 47 Input to the information base / 48 Ten rules and ten benefits / 50 Getting started / 52 Presenting SGML documents / 55 The standards involved / 55 Document Style Semantics and Specification Language / 55 Standard Page Description Language / 58 Fonts / 61 SGML support facilities / 66 Interchanging SGML documents / 66 Registration of owner identifiers / 67 Editing SGML documents / 68 The overall model / 70 Techniques for using SGML / 72 Vocabulary / 76 Hypermedia and other new work / 77 HyTime / 77 The Standard Music Description Language / 79 A binary version of SGML / 81 Revision of ISO 8879 / 82 Conformance / 83 Related standards work / 84 Some applications of SGML / 89 Defence / 89 Others / 94 A comparison of SGML and ODA / 103 Something about the standards / 103 Technical issues / 105 Business issues / 114 SGML product guidance / 120 Licensing a product / 120 Availability of products / 127 Further information / 134 SGML Users' Group / 134 Graphic Communications Association / 135 Electronic Publishing Special Interest Group / 136 Published standards and technical reports / 137 Books on SGML / 138 Other useful documents / 139 The last word / 141 Appendix 1: A brief history of the development of SGML / 143 Appendix 2: Glossary / 146 Index / 149

rawTOC:
Preface \\ Acronyms and abbreviations \\ Introduction / 1 \\ Background / 1 \\ Standardization aspects / 2 \\ Objectives of SGML / 6 \\ Uses of SGML / 7 \\ The Standard Generalized Markup Language / 12 \\ Concepts on which SGML is based / 12 \\ The notion of markup / 13 \\ What SGML is / 14 \\ How SGML works / 15 \\ Features of SGML / 20 \\ An SGML document / 24 \\ SGML declaration / 24 \\ Document type definition / 27 \\ Document instance / 30 \\ Reducing overheads / 31 \\ Some application considerations / 35 \\ General remarks / 35 \\ Avoidance of presentation issues / 36 \\ Numbering schemes / 37 \\ Cross-referencing / 37 \\ Indexing / 37 \\ Lists / 38 \\ Tables / 39 \\ Mathematics / 41 \\ Libraries of information / 41 \\ Hypermedia links / 41 \\ Security / 42 \\ The integrated information base / 45 \\ Some possibilities / 45 \\ Organizational aspects / 46 \\ Output considerations / 46 \\ Functionality / 47 \\ Input to the information base / 48 \\ Ten rules and ten benefits / 50 \\ Getting started / 52 \\ Presenting SGML documents / 55 \\ The standards involved / 55 \\ Document Style Semantics and Specification Language / 55 \\ Standard Page Description Language / 58 \\ Fonts / 61 \\ SGML support facilities / 66 \\ Interchanging SGML documents / 66 \\ Registration of owner identifiers / 67 \\ Editing SGML documents / 68 \\ The overall model / 70 \\ Techniques for using SGML / 72 \\ Vocabulary / 76 \\ Hypermedia and other new work / 77 \\ HyTime / 77 \\ The Standard Music Description Language / 79 \\ A binary version of SGML / 81 \\ Revision of ISO 8879 / 82 \\ Conformance / 83 \\ Related standards work / 84 \\ Some applications of SGML / 89 \\ Defence / 89 \\ Others / 94 \\ A comparison of SGML and ODA / 103 \\ Something about the standards / 103 \\ Technical issues / 105 \\ Business issues / 114 \\ SGML product guidance / 120 \\ Licensing a product / 120 \\ Availability of products / 127 \\ Further information / 134 \\ SGML Users' Group / 134 \\ Graphic Communications Association / 135 \\ Electronic Publishing Special Interest Group / 136 \\ Published standards and technical reports / 137 \\ Books on SGML / 138 \\ Other useful documents / 139 \\ The last word / 141 \\ Appendix 1: A brief history of the development of SGML / 143 \\ Appendix 2: Glossary / 146 \\ Index / 149

entry:
@Book{Smith:1992:SRS,
  author =       "Joan M. Smith",
  title =        "{SGML} and Related Standards: Document Description and
                 Processing Languages",
  publisher =    pub-ELLIS-HORWOOD,
  address =      pub-ELLIS-HORWOOD:adr,
  pages =        "xviii + 151",
  year =         "1992",
  ISBN =         "0-13-441056-4 (paperback), 0-13-806506-3",
  ISBN-13 =      "978-0-13-441056-2 (paperback), 978-0-13-806506-5",
  LCCN =         "QA76.73 .S42 1992",
  MRclass =      "68U15, 68-01",
  bibdate =      "Wed Aug 10 11:33:23 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sgml.bib;
                 https://www.math.utah.edu/pub/tex/bib/standard.bib",
  price =        "US\$50.25",
  series =       "The Ellis Horwood series in computers and their
                 applications",
  ZMnumber =     "0818.68146",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Preface \\
                 Acronyms and abbreviations \\
                 Introduction / 1 \\
                 Background / 1 \\
                 Standardization aspects / 2 \\
                 Objectives of SGML / 6 \\
                 Uses of SGML / 7 \\
                 The Standard Generalized Markup Language / 12 \\
                 Concepts on which SGML is based / 12 \\
                 The notion of markup / 13 \\
                 What SGML is / 14 \\
                 How SGML works / 15 \\
                 Features of SGML / 20 \\
                 An SGML document / 24 \\
                 SGML declaration / 24 \\
                 Document type definition / 27 \\
                 Document instance / 30 \\
                 Reducing overheads / 31 \\
                 Some application considerations / 35 \\
                 General remarks / 35 \\
                 Avoidance of presentation issues / 36 \\
                 Numbering schemes / 37 \\
                 Cross-referencing / 37 \\
                 Indexing / 37 \\
                 Lists / 38 \\
                 Tables / 39 \\
                 Mathematics / 41 \\
                 Libraries of information / 41 \\
                 Hypermedia links / 41 \\
                 Security / 42 \\
                 The integrated information base / 45 \\
                 Some possibilities / 45 \\
                 Organizational aspects / 46 \\
                 Output considerations / 46 \\
                 Functionality / 47 \\
                 Input to the information base / 48 \\
                 Ten rules and ten benefits / 50 \\
                 Getting started / 52 \\
                 Presenting SGML documents / 55 \\
                 The standards involved / 55 \\
                 Document Style Semantics and Specification Language /
                 55 \\
                 Standard Page Description Language / 58 \\
                 Fonts / 61 \\
                 SGML support facilities / 66 \\
                 Interchanging SGML documents / 66 \\
                 Registration of owner identifiers / 67 \\
                 Editing SGML documents / 68 \\
                 The overall model / 70 \\
                 Techniques for using SGML / 72 \\
                 Vocabulary / 76 \\
                 Hypermedia and other new work / 77 \\
                 HyTime / 77 \\
                 The Standard Music Description Language / 79 \\
                 A binary version of SGML / 81 \\
                 Revision of ISO 8879 / 82 \\
                 Conformance / 83 \\
                 Related standards work / 84 \\
                 Some applications of SGML / 89 \\
                 Defence / 89 \\
                 Others / 94 \\
                 A comparison of SGML and ODA / 103 \\
                 Something about the standards / 103 \\
                 Technical issues / 105 \\
                 Business issues / 114 \\
                 SGML product guidance / 120 \\
                 Licensing a product / 120 \\
                 Availability of products / 127 \\
                 Further information / 134 \\
                 SGML Users' Group / 134 \\
                 Graphic Communications Association / 135 \\
                 Electronic Publishing Special Interest Group / 136 \\
                 Published standards and technical reports / 137 \\
                 Books on SGML / 138 \\
                 Other useful documents / 139 \\
                 The last word / 141 \\
                 Appendix 1: A brief history of the development of SGML
                 / 143 \\
                 Appendix 2: Glossary / 146 \\
                 Index / 149",
}


bibtype: book
filename: master.bib
label: Smith:1998:SECa
author: Crosbie Smith
title: The science of energy: a cultural history of energy physics in Victorian Britain
publisher: pub-U-CHICAGO
address: pub-U-CHICAGO:adr
pages: xi + 404
year: 1998
ISBN: 0-226-76420-6, 0-226-76421-4 (paperback) OR 0226764206, 0226764214 (paperback)
ISBN13: 978-0-226-76420-7, 978-0-226-76421-4 (paperback) OR 9780226764207, 9780226764214 (paperback)
LCCN: QC72 .S58 1998
bibdate: Mon Sep 29 10:56:31 MDT 2014
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2014.09.29 10:56:31 MDT
acknowledgement: ack-nhfb
rawauthor: Crosbie Smith
rawtitle: The science of energy: a cultural history of energy physics in {Victorian Britain}
URL:
http://catdir.loc.gov/catdir/description/uchi051/98024960.html; http://catdir.loc.gov/catdir/enhancements/fy0608/98024960-t.html; http://catdir.loc.gov/catdir/enhancements/fy0609/98024960-b.html

abstract:
Although we take it for granted today, the concept of ``energy'' transformed nineteenth-century physics. In booktitle The Science of Energy, Crosbie Smith shows how a North British group of scientists and engineers, including James Joule, James Clerk Maxwell, William and James Thomson, Fleeming Jenkin, and P. G. Tait, developed energy physics to solve practical problems encountered by Scottish shipbuilders and marine engineers to counter biblical revivalism and evolutionary materialism and to rapidly enhance their own scientific credibility. Replacing the language and concepts of classical mechanics with terms such as ``actual'' and ``potential'' energy, the North British group conducted their revolution in physics so astutely and vigorously that the concept of ``energy'' --- a valuable commodity in the early days of industrialization --- became their intellectual property. Smith skillfully places this revolution in its scientific and cultural context, exploring the actual creation of scientific knowledge during one of the most significant episodes in the history of physics.

subject:
Force and energy; History; 19th century; Power resources; Power (Mechanics); Force et energie; Histoire; 19e siecle; Ressources energetiques; Energie mecanique; Energie; Physik; Wissenschaft; Kraft; Force and energy; Power (Mechanics); Power resources; Gross britannien

TOC:
Introduction: a history of energy From design to dissolution: Scotland's Presbyterian cultures Recovering the motive power of heat Mr Joule of Manchester Constructing a perfect thermo-dynamic engine `Everything in the material world is progressive' `The epoch of energy': the new physics and the new cosmology The science of thermodynamics North Britain versus metropolis: territorial controversy in the history of energy Newton reinvented: Thomson and Tait's Treatise on natural philosophy Gentleman of energy: the natural philosophy of James Clerk Maxwell Demons versus dissipation Energy and electricity: `the apparatus of the market place' Sequel: Transforming energy in the late nineteenth century

rawabstract:
Although we take it for granted today, the concept of ``energy'' transformed nineteenth-century physics. In \booktitle{The Science of Energy}, Crosbie Smith shows how a North British group of scientists and engineers, including James Joule, James Clerk Maxwell, William and James Thomson, Fleeming Jenkin, and P. G. Tait, developed energy physics to solve practical problems encountered by Scottish shipbuilders and marine engineers to counter biblical revivalism and evolutionary materialism and to rapidly enhance their own scientific credibility. Replacing the language and concepts of classical mechanics with terms such as ``actual'' and ``potential'' energy, the North British group conducted their revolution in physics so astutely and vigorously that the concept of ``energy'' --- a valuable commodity in the early days of industrialization --- became their intellectual property. Smith skillfully places this revolution in its scientific and cultural context, exploring the actual creation of scientific knowledge during one of the most significant episodes in the history of physics.

rawTOC:
Introduction: a history of energy \\ From design to dissolution: Scotland's Presbyterian cultures \\ Recovering the motive power of heat \\ Mr Joule of Manchester \\ Constructing a perfect thermo-dynamic engine \\ `Everything in the material world is progressive' \\ `The epoch of energy': the new physics and the new cosmology \\ The science of thermodynamics \\ North Britain versus metropolis: territorial controversy in the history of energy \\ Newton reinvented: Thomson and Tait's Treatise on natural philosophy \\ Gentleman of energy: the natural philosophy of James Clerk Maxwell \\ Demons versus dissipation \\ Energy and electricity: `the apparatus of the market place' \\ Sequel: Transforming energy in the late nineteenth century

entry:
@Book{Smith:1998:SECa,
  author =       "Crosbie Smith",
  title =        "The science of energy: a cultural history of energy
                 physics in {Victorian Britain}",
  publisher =    pub-U-CHICAGO,
  address =      pub-U-CHICAGO:adr,
  pages =        "xi + 404",
  year =         "1998",
  ISBN =         "0-226-76420-6, 0-226-76421-4 (paperback)",
  ISBN-13 =      "978-0-226-76420-7, 978-0-226-76421-4 (paperback)",
  LCCN =         "QC72 .S58 1998",
  bibdate =      "Mon Sep 29 10:56:31 MDT 2014",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://catdir.loc.gov/catdir/description/uchi051/98024960.html;
                 http://catdir.loc.gov/catdir/enhancements/fy0608/98024960-t.html;
                 http://catdir.loc.gov/catdir/enhancements/fy0609/98024960-b.html",
  abstract =     "Although we take it for granted today, the concept of
                 ``energy'' transformed nineteenth-century physics. In
                 \booktitle{The Science of Energy}, Crosbie Smith shows
                 how a North British group of scientists and engineers,
                 including James Joule, James Clerk Maxwell, William and
                 James Thomson, Fleeming Jenkin, and P. G. Tait,
                 developed energy physics to solve practical problems
                 encountered by Scottish shipbuilders and marine
                 engineers to counter biblical revivalism and
                 evolutionary materialism and to rapidly enhance their
                 own scientific credibility. Replacing the language and
                 concepts of classical mechanics with terms such as
                 ``actual'' and ``potential'' energy, the North British
                 group conducted their revolution in physics so astutely
                 and vigorously that the concept of ``energy'' --- a
                 valuable commodity in the early days of
                 industrialization --- became their intellectual
                 property. Smith skillfully places this revolution in
                 its scientific and cultural context, exploring the
                 actual creation of scientific knowledge during one of
                 the most significant episodes in the history of
                 physics.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Force and energy; History; 19th century; Power
                 resources; Power (Mechanics); Force et {\'e}nergie;
                 Histoire; 19e si{\`e}cle; Ressources
                 {\'e}nerg{\'e}tiques; {\'E}nergie m{\'e}canique;
                 Energie; Physik; Wissenschaft; Kraft; Force and energy;
                 Power (Mechanics); Power resources;
                 Gro{\ss}britannien",
  tableofcontents = "Introduction: a history of energy \\
                 From design to dissolution: Scotland's Presbyterian
                 cultures \\
                 Recovering the motive power of heat \\
                 Mr Joule of Manchester \\
                 Constructing a perfect thermo-dynamic engine \\
                 `Everything in the material world is progressive' \\
                 `The epoch of energy': the new physics and the new
                 cosmology \\
                 The science of thermodynamics \\
                 North Britain versus metropolis: territorial
                 controversy in the history of energy \\
                 Newton reinvented: Thomson and Tait's Treatise on
                 natural philosophy \\
                 Gentleman of energy: the natural philosophy of James
                 Clerk Maxwell \\
                 Demons versus dissipation \\
                 Energy and electricity: `the apparatus of the market
                 place' \\
                 Sequel: Transforming energy in the late nineteenth
                 century",
}


