# bibtab

bibtype: book
filename: master.bib
label: Paulos:1991:BNR
author: John Allen Paulos
title: Beyond Numeracy: Ruminations of a Numbers Man
publisher: pub-KNOPF
address: pub-KNOPF:adr
pages: xiii + 285
year: 1991
ISBN: 0-394-58640-9, 0-685-48163-8 OR 0394586409, 0685481638
ISBN13: 978-0-394-58640-3, 978-0-685-48163-9 OR 9780394586403, 9780685481639
LCCN: QA5 .P38 1991
bibdate: Thu Sep 15 08:20:32 1994
bibtimestamp: 1994.09.15 08:20:32 ???
acknowledgement: ack-nhfb
rawauthor: John Allen Paulos
rawtitle: Beyond Numeracy: Ruminations of a Numbers Man
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
This book is in part a dictionary, in part a collection of short mathematical essays, and in part the ruminations of a numbers man. Although it contains many entries (brief essays) arranged in alphabetical order and depicting a broad range of mathematical topics, the book differs from a standard dictionary in that its entries are less comprehensive, longer, and in some cases quite unconventional.

TOC:
A mathematical accent Algebra: some basic principles Analytic geometry Arabic numerals Areas and volumes Binary numbers and codes Calculus Chaos theory Coincidences Combinatorics, graphs, and maps Complexity of programs Computation and rote Correlations, intervals, and testing Differential equations E Mathematics in ethics Exponential growth Fermat's last theorem Mathematical folklore Fractals Functions Game theory Godel and his theorem Golden rectangle, Fibonacci sequences Groups and abstract algebra Human consciousness, its fractal nature Humor and mathematics Imaginary and negative numbers Impossibilities: three old, three new Mathematical induction Infinite sets Limits Linear programming Matrices and vectors Mean, median, and mode Mobius strips and orientability Monte Carlo method of simulation The multiplication principle Music, art, and digitalization Non-Euclidean geometry Notation Oulipo: mathematics in literature Partial orderings and comparisons Pascal's triangle Philosophy of mathematics Pi Platonic solids Prime numbers Probability The Pythagorean theorem QED, proofs, and theorems The quadratic and other formulas Quantifiers in logic Rational and irrational numbers Recursion: from definitions to life Russell's paradox Scientific notation Series: convergence and divergence Sorting and retrieving Statistics: two theorems Substitutability and more on rote Symmetry and invariance Tautologies and truth tables Time, space, and immensity Topology Trigonometry Turing's test, expert systems Variables and pronouns Voting systems Zeno and motion Chronological listing of the ``top forty''

rawabstract:
This book is in part a dictionary, in part a collection of short mathematical essays, and in part the ruminations of a numbers man. Although it contains many entries (brief essays) arranged in alphabetical order and depicting a broad range of mathematical topics, the book differs from a standard dictionary in that its entries are less comprehensive, longer, and in some cases quite unconventional.

rawTOC:
A mathematical accent \\ Algebra: some basic principles \\ Analytic geometry \\ Arabic numerals \\ Areas and volumes \\ Binary numbers and codes \\ Calculus \\ Chaos theory \\ Coincidences \\ Combinatorics, graphs, and maps \\ Complexity of programs \\ Computation and rote \\ Correlations, intervals, and testing \\ Differential equations \\ E \\ Mathematics in ethics \\ Exponential growth \\ Fermat's last theorem \\ Mathematical folklore \\ Fractals \\ Functions \\ Game theory \\ G{\"o}del and his theorem \\ Golden rectangle, Fibonacci sequences \\ Groups and abstract algebra \\ Human consciousness, its fractal nature \\ Humor and mathematics \\ Imaginary and negative numbers \\ Impossibilities: three old, three new \\ Mathematical induction \\ Infinite sets \\ Limits \\ Linear programming \\ Matrices and vectors \\ Mean, median, and mode \\ M{\"o}bius strips and orientability \\ Monte Carlo method of simulation \\ The multiplication principle \\ Music, art, and digitalization \\ Non-Euclidean geometry \\ Notation \\ Oulipo: mathematics in literature \\ Partial orderings and comparisons \\ Pascal's triangle \\ Philosophy of mathematics \\ Pi \\ Platonic solids \\ Prime numbers \\ Probability \\ The Pythagorean theorem \\ QED, proofs, and theorems \\ The quadratic and other formulas \\ Quantifiers in logic \\ Rational and irrational numbers \\ Recursion: from definitions to life \\ Russell's paradox \\ Scientific notation \\ Series: convergence and divergence \\ Sorting and retrieving \\ Statistics: two theorems \\ Substitutability and more on rote \\ Symmetry and invariance \\ Tautologies and truth tables \\ Time, space, and immensity \\ Topology \\ Trigonometry \\ Turing's test, expert systems \\ Variables and pronouns \\ Voting systems \\ Zeno and motion \\ Chronological listing of the ``top forty''

entry:
@Book{Paulos:1991:BNR,
  author =       "John Allen Paulos",
  title =        "Beyond Numeracy: Ruminations of a Numbers Man",
  publisher =    pub-KNOPF,
  address =      pub-KNOPF:adr,
  pages =        "xiii + 285",
  year =         "1991",
  ISBN =         "0-394-58640-9, 0-685-48163-8",
  ISBN-13 =      "978-0-394-58640-3, 978-0-685-48163-9",
  LCCN =         "QA5 .P38 1991",
  bibdate =      "Thu Sep 15 08:20:32 1994",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "This book is in part a dictionary, in part a
                 collection of short mathematical essays, and in part
                 the ruminations of a numbers man. Although it contains
                 many entries (brief essays) arranged in alphabetical
                 order and depicting a broad range of mathematical
                 topics, the book differs from a standard dictionary in
                 that its entries are less comprehensive, longer, and in
                 some cases quite unconventional.",
  acknowledgement = ack-nhfb,
  tableofcontents = "A mathematical accent \\
                 Algebra: some basic principles \\
                 Analytic geometry \\
                 Arabic numerals \\
                 Areas and volumes \\
                 Binary numbers and codes \\
                 Calculus \\
                 Chaos theory \\
                 Coincidences \\
                 Combinatorics, graphs, and maps \\
                 Complexity of programs \\
                 Computation and rote \\
                 Correlations, intervals, and testing \\
                 Differential equations \\
                 E \\
                 Mathematics in ethics \\
                 Exponential growth \\
                 Fermat's last theorem \\
                 Mathematical folklore \\
                 Fractals \\
                 Functions \\
                 Game theory \\
                 G{\"o}del and his theorem \\
                 Golden rectangle, Fibonacci sequences \\
                 Groups and abstract algebra \\
                 Human consciousness, its fractal nature \\
                 Humor and mathematics \\
                 Imaginary and negative numbers \\
                 Impossibilities: three old, three new \\
                 Mathematical induction \\
                 Infinite sets \\
                 Limits \\
                 Linear programming \\
                 Matrices and vectors \\
                 Mean, median, and mode \\
                 M{\"o}bius strips and orientability \\
                 Monte Carlo method of simulation \\
                 The multiplication principle \\
                 Music, art, and digitalization \\
                 Non-Euclidean geometry \\
                 Notation \\
                 Oulipo: mathematics in literature \\
                 Partial orderings and comparisons \\
                 Pascal's triangle \\
                 Philosophy of mathematics \\
                 Pi \\
                 Platonic solids \\
                 Prime numbers \\
                 Probability \\
                 The Pythagorean theorem \\
                 QED, proofs, and theorems \\
                 The quadratic and other formulas \\
                 Quantifiers in logic \\
                 Rational and irrational numbers \\
                 Recursion: from definitions to life \\
                 Russell's paradox \\
                 Scientific notation \\
                 Series: convergence and divergence \\
                 Sorting and retrieving \\
                 Statistics: two theorems \\
                 Substitutability and more on rote \\
                 Symmetry and invariance \\
                 Tautologies and truth tables \\
                 Time, space, and immensity \\
                 Topology \\
                 Trigonometry \\
                 Turing's test, expert systems \\
                 Variables and pronouns \\
                 Voting systems \\
                 Zeno and motion \\
                 Chronological listing of the ``top forty''",
}


bibtype: book
filename: master.bib
label: Pauncz:1979:SEC
author: Ruben Pauncz
title: Spin Eigenfunctions: Construction and Use
publisher: pub-PLENUM
address: pub-PLENUM:adr
pages: xv + 370
year: 1979
ISBN: 0-306-40141-X OR 030640141X
ISBN13: 978-0-306-40141-1 OR 9780306401411
LCCN: QD462.P38
bibdate: Sat Jul 25 13:55:27 1998
bibtimestamp: 1998.07.25 13:55:27 ???
acknowledgement: ack-nhfb
rawauthor: Ruben Pauncz
rawtitle: Spin Eigenfunctions: Construction and Use
bibsource:
https://www.math.utah.edu/pub/tex/bib/ijqc1980.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

TOC:
1. Introduction / 1 1.1. Electronic States with Definite Multiplicities / 1 1.2. Basic Facts with Respect to the Spin / 4 1.3. Spin Operators and Functions for One Electron / 5 1.4. Addition Theorem of Angular Momenta / 7 References / 8 2: Construction of Spin Eigenfunctions from the Products of One-Electron Spin Functions / 9 2.1. The Resultant Spin Operator and the Dirac Identity / 9 2.2. Eigenfunctions of $S_z$ / 11 2.3. Construction of $S^2$ Eigenfunctions by the Diagonalization of the $S^2$ Matrix / 14 2.4. Construction of $S^2$ Eigenfunctions by the Orthogonalization Procedure / 16 2.5. Dimension of the Spin Degeneracy / 17 2.6. Genealogical Construction of Spin Eigenfunctions / 19 2.7. Branching Diagram / 21 2.8. Orthogonality of the Branching -Diagram Functions / 22 2.9. Special Properties of the Branching-Diagram Functions / 23 2.10. Ordering of the Primitive Spin Functions; the Path Diagram / 25 2.11. Expression for $X(N, S, S; 1)$ / 28 2.12. Expression for $X(N, S, S; f)$ / 29 2.13. The Coefficient of a Primitive Spin Function in a Given Branching-Diagram Function / 30 References / 32 3. Construction of Spin Eigenfunctions from the Products of Two-Electron Spin Eigenfunctions / 33 3.1. Serber-Type Construction of Spin Eigenfunctions / 33 3.2. Formulas for the Serber Construction / 34 3.3. Geminal Spin Product Functions; Serber Path Diagram / 36 3.4. Special Properties of the Serber Functions / 38 3.5. The Coefficient of a Geminal Product Function in a Given Serber Function / 41 3.6. The Algorithm of Carrington and Doggett / 43 3.7. Construction of Serber-Type Functions by Direct Diagonalization of the $S^2$ Matrix / 43 3.7.1. $S^2$ Matrix for an Even Number of Electrons / 44 3.7.2. $S^2$ Matrix for an Odd Number of Electrons / 45 3.8. Construction of Spin Eigenfunctions from Those of Two Subsystems / 46 References / 48 4. Construction of Spin Eigenfunctions by the Projection Operator Method / 49 4.1. Projection Operator Method / 49 4.1.1. Trial Function / 49 4.1.2. The Projection Operator / 50 4.2. The Projection of the First Primitive Function / 52 4.3. The Projection of an Arbitrary Primitive Spin Function / 56 4.4. The Choice of Spin Functions Whose Projections Are Linearly Independent / 56 4.5. Relation between the Projected Functions and the Branching-Diagram Functions / 60 4.6. Projected Functions for $S > M$; Sanibel Coefficients / 61 4.7. Sasaki and Ohno's Derivation of the Sanibel Coefficients / 63 4.8. Derivation of the Sanibel Coefficients from the Vector-Coupling Coefficients / 67 4.9. Sanibel Coefficients by the Group Theoretical Projection Operator Method / 68 4.10. The Construction of Serber-Type Functions by the Projection Operator Method / 71 4.11. The Overlap Matrix of the Projected Spin Functions / 74 References / 75 5. Spin-Paired Spin Eigenfunctions / 77 5.1. Spin-Paired Spin Eigenfunctions / 77 5.2. Extended Rumer Diagrams / 79 5.3. Linear Independence of Extended Rumer Functions / 80 5.4. The Relation between Rumer Functions and Branching-Diagram Functions / 82 5.5. The Relation between Rumer Functions and Serber-Type Functions / 83 5.6. Matrix Elements between the Spin-Paired Functions / 86 5.6.1. Islands / 87 5.6.2 O Chain / 87 5.6.3 E Chain / 88 References / 89 6. Basic Notions of the Theory of the Symmetric Group / 91 6.1. Introduction / 91 6.2. Permutations; Cyclic Structure / 91 6.3. Young Frames; Young Tableaux / 96 6.4. The Symmetric Group Algebra: Young Operators / 97 6.4.1. Young Operators / 99 6.4.2. Ordering of the Standard Tableaux / 100 6.4.3. Yamanouchi Symbol / 100 6.4.4. The Young Operator $E_r s^alpha $ / 103 6.4.5. Alternative Definition or the Young Operators / 105 6.5. Representations of the Symmetric Group / 106 6.5.1. Young's Orthogonal Representation / 106 6.5.2. Young's Natural Representation / 107 6.6. Matric Basis of the Symmetric Group Algebra / 109 6.6.1. Calculation of the Characters of the Symmetric Group / 111 6.6.2. Matsen's Method for the Construction of Matric Units / 112 6.6.3. Salmon's Method for the Construction of Matric Units / 114 References / 115 7. Representations of the Symmetric Group Generated by the Spin Eigenfunctions / 117 7.1. Introduction / 117 7.2. The Genealogical Spin Functions Generate a Representation of the Symmetric Group / 117 7.3. Recursive Construction of the Representation Matrices: Yamanouchi--Kotani Method / 120 7.3.1. Permutations That Do Not Affect the Last Number $N$ / 120 7.3.2. The Transposition $(N - 1, N)$ / 122 7.4. Relation between the Yamanouchi--Kotani Representation and the Young Orthogonal Representation / 124 7.4.1. Dimension of the Representation / 124 7.4.2. One-to-One Correspondence between the Young Tableaux and Branching-Diagram Functions / 125 7.4.3. Identity of the Young Orthogonal and the Yamanouchi--Kotani Representation / 126 7.5. Construction of the Spin Functions from the Representation Matrices / 129 7.6. Construction of the Branching-Diagram Functions by Use of the Matric Units / 131 7.6.1. Conditions for Nonvanishing $e_i i^alpha theta $ / 133 7.6.2. The Character Projection Operator / 134 7.6.3. Construction of the Branching-Diagram Functions by Use of the Matric Units; Salmon's Procedure / 136 7.7. Representation of the Symmetric Group Generated by the Serber-Type Spin Functions / 138 7.7.1. Direct Method for the Calculation of the Representation Matrix / 138 7.7.2. Recursive Calculation of the Representation Matrix / 139 7.8. The Relation between the Serber and the Young--Yamanouchi Representations. / 141 7.8.1. The Transformation Matrix / 141 7.8.2. Recursive Construction of the Transformation Matrix / 142 7.9. Matric Basis of the Serber Representation / 145 7.10. Representation Generated by the Spin-Coupled Functions / 147 7.11. Relation between the Young--Yamanouchi and the Reduced Representations / 149 References / 151 8. Representations of the Symmetric Group Generated by the Projected Spin Functions and Valence Bond Functions / 153 8.1. Introduction / 153 8.2. Representation Generated by the Projected Spin Functions / 153 8.3. Construction of the Projected Spin Functions by the Use of the Young Operator / 156 8.4. Construction of the Projected Spin Functions by the Character Projection Operator / 158 8.5. Representation Generated by the Rumer Functions / 159 8.6. Construction of the Spin-Paired Functions from the Alternative Young Operators / 160 8.7. The Linear Independence of $V_f$'s and Their Relation to the Genealogical Functions / 162 References / 163 9. Combination of Spatial and Spin Functions; Calculation of the Matrix Elements of Operators / 165 9.1. Introduction / 165 9.2. Construction of Antisymmetric Wave Function / 165 9.3. Separation of $Psi _i$ into Spatial and Spin Functions / 168 9.4. The Spatial Functions $Phi _j,i^S$ Generate a Representation of $S_N$ / 169 9.5. Calculation of the Matrix Elements of the Hamiltonian / 172 9.6. Computational Aspects of the Basic Formulas / 175 9.7. The Form of the Spatial Function $Phi $ / 177 References / 179 10. Calculation of the Matrix Elements of the Hamiltonian; Orthogonal Spin Functions / 181 10.1. Introduction / 181 10.2. Spatial Functions with a Number of Doubly Occupied Orbitals; Branching-Diagram Spin Functions / 181 10.3. Calculation of the Energy Matrix / 185 10.3.1. Alternative Method for the Calculation of the Invariant Part / 189 10.3.2. Calculation of the Energy Matrix for the Case of Orthogonal Orbitals / 189 10.4. Matrix Elements of the Hamiltonian for Serber-Type Spin Functions 1 / 92 10.4.1. Notation for the Spatial Functions / 192 10.4.2. Geminal Spin Harmonics / 192 10.4.3. Normalization Integral / 193 10.4.4. The Lineup Permutation / 194 10.4.5. The Wave Functions Form an Orthonormal Set / 194 10.4.6. The Form of the Hamiltonian / 195 10.4.7. Reduction of the Sum over the Permutations / 196 10.4.8. Reduction of the Sum over Electron Pairs / 197 10.4.9. Matrix Elements of the Hamiltonian / 198 10.5. Calculation of the Matrix Elements of the Hamiltonian for Spin-Coupled Wave Functions / 200 10.6. Calculation of the Energy for a Single Configuration / 203 10.6.1. One-Electron Operators / 203 10.6.2. Two-Electron Operators / 205 References / 207 11. Calculation of the Matrix Elements of the Hamiltonian; Nonorthogonal Spin Functions / 209 11.1. Introduction / 209 11.2. A Single Configuration; Projected Spin Function / 209 11.3. Different Orbitals for Different Spins / 211 11.3.1. Alternant Molecular Orbitals / 212 11.3.2. Calculation of the Normalization Integral / 212 11.4. Many-Configuration Wave Function; Projection Operator Method / 213 11.4.1. The Reference Permutation / 214 11.4.2. Summation over the Subgroup $S_v$ / 215 11.4.3. The Spatial Integrals / 216 11.4.4. Matrix Elements / 217 11.5. Many-Configuration Wave Function; Bonded Functions / 219 11.5.1. The Matching Rearrangement / 220 11.5.2. The Effect of Double Occupancy / 220 11.5.3. Matrix Elements of the Spin Functions / 221 11.5.4. Matrix Elements of the Transpositions / 222 11.5.5. Matrix Element of the Hamiltonian between Two Functions / 223 11.5.6. Matrix Elements in Terms of Bonded Functions / 224 References / 227 12. Spin-Free Quantum Chemistry / 229 12.1. Introduction / 229 12.2. The Decomposition of the Antisymmetrizer / 230 12.3. Spin-Free Hamiltonian / 232 12.4. Construction of Spatial Functions $Phi _i k^nu $ / 233 12.5. Invariance Group of the Primitive Ket / 234 12.6. The Coset Representation Generated by the Invariance Group / 235 12.6.1. Decomposition of the Vector Space $V(phi )$ / 237 12.6.2. Factorization of the Secular Equations / 239 12.7. Construction of the Invariant Subspaces by Means of the Orthogonal Units / 240 12.7.1. The Immanant Function / 240 12.7.2. The Antisymmetric Space Spin Counterpart of the Immanant / 244 12.8. Structure Projections / 246 12.8.1. The Pair Diagram / 246 12.8.2. The Pair Operators / 247 12.8.3. Construction of Spin-Free Pair Functions / 250 12.8.4. Pair Projections in the Function Space / 250 12.8.5. Spin-Free Exclusion Principle / 251 12.9. Matrix Elements of the Hamiltonian over the Structure Projections / 252 12.10. Spin-Free Counterpart of the Projected Function / 256 12.11. Gallup's Formulation of Spin-Free Quantum Chemistry / 259 12.12. Calculation of Pauling Numbers / 263 References / 265 13. Matrix Elements of the Hamiltonian and the Representation of the Unitary Group / 267 13.1. Introduction / 267 13.2. Formulation of the Hamiltonian / 267 13.3. Basic Notions about the Unitary Group / 270 13.4. Irreducible Representations of the Unitary Group / 272 13.4.1. The Gel'fand--Tsetlin Representation of the Generator Algebra / 273 13.4.2. Group-Theoretical Meaning of the Gel'fand Pattern / 275 13.5. The Representation Matrices of $E_i j$'s / 275 13.5.1. The Diagonal Generators $E_i i$ / 276 13.5.2. The Raising Generators $E_i j (i < j)$ / 277 13.5.3. The Lowering Generators $E_j i (i < j)$ / 278 13.5.4. Gel'fand--Tsetlin Formula for the Matrix of $E_i, i + 1$ / 278 13.6. Weyl Tableaux / 280 13.7. The $N$th-Rank Tensor Space and Its Decomposition into Invariant Subspaces / 282 13.8. Exclusion Principle and Gel'fand States / 286 13.9. Matrix Elements of the Generators for Paldus Tableaux / 289 13.9.1. Basis Generation / 289 13.9.2. Matrix Elements of the Generators / 290 13.10. Matrix Element of the Generators; Downward-Robb Algorithm / 291 13.10.1. Basis Generation / 292 13.10.2. Eigenvalues of the Diagonal Generators / 297 13.10.3. Generators $E_i j$ / 297 13.11. Graphical Representation of the Basis Functions; Relation to the Configuration Interaction Method / 298 References / 299 Appendix 1. Some Basic Algebraic Notions / 301 A.1.1. Introduction / 301 A.1.2. Frobenius or Group Algebra; Convolution Algebra / 301 A.1.2.1. Invariant Mean / 302 A.1.2.2. Frobenius or Group Algebra / 302 A.1.2.3. Convolution Algebra / 303 A.1.3. Some Algebraic Notions / 303 A.1.4. The Centrum of the Algebra / 304 A.1.5. Irreducible Representations; Schur's Lemma / 309 A.1.6. The Matric Basis / 310 A.1.7. Symmetry Adaptation / 314 A.1.8. Wigner--Eckart Theorem / 315 References / 316 Appendix 2. The Coset Representation / 317 A.2.1. Introduction / 317 A.2.2. The Character of an Element $g$ in the Coset Representation / 318 Appendix 3. Double Coset / 321 A.3.1. The Double Coset Decomposition / 321 A.3.2. The Number of Elements in a Double Coset / 323 Appendix 4. The Method of Spinor Invariants / 325 A.4.1. Spinors and Their Transformation Properties / 325 A.4.2. The Method of Spinor Invariants / 326 A.4.3. Construction of the Genealogical Spin Functions by the Method of Spinor Invariants / 326 A.4.4. Normalization Factors / 327 A.4.5. Construction of the Serber Functions by the Method of Spinor Invariants / 329 A.4.6. Singlet Functions as Spinor Invariants / 332 References / 332 Appendix 5. Construction of Total Wave Functions That Are Eigenfunctions of $S^2$ by the Method of Second Quantization / 333 A.5.1. The Formalism of Second Quantization / 333 A.5.2. Representation of the Spin Operators in the Second-Quantization Formalism / 335 A.5.3. Review of the Papers That Use the Second-Quantization Formalism for the Construction of Spin Eigenfunctions / 336 A.5.3.1. Genealogical Construction / 336 A.5.3.2. Projection Operator Method / 337 A.5.3.3. Valence Bond Method / 337 A.5.3.4. The Occupation-Branching-Number Representation / 337 References / 338 Appendix 6. Table of Sanibel Coefficients / 339 Reference / 341 Bibliography / 343 Author Index / 363 Subject Index 367

rawTOC:
1. Introduction / 1 \\ 1.1. Electronic States with Definite Multiplicities / 1 \\ 1.2. Basic Facts with Respect to the Spin / 4 \\ 1.3. Spin Operators and Functions for One Electron / 5 \\ 1.4. Addition Theorem of Angular Momenta / 7 \\ References / 8 \\ 2: Construction of Spin Eigenfunctions from the Products of One-Electron Spin Functions / 9 \\ 2.1. The Resultant Spin Operator and the Dirac Identity / 9 \\ 2.2. Eigenfunctions of $S_z$ / 11 \\ 2.3. Construction of $S^2$ Eigenfunctions by the Diagonalization of the $S^2$ Matrix / 14 \\ 2.4. Construction of $S^2$ Eigenfunctions by the Orthogonalization Procedure / 16 \\ 2.5. Dimension of the Spin Degeneracy / 17 \\ 2.6. Genealogical Construction of Spin Eigenfunctions / 19 \\ 2.7. Branching Diagram / 21 \\ 2.8. Orthogonality of the Branching -Diagram Functions / 22 \\ 2.9. Special Properties of the Branching-Diagram Functions / 23 \\ 2.10. Ordering of the Primitive Spin Functions; the Path Diagram / 25 \\ 2.11. Expression for $X(N, S, S; 1)$ / 28 \\ 2.12. Expression for $X(N, S, S; f)$ / 29 \\ 2.13. The Coefficient of a Primitive Spin Function in a Given Branching-Diagram Function / 30 \\ References / 32 \\ 3. Construction of Spin Eigenfunctions from the Products of Two-Electron Spin Eigenfunctions / 33 \\ 3.1. Serber-Type Construction of Spin Eigenfunctions / 33 \\ 3.2. Formulas for the Serber Construction / 34 \\ 3.3. Geminal Spin Product Functions; Serber Path Diagram / 36 \\ 3.4. Special Properties of the Serber Functions / 38 \\ 3.5. The Coefficient of a Geminal Product Function in a Given Serber Function / 41 \\ 3.6. The Algorithm of Carrington and Doggett / 43 \\ 3.7. Construction of Serber-Type Functions by Direct Diagonalization of the $S^2$ Matrix / 43 \\ 3.7.1. $S^2$ Matrix for an Even Number of Electrons / 44 \\ 3.7.2. $S^2$ Matrix for an Odd Number of Electrons / 45 \\ 3.8. Construction of Spin Eigenfunctions from Those of Two Subsystems / 46 \\ References / 48 \\ 4. Construction of Spin Eigenfunctions by the Projection Operator Method / 49 \\ 4.1. Projection Operator Method / 49 \\ 4.1.1. Trial Function / 49 \\ 4.1.2. The Projection Operator / 50 \\ 4.2. The Projection of the First Primitive Function / 52 \\ 4.3. The Projection of an Arbitrary Primitive Spin Function / 56 \\ 4.4. The Choice of Spin Functions Whose Projections Are Linearly Independent / 56 \\ 4.5. Relation between the Projected Functions and the Branching-Diagram Functions / 60 \\ 4.6. Projected Functions for $S > M$; Sanibel Coefficients / 61 \\ 4.7. Sasaki and Ohno's Derivation of the Sanibel Coefficients / 63 \\ 4.8. Derivation of the Sanibel Coefficients from the Vector-Coupling Coefficients / 67 \\ 4.9. Sanibel Coefficients by the Group Theoretical Projection Operator Method / 68 \\ 4.10. The Construction of Serber-Type Functions by the Projection Operator Method / 71 \\ 4.11. The Overlap Matrix of the Projected Spin Functions / 74 \\ References / 75 \\ 5. Spin-Paired Spin Eigenfunctions / 77 \\ 5.1. Spin-Paired Spin Eigenfunctions / 77 \\ 5.2. Extended Rumer Diagrams / 79 \\ 5.3. Linear Independence of Extended Rumer Functions / 80 \\ 5.4. The Relation between Rumer Functions and Branching-Diagram Functions / 82 \\ 5.5. The Relation between Rumer Functions and Serber-Type Functions / 83 \\ 5.6. Matrix Elements between the Spin-Paired Functions / 86 \\ 5.6.1. Islands / 87 \\ 5.6.2 O Chain / 87 \\ 5.6.3 E Chain / 88 \\ References / 89 \\ 6. Basic Notions of the Theory of the Symmetric Group / 91 \\ 6.1. Introduction / 91 \\ 6.2. Permutations; Cyclic Structure / 91 \\ 6.3. Young Frames; Young Tableaux / 96 \\ 6.4. The Symmetric Group Algebra: Young Operators / 97 \\ 6.4.1. Young Operators / 99 \\ 6.4.2. Ordering of the Standard Tableaux / 100 \\ 6.4.3. Yamanouchi Symbol / 100 \\ 6.4.4. The Young Operator $E_{r s}^\alpha$ / 103 \\ 6.4.5. Alternative Definition or the Young Operators / 105 \\ 6.5. Representations of the Symmetric Group / 106 \\ 6.5.1. Young's Orthogonal Representation / 106 \\ 6.5.2. Young's Natural Representation / 107 \\ 6.6. Matric Basis of the Symmetric Group Algebra / 109 \\ 6.6.1. Calculation of the Characters of the Symmetric Group / 111 \\ 6.6.2. Matsen's Method for the Construction of Matric Units / 112 \\ 6.6.3. Salmon's Method for the Construction of Matric Units / 114 \\ References / 115 \\ 7. Representations of the Symmetric Group Generated by the Spin Eigenfunctions / 117 \\ 7.1. Introduction / 117 \\ 7.2. The Genealogical Spin Functions Generate a Representation of the Symmetric Group / 117 \\ 7.3. Recursive Construction of the Representation Matrices: Yamanouchi--Kotani Method / 120 \\ 7.3.1. Permutations That Do Not Affect the Last Number $N$ / 120 \\ 7.3.2. The Transposition $(N - 1, N)$ / 122 \\ 7.4. Relation between the Yamanouchi--Kotani Representation and the Young Orthogonal Representation / 124 \\ 7.4.1. Dimension of the Representation / 124 \\ 7.4.2. One-to-One Correspondence between the Young Tableaux and Branching-Diagram Functions / 125 \\ 7.4.3. Identity of the Young Orthogonal and the Yamanouchi--Kotani Representation / 126 \\ 7.5. Construction of the Spin Functions from the Representation Matrices / 129 \\ 7.6. Construction of the Branching-Diagram Functions by Use of the Matric Units / 131 \\ 7.6.1. Conditions for Nonvanishing $e_{i i}^\alpha \theta$ / 133 \\ 7.6.2. The Character Projection Operator / 134 \\ 7.6.3. Construction of the Branching-Diagram Functions by Use of the Matric Units; Salmon's Procedure / 136 \\ 7.7. Representation of the Symmetric Group Generated by the Serber-Type Spin Functions / 138 \\ 7.7.1. Direct Method for the Calculation of the Representation Matrix / 138 \\ 7.7.2. Recursive Calculation of the Representation Matrix / 139 \\ 7.8. The Relation between the Serber and the Young--Yamanouchi Representations. / 141 \\ 7.8.1. The Transformation Matrix / 141 \\ 7.8.2. Recursive Construction of the Transformation Matrix / 142 \\ 7.9. Matric Basis of the Serber Representation / 145 \\ 7.10. Representation Generated by the Spin-Coupled Functions / 147 \\ 7.11. Relation between the Young--Yamanouchi and the Reduced Representations / 149 \\ References / 151 \\ 8. Representations of the Symmetric Group Generated by the Projected Spin Functions and Valence Bond Functions / 153 \\ 8.1. Introduction / 153 \\ 8.2. Representation Generated by the Projected Spin Functions / 153 \\ 8.3. Construction of the Projected Spin Functions by the Use of the Young Operator / 156 \\ 8.4. Construction of the Projected Spin Functions by the Character Projection Operator / 158 \\ 8.5. Representation Generated by the Rumer Functions / 159 \\ 8.6. Construction of the Spin-Paired Functions from the Alternative Young Operators / 160 \\ 8.7. The Linear Independence of $V_f$'s and Their Relation to the Genealogical Functions / 162 \\ References / 163 \\ 9. Combination of Spatial and Spin Functions; Calculation of the Matrix Elements of Operators / 165 \\ 9.1. Introduction / 165 \\ 9.2. Construction of Antisymmetric Wave Function / 165 \\ 9.3. Separation of $\Psi_i$ into Spatial and Spin Functions / 168 \\ 9.4. The Spatial Functions $\Phi_{j,i}^S$ Generate a Representation of $S_N$ / 169 \\ 9.5. Calculation of the Matrix Elements of the Hamiltonian / 172 \\ 9.6. Computational Aspects of the Basic Formulas / 175 \\ 9.7. The Form of the Spatial Function $\Phi$ / 177 \\ References / 179 \\ 10. Calculation of the Matrix Elements of the Hamiltonian; Orthogonal Spin Functions / 181 \\ 10.1. Introduction / 181 \\ 10.2. Spatial Functions with a Number of Doubly Occupied Orbitals; Branching-Diagram Spin Functions / 181 \\ 10.3. Calculation of the Energy Matrix / 185 \\ 10.3.1. Alternative Method for the Calculation of the Invariant Part / 189 \\ 10.3.2. Calculation of the Energy Matrix for the Case of Orthogonal Orbitals / 189 \\ 10.4. Matrix Elements of the Hamiltonian for Serber-Type Spin Functions 1 / 92 \\ 10.4.1. Notation for the Spatial Functions / 192 \\ 10.4.2. Geminal Spin Harmonics / 192 \\ 10.4.3. Normalization Integral / 193 \\ 10.4.4. The Lineup Permutation / 194 \\ 10.4.5. The Wave Functions Form an Orthonormal Set / 194 \\ 10.4.6. The Form of the Hamiltonian / 195 \\ 10.4.7. Reduction of the Sum over the Permutations / 196 \\ 10.4.8. Reduction of the Sum over Electron Pairs / 197 \\ 10.4.9. Matrix Elements of the Hamiltonian / 198 \\ 10.5. Calculation of the Matrix Elements of the Hamiltonian for Spin-Coupled Wave Functions / 200 \\ 10.6. Calculation of the Energy for a Single Configuration / 203 \\ 10.6.1. One-Electron Operators / 203 \\ 10.6.2. Two-Electron Operators / 205 \\ References / 207 \\ 11. Calculation of the Matrix Elements of the Hamiltonian; Nonorthogonal Spin Functions / 209 \\ 11.1. Introduction / 209 \\ 11.2. A Single Configuration; Projected Spin Function / 209 \\ 11.3. Different Orbitals for Different Spins / 211 \\ 11.3.1. Alternant Molecular Orbitals / 212 \\ 11.3.2. Calculation of the Normalization Integral / 212 \\ 11.4. Many-Configuration Wave Function; Projection Operator Method / 213 \\ 11.4.1. The Reference Permutation / 214 \\ 11.4.2. Summation over the Subgroup $S_v$ / 215 \\ 11.4.3. The Spatial Integrals / 216 \\ 11.4.4. Matrix Elements / 217 \\ 11.5. Many-Configuration Wave Function; Bonded Functions / 219 \\ 11.5.1. The Matching Rearrangement / 220 \\ 11.5.2. The Effect of Double Occupancy / 220 \\ 11.5.3. Matrix Elements of the Spin Functions / 221 \\ 11.5.4. Matrix Elements of the Transpositions / 222 \\ 11.5.5. Matrix Element of the Hamiltonian between Two Functions / 223 \\ 11.5.6. Matrix Elements in Terms of Bonded Functions / 224 \\ References / 227 \\ 12. Spin-Free Quantum Chemistry / 229 \\ 12.1. Introduction / 229 \\ 12.2. The Decomposition of the Antisymmetrizer / 230 \\ 12.3. Spin-Free Hamiltonian / 232 \\ 12.4. Construction of Spatial Functions $\Phi_{i k}^\nu$ / 233 \\ 12.5. Invariance Group of the Primitive Ket / 234 \\ 12.6. The Coset Representation Generated by the Invariance Group / 235 \\ 12.6.1. Decomposition of the Vector Space $V(\phi)$ / 237 \\ 12.6.2. Factorization of the Secular Equations / 239 \\ 12.7. Construction of the Invariant Subspaces by Means of the Orthogonal Units / 240 \\ 12.7.1. The Immanant Function / 240 \\ 12.7.2. The Antisymmetric Space Spin Counterpart of the Immanant / 244 \\ 12.8. Structure Projections / 246 \\ 12.8.1. The Pair Diagram / 246 \\ 12.8.2. The Pair Operators / 247 \\ 12.8.3. Construction of Spin-Free Pair Functions / 250 \\ 12.8.4. Pair Projections in the Function Space / 250 \\ 12.8.5. Spin-Free Exclusion Principle / 251 \\ 12.9. Matrix Elements of the Hamiltonian over the Structure Projections / 252 \\ 12.10. Spin-Free Counterpart of the Projected Function / 256 \\ 12.11. Gallup's Formulation of Spin-Free Quantum Chemistry / 259 \\ 12.12. Calculation of Pauling Numbers / 263 \\ References / 265 \\ 13. Matrix Elements of the Hamiltonian and the Representation of the Unitary Group / 267 \\ 13.1. Introduction / 267 \\ 13.2. Formulation of the Hamiltonian / 267 \\ 13.3. Basic Notions about the Unitary Group / 270 \\ 13.4. Irreducible Representations of the Unitary Group / 272 \\ 13.4.1. The Gel'fand--Tsetlin Representation of the Generator Algebra / 273 \\ 13.4.2. Group-Theoretical Meaning of the Gel'fand Pattern / 275 \\ 13.5. The Representation Matrices of $E_{i j}$'s / 275 \\ 13.5.1. The Diagonal Generators $E_{i i}$ / 276 \\ 13.5.2. The Raising Generators $E_{i j} (i < j)$ / 277 \\ 13.5.3. The Lowering Generators $E_{j i} (i < j)$ / 278 \\ 13.5.4. Gel'fand--Tsetlin Formula for the Matrix of $E_{i, i + 1}$ / 278 \\ 13.6. Weyl Tableaux / 280 \\ 13.7. The $N$th-Rank Tensor Space and Its Decomposition into Invariant Subspaces / 282 \\ 13.8. Exclusion Principle and Gel'fand States / 286 \\ 13.9. Matrix Elements of the Generators for Paldus Tableaux / 289 \\ 13.9.1. Basis Generation / 289 \\ 13.9.2. Matrix Elements of the Generators / 290 \\ 13.10. Matrix Element of the Generators; Downward-Robb Algorithm / 291 \\ 13.10.1. Basis Generation / 292 \\ 13.10.2. Eigenvalues of the Diagonal Generators / 297 \\ 13.10.3. Generators $E_{i j}$ / 297 \\ 13.11. Graphical Representation of the Basis Functions; Relation to the Configuration Interaction Method / 298 \\ References / 299 \\ Appendix 1. Some Basic Algebraic Notions / 301 \\ A.1.1. Introduction / 301 \\ A.1.2. Frobenius or Group Algebra; Convolution Algebra / 301 \\ A.1.2.1. Invariant Mean / 302 \\ A.1.2.2. Frobenius or Group Algebra / 302 \\ A.1.2.3. Convolution Algebra / 303 \\ A.1.3. Some Algebraic Notions / 303 \\ A.1.4. The Centrum of the Algebra / 304 \\ A.1.5. Irreducible Representations; Schur's Lemma / 309 \\ A.1.6. The Matric Basis / 310 \\ A.1.7. Symmetry Adaptation / 314 \\ A.1.8. Wigner--Eckart Theorem / 315 \\ References / 316 \\ Appendix 2. The Coset Representation / 317 \\ A.2.1. Introduction / 317 \\ A.2.2. The Character of an Element $g$ in the Coset Representation / 318 \\ Appendix 3. Double Coset / 321 \\ A.3.1. The Double Coset Decomposition / 321 \\ A.3.2. The Number of Elements in a Double Coset / 323 \\ Appendix 4. The Method of Spinor Invariants / 325 \\ A.4.1. Spinors and Their Transformation Properties / 325 \\ A.4.2. The Method of Spinor Invariants / 326 \\ A.4.3. Construction of the Genealogical Spin Functions by the Method of Spinor Invariants / 326 \\ A.4.4. Normalization Factors / 327 \\ A.4.5. Construction of the Serber Functions by the Method of Spinor Invariants / 329 \\ A.4.6. Singlet Functions as Spinor Invariants / 332 \\ References / 332 \\ Appendix 5. Construction of Total Wave Functions That Are Eigenfunctions of $S^2$ by the Method of Second Quantization / 333 \\ A.5.1. The Formalism of Second Quantization / 333 \\ A.5.2. Representation of the Spin Operators in the Second-Quantization Formalism / 335 \\ A.5.3. Review of the Papers That Use the Second-Quantization Formalism for the Construction of Spin Eigenfunctions / 336 \\ A.5.3.1. Genealogical Construction / 336 \\ A.5.3.2. Projection Operator Method / 337 \\ A.5.3.3. Valence Bond Method / 337 \\ A.5.3.4. The Occupation-Branching-Number Representation / 337 \\ References / 338 \\ Appendix 6. Table of Sanibel Coefficients / 339 \\ Reference / 341 \\ Bibliography / 343 \\ Author Index / 363 \\ Subject Index 367

entry:
@Book{Pauncz:1979:SEC,
  author =       "Ruben Pauncz",
  title =        "Spin Eigenfunctions: Construction and Use",
  publisher =    pub-PLENUM,
  address =      pub-PLENUM:adr,
  pages =        "xv + 370",
  year =         "1979",
  ISBN =         "0-306-40141-X",
  ISBN-13 =      "978-0-306-40141-1",
  LCCN =         "QD462.P38",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ijqc1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "1. Introduction / 1 \\
                 1.1. Electronic States with Definite Multiplicities / 1
                 \\
                 1.2. Basic Facts with Respect to the Spin / 4 \\
                 1.3. Spin Operators and Functions for One Electron / 5
                 \\
                 1.4. Addition Theorem of Angular Momenta / 7 \\
                 References / 8 \\
                 2: Construction of Spin Eigenfunctions from the
                 Products of One-Electron Spin Functions / 9 \\
                 2.1. The Resultant Spin Operator and the Dirac Identity
                 / 9 \\
                 2.2. Eigenfunctions of $S_z$ / 11 \\
                 2.3. Construction of $S^2$ Eigenfunctions by the
                 Diagonalization of the $S^2$ Matrix / 14 \\
                 2.4. Construction of $S^2$ Eigenfunctions by the
                 Orthogonalization Procedure / 16 \\
                 2.5. Dimension of the Spin Degeneracy / 17 \\
                 2.6. Genealogical Construction of Spin Eigenfunctions /
                 19 \\
                 2.7. Branching Diagram / 21 \\
                 2.8. Orthogonality of the Branching -Diagram Functions
                 / 22 \\
                 2.9. Special Properties of the Branching-Diagram
                 Functions / 23 \\
                 2.10. Ordering of the Primitive Spin Functions; the
                 Path Diagram / 25 \\
                 2.11. Expression for $X(N, S, S; 1)$ / 28 \\
                 2.12. Expression for $X(N, S, S; f)$ / 29 \\
                 2.13. The Coefficient of a Primitive Spin Function in a
                 Given Branching-Diagram Function / 30 \\
                 References / 32 \\
                 3. Construction of Spin Eigenfunctions from the
                 Products of Two-Electron Spin Eigenfunctions / 33 \\
                 3.1. Serber-Type Construction of Spin Eigenfunctions /
                 33 \\
                 3.2. Formulas for the Serber Construction / 34 \\
                 3.3. Geminal Spin Product Functions; Serber Path
                 Diagram / 36 \\
                 3.4. Special Properties of the Serber Functions / 38
                 \\
                 3.5. The Coefficient of a Geminal Product Function in a
                 Given Serber Function / 41 \\
                 3.6. The Algorithm of Carrington and Doggett / 43 \\
                 3.7. Construction of Serber-Type Functions by Direct
                 Diagonalization of the $S^2$ Matrix / 43 \\
                 3.7.1. $S^2$ Matrix for an Even Number of Electrons /
                 44 \\
                 3.7.2. $S^2$ Matrix for an Odd Number of Electrons / 45
                 \\
                 3.8. Construction of Spin Eigenfunctions from Those of
                 Two Subsystems / 46 \\
                 References / 48 \\
                 4. Construction of Spin Eigenfunctions by the
                 Projection Operator Method / 49 \\
                 4.1. Projection Operator Method / 49 \\
                 4.1.1. Trial Function / 49 \\
                 4.1.2. The Projection Operator / 50 \\
                 4.2. The Projection of the First Primitive Function /
                 52 \\
                 4.3. The Projection of an Arbitrary Primitive Spin
                 Function / 56 \\
                 4.4. The Choice of Spin Functions Whose Projections Are
                 Linearly Independent / 56 \\
                 4.5. Relation between the Projected Functions and the
                 Branching-Diagram Functions / 60 \\
                 4.6. Projected Functions for $S > M$; Sanibel
                 Coefficients / 61 \\
                 4.7. Sasaki and Ohno's Derivation of the Sanibel
                 Coefficients / 63 \\
                 4.8. Derivation of the Sanibel Coefficients from the
                 Vector-Coupling Coefficients / 67 \\
                 4.9. Sanibel Coefficients by the Group Theoretical
                 Projection Operator Method / 68 \\
                 4.10. The Construction of Serber-Type Functions by the
                 Projection Operator Method / 71 \\
                 4.11. The Overlap Matrix of the Projected Spin
                 Functions / 74 \\
                 References / 75 \\
                 5. Spin-Paired Spin Eigenfunctions / 77 \\
                 5.1. Spin-Paired Spin Eigenfunctions / 77 \\
                 5.2. Extended Rumer Diagrams / 79 \\
                 5.3. Linear Independence of Extended Rumer Functions /
                 80 \\
                 5.4. The Relation between Rumer Functions and
                 Branching-Diagram Functions / 82 \\
                 5.5. The Relation between Rumer Functions and
                 Serber-Type Functions / 83 \\
                 5.6. Matrix Elements between the Spin-Paired Functions
                 / 86 \\
                 5.6.1. Islands / 87 \\
                 5.6.2 O Chain / 87 \\
                 5.6.3 E Chain / 88 \\
                 References / 89 \\
                 6. Basic Notions of the Theory of the Symmetric Group /
                 91 \\
                 6.1. Introduction / 91 \\
                 6.2. Permutations; Cyclic Structure / 91 \\
                 6.3. Young Frames; Young Tableaux / 96 \\
                 6.4. The Symmetric Group Algebra: Young Operators / 97
                 \\
                 6.4.1. Young Operators / 99 \\
                 6.4.2. Ordering of the Standard Tableaux / 100 \\
                 6.4.3. Yamanouchi Symbol / 100 \\
                 6.4.4. The Young Operator $E_{r s}^\alpha$ / 103 \\
                 6.4.5. Alternative Definition or the Young Operators /
                 105 \\
                 6.5. Representations of the Symmetric Group / 106 \\
                 6.5.1. Young's Orthogonal Representation / 106 \\
                 6.5.2. Young's Natural Representation / 107 \\
                 6.6. Matric Basis of the Symmetric Group Algebra / 109
                 \\
                 6.6.1. Calculation of the Characters of the Symmetric
                 Group / 111 \\
                 6.6.2. Matsen's Method for the Construction of Matric
                 Units / 112 \\
                 6.6.3. Salmon's Method for the Construction of Matric
                 Units / 114 \\
                 References / 115 \\
                 7. Representations of the Symmetric Group Generated by
                 the Spin Eigenfunctions / 117 \\
                 7.1. Introduction / 117 \\
                 7.2. The Genealogical Spin Functions Generate a
                 Representation of the Symmetric Group / 117 \\
                 7.3. Recursive Construction of the Representation
                 Matrices: Yamanouchi--Kotani Method / 120 \\
                 7.3.1. Permutations That Do Not Affect the Last Number
                 $N$ / 120 \\
                 7.3.2. The Transposition $(N - 1, N)$ / 122 \\
                 7.4. Relation between the Yamanouchi--Kotani
                 Representation and the Young Orthogonal Representation
                 / 124 \\
                 7.4.1. Dimension of the Representation / 124 \\
                 7.4.2. One-to-One Correspondence between the Young
                 Tableaux and Branching-Diagram Functions / 125 \\
                 7.4.3. Identity of the Young Orthogonal and the
                 Yamanouchi--Kotani Representation / 126 \\
                 7.5. Construction of the Spin Functions from the
                 Representation Matrices / 129 \\
                 7.6. Construction of the Branching-Diagram Functions by
                 Use of the Matric Units / 131 \\
                 7.6.1. Conditions for Nonvanishing $e_{i i}^\alpha
                 \theta$ / 133 \\
                 7.6.2. The Character Projection Operator / 134 \\
                 7.6.3. Construction of the Branching-Diagram Functions
                 by Use of the Matric Units; Salmon's Procedure / 136
                 \\
                 7.7. Representation of the Symmetric Group Generated by
                 the Serber-Type Spin Functions / 138 \\
                 7.7.1. Direct Method for the Calculation of the
                 Representation Matrix / 138 \\
                 7.7.2. Recursive Calculation of the Representation
                 Matrix / 139 \\
                 7.8. The Relation between the Serber and the
                 Young--Yamanouchi Representations. / 141 \\
                 7.8.1. The Transformation Matrix / 141 \\
                 7.8.2. Recursive Construction of the Transformation
                 Matrix / 142 \\
                 7.9. Matric Basis of the Serber Representation / 145
                 \\
                 7.10. Representation Generated by the Spin-Coupled
                 Functions / 147 \\
                 7.11. Relation between the Young--Yamanouchi and the
                 Reduced Representations / 149 \\
                 References / 151 \\
                 8. Representations of the Symmetric Group Generated by
                 the Projected Spin Functions and Valence Bond Functions
                 / 153 \\
                 8.1. Introduction / 153 \\
                 8.2. Representation Generated by the Projected Spin
                 Functions / 153 \\
                 8.3. Construction of the Projected Spin Functions by
                 the Use of the Young Operator / 156 \\
                 8.4. Construction of the Projected Spin Functions by
                 the Character Projection Operator / 158 \\
                 8.5. Representation Generated by the Rumer Functions /
                 159 \\
                 8.6. Construction of the Spin-Paired Functions from the
                 Alternative Young Operators / 160 \\
                 8.7. The Linear Independence of $V_f$'s and Their
                 Relation to the Genealogical Functions / 162 \\
                 References / 163 \\
                 9. Combination of Spatial and Spin Functions;
                 Calculation of the Matrix Elements of Operators / 165
                 \\
                 9.1. Introduction / 165 \\
                 9.2. Construction of Antisymmetric Wave Function / 165
                 \\
                 9.3. Separation of $\Psi_i$ into Spatial and Spin
                 Functions / 168 \\
                 9.4. The Spatial Functions $\Phi_{j,i}^S$ Generate a
                 Representation of $S_N$ / 169 \\
                 9.5. Calculation of the Matrix Elements of the
                 Hamiltonian / 172 \\
                 9.6. Computational Aspects of the Basic Formulas / 175
                 \\
                 9.7. The Form of the Spatial Function $\Phi$ / 177 \\
                 References / 179 \\
                 10. Calculation of the Matrix Elements of the
                 Hamiltonian; Orthogonal Spin Functions / 181 \\
                 10.1. Introduction / 181 \\
                 10.2. Spatial Functions with a Number of Doubly
                 Occupied Orbitals; Branching-Diagram Spin Functions /
                 181 \\
                 10.3. Calculation of the Energy Matrix / 185 \\
                 10.3.1. Alternative Method for the Calculation of the
                 Invariant Part / 189 \\
                 10.3.2. Calculation of the Energy Matrix for the Case
                 of Orthogonal Orbitals / 189 \\
                 10.4. Matrix Elements of the Hamiltonian for
                 Serber-Type Spin Functions 1 / 92 \\
                 10.4.1. Notation for the Spatial Functions / 192 \\
                 10.4.2. Geminal Spin Harmonics / 192 \\
                 10.4.3. Normalization Integral / 193 \\
                 10.4.4. The Lineup Permutation / 194 \\
                 10.4.5. The Wave Functions Form an Orthonormal Set /
                 194 \\
                 10.4.6. The Form of the Hamiltonian / 195 \\
                 10.4.7. Reduction of the Sum over the Permutations /
                 196 \\
                 10.4.8. Reduction of the Sum over Electron Pairs / 197
                 \\
                 10.4.9. Matrix Elements of the Hamiltonian / 198 \\
                 10.5. Calculation of the Matrix Elements of the
                 Hamiltonian for Spin-Coupled Wave Functions / 200 \\
                 10.6. Calculation of the Energy for a Single
                 Configuration / 203 \\
                 10.6.1. One-Electron Operators / 203 \\
                 10.6.2. Two-Electron Operators / 205 \\
                 References / 207 \\
                 11. Calculation of the Matrix Elements of the
                 Hamiltonian; Nonorthogonal Spin Functions / 209 \\
                 11.1. Introduction / 209 \\
                 11.2. A Single Configuration; Projected Spin Function /
                 209 \\
                 11.3. Different Orbitals for Different Spins / 211 \\
                 11.3.1. Alternant Molecular Orbitals / 212 \\
                 11.3.2. Calculation of the Normalization Integral / 212
                 \\
                 11.4. Many-Configuration Wave Function; Projection
                 Operator Method / 213 \\
                 11.4.1. The Reference Permutation / 214 \\
                 11.4.2. Summation over the Subgroup $S_v$ / 215 \\
                 11.4.3. The Spatial Integrals / 216 \\
                 11.4.4. Matrix Elements / 217 \\
                 11.5. Many-Configuration Wave Function; Bonded
                 Functions / 219 \\
                 11.5.1. The Matching Rearrangement / 220 \\
                 11.5.2. The Effect of Double Occupancy / 220 \\
                 11.5.3. Matrix Elements of the Spin Functions / 221 \\
                 11.5.4. Matrix Elements of the Transpositions / 222 \\
                 11.5.5. Matrix Element of the Hamiltonian between Two
                 Functions / 223 \\
                 11.5.6. Matrix Elements in Terms of Bonded Functions /
                 224 \\
                 References / 227 \\
                 12. Spin-Free Quantum Chemistry / 229 \\
                 12.1. Introduction / 229 \\
                 12.2. The Decomposition of the Antisymmetrizer / 230
                 \\
                 12.3. Spin-Free Hamiltonian / 232 \\
                 12.4. Construction of Spatial Functions $\Phi_{i
                 k}^\nu$ / 233 \\
                 12.5. Invariance Group of the Primitive Ket / 234 \\
                 12.6. The Coset Representation Generated by the
                 Invariance Group / 235 \\
                 12.6.1. Decomposition of the Vector Space $V(\phi)$ /
                 237 \\
                 12.6.2. Factorization of the Secular Equations / 239
                 \\
                 12.7. Construction of the Invariant Subspaces by Means
                 of the Orthogonal Units / 240 \\
                 12.7.1. The Immanant Function / 240 \\
                 12.7.2. The Antisymmetric Space Spin Counterpart of the
                 Immanant / 244 \\
                 12.8. Structure Projections / 246 \\
                 12.8.1. The Pair Diagram / 246 \\
                 12.8.2. The Pair Operators / 247 \\
                 12.8.3. Construction of Spin-Free Pair Functions / 250
                 \\
                 12.8.4. Pair Projections in the Function Space / 250
                 \\
                 12.8.5. Spin-Free Exclusion Principle / 251 \\
                 12.9. Matrix Elements of the Hamiltonian over the
                 Structure Projections / 252 \\
                 12.10. Spin-Free Counterpart of the Projected Function
                 / 256 \\
                 12.11. Gallup's Formulation of Spin-Free Quantum
                 Chemistry / 259 \\
                 12.12. Calculation of Pauling Numbers / 263 \\
                 References / 265 \\
                 13. Matrix Elements of the Hamiltonian and the
                 Representation of the Unitary Group / 267 \\
                 13.1. Introduction / 267 \\
                 13.2. Formulation of the Hamiltonian / 267 \\
                 13.3. Basic Notions about the Unitary Group / 270 \\
                 13.4. Irreducible Representations of the Unitary Group
                 / 272 \\
                 13.4.1. The Gel'fand--Tsetlin Representation of the
                 Generator Algebra / 273 \\
                 13.4.2. Group-Theoretical Meaning of the Gel'fand
                 Pattern / 275 \\
                 13.5. The Representation Matrices of $E_{i j}$'s / 275
                 \\
                 13.5.1. The Diagonal Generators $E_{i i}$ / 276 \\
                 13.5.2. The Raising Generators $E_{i j} (i < j)$ / 277
                 \\
                 13.5.3. The Lowering Generators $E_{j i} (i < j)$ / 278
                 \\
                 13.5.4. Gel'fand--Tsetlin Formula for the Matrix of
                 $E_{i, i + 1}$ / 278 \\
                 13.6. Weyl Tableaux / 280 \\
                 13.7. The $N$th-Rank Tensor Space and Its Decomposition
                 into Invariant Subspaces / 282 \\
                 13.8. Exclusion Principle and Gel'fand States / 286 \\
                 13.9. Matrix Elements of the Generators for Paldus
                 Tableaux / 289 \\
                 13.9.1. Basis Generation / 289 \\
                 13.9.2. Matrix Elements of the Generators / 290 \\
                 13.10. Matrix Element of the Generators; Downward-Robb
                 Algorithm / 291 \\
                 13.10.1. Basis Generation / 292 \\
                 13.10.2. Eigenvalues of the Diagonal Generators / 297
                 \\
                 13.10.3. Generators $E_{i j}$ / 297 \\
                 13.11. Graphical Representation of the Basis Functions;
                 Relation to the Configuration Interaction Method / 298
                 \\
                 References / 299 \\
                 Appendix 1. Some Basic Algebraic Notions / 301 \\
                 A.1.1. Introduction / 301 \\
                 A.1.2. Frobenius or Group Algebra; Convolution Algebra
                 / 301 \\
                 A.1.2.1. Invariant Mean / 302 \\
                 A.1.2.2. Frobenius or Group Algebra / 302 \\
                 A.1.2.3. Convolution Algebra / 303 \\
                 A.1.3. Some Algebraic Notions / 303 \\
                 A.1.4. The Centrum of the Algebra / 304 \\
                 A.1.5. Irreducible Representations; Schur's Lemma / 309
                 \\
                 A.1.6. The Matric Basis / 310 \\
                 A.1.7. Symmetry Adaptation / 314 \\
                 A.1.8. Wigner--Eckart Theorem / 315 \\
                 References / 316 \\
                 Appendix 2. The Coset Representation / 317 \\
                 A.2.1. Introduction / 317 \\
                 A.2.2. The Character of an Element $g$ in the Coset
                 Representation / 318 \\
                 Appendix 3. Double Coset / 321 \\
                 A.3.1. The Double Coset Decomposition / 321 \\
                 A.3.2. The Number of Elements in a Double Coset / 323
                 \\
                 Appendix 4. The Method of Spinor Invariants / 325 \\
                 A.4.1. Spinors and Their Transformation Properties /
                 325 \\
                 A.4.2. The Method of Spinor Invariants / 326 \\
                 A.4.3. Construction of the Genealogical Spin Functions
                 by the Method of Spinor Invariants / 326 \\
                 A.4.4. Normalization Factors / 327 \\
                 A.4.5. Construction of the Serber Functions by the
                 Method of Spinor Invariants / 329 \\
                 A.4.6. Singlet Functions as Spinor Invariants / 332 \\
                 References / 332 \\
                 Appendix 5. Construction of Total Wave Functions That
                 Are Eigenfunctions of $S^2$ by the Method of Second
                 Quantization / 333 \\
                 A.5.1. The Formalism of Second Quantization / 333 \\
                 A.5.2. Representation of the Spin Operators in the
                 Second-Quantization Formalism / 335 \\
                 A.5.3. Review of the Papers That Use the
                 Second-Quantization Formalism for the Construction of
                 Spin Eigenfunctions / 336 \\
                 A.5.3.1. Genealogical Construction / 336 \\
                 A.5.3.2. Projection Operator Method / 337 \\
                 A.5.3.3. Valence Bond Method / 337 \\
                 A.5.3.4. The Occupation-Branching-Number Representation
                 / 337 \\
                 References / 338 \\
                 Appendix 6. Table of Sanibel Coefficients / 339 \\
                 Reference / 341 \\
                 Bibliography / 343 \\
                 Author Index / 363 \\
                 Subject Index 367",
}


bibtype: book
filename: master.bib
label: Pavlidis:1982:AGI
author: Theo Pavlidis
title: Algorithms for Graphics and Image Processing
publisher: pub-CSP
address: pub-CSP:adr
pages: xv + 416
year: 1982
ISBN: 0-914894-65-X OR 091489465X
ISBN13: 978-0-914894-65-0 OR 9780914894650
LCCN: T385 .P38 1982
bibdate: Wed Dec 15 10:40:43 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:40:43 ???
acknowledgement: ack-nhfb
rawauthor: Theo Pavlidis
rawtitle: Algorithms for Graphics and Image Processing
TOC:
Digitization of gray scale images Processing of gray scale images Segmentation Projections Data structures Bilevel pictures Contour filling Thinning algorithms Curve fitting and curve displaying Curve fitting with splines Approximation of curves Surface fitting and surface displaying The mathematics of two-dimensional graphics Polygon clipping The mathematics of three-dimensional graphics Creating three-dimensional graphic displays

rawTOC:
Digitization of gray scale images \\ Processing of gray scale images \\ Segmentation \\ Projections \\ Data structures \\ Bilevel pictures \\ Contour filling \\ Thinning algorithms \\ Curve fitting and curve displaying \\ Curve fitting with splines \\ Approximation of curves \\ Surface fitting and surface displaying \\ The mathematics of two-dimensional graphics \\ Polygon clipping \\ The mathematics of three-dimensional graphics \\ Creating three-dimensional graphic displays

entry:
@Book{Pavlidis:1982:AGI,
  author =       "Theo Pavlidis",
  title =        "Algorithms for Graphics and Image Processing",
  publisher =    pub-CSP,
  address =      pub-CSP:adr,
  pages =        "xv + 416",
  year =         "1982",
  ISBN =         "0-914894-65-X",
  ISBN-13 =      "978-0-914894-65-0",
  LCCN =         "T385 .P38 1982",
  bibdate =      "Wed Dec 15 10:40:43 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Digitization of gray scale images \\
                 Processing of gray scale images \\
                 Segmentation \\
                 Projections \\
                 Data structures \\
                 Bilevel pictures \\
                 Contour filling \\
                 Thinning algorithms \\
                 Curve fitting and curve displaying \\
                 Curve fitting with splines \\
                 Approximation of curves \\
                 Surface fitting and surface displaying \\
                 The mathematics of two-dimensional graphics \\
                 Polygon clipping \\
                 The mathematics of three-dimensional graphics \\
                 Creating three-dimensional graphic displays",
}


bibtype: book
filename: master.bib
label: Pavlidis:1999:FXP
author: Theodosios Pavlidis
title: Fundamentals of X Programming: Graphical User Interfaces and Beyond
publisher: pub-KLUWER
address: pub-KLUWER:adr
pages: xvii + 374
year: 1999
ISBN: 0-306-46065-3 (hardcover), 0-306-46968-5 (e-book) OR 0306460653 (hardcover), 0306469685 (ebook)
LCCN: QA76.76.W56P387 1999
bibdate: Mon May 17 18:13:25 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1999.05.17 18:13:25 ???
URL: http://www.loc.gov/catdir/enhancements/fy0902/98056154-d.html
acknowledgement: ack-nhfb
rawauthor: Theodosios Pavlidis
rawtitle: Fundamentals of {X} Programming: Graphical User Interfaces and Beyond
ISBN13:
978-0-306-46065-4 (hardcover), 978-0-306-46968-8 (e-book) OR 9780306460654 (hardcover), 9780306469688 (ebook)

abstract:
The X is the dominant window system under Unix, and X servers are available for Microsoft Windows, thus enabling graphics over a network in the PC world. This book provides an overview of the X Window System, focusing on characteristics that have significant impact on the development of both application programs and widgets. It pays special attention to applications that go beyond graphical user interfaces (GUIs), such as visualization and imaging programs; issues affecting video games; and designing widgets with a complex appearance. While the book does not assume previous knowledge of X, it is intended for experienced programmers, especially those who want to write programs that go beyond simple GUIs

subject:
X Window System (Computer system); Graphical user interfaces (Computer systems); Computer programming

TOC:
Preface Acknowledgments Table of Contents Software Installation 1: Introduction 1.1: Overview of X 1.2: Highlights of the X Toolkit 1.3: Simplifying X 1.4: Odds and Ends 1.5: Conclusions 1.6: Projects 2: Fundamentals of the X Window System 2.1: Introduction 2.2: Advanced Features of the Window Object in X 2.3: Events 2.4: Window Manager 2.5: Grabbing and Spying 2.6: Conclusions 2.7: Projects 3: Introduction to the X Toolkit 3.1: Widgets 3.2: Using Resources 3.3: Resource Definition 3.4: Conclusions 3.5: Projects 4: Event Handling in the X Toolkit 4.1: Overview 4.2: Event Processing 4.3: Dealing with Nonevent Input 4.4: Entering Text 4.5: Conclusions 4.6: Projects 5: Programming with Widgets 5.1: Widgets as Building Blocks 5.2: Simple Widgets 5.3: Widget Geometry 5.4: Container Widgets 5.5: Shell Widgets and Pop-ups 5.6: Drawing Widgets 5.7: Conclusions 5.8: Projects 6: Constraint and Compound Widgets 6.1: Constraint Widgets 6.2: Compound Widgets 6.3: Transient Menus 6.4: Conclusions 6.5: Projects 7: Text and Dialog Widgets 7.1: Text Widgets 7.2: Text Widget Applications 7.3: Dialog Widgets 7.4: Conclusions 7.5: Projects 8: Drawing Operations 8.1: Basics of Drawing 8.2: Drawing Functions 8.3: Icons, Cursors, and Fonts 8.4: Regions 8.5: Conclusions 8.6: Projects 9: Color and Images 9.1: Overview 9.2: Using Existing Colormaps 9.3: Visuals 9.4: Creating and Using New Colormaps 9.5: Image Structures 9.6: Overlays 9.7: Conclusions 9.8: Projects 10: Selections 10.1: Interclient Communication 10.2: The Gory Details 10.3: Nontext Selections 10.4: Implementation Issues 10.5: Conclusions 10.6: Projects 11: Writing Widgets 11.1: Introduction 11.2: Anatomy of a Widget 11.3: Sketch Widget Implementation 11.4: Conclusions 11.5: Projects 12: Examples of Widget Implementation 12.1: Introduction 12.2: Slider Widget 12.3: Composite Widget 12.4: Conclusions 12.5: Projects Appendix: Software A1: Overview A2: Data Types Used in the Starter Toolkit A3: Functions A4: Resources and Convenience Function of Paper Class Widgets References

rawabstract:
The X is the dominant window system under Unix, and X servers are available for Microsoft Windows, thus enabling graphics over a network in the PC world. This book provides an overview of the X Window System, focusing on characteristics that have significant impact on the development of both application programs and widgets. It pays special attention to applications that go beyond graphical user interfaces (GUIs), such as visualization and imaging programs; issues affecting video games; and designing widgets with a complex appearance. While the book does not assume previous knowledge of X, it is intended for experienced programmers, especially those who want to write programs that go beyond simple GUIs

shortTOC:
1: Introduction 2: Fundamentals of the X Window System 3: Introduction to the X Toolkit 4: Event Handling in the X Toolkit 5: Programming with Widgets 6: Constraint and Compound Widgets 7: Text and Dialog Widgets 8: Drawing Operations 9: Color and Images 10: Selections 11: Writing Widgets 12: Examples of Widget Implementation Appendix: Software

rawshortTOC:
1: Introduction \\ 2: Fundamentals of the X Window System \\ 3: Introduction to the X Toolkit \\ 4: Event Handling in the X Toolkit \\ 5: Programming with Widgets \\ 6: Constraint and Compound Widgets \\ 7: Text and Dialog Widgets \\ 8: Drawing Operations \\ 9: Color and Images \\ 10: Selections \\ 11: Writing Widgets \\ 12: Examples of Widget Implementation \\ Appendix: Software

rawTOC:
Preface \\ Acknowledgments \\ Table of Contents \\ Software Installation \\ 1: Introduction \\ 1.1: Overview of X \\ 1.2: Highlights of the X Toolkit \\ 1.3: Simplifying X \\ 1.4: Odds and Ends \\ 1.5: Conclusions \\ 1.6: Projects \\ 2: Fundamentals of the X Window System \\ 2.1: Introduction \\ 2.2: Advanced Features of the Window Object in X \\ 2.3: Events \\ 2.4: Window Manager \\ 2.5: Grabbing and Spying \\ 2.6: Conclusions \\ 2.7: Projects \\ 3: Introduction to the X Toolkit \\ 3.1: Widgets \\ 3.2: Using Resources \\ 3.3: Resource Definition \\ 3.4: Conclusions \\ 3.5: Projects \\ 4: Event Handling in the X Toolkit \\ 4.1: Overview \\ 4.2: Event Processing \\ 4.3: Dealing with Nonevent Input \\ 4.4: Entering Text \\ 4.5: Conclusions \\ 4.6: Projects \\ 5: Programming with Widgets \\ 5.1: Widgets as Building Blocks \\ 5.2: Simple Widgets \\ 5.3: Widget Geometry \\ 5.4: Container Widgets \\ 5.5: Shell Widgets and Pop-ups \\ 5.6: Drawing Widgets \\ 5.7: Conclusions \\ 5.8: Projects \\ 6: Constraint and Compound Widgets \\ 6.1: Constraint Widgets \\ 6.2: Compound Widgets \\ 6.3: Transient Menus \\ 6.4: Conclusions \\ 6.5: Projects \\ 7: Text and Dialog Widgets \\ 7.1: Text Widgets \\ 7.2: Text Widget Applications \\ 7.3: Dialog Widgets \\ 7.4: Conclusions \\ 7.5: Projects \\ 8: Drawing Operations \\ 8.1: Basics of Drawing \\ 8.2: Drawing Functions \\ 8.3: Icons, Cursors, and Fonts \\ 8.4: Regions \\ 8.5: Conclusions \\ 8.6: Projects \\ 9: Color and Images \\ 9.1: Overview \\ 9.2: Using Existing Colormaps \\ 9.3: Visuals \\ 9.4: Creating and Using New Colormaps \\ 9.5: Image Structures \\ 9.6: Overlays \\ 9.7: Conclusions \\ 9.8: Projects \\ 10: Selections \\ 10.1: Interclient Communication \\ 10.2: The Gory Details \\ 10.3: Nontext Selections \\ 10.4: Implementation Issues \\ 10.5: Conclusions \\ 10.6: Projects \\ 11: Writing Widgets \\ 11.1: Introduction \\ 11.2: Anatomy of a Widget \\ 11.3: Sketch Widget Implementation \\ 11.4: Conclusions \\ 11.5: Projects \\ 12: Examples of Widget Implementation \\ 12.1: Introduction \\ 12.2: Slider Widget \\ 12.3: Composite Widget \\ 12.4: Conclusions \\ 12.5: Projects \\ Appendix: Software \\ A1: Overview \\ A2: Data Types Used in the Starter Toolkit \\ A3: Functions \\ A4: Resources and Convenience Function of Paper Class Widgets \\ References

entry:
@Book{Pavlidis:1999:FXP,
  author =       "Theodosios Pavlidis",
  title =        "Fundamentals of {X} Programming: Graphical User
                 Interfaces and Beyond",
  publisher =    pub-KLUWER,
  address =      pub-KLUWER:adr,
  pages =        "xvii + 374",
  year =         "1999",
  ISBN =         "0-306-46065-3 (hardcover), 0-306-46968-5 (e-book)",
  ISBN-13 =      "978-0-306-46065-4 (hardcover), 978-0-306-46968-8
                 (e-book)",
  LCCN =         "QA76.76.W56P387 1999",
  bibdate =      "Mon May 17 18:13:25 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$89.85",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0902/98056154-d.html",
  abstract =     "The X is the dominant window system under Unix, and X
                 servers are available for Microsoft Windows, thus
                 enabling graphics over a network in the PC world. This
                 book provides an overview of the X Window System,
                 focusing on characteristics that have significant
                 impact on the development of both application programs
                 and widgets. It pays special attention to applications
                 that go beyond graphical user interfaces (GUIs), such
                 as visualization and imaging programs; issues affecting
                 video games; and designing widgets with a complex
                 appearance. While the book does not assume previous
                 knowledge of X, it is intended for experienced
                 programmers, especially those who want to write
                 programs that go beyond simple GUIs",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  shorttableofcontents = "1: Introduction \\
                 2: Fundamentals of the X Window System \\
                 3: Introduction to the X Toolkit \\
                 4: Event Handling in the X Toolkit \\
                 5: Programming with Widgets \\
                 6: Constraint and Compound Widgets \\
                 7: Text and Dialog Widgets \\
                 8: Drawing Operations \\
                 9: Color and Images \\
                 10: Selections \\
                 11: Writing Widgets \\
                 12: Examples of Widget Implementation \\
                 Appendix: Software",
  subject =      "X Window System (Computer system); Graphical user
                 interfaces (Computer systems); Computer programming",
  tableofcontents = "Preface \\
                 Acknowledgments \\
                 Table of Contents \\
                 Software Installation \\
                 1: Introduction \\
                 1.1: Overview of X \\
                 1.2: Highlights of the X Toolkit \\
                 1.3: Simplifying X \\
                 1.4: Odds and Ends \\
                 1.5: Conclusions \\
                 1.6: Projects \\
                 2: Fundamentals of the X Window System \\
                 2.1: Introduction \\
                 2.2: Advanced Features of the Window Object in X \\
                 2.3: Events \\
                 2.4: Window Manager \\
                 2.5: Grabbing and Spying \\
                 2.6: Conclusions \\
                 2.7: Projects \\
                 3: Introduction to the X Toolkit \\
                 3.1: Widgets \\
                 3.2: Using Resources \\
                 3.3: Resource Definition \\
                 3.4: Conclusions \\
                 3.5: Projects \\
                 4: Event Handling in the X Toolkit \\
                 4.1: Overview \\
                 4.2: Event Processing \\
                 4.3: Dealing with Nonevent Input \\
                 4.4: Entering Text \\
                 4.5: Conclusions \\
                 4.6: Projects \\
                 5: Programming with Widgets \\
                 5.1: Widgets as Building Blocks \\
                 5.2: Simple Widgets \\
                 5.3: Widget Geometry \\
                 5.4: Container Widgets \\
                 5.5: Shell Widgets and Pop-ups \\
                 5.6: Drawing Widgets \\
                 5.7: Conclusions \\
                 5.8: Projects \\
                 6: Constraint and Compound Widgets \\
                 6.1: Constraint Widgets \\
                 6.2: Compound Widgets \\
                 6.3: Transient Menus \\
                 6.4: Conclusions \\
                 6.5: Projects \\
                 7: Text and Dialog Widgets \\
                 7.1: Text Widgets \\
                 7.2: Text Widget Applications \\
                 7.3: Dialog Widgets \\
                 7.4: Conclusions \\
                 7.5: Projects \\
                 8: Drawing Operations \\
                 8.1: Basics of Drawing \\
                 8.2: Drawing Functions \\
                 8.3: Icons, Cursors, and Fonts \\
                 8.4: Regions \\
                 8.5: Conclusions \\
                 8.6: Projects \\
                 9: Color and Images \\
                 9.1: Overview \\
                 9.2: Using Existing Colormaps \\
                 9.3: Visuals \\
                 9.4: Creating and Using New Colormaps \\
                 9.5: Image Structures \\
                 9.6: Overlays \\
                 9.7: Conclusions \\
                 9.8: Projects \\
                 10: Selections \\
                 10.1: Interclient Communication \\
                 10.2: The Gory Details \\
                 10.3: Nontext Selections \\
                 10.4: Implementation Issues \\
                 10.5: Conclusions \\
                 10.6: Projects \\
                 11: Writing Widgets \\
                 11.1: Introduction \\
                 11.2: Anatomy of a Widget \\
                 11.3: Sketch Widget Implementation \\
                 11.4: Conclusions \\
                 11.5: Projects \\
                 12: Examples of Widget Implementation \\
                 12.1: Introduction \\
                 12.2: Slider Widget \\
                 12.3: Composite Widget \\
                 12.4: Conclusions \\
                 12.5: Projects \\
                 Appendix: Software \\
                 A1: Overview \\
                 A2: Data Types Used in the Starter Toolkit \\
                 A3: Functions \\
                 A4: Resources and Convenience Function of Paper Class
                 Widgets \\
                 References",
}


bibtype: misc
filename: master.bib
label: Paxson:flex
author: Vern Paxson
title: flex: fast lexical analyzer generator
pages: xvii + 374
year: 1988
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
howpublished: pub-FSF
rawauthor: Vern Paxson
rawtitle: flex: fast lexical analyzer generator
note:
Electronic mail: path |vern@lbl-csam.arpa| or path |vern@lbl-rtsg.arpa|. Software also available via ANONYMOUS FTP to path |lbl-csam.arpa|, path |lbl-rtsg.arpa|, or path |prep.ai.mit.edu|. See also cite Donnelly:bison.

rawnote:
Electronic mail: \path|vern@lbl-csam.arpa| or \path|vern@lbl-rtsg.arpa|. Software also available via ANONYMOUS FTP to \path|lbl-csam.arpa|, \path|lbl-rtsg.arpa|, or \path|prep.ai.mit.edu|. See also \cite{Donnelly:bison}.

entry:
@Misc{Paxson:flex,
  author =       "Vern Paxson",
  title =        "flex: fast lexical analyzer generator",
  howpublished = pub-FSF # " " # pub-FSF:adr,
  year =         "1988",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Electronic mail: \path|vern@lbl-csam.arpa| or
                 \path|vern@lbl-rtsg.arpa|. Software also available via
                 ANONYMOUS FTP to \path|lbl-csam.arpa|,
                 \path|lbl-rtsg.arpa|, or \path|prep.ai.mit.edu|. See
                 also \cite{Donnelly:bison}.",
  acknowledgement = ack-nhfb,
}


bibtype: misc
filename: master.bib
label: pc-sales88
pages: xvii + 374
year: 1988
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
note: Trade journal advertisement sales volume estimates.
acknowledgement: ack-nhfb
key: PCS
rawnote: Trade journal advertisement sales volume estimates.
entry:
@Misc{pc-sales88,
  key =          "PCS",
  year =         "1988",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Trade journal advertisement sales volume estimates.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Peitgen:1986:BF
author: Heinz-Otto Peitgen and Peter H. Richter
title: The Beauty of Fractals
publisher: pub-SV
address: pub-SV:adr
pages: xii + 199
year: 1986
ISBN: 0-387-15851-0 OR 0387158510
ISBN13: 978-0-387-15851-8 OR 9780387158518
LCCN: QA447 .P45 1986
bibdate: Wed Dec 15 10:40:44 1993
bibtimestamp: 1993.12.15 10:40:44 ???
subject: Fractals; Fractales; Fractals; Fractals; Dynamisches System; Fraktal; Fractales; Mathematics
acknowledgement: ack-nhfb
rawauthor: Heinz-Otto Peitgen and Peter H. Richter
rawtitle: The Beauty of Fractals
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
The authors present an unusual attempt to publicize the field of Complex Dynamics, an exciting mathematical discipline of respectable tradition that recently sprang into new life under the impact of modern computer graphics. Where previous generations of scientists had to develop their own inner eye to perceive the abstract aesthetics of their work, the astounding pictures assembled here invite the reader to share in a new mathematical experience, to revel in the charm of fractal frontiers.

TOC:
Frontiers of Chaos / 1 Special Sections 1 Verhulst Dynamics / 23 2 Julia Sets and Their Computergraphical Generation / 27 3 Sullivan's Classification of Critical Points / 53 4 The Mandelbrot Set / 56 5 External Angles and Hubbard Trees / 63 6 Newton's Method for Complex Polynomials: Cayley's Problem / 93 7 Newton's Method for Real Equations / 103 8 A Discrete Volterra--Lotka System / 125 Magnetism and Complex Boundaries / 129 Special Sections 9 Yang-Lee Zeros / 139 10 Renormalization / 142 References / 147 Invited Contributions / 151 B. B. Mandelbrot: Fractals and the Rebirth of Iteration Theory / 151 A. Douady: Julia Sets and the Mandelbrot Set / 161 G. Eilenberger: Freedom, Science, and Aesthetics / 175 H. W. Franke: Refractions of Science into Art / 181 Do It Yourself / 189 Documentation / 193 Index / 197

rawabstract:
The authors present an unusual attempt to publicize the field of Complex Dynamics, an exciting mathematical discipline of respectable tradition that recently sprang into new life under the impact of modern computer graphics. Where previous generations of scientists had to develop their own inner eye to perceive the abstract aesthetics of their work, the astounding pictures assembled here invite the reader to share in a new mathematical experience, to revel in the charm of fractal frontiers.

rawTOC:
Frontiers of Chaos / 1 \\ Special Sections \\ 1 Verhulst Dynamics / 23 \\ 2 Julia Sets and Their Computergraphical Generation / 27 \\ 3 Sullivan's Classification of Critical Points / 53 \\ 4 The Mandelbrot Set / 56 \\ 5 External Angles and Hubbard Trees / 63 \\ 6 Newton's Method for Complex Polynomials: Cayley's Problem / 93 \\ 7 Newton's Method for Real Equations / 103 \\ 8 A Discrete Volterra--Lotka System / 125 \\ Magnetism and Complex Boundaries / 129 \\ Special Sections \\ 9 Yang-Lee Zeros / 139 \\ 10 Renormalization / 142 \\ References / 147 \\ Invited Contributions / 151 \\ B. B. Mandelbrot: Fractals and the Rebirth of Iteration Theory / 151 \\ A. Douady: Julia Sets and the Mandelbrot Set / 161 \\ G. Eilenberger: Freedom, Science, and Aesthetics / 175 \\ H. W. Franke: Refractions of Science into Art / 181 \\ Do It Yourself / 189 \\ Documentation / 193 \\ Index / 197

entry:
@Book{Peitgen:1986:BF,
  author =       "Heinz-Otto Peitgen and Peter H. Richter",
  title =        "The Beauty of Fractals",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 199",
  year =         "1986",
  ISBN =         "0-387-15851-0",
  ISBN-13 =      "978-0-387-15851-8",
  LCCN =         "QA447 .P45 1986",
  bibdate =      "Wed Dec 15 10:40:44 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "The authors present an unusual attempt to publicize
                 the field of Complex Dynamics, an exciting mathematical
                 discipline of respectable tradition that recently
                 sprang into new life under the impact of modern
                 computer graphics. Where previous generations of
                 scientists had to develop their own inner eye to
                 perceive the abstract aesthetics of their work, the
                 astounding pictures assembled here invite the reader to
                 share in a new mathematical experience, to revel in the
                 charm of fractal frontiers.",
  acknowledgement = ack-nhfb,
  subject =      "Fractals; Fractales; Fractals; Fractals; Dynamisches
                 System; Fraktal; Fractales; Mathematics",
  tableofcontents = "Frontiers of Chaos / 1 \\
                 Special Sections \\
                 1 Verhulst Dynamics / 23 \\
                 2 Julia Sets and Their Computergraphical Generation /
                 27 \\
                 3 Sullivan's Classification of Critical Points / 53 \\
                 4 The Mandelbrot Set / 56 \\
                 5 External Angles and Hubbard Trees / 63 \\
                 6 Newton's Method for Complex Polynomials: Cayley's
                 Problem / 93 \\
                 7 Newton's Method for Real Equations / 103 \\
                 8 A Discrete Volterra--Lotka System / 125 \\
                 Magnetism and Complex Boundaries / 129 \\
                 Special Sections \\
                 9 Yang-Lee Zeros / 139 \\
                 10 Renormalization / 142 \\
                 References / 147 \\
                 Invited Contributions / 151 \\
                 B. B. Mandelbrot: Fractals and the Rebirth of Iteration
                 Theory / 151 \\
                 A. Douady: Julia Sets and the Mandelbrot Set / 161 \\
                 G. Eilenberger: Freedom, Science, and Aesthetics / 175
                 \\
                 H. W. Franke: Refractions of Science into Art / 181 \\
                 Do It Yourself / 189 \\
                 Documentation / 193 \\
                 Index / 197",
}


bibtype: book
filename: master.bib
label: Peitgen:1991:FC
author: Heinz-Otto Peitgen and Hartmut Jurgens and Dietmar Saupe
title: Fractals for the Classroom
publisher: pub-SV
address: pub-SV:adr
pages: xii + 128 (vol. 1)
year: 1991
DOI: https://doi.org/10.1007/978-1-4613-9047-3
LCCN: QA614.86 .P45 1991
bibdate: Wed Jun 24 08:29:35 1998
bibtimestamp: 1998.06.24 08:29:35 ???
note: Issued in 1991--1992, with corrected second printing in 1993--1994.
acknowledgement: ack-nhfb
rawauthor: Heinz-Otto Peitgen and Hartmut J{\"u}rgens and Dietmar Saupe
rawnote: Issued in 1991--1992, with corrected second printing in 1993--1994.
rawtitle: Fractals for the Classroom
ISBN:
0-387-97346-X (vol. 1, New York), 3-540-97346-X (vol. 1, Berlin), 0-387-97722-8 (vol. 2, New York), 3-540-97722-8 (vol. 2, Berlin) OR 038797346X (vol. 1, New York), 354097346X (vol. 1, Berlin), 0387977228 (vol. 2, New York), 3540977228 (vol. 2, Berlin)

ISBN13:
978-0-387-97346-3 (vol. 1, New York), 978-3-540-97346-1 (vol. 1, Berlin), 978-0-387-97722-5 (vol. 2, New York), 978-3-540-97722-3 (vol. 2, Berlin) OR 9780387973463 (vol. 1, New York), 9783540973461 (vol. 1, Berlin), 9780387977225 (vol. 2, New York), 9783540977223 (vol. 2, Berlin)

bibsource:
https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
This first volume of strategic activities is designed to develop through a hands-on approach, a basic mathematical understanding and appreciation of fractals. The concepts presented on fractals include self-similarity, the chaos game, and complexity as it relates to fractal dimension. These strategic activities have been developed from a sound instructional base, stressing the connections to the contemporary curriculums recommended in the National Council of Teachers of Mathematics' Curriculum and Evaluation Standards for School Mathematics. Where appropriate the activities take advantage of the technological power of the graphics calculator. These activites make excellent extensions to many of the topics that are already taught in the current curriculum. Together, they can be used as a complete unit or as the beginning for a semester course on fractals.

TOC:
Unit 1 Self-Similarity Key Objectives, Notions, and Connections Mathematical Background Using the Activities Sheets 1.1 Sierpinski Triangle and Variations 1.2 Number Patterns and Variations 1.3 Square Gasket 1.4 Sierpinski Tetrahedron 1.5 Trees 1.6 Self-Similarity: Basic Properties 1.7 Self-Similarity: Specifics 1.8 Box Self-Similarity: Grasping the Limit 1.9 Pascal's Triangle 1.10 Sierpinski Triangle Revisited 1.11 New Coloring Rules and Patterns 1.12 Cellular Automata Unit 2 The Chaos Game Key Objectives, Notions, and Connections Mathematical Background Using the Activities Sheets 2.1 The Chaos Game 2.2 Simulating the Chaos Game 2.3 Addresses in Triangles and Trees 2.4 Chaos Game and Sierpinski Triangle 2.5 Chaos Game Analysis 2.6 Sampling and the Chaos Game 2.7 Probability and the Chaos Game 2.8 Trees and the Cantor Set 2.9 Trees and the Sierpinski Triangle Unit 3 Complexity Key Objectives, Notions, and Connections Mathematical Background Using the Activities Sheets 3.1 Construction and Complexity 3.2 Fractal Curves 3.3 Curve Fitting 3.4 Curve Fitting Using Logs 3.5 Curve Fitting Using Technology 3.6 Box Dimension 3.7 Box Dimension and Coastlines 3.8 Box Dimension for Self-Similar Objects 3.9 Similarity Dimension Answers

rawabstract:
This first volume of strategic activities is designed to develop through a hands-on approach, a basic mathematical understanding and appreciation of fractals. The concepts presented on fractals include self-similarity, the chaos game, and complexity as it relates to fractal dimension. These strategic activities have been developed from a sound instructional base, stressing the connections to the contemporary curriculums recommended in the National Council of Teachers of Mathematics' Curriculum and Evaluation Standards for School Mathematics. Where appropriate the activities take advantage of the technological power of the graphics calculator. These activites make excellent extensions to many of the topics that are already taught in the current curriculum. Together, they can be used as a complete unit or as the beginning for a semester course on fractals.

shortTOC:
Slide titles: Broccoli romanesco Sierpinski snail-shell The chaos game Pascal's triangle Sierpinski tetrahedron The Mandelbrot set 3D Secco (Mandelbrot set) Escalante 3D Yellowstone Lake 3D v. 1. Introduction to fractals and chaos (V.1 Pt. 1) v. 2. Strategic activities (V.2 Pt. 1; V.2 Pt. 2)

rawshortTOC:
Slide titles: Broccoli romanesco \\ Sierpinski snail-shell \\ The chaos game \\ Pascal's triangle \\ Sierpinski tetrahedron \\ The Mandelbrot set 3D \\ Secco (Mandelbrot set) \\ Escalante 3D \\ Yellowstone Lake 3D \\ v. 1. Introduction to fractals and chaos (V.1 Pt. 1) \\ v. 2. Strategic activities (V.2 Pt. 1; V.2 Pt. 2)

rawTOC:
Unit 1 Self-Similarity \\ Key Objectives, Notions, and Connections \\ Mathematical Background \\ Using the Activities Sheets \\ 1.1 Sierpinski Triangle and Variations \\ 1.2 Number Patterns and Variations \\ 1.3 Square Gasket \\ 1.4 Sierpinski Tetrahedron \\ 1.5 Trees \\ 1.6 Self-Similarity: Basic Properties \\ 1.7 Self-Similarity: Specifics \\ 1.8 Box Self-Similarity: Grasping the Limit \\ 1.9 Pascal's Triangle \\ 1.10 Sierpinski Triangle Revisited \\ 1.11 New Coloring Rules and Patterns \\ 1.12 Cellular Automata \\ Unit 2 The Chaos Game \\ Key Objectives, Notions, and Connections \\ Mathematical Background \\ Using the Activities Sheets \\ 2.1 The Chaos Game \\ 2.2 Simulating the Chaos Game \\ 2.3 Addresses in Triangles and Trees \\ 2.4 Chaos Game and Sierpinski Triangle \\ 2.5 Chaos Game Analysis \\ 2.6 Sampling and the Chaos Game \\ 2.7 Probability and the Chaos Game \\ 2.8 Trees and the Cantor Set \\ 2.9 Trees and the Sierpinski Triangle \\ Unit 3 Complexity \\ Key Objectives, Notions, and Connections \\ Mathematical Background \\ Using the Activities Sheets \\ 3.1 Construction and Complexity \\ 3.2 Fractal Curves \\ 3.3 Curve Fitting \\ 3.4 Curve Fitting Using Logs \\ 3.5 Curve Fitting Using Technology \\ 3.6 Box Dimension \\ 3.7 Box Dimension and Coastlines \\ 3.8 Box Dimension for Self-Similar Objects \\ 3.9 Similarity Dimension \\ Answers

entry:
@Book{Peitgen:1991:FC,
  author =       "Heinz-Otto Peitgen and Hartmut J{\"u}rgens and Dietmar
                 Saupe",
  title =        "Fractals for the Classroom",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 128 (vol. 1)",
  year =         "1991",
  DOI =          "https://doi.org/10.1007/978-1-4613-9047-3",
  ISBN =         "0-387-97346-X (vol. 1, New York), 3-540-97346-X (vol.
                 1, Berlin), 0-387-97722-8 (vol. 2, New York),
                 3-540-97722-8 (vol. 2, Berlin)",
  ISBN-13 =      "978-0-387-97346-3 (vol. 1, New York),
                 978-3-540-97346-1 (vol. 1, Berlin), 978-0-387-97722-5
                 (vol. 2, New York), 978-3-540-97722-3 (vol. 2,
                 Berlin)",
  LCCN =         "QA614.86 .P45 1991",
  bibdate =      "Wed Jun 24 08:29:35 1998",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Issued in 1991--1992, with corrected second printing
                 in 1993--1994.",
  price =        "US\$24.95 (vol. 1), US\$39.95 (vol. 2)",
  abstract =     "This first volume of strategic activities is designed
                 to develop through a hands-on approach, a basic
                 mathematical understanding and appreciation of
                 fractals. The concepts presented on fractals include
                 self-similarity, the chaos game, and complexity as it
                 relates to fractal dimension. These strategic
                 activities have been developed from a sound
                 instructional base, stressing the connections to the
                 contemporary curriculums recommended in the National
                 Council of Teachers of Mathematics' Curriculum and
                 Evaluation Standards for School Mathematics. Where
                 appropriate the activities take advantage of the
                 technological power of the graphics calculator. These
                 activites make excellent extensions to many of the
                 topics that are already taught in the current
                 curriculum. Together, they can be used as a complete
                 unit or as the beginning for a semester course on
                 fractals.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  shorttableofcontents = "Slide titles: Broccoli romanesco \\
                 Sierpinski snail-shell \\
                 The chaos game \\
                 Pascal's triangle \\
                 Sierpinski tetrahedron \\
                 The Mandelbrot set 3D \\
                 Secco (Mandelbrot set) \\
                 Escalante 3D \\
                 Yellowstone Lake 3D \\
                 v. 1. Introduction to fractals and chaos (V.1 Pt. 1)
                 \\
                 v. 2. Strategic activities (V.2 Pt. 1; V.2 Pt. 2)",
  tableofcontents = "Unit 1 Self-Similarity \\
                 Key Objectives, Notions, and Connections \\
                 Mathematical Background \\
                 Using the Activities Sheets \\
                 1.1 Sierpinski Triangle and Variations \\
                 1.2 Number Patterns and Variations \\
                 1.3 Square Gasket \\
                 1.4 Sierpinski Tetrahedron \\
                 1.5 Trees \\
                 1.6 Self-Similarity: Basic Properties \\
                 1.7 Self-Similarity: Specifics \\
                 1.8 Box Self-Similarity: Grasping the Limit \\
                 1.9 Pascal's Triangle \\
                 1.10 Sierpinski Triangle Revisited \\
                 1.11 New Coloring Rules and Patterns \\
                 1.12 Cellular Automata \\
                 Unit 2 The Chaos Game \\
                 Key Objectives, Notions, and Connections \\
                 Mathematical Background \\
                 Using the Activities Sheets \\
                 2.1 The Chaos Game \\
                 2.2 Simulating the Chaos Game \\
                 2.3 Addresses in Triangles and Trees \\
                 2.4 Chaos Game and Sierpinski Triangle \\
                 2.5 Chaos Game Analysis \\
                 2.6 Sampling and the Chaos Game \\
                 2.7 Probability and the Chaos Game \\
                 2.8 Trees and the Cantor Set \\
                 2.9 Trees and the Sierpinski Triangle \\
                 Unit 3 Complexity \\
                 Key Objectives, Notions, and Connections \\
                 Mathematical Background \\
                 Using the Activities Sheets \\
                 3.1 Construction and Complexity \\
                 3.2 Fractal Curves \\
                 3.3 Curve Fitting \\
                 3.4 Curve Fitting Using Logs \\
                 3.5 Curve Fitting Using Technology \\
                 3.6 Box Dimension \\
                 3.7 Box Dimension and Coastlines \\
                 3.8 Box Dimension for Self-Similar Objects \\
                 3.9 Similarity Dimension \\
                 Answers",
}


bibtype: book
filename: master.bib
label: Penna:1986:PGA
author: Michael A. Penna and Richard R. Patterson
title: Projective Geometry and its Applications to Computer Graphics
publisher: pub-PH
address: pub-PH:adr
pages: xi + 403
year: 1986
ISBN: 0-13-730649-0 OR 0137306490
ISBN13: 978-0-13-730649-7 OR 9780137306497
LCCN: QA471 .P3951 1986
bibdate: Wed Dec 15 10:40:45 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:40:45 ???
acknowledgement: ack-nhfb
rawauthor: Michael A. Penna and Richard R. Patterson
rawtitle: Projective Geometry and its Applications to Computer Graphics
entry:
@Book{Penna:1986:PGA,
  author =       "Michael A. Penna and Richard R. Patterson",
  title =        "Projective Geometry and its Applications to Computer
                 Graphics",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xi + 403",
  year =         "1986",
  ISBN =         "0-13-730649-0",
  ISBN-13 =      "978-0-13-730649-7",
  LCCN =         "QA471 .P3951 1986",
  bibdate =      "Wed Dec 15 10:40:45 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$37.50",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Pennebaker:1992:JSI
author: William B. Pennebaker and Joan L. Mitchell
title: JPEG Still Image Data Compression Standard
publisher: pub-VAN-NOSTRAND-REINHOLD
address: pub-VAN-NOSTRAND-REINHOLD:adr
pages: xviii + 638
year: 1992
ISBN: 0-442-01272-1 OR 0442012721
ISBN13: 978-0-442-01272-4 OR 9780442012724
LCCN: TA1632 .P45 1993
bibdate: Sat Jan 26 12:46:16 MST 2013
bibtimestamp: 2013.01.26 12:46:16 MST
acknowledgement: ack-ds
rawauthor: William B. Pennebaker and Joan L. Mitchell
rawtitle: {JPEG} Still Image Data Compression Standard
bibsource:
https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

keywords:
Algorithms; Data compression (Telecommunication) --- Standards; Image compression --- Standards; Image processing --- Digital techniques --- Standards

TOC:
Foreword / xiii Acknowledgments / xv Trademarks / xvii 1: Introduction / 1 1.1 Examples of JPEG image compression / 4 1.2 Organization of the book / 4 1.3 An architecture for image compression / 6 1.4 JPEG baseline and extended systems / 6 1.5 An evolving standard / 7 1.6 An international collaboration / 7 2: Image Concepts and Vocabulary / 9 2.1 Digital images / 10 2.2 Sampling / 10 2.3 Two-dimensional arrays of samples / 12 2.4 Digital image data types / 13 2.5 Large amounts of data / 21 3: Aspects of the Human Visual System / 23 3.1 Luminance sampling / 23 3.2 Sampie precision / 25 3.3 Chrominance sampling / 25 3.4 Linearity / 25 4: The Discrete Cosine Transform (DCT) / 29 4.1 Basic DCT concepts / 29 4.2 Mathematical definition of the FDCT and IDCT / 39 4.3 Fast DCTs / 41 5: Image Compression Systems / 65 5.1 Basic structure of image compression systems / 65 5.2 Image compression models / 67 5.3 JPEG entropy encoder and entropy decoder structures / 73 5.4 Transcoding / 77 5.5 JPEG lossless and lossy compression / 78 5.6 Sequential and progressive coding / 79 5.7 Hierarchical coding / 79 5.8 Compression measures / 79 6: JPEG Modes of Operation / 81 6.1 Sequential DCT-based mode of operation / 81 6.2 Progressive DCT-based mode of operation / 86 6.3 Sequential lossless mode of operation / 92 6.4 Hierarchical mode of operation / 93 7: JPEG Syntax and Data Organization / 97 7.1 Control procedures and compressed data structure / 97 7.2 Interchange and abbreviated compressed data formats / 99 7.3 Image data ordering / 99 7.4 Marker definitions / 105 7.5 Frame header / 110 7.6 Scan header / 113 7.7 Limit on the number of data units in an MCU / 116 7.8 Marker segments for tables and parameters / 117 7.9 Hierarchical progression marker segments / 120 7.10 Examples of JPEG data streams / 122 7.11 Backus--Naur Form / 127 7.12 JPEG BNF / 130 8: Entropy Coding Concepts / 135 8.1 Entropy and Information / 135 8.2 An example to illustrate entropy coding / 137 8.3 Variable-length code words / 137 8.4 Statistical modeling / 143 8.5 Adaptive coding / 147 9: JPEG Binary Arithmetic Coding / 149 9.1 The QM-encoder / 151 9.2 The QM-decoder / 162 9.3 More about the QM-coder / 166 10: JPEG Coding Models / 169 10.1 JPEG sequential DCT-based coding models / 170 10.2 Models for progressive DCT-based coding / 173 10.3 Coding model for lossless coding / 182 10.4 Models for hierarchical coding / 185 11: JPEG Huffman Entropy Coding / 189 11.1 Statistical models for the Huffman DCT-based sequential mode / 190 11.2 Statistical models for progressive DCT-based coding / 194 11.3 Statistical models for lossless coding and hierarchical mode spatial corrections / 198 11.4 Generation of Huffman tables / 198 12: Arithmetic Coding Statistical Models / 203 12.1 Overview of JPEG binary arithmetic-coding procedures / 203 12.2 Decision trees and notation / 204 12.3 Statistical models for the DCT-based sequential mode with arithmetic coding / 206 12.4 Statistical models for progressive DCT-based coding / 214 12.5 Statistical models for lossless coding and hierarchical-rnode spatial corrections / 216 12.6 Arithmetic coding conditioning tables / 218 13: More on Arithmetic Coding / 219 13.1 Optimal procedures for hardware and software / 220 13.2 Fast software encoder implementations / 225 13.3 Fast software decoder implementations / 228 13.4 Conditional exchange / 229 13.5 QM-coder versus Q-coder / 229 13.6 Resynchronization of decoders / 230 13.7 Speedup mode / 231 14: Probability Estimation / 233 14.1 Bayesian estimation / 234 14.2 Renormalization-driven estimation / 235 14.3 Markov-chain modelling of the probability estimation / 236 14.4 Approximate model / 238 14.5 Single-and mixed-context models / 240 14.6 Single-context model / 241 14.7 Mixed-context model / 243 14.8 Application of the estimation models to the QM-coder / 244 14.9 Initial learning / 247 14.10 Robustness of estimators versus refinement of models / 249 14.11 Other estimation tables / 249 15: Compression Performance / 253 15.1 Results for baseline sequential DCT / 254 15.2 Results for sequential DCT with arithmetic coding / 255 15.3 Results for sequential DCT with restart capability / 255 15.4 Results for progressive DCT with arithmetic coding / 256 15.5 Results for lossless mode with arithmetic coding / 257 15.6 Summary of Results / 258 16: JPEG Enhancements / 261 16.1 Removing blocking artifacts with AC prediction / 261 16.2 Low bitrate VQ enhanced decoding / 264 16.3 An approximate form of adaptive quantization / 264 16.4 Display-adjusted decoding / 266 17: JPEG Applications and Vendors / 267 17.1 Adobe Systems Incorporated / 269 17.2 AT&T Microelectronics / 270 17.3 AutoGraph International ApS / 271 17.4 AutoView / 272 17.5 Bulletin board systems / 272 17.6 California Department of Motor Vehicles / 273 17.7 C-Cube Microsystems, Inc. / 273 17.8 Data Link / 275 17.9 Discovery Technologies, Inc. / 275 17.10 DSP / 276 17.11 Eastman Kodak Company / 276 17.12 Handmade Software / 277 17.13 IBM / 278 17.14 Identix / 279 17.15 IIT / 279 17.16 Independent JPEG Group / 280 17.17 ITR / 281 17.18 Lewis Siwell, Inc. / 281 17.19 LSI Logic / 282 17.20 Moore Data Management Services / 283 17.21 NBS Imaging / 283 17.22 NTT Electronics Technology Ltd. / 284 17.23 OPTIBASE / 284 17.24 Optivision, Inc. / 284 17.25 Philips Kommunikations Industrie / 285 17.26 PRISM / 286 17.27 Storm Technology / 286 17.28 Telephoto Communications / 287 17.29 Tribune Publishing Co. / 288 17.30 VideoTelecom / 288 17.31 Ximage / 289 17.32 Xing / 289 17.33 Zoran Corporation / 290 17.34 3M / 291 17.35 File formats / 292 18: Overview of CCITT, ISO, and IEC / 295 18.1 ISO / 296 18.2 CCITT / 297 18.3 IEC / 298 18.4 Joint coordination / 299 19: History of JPEG / 301 19.1 Formation of JPEG / 301 19.2 Original JPEG Goals / 302 19.3 Selecting an approach / 302 19.4 Functional requirements / 303 19.5 Refining the ADCT technique / 306 19.6 Technical specifications / 307 19.7 ISO 10918 Part I / 309 19.8 JPEG Part I DIS ballot results / 311 19.9 CCITT Recommendation T.81 / 311 19.10 ISO 10918 Part 20 / 311 19.11 JPEG Goals Achieved / 313 20: Other Image Compression Standards / 317 20.1 CCITTG3 and G40 / 317 20.2 H.2610 / 318 20.3 JBIG / 318 20.4 MPEG / 325 21: Possible Future JPEG Directions / 331 21.1 Adaptive quantization / 331 21.2 Improvements to lossless coding / 332 21.3 Other possible addenda / 333 21.4 Backwards compatibility / 333 Appendix A. ISO DIS 10918-1 Requirements and Guidelines / 335 Appendix B. Draft ISO DIS 10918-2 Compliance Testing / 545 References / 627 Index / 632

shortTOC:
Foreword Acknowledgments Trademarks Introduction Image Concepts and Vocabulary Aspects of the Human Visual Systems The Discrete Cosine Transform (DCT) Image Compression Systems JPEG Modes of Operation JPEG Syntax and Data Organization Entropy Coding Concepts JPEG Binary Arithmetic Coding JPEG Coding Models JPEG Huffman Entropy Coding Arithmetic Coding Statistical More on Arithmetic Coding Probability Estimation Compression Performance JPEG Enhancements JPEG Applications and Vendors Overview of CCITT, ISO, and IEC History of JPEG Other Image Compression Standards Possible Future JPEG Directions Appendix A Appendix B References Index

rawshortTOC:
Foreword \\ Acknowledgments \\ Trademarks \\ Introduction \\ Image Concepts and Vocabulary \\ Aspects of the Human Visual Systems \\ The Discrete Cosine Transform (DCT) \\ Image Compression Systems \\ JPEG Modes of Operation \\ JPEG Syntax and Data Organization \\ Entropy Coding Concepts \\ JPEG Binary Arithmetic Coding \\ JPEG Coding Models \\ JPEG Huffman Entropy Coding \\ Arithmetic Coding Statistical \\ More on Arithmetic Coding \\ Probability Estimation \\ Compression Performance \\ JPEG Enhancements \\ JPEG Applications and Vendors \\ Overview of CCITT, ISO, and IEC \\ History of JPEG \\ Other Image Compression Standards \\ Possible Future JPEG Directions \\ Appendix A \\ Appendix B \\ References \\ Index

rawTOC:
Foreword / xiii \\ Acknowledgments / xv \\ Trademarks / xvii \\ 1: Introduction / 1 \\ 1.1 Examples of JPEG image compression / 4 \\ 1.2 Organization of the book / 4 \\ 1.3 An architecture for image compression / 6 \\ 1.4 JPEG baseline and extended systems / 6 \\ 1.5 An evolving standard / 7 \\ 1.6 An international collaboration / 7 \\ 2: Image Concepts and Vocabulary / 9 \\ 2.1 Digital images / 10 \\ 2.2 Sampling / 10 \\ 2.3 Two-dimensional arrays of samples / 12 \\ 2.4 Digital image data types / 13 \\ 2.5 Large amounts of data / 21 \\ 3: Aspects of the Human Visual System / 23 \\ 3.1 Luminance sampling / 23 \\ 3.2 Sampie precision / 25 \\ 3.3 Chrominance sampling / 25 \\ 3.4 Linearity / 25 \\ 4: The Discrete Cosine Transform (DCT) / 29 \\ 4.1 Basic DCT concepts / 29 \\ 4.2 Mathematical definition of the FDCT and IDCT / 39 \\ 4.3 Fast DCTs / 41 \\ 5: Image Compression Systems / 65 \\ 5.1 Basic structure of image compression systems / 65 \\ 5.2 Image compression models / 67 \\ 5.3 JPEG entropy encoder and entropy decoder structures / 73 \\ 5.4 Transcoding / 77 \\ 5.5 JPEG lossless and lossy compression / 78 \\ 5.6 Sequential and progressive coding / 79 \\ 5.7 Hierarchical coding / 79 \\ 5.8 Compression measures / 79 \\ 6: JPEG Modes of Operation / 81 \\ 6.1 Sequential DCT-based mode of operation / 81 \\ 6.2 Progressive DCT-based mode of operation / 86 \\ 6.3 Sequential lossless mode of operation / 92 \\ 6.4 Hierarchical mode of operation / 93 \\ 7: JPEG Syntax and Data Organization / 97 \\ 7.1 Control procedures and compressed data structure / 97 \\ 7.2 Interchange and abbreviated compressed data formats / 99 \\ 7.3 Image data ordering / 99 \\ 7.4 Marker definitions / 105 \\ 7.5 Frame header / 110 \\ 7.6 Scan header / 113 \\ 7.7 Limit on the number of data units in an MCU / 116 \\ 7.8 Marker segments for tables and parameters / 117 \\ 7.9 Hierarchical progression marker segments / 120 \\ 7.10 Examples of JPEG data streams / 122 \\ 7.11 Backus--Naur Form / 127 \\ 7.12 JPEG BNF / 130 \\ 8: Entropy Coding Concepts / 135 \\ 8.1 Entropy and Information / 135 \\ 8.2 An example to illustrate entropy coding / 137 \\ 8.3 Variable-length code words / 137 \\ 8.4 Statistical modeling / 143 \\ 8.5 Adaptive coding / 147 \\ 9: JPEG Binary Arithmetic Coding / 149 \\ 9.1 The QM-encoder / 151 \\ 9.2 The QM-decoder / 162 \\ 9.3 More about the QM-coder / 166 \\ 10: JPEG Coding Models / 169 \\ 10.1 JPEG sequential DCT-based coding models / 170 \\ 10.2 Models for progressive DCT-based coding / 173 \\ 10.3 Coding model for lossless coding / 182 \\ 10.4 Models for hierarchical coding / 185 \\ 11: JPEG Huffman Entropy Coding / 189 \\ 11.1 Statistical models for the Huffman DCT-based sequential mode / 190 \\ 11.2 Statistical models for progressive DCT-based coding / 194 \\ 11.3 Statistical models for lossless coding and hierarchical mode spatial corrections / 198 \\ 11.4 Generation of Huffman tables / 198 \\ 12: Arithmetic Coding Statistical Models / 203 \\ 12.1 Overview of JPEG binary arithmetic-coding procedures / 203 \\ 12.2 Decision trees and notation / 204 \\ 12.3 Statistical models for the DCT-based sequential mode with arithmetic coding / 206 \\ 12.4 Statistical models for progressive DCT-based coding / 214 \\ 12.5 Statistical models for lossless coding and hierarchical-rnode spatial corrections / 216 \\ 12.6 Arithmetic coding conditioning tables / 218 \\ 13: More on Arithmetic Coding / 219 \\ 13.1 Optimal procedures for hardware and software / 220 \\ 13.2 Fast software encoder implementations / 225 \\ 13.3 Fast software decoder implementations / 228 \\ 13.4 Conditional exchange / 229 \\ 13.5 QM-coder versus Q-coder / 229 \\ 13.6 Resynchronization of decoders / 230 \\ 13.7 Speedup mode / 231 \\ 14: Probability Estimation / 233 \\ 14.1 Bayesian estimation / 234 \\ 14.2 Renormalization-driven estimation / 235 \\ 14.3 Markov-chain modelling of the probability estimation / 236 \\ 14.4 Approximate model / 238 \\ 14.5 Single-and mixed-context models / 240 \\ 14.6 Single-context model / 241 \\ 14.7 Mixed-context model / 243 \\ 14.8 Application of the estimation models to the QM-coder / 244 \\ 14.9 Initial learning / 247 \\ 14.10 Robustness of estimators versus refinement of models / 249 \\ 14.11 Other estimation tables / 249 \\ 15: Compression Performance / 253 \\ 15.1 Results for baseline sequential DCT / 254 \\ 15.2 Results for sequential DCT with arithmetic coding / 255 \\ 15.3 Results for sequential DCT with restart capability / 255 \\ 15.4 Results for progressive DCT with arithmetic coding / 256 \\ 15.5 Results for lossless mode with arithmetic coding / 257 \\ 15.6 Summary of Results / 258 \\ 16: JPEG Enhancements / 261 \\ 16.1 Removing blocking artifacts with AC prediction / 261 \\ 16.2 Low bitrate VQ enhanced decoding / 264 \\ 16.3 An approximate form of adaptive quantization / 264 \\ 16.4 Display-adjusted decoding / 266 \\ 17: JPEG Applications and Vendors / 267 \\ 17.1 Adobe Systems Incorporated / 269 \\ 17.2 AT\&T Microelectronics / 270 \\ 17.3 AutoGraph International ApS / 271 \\ 17.4 AutoView / 272 \\ 17.5 Bulletin board systems / 272 \\ 17.6 California Department of Motor Vehicles / 273 \\ 17.7 C-Cube Microsystems, Inc. / 273 \\ 17.8 Data Link / 275 \\ 17.9 Discovery Technologies, Inc. / 275 \\ 17.10 DSP / 276 \\ 17.11 Eastman Kodak Company / 276 \\ 17.12 Handmade Software / 277 \\ 17.13 IBM / 278 \\ 17.14 Identix / 279 \\ 17.15 IIT / 279 \\ 17.16 Independent JPEG Group / 280 \\ 17.17 ITR / 281 \\ 17.18 Lewis Siwell, Inc. / 281 \\ 17.19 LSI Logic / 282 \\ 17.20 Moore Data Management Services / 283 \\ 17.21 NBS Imaging / 283 \\ 17.22 NTT Electronics Technology Ltd. / 284 \\ 17.23 OPTIBASE / 284 \\ 17.24 Optivision, Inc. / 284 \\ 17.25 Philips Kommunikations Industrie / 285 \\ 17.26 PRISM / 286 \\ 17.27 Storm Technology / 286 \\ 17.28 Telephoto Communications / 287 \\ 17.29 Tribune Publishing Co. / 288 \\ 17.30 VideoTelecom / 288 \\ 17.31 Ximage / 289 \\ 17.32 Xing / 289 \\ 17.33 Zoran Corporation / 290 \\ 17.34 3M / 291 \\ 17.35 File formats / 292 \\ 18: Overview of CCITT, ISO, and IEC / 295 \\ 18.1 ISO / 296 \\ 18.2 CCITT / 297 \\ 18.3 IEC / 298 \\ 18.4 Joint coordination / 299 \\ 19: History of JPEG / 301 \\ 19.1 Formation of JPEG / 301 \\ 19.2 Original JPEG Goals / 302 \\ 19.3 Selecting an approach / 302 \\ 19.4 Functional requirements / 303 \\ 19.5 Refining the ADCT technique / 306 \\ 19.6 Technical specifications / 307 \\ 19.7 ISO 10918 Part I / 309 \\ 19.8 JPEG Part I DIS ballot results / 311 \\ 19.9 CCITT Recommendation T.81 / 311 \\ 19.10 ISO 10918 Part 20 / 311 \\ 19.11 JPEG Goals Achieved / 313 \\ 20: Other Image Compression Standards / 317 \\ 20.1 CCITTG3 and G40 / 317 \\ 20.2 H.2610 / 318 \\ 20.3 JBIG / 318 \\ 20.4 MPEG / 325 \\ 21: Possible Future JPEG Directions / 331 \\ 21.1 Adaptive quantization / 331 \\ 21.2 Improvements to lossless coding / 332 \\ 21.3 Other possible addenda / 333 \\ 21.4 Backwards compatibility / 333 \\ Appendix A. ISO DIS 10918-1 Requirements and Guidelines / 335 \\ Appendix B. Draft ISO DIS 10918-2 Compliance Testing / 545 \\ References / 627 \\ Index / 632

entry:
@Book{Pennebaker:1992:JSI,
  author =       "William B. Pennebaker and Joan L. Mitchell",
  title =        "{JPEG} Still Image Data Compression Standard",
  publisher =    pub-VAN-NOSTRAND-REINHOLD,
  address =      pub-VAN-NOSTRAND-REINHOLD:adr,
  pages =        "xviii + 638",
  year =         "1992",
  ISBN =         "0-442-01272-1",
  ISBN-13 =      "978-0-442-01272-4",
  LCCN =         "TA1632 .P45 1993",
  bibdate =      "Sat Jan 26 12:46:16 MST 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-ds # " and " # ack-nhfb,
  keywords =     "Algorithms; Data compression (Telecommunication) ---
                 Standards; Image compression --- Standards; Image
                 processing --- Digital techniques --- Standards",
  libnote =      "Not in my library.",
  rawdata =      "Pennebaker, William B., and Joan L. Mitchell (1992)
                 {\it JPEG Still Image Data Compression Standard}, New
                 York, Van Nostrand Reinhold.",
  shorttableofcontents = "Foreword \\
                 Acknowledgments \\
                 Trademarks \\
                 Introduction \\
                 Image Concepts and Vocabulary \\
                 Aspects of the Human Visual Systems \\
                 The Discrete Cosine Transform (DCT) \\
                 Image Compression Systems \\
                 JPEG Modes of Operation \\
                 JPEG Syntax and Data Organization \\
                 Entropy Coding Concepts \\
                 JPEG Binary Arithmetic Coding \\
                 JPEG Coding Models \\
                 JPEG Huffman Entropy Coding \\
                 Arithmetic Coding Statistical \\
                 More on Arithmetic Coding \\
                 Probability Estimation \\
                 Compression Performance \\
                 JPEG Enhancements \\
                 JPEG Applications and Vendors \\
                 Overview of CCITT, ISO, and IEC \\
                 History of JPEG \\
                 Other Image Compression Standards \\
                 Possible Future JPEG Directions \\
                 Appendix A \\
                 Appendix B \\
                 References \\
                 Index",
  tableofcontents = "Foreword / xiii \\
                 Acknowledgments / xv \\
                 Trademarks / xvii \\
                 1: Introduction / 1 \\
                 1.1 Examples of JPEG image compression / 4 \\
                 1.2 Organization of the book / 4 \\
                 1.3 An architecture for image compression / 6 \\
                 1.4 JPEG baseline and extended systems / 6 \\
                 1.5 An evolving standard / 7 \\
                 1.6 An international collaboration / 7 \\
                 2: Image Concepts and Vocabulary / 9 \\
                 2.1 Digital images / 10 \\
                 2.2 Sampling / 10 \\
                 2.3 Two-dimensional arrays of samples / 12 \\
                 2.4 Digital image data types / 13 \\
                 2.5 Large amounts of data / 21 \\
                 3: Aspects of the Human Visual System / 23 \\
                 3.1 Luminance sampling / 23 \\
                 3.2 Sampie precision / 25 \\
                 3.3 Chrominance sampling / 25 \\
                 3.4 Linearity / 25 \\
                 4: The Discrete Cosine Transform (DCT) / 29 \\
                 4.1 Basic DCT concepts / 29 \\
                 4.2 Mathematical definition of the FDCT and IDCT / 39
                 \\
                 4.3 Fast DCTs / 41 \\
                 5: Image Compression Systems / 65 \\
                 5.1 Basic structure of image compression systems / 65
                 \\
                 5.2 Image compression models / 67 \\
                 5.3 JPEG entropy encoder and entropy decoder structures
                 / 73 \\
                 5.4 Transcoding / 77 \\
                 5.5 JPEG lossless and lossy compression / 78 \\
                 5.6 Sequential and progressive coding / 79 \\
                 5.7 Hierarchical coding / 79 \\
                 5.8 Compression measures / 79 \\
                 6: JPEG Modes of Operation / 81 \\
                 6.1 Sequential DCT-based mode of operation / 81 \\
                 6.2 Progressive DCT-based mode of operation / 86 \\
                 6.3 Sequential lossless mode of operation / 92 \\
                 6.4 Hierarchical mode of operation / 93 \\
                 7: JPEG Syntax and Data Organization / 97 \\
                 7.1 Control procedures and compressed data structure /
                 97 \\
                 7.2 Interchange and abbreviated compressed data formats
                 / 99 \\
                 7.3 Image data ordering / 99 \\
                 7.4 Marker definitions / 105 \\
                 7.5 Frame header / 110 \\
                 7.6 Scan header / 113 \\
                 7.7 Limit on the number of data units in an MCU / 116
                 \\
                 7.8 Marker segments for tables and parameters / 117 \\
                 7.9 Hierarchical progression marker segments / 120 \\
                 7.10 Examples of JPEG data streams / 122 \\
                 7.11 Backus--Naur Form / 127 \\
                 7.12 JPEG BNF / 130 \\
                 8: Entropy Coding Concepts / 135 \\
                 8.1 Entropy and Information / 135 \\
                 8.2 An example to illustrate entropy coding / 137 \\
                 8.3 Variable-length code words / 137 \\
                 8.4 Statistical modeling / 143 \\
                 8.5 Adaptive coding / 147 \\
                 9: JPEG Binary Arithmetic Coding / 149 \\
                 9.1 The QM-encoder / 151 \\
                 9.2 The QM-decoder / 162 \\
                 9.3 More about the QM-coder / 166 \\
                 10: JPEG Coding Models / 169 \\
                 10.1 JPEG sequential DCT-based coding models / 170 \\
                 10.2 Models for progressive DCT-based coding / 173 \\
                 10.3 Coding model for lossless coding / 182 \\
                 10.4 Models for hierarchical coding / 185 \\
                 11: JPEG Huffman Entropy Coding / 189 \\
                 11.1 Statistical models for the Huffman DCT-based
                 sequential mode / 190 \\
                 11.2 Statistical models for progressive DCT-based
                 coding / 194 \\
                 11.3 Statistical models for lossless coding and
                 hierarchical mode spatial corrections / 198 \\
                 11.4 Generation of Huffman tables / 198 \\
                 12: Arithmetic Coding Statistical Models / 203 \\
                 12.1 Overview of JPEG binary arithmetic-coding
                 procedures / 203 \\
                 12.2 Decision trees and notation / 204 \\
                 12.3 Statistical models for the DCT-based sequential
                 mode with arithmetic coding / 206 \\
                 12.4 Statistical models for progressive DCT-based
                 coding / 214 \\
                 12.5 Statistical models for lossless coding and
                 hierarchical-rnode spatial corrections / 216 \\
                 12.6 Arithmetic coding conditioning tables / 218 \\
                 13: More on Arithmetic Coding / 219 \\
                 13.1 Optimal procedures for hardware and software / 220
                 \\
                 13.2 Fast software encoder implementations / 225 \\
                 13.3 Fast software decoder implementations / 228 \\
                 13.4 Conditional exchange / 229 \\
                 13.5 QM-coder versus Q-coder / 229 \\
                 13.6 Resynchronization of decoders / 230 \\
                 13.7 Speedup mode / 231 \\
                 14: Probability Estimation / 233 \\
                 14.1 Bayesian estimation / 234 \\
                 14.2 Renormalization-driven estimation / 235 \\
                 14.3 Markov-chain modelling of the probability
                 estimation / 236 \\
                 14.4 Approximate model / 238 \\
                 14.5 Single-and mixed-context models / 240 \\
                 14.6 Single-context model / 241 \\
                 14.7 Mixed-context model / 243 \\
                 14.8 Application of the estimation models to the
                 QM-coder / 244 \\
                 14.9 Initial learning / 247 \\
                 14.10 Robustness of estimators versus refinement of
                 models / 249 \\
                 14.11 Other estimation tables / 249 \\
                 15: Compression Performance / 253 \\
                 15.1 Results for baseline sequential DCT / 254 \\
                 15.2 Results for sequential DCT with arithmetic coding
                 / 255 \\
                 15.3 Results for sequential DCT with restart capability
                 / 255 \\
                 15.4 Results for progressive DCT with arithmetic coding
                 / 256 \\
                 15.5 Results for lossless mode with arithmetic coding /
                 257 \\
                 15.6 Summary of Results / 258 \\
                 16: JPEG Enhancements / 261 \\
                 16.1 Removing blocking artifacts with AC prediction /
                 261 \\
                 16.2 Low bitrate VQ enhanced decoding / 264 \\
                 16.3 An approximate form of adaptive quantization / 264
                 \\
                 16.4 Display-adjusted decoding / 266 \\
                 17: JPEG Applications and Vendors / 267 \\
                 17.1 Adobe Systems Incorporated / 269 \\
                 17.2 AT\&T Microelectronics / 270 \\
                 17.3 AutoGraph International ApS / 271 \\
                 17.4 AutoView / 272 \\
                 17.5 Bulletin board systems / 272 \\
                 17.6 California Department of Motor Vehicles / 273 \\
                 17.7 C-Cube Microsystems, Inc. / 273 \\
                 17.8 Data Link / 275 \\
                 17.9 Discovery Technologies, Inc. / 275 \\
                 17.10 DSP / 276 \\
                 17.11 Eastman Kodak Company / 276 \\
                 17.12 Handmade Software / 277 \\
                 17.13 IBM / 278 \\
                 17.14 Identix / 279 \\
                 17.15 IIT / 279 \\
                 17.16 Independent JPEG Group / 280 \\
                 17.17 ITR / 281 \\
                 17.18 Lewis Siwell, Inc. / 281 \\
                 17.19 LSI Logic / 282 \\
                 17.20 Moore Data Management Services / 283 \\
                 17.21 NBS Imaging / 283 \\
                 17.22 NTT Electronics Technology Ltd. / 284 \\
                 17.23 OPTIBASE / 284 \\
                 17.24 Optivision, Inc. / 284 \\
                 17.25 Philips Kommunikations Industrie / 285 \\
                 17.26 PRISM / 286 \\
                 17.27 Storm Technology / 286 \\
                 17.28 Telephoto Communications / 287 \\
                 17.29 Tribune Publishing Co. / 288 \\
                 17.30 VideoTelecom / 288 \\
                 17.31 Ximage / 289 \\
                 17.32 Xing / 289 \\
                 17.33 Zoran Corporation / 290 \\
                 17.34 3M / 291 \\
                 17.35 File formats / 292 \\
                 18: Overview of CCITT, ISO, and IEC / 295 \\
                 18.1 ISO / 296 \\
                 18.2 CCITT / 297 \\
                 18.3 IEC / 298 \\
                 18.4 Joint coordination / 299 \\
                 19: History of JPEG / 301 \\
                 19.1 Formation of JPEG / 301 \\
                 19.2 Original JPEG Goals / 302 \\
                 19.3 Selecting an approach / 302 \\
                 19.4 Functional requirements / 303 \\
                 19.5 Refining the ADCT technique / 306 \\
                 19.6 Technical specifications / 307 \\
                 19.7 ISO 10918 Part I / 309 \\
                 19.8 JPEG Part I DIS ballot results / 311 \\
                 19.9 CCITT Recommendation T.81 / 311 \\
                 19.10 ISO 10918 Part 20 / 311 \\
                 19.11 JPEG Goals Achieved / 313 \\
                 20: Other Image Compression Standards / 317 \\
                 20.1 CCITTG3 and G40 / 317 \\
                 20.2 H.2610 / 318 \\
                 20.3 JBIG / 318 \\
                 20.4 MPEG / 325 \\
                 21: Possible Future JPEG Directions / 331 \\
                 21.1 Adaptive quantization / 331 \\
                 21.2 Improvements to lossless coding / 332 \\
                 21.3 Other possible addenda / 333 \\
                 21.4 Backwards compatibility / 333 \\
                 Appendix A. ISO DIS 10918-1 Requirements and Guidelines
                 / 335 \\
                 Appendix B. Draft ISO DIS 10918-2 Compliance Testing /
                 545 \\
                 References / 627 \\
                 Index / 632",
}


bibtype: book
filename: master.bib
label: Pennington:1965:ICM
author: Ralph H. Pennington
title: Introductory Computer Methods and Numerical Analysis
publisher: pub-MACMILLAN
address: pub-MACMILLAN:adr
pages: xi + 452
year: 1965
LCCN: QA76.5 .P38
bibdate: Wed Dec 15 18:09:03 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 18:09:03 ???
acknowledgement: ack-nhfb
rawauthor: Ralph H. Pennington
rawtitle: Introductory Computer Methods and Numerical Analysis
entry:
@Book{Pennington:1965:ICM,
  author =       "Ralph H. Pennington",
  title =        "Introductory Computer Methods and Numerical Analysis",
  publisher =    pub-MACMILLAN,
  address =      pub-MACMILLAN:adr,
  pages =        "xi + 452",
  year =         "1965",
  LCCN =         "QA76.5 .P38",
  bibdate =      "Wed Dec 15 18:09:03 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Penrose:2011:CTE
author: Roger Penrose
title: Cycles of Time: an Extraordinary New View of the Universe
publisher: pub-KNOPF
address: pub-KNOPF:adr
pages: xii + 288
year: 2011
LCCN: QB991.C92 P46 2011
bibdate: Fri Jul 22 15:56:22 MDT 2011
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2011.07.22 15:56:22 MDT
subject: Cyclic universe theory (Cosmology); Cosmology
acknowledgement: ack-nhfb
rawauthor: Roger Penrose
rawtitle: Cycles of Time: an Extraordinary New View of the Universe
ISBN:
0-224-08036-9 (hardcover), 0-307-26590-0 (hardcover) OR 0224080369 (hardcover), 0307265900 (hardcover)

ISBN13:
978-0-224-08036-1 (hardcover), 978-0-307-26590-6 (hardcover) OR 9780224080361 (hardcover), 9780307265906 (hardcover)

abstract:
A groundbreaking book providing a new take on three of cosmology's most profound questions: What, if anything, came before the Big Bang? What is the source of order in our universe? What is the universe's ultimate future? Current understanding of our universe dictates that all matter will eventually thin out to zero density, with huge black holes finally evaporating away into massless energy. Roger Penrose --- one of the most innovative mathematicians of our time --- turns around this predominant picture of the universe's ``heat death,'' arguing how the expected ultimate fate of our accelerating, expanding universe can actually be reinterpreted as the ``Big Bang'' of a new one. Along the way to this remarkable cosmological picture, Penrose sheds new light on basic principles that underlie the behavior of our universe, describing various standard and nonstandard cosmological models, the fundamental role of the cosmic microwave background, and the key status of black holes. Intellectually thrilling and accessible, booktitle Cycles of Time is another essential guide to the universe from one of our preeminent thinkers.

TOC:
The Second Law and its underlying mystery The oddly special nature of the Big Bang Conformal cyclic cosmology

rawabstract:
A groundbreaking book providing a new take on three of cosmology's most profound questions: What, if anything, came before the Big Bang? What is the source of order in our universe? What is the universe's ultimate future? Current understanding of our universe dictates that all matter will eventually thin out to zero density, with huge black holes finally evaporating away into massless energy. Roger Penrose --- one of the most innovative mathematicians of our time --- turns around this predominant picture of the universe's ``heat death,'' arguing how the expected ultimate fate of our accelerating, expanding universe can actually be reinterpreted as the ``Big Bang'' of a new one. Along the way to this remarkable cosmological picture, Penrose sheds new light on basic principles that underlie the behavior of our universe, describing various standard and nonstandard cosmological models, the fundamental role of the cosmic microwave background, and the key status of black holes. Intellectually thrilling and accessible, \booktitle{Cycles of Time} is another essential guide to the universe from one of our preeminent thinkers.

rawTOC:
The Second Law and its underlying mystery \\ The oddly special nature of the Big Bang \\ Conformal cyclic cosmology

entry:
@Book{Penrose:2011:CTE,
  author =       "Roger Penrose",
  title =        "Cycles of Time: an Extraordinary New View of the
                 Universe",
  publisher =    pub-KNOPF,
  address =      pub-KNOPF:adr,
  pages =        "xii + 288",
  year =         "2011",
  ISBN =         "0-224-08036-9 (hardcover), 0-307-26590-0 (hardcover)",
  ISBN-13 =      "978-0-224-08036-1 (hardcover), 978-0-307-26590-6
                 (hardcover)",
  LCCN =         "QB991.C92 P46 2011",
  bibdate =      "Fri Jul 22 15:56:22 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "A groundbreaking book providing a new take on three of
                 cosmology's most profound questions: What, if anything,
                 came before the Big Bang? What is the source of order
                 in our universe? What is the universe's ultimate
                 future? Current understanding of our universe dictates
                 that all matter will eventually thin out to zero
                 density, with huge black holes finally evaporating away
                 into massless energy. Roger Penrose --- one of the most
                 innovative mathematicians of our time --- turns around
                 this predominant picture of the universe's ``heat
                 death,'' arguing how the expected ultimate fate of our
                 accelerating, expanding universe can actually be
                 reinterpreted as the ``Big Bang'' of a new one. Along
                 the way to this remarkable cosmological picture,
                 Penrose sheds new light on basic principles that
                 underlie the behavior of our universe, describing
                 various standard and nonstandard cosmological models,
                 the fundamental role of the cosmic microwave
                 background, and the key status of black holes.
                 Intellectually thrilling and accessible,
                 \booktitle{Cycles of Time} is another essential guide
                 to the universe from one of our preeminent thinkers.",
  acknowledgement = ack-nhfb,
  subject =      "Cyclic universe theory (Cosmology); Cosmology",
  tableofcontents = "The Second Law and its underlying mystery \\
                 The oddly special nature of the Big Bang \\
                 Conformal cyclic cosmology",
}


bibtype: book
filename: master.bib
label: Pepple:2004:MSO
author: Ken Pepple and Brian Down and David Levy
title: Migrating to the Solaris Operating System: The Discipline of UNIX-to-UNIX Migrations
publisher: pub-PHPTR
address: pub-PHPTR:adr
pages: xix + 251
year: 2004
ISBN: 0-13-150263-8 OR 0131502638
ISBN13: 978-0-13-150263-5 OR 9780131502635
LCCN: QA76.76.O63 P445 2004
bibdate: Thu Dec 18 10:49:19 2003
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2003.12.18 10:49:19 ???
series: Sun BluePrints Program
acknowledgement: ack-nhfb
rawauthor: Ken Pepple and Brian Down and David Levy
rawtitle: Migrating to the {Solaris} Operating System: The Discipline of {UNIX-to-UNIX} Migrations
abstract:
Increase efficiency with new technologies and processes Improve the performance and availability of your IT solutions Reduce IT total cost of ownership This book presents an established methodology for transitioning the people, processes, and technologies in IT environments To The Solaris(TM) Operating System. it steps you through the various phases of the migration process, using detailed case studies to illustrate the benefits, costs, and requirements associated with a migration project. While this book focuses on UNIX server migrations, The methodology and best practices presented apply for most migrations To The Solaris environment. They can be used for projects ranging from the smallest data conversion To The largest legacy migration.

TOC:
Acknowledgments Preface How This Guide is Organized Related Documentation Typographic Conventions Shell Prompts Using UNIX Commands Accessing Sun Documentation Introduction to Migrations Migration Goals Migration Motivators Migration Benefits Migration Problems UNIX Migration Overview Brief History of UNIX Comparison of Commercial and Derivative Versions of UNIX Migration Strategies Understanding the Concepts Evaluating the Environment Examining Strategies Choosing a Strategy and Developing Tactics Justifying and Planning a Migration Project Establishing a Business Justification for a Migration Effort Planning Your Migration Project Closing the Project Introducing the SunTone Methodology for Migration SunTone Architecture Methodology Architect Phase Defined Implement Phase Defined Manage Phase Defined Moving Between Phases Architecting a Migration Assessing the Environment Designing and Architecting a Migration Solution Implementing a Migration Porting an Application to a New Operating System Migrating Data Creating the Production Environment Testing the Migrated Environment Refining and Documenting Your Migration Methodology Training End Users and Staff Managing a Migrated Environment Extending the E-Stack Defining Migration-Specific Management Tasks Migrating From Red Hat Linux Overview of Linux Justifying the Migration Architecting the Target Solaris Environment Implementing the Migration to the Solaris Environment Managing the New Solaris Environment Migrating From Tru64 UNIX Overview of Tru64 64-Bit Computing Clustering Justifying the Migration Architecting the Migration Implementing the Migration to the Solaris Environment Managing the New Solaris Environment Migrating From the HP/UX Platform Justifying the Migration Architecting the Migration Solution Implementing the Migration to the Solaris Operating System Managing the New Solaris Environment Results Sample JScore Report and Analysis Index

rawabstract:
Increase efficiency with new technologies and processes Improve the performance and availability of your IT solutions Reduce IT total cost of ownership This book presents an established methodology for transitioning the people, processes, and technologies in IT environments To The Solaris(TM) Operating System. it steps you through the various phases of the migration process, using detailed case studies to illustrate the benefits, costs, and requirements associated with a migration project. While this book focuses on UNIX server migrations, The methodology and best practices presented apply for most migrations To The Solaris environment. They can be used for projects ranging from the smallest data conversion To The largest legacy migration.

rawTOC:
Acknowledgments \\ Preface \\ How This Guide is Organized \\ Related Documentation \\ Typographic Conventions \\ Shell Prompts \\ Using UNIX Commands \\ Accessing Sun Documentation \\ Introduction to Migrations \\ Migration Goals \\ Migration Motivators \\ Migration Benefits \\ Migration Problems \\ UNIX Migration Overview \\ Brief History of UNIX \\ Comparison of Commercial and Derivative Versions of UNIX \\ Migration Strategies \\ Understanding the Concepts \\ Evaluating the Environment \\ Examining Strategies \\ Choosing a Strategy and Developing Tactics \\ Justifying and Planning a Migration Project \\ Establishing a Business Justification for a Migration Effort \\ Planning Your Migration Project \\ Closing the Project \\ Introducing the SunTone Methodology for Migration \\ SunTone Architecture Methodology \\ Architect Phase Defined \\ Implement Phase Defined \\ Manage Phase Defined \\ Moving Between Phases \\ Architecting a Migration \\ Assessing the Environment \\ Designing and Architecting a Migration Solution \\ Implementing a Migration \\ Porting an Application to a New Operating System \\ Migrating Data \\ Creating the Production Environment \\ Testing the Migrated Environment \\ Refining and Documenting Your Migration Methodology \\ Training End Users and Staff \\ Managing a Migrated Environment \\ Extending the E-Stack \\ Defining Migration-Specific Management Tasks \\ Migrating From Red Hat Linux \\ Overview of Linux \\ Justifying the Migration \\ Architecting the Target Solaris Environment \\ Implementing the Migration to the Solaris Environment \\ Managing the New Solaris Environment \\ Migrating From Tru64 UNIX \\ Overview of Tru64 \\ 64-Bit Computing \\ Clustering \\ Justifying the Migration \\ Architecting the Migration \\ Implementing the Migration to the Solaris Environment \\ Managing the New Solaris Environment \\ Migrating From the HP/UX Platform \\ Justifying the Migration \\ Architecting the Migration Solution \\ Implementing the Migration to the Solaris Operating System \\ Managing the New Solaris Environment \\ Results \\ Sample JScore Report and Analysis \\ Index

entry:
@Book{Pepple:2004:MSO,
  author =       "Ken Pepple and Brian Down and David Levy",
  title =        "Migrating to the {Solaris} Operating System: The
                 Discipline of {UNIX-to-UNIX} Migrations",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  pages =        "xix + 251",
  year =         "2004",
  ISBN =         "0-13-150263-8",
  ISBN-13 =      "978-0-13-150263-5",
  LCCN =         "QA76.76.O63 P445 2004",
  bibdate =      "Thu Dec 18 10:49:19 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  series =       "Sun BluePrints Program",
  abstract =     "Increase efficiency with new technologies and
                 processes Improve the performance and availability of
                 your IT solutions Reduce IT total cost of ownership
                 This book presents an established methodology for
                 transitioning the people, processes, and technologies
                 in IT environments To The Solaris(TM) Operating System.
                 it steps you through the various phases of the
                 migration process, using detailed case studies to
                 illustrate the benefits, costs, and requirements
                 associated with a migration project. While this book
                 focuses on UNIX server migrations, The methodology and
                 best practices presented apply for most migrations To
                 The Solaris environment. They can be used for projects
                 ranging from the smallest data conversion To The
                 largest legacy migration.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Acknowledgments \\
                 Preface \\
                 How This Guide is Organized \\
                 Related Documentation \\
                 Typographic Conventions \\
                 Shell Prompts \\
                 Using UNIX Commands \\
                 Accessing Sun Documentation \\
                 Introduction to Migrations \\
                 Migration Goals \\
                 Migration Motivators \\
                 Migration Benefits \\
                 Migration Problems \\
                 UNIX Migration Overview \\
                 Brief History of UNIX \\
                 Comparison of Commercial and Derivative Versions of
                 UNIX \\
                 Migration Strategies \\
                 Understanding the Concepts \\
                 Evaluating the Environment \\
                 Examining Strategies \\
                 Choosing a Strategy and Developing Tactics \\
                 Justifying and Planning a Migration Project \\
                 Establishing a Business Justification for a Migration
                 Effort \\
                 Planning Your Migration Project \\
                 Closing the Project \\
                 Introducing the SunTone Methodology for Migration \\
                 SunTone Architecture Methodology \\
                 Architect Phase Defined \\
                 Implement Phase Defined \\
                 Manage Phase Defined \\
                 Moving Between Phases \\
                 Architecting a Migration \\
                 Assessing the Environment \\
                 Designing and Architecting a Migration Solution \\
                 Implementing a Migration \\
                 Porting an Application to a New Operating System \\
                 Migrating Data \\
                 Creating the Production Environment \\
                 Testing the Migrated Environment \\
                 Refining and Documenting Your Migration Methodology \\
                 Training End Users and Staff \\
                 Managing a Migrated Environment \\
                 Extending the E-Stack \\
                 Defining Migration-Specific Management Tasks \\
                 Migrating From Red Hat Linux \\
                 Overview of Linux \\
                 Justifying the Migration \\
                 Architecting the Target Solaris Environment \\
                 Implementing the Migration to the Solaris Environment
                 \\
                 Managing the New Solaris Environment \\
                 Migrating From Tru64 UNIX \\
                 Overview of Tru64 \\
                 64-Bit Computing \\
                 Clustering \\
                 Justifying the Migration \\
                 Architecting the Migration \\
                 Implementing the Migration to the Solaris Environment
                 \\
                 Managing the New Solaris Environment \\
                 Migrating From the HP/UX Platform \\
                 Justifying the Migration \\
                 Architecting the Migration Solution \\
                 Implementing the Migration to the Solaris Operating
                 System \\
                 Managing the New Solaris Environment \\
                 Results \\
                 Sample JScore Report and Analysis \\
                 Index",
}


bibtype: book
filename: master.bib
label: Perelman:1998:MHT
author: Leslie C. Perelman and James Paradis and Edward Barrett
title: The Mayfield Handbook of Technical and Scientific Writing
publisher: Mayfield Publishing Company
address: Mountain View, CA, USA
pages: xxvii + 508
year: 1998
ISBN: 1-55934-647-7 OR 1559346477
ISBN13: 978-1-55934-647-4 OR 9781559346474
LCCN: T11 .P394 1998
bibdate: Fri Aug 24 07:44:19 2001
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2001.08.24 07:44:19 ???
acknowledgement: ack-nhfb
rawauthor: Leslie C. Perelman and James Paradis and Edward Barrett
rawtitle: The {Mayfield} Handbook of Technical and Scientific Writing
entry:
@Book{Perelman:1998:MHT,
  author =       "Leslie C. Perelman and James Paradis and Edward
                 Barrett",
  title =        "The {Mayfield} Handbook of Technical and Scientific
                 Writing",
  publisher =    "Mayfield Publishing Company",
  address =      "Mountain View, CA, USA",
  pages =        "xxvii + 508",
  year =         "1998",
  ISBN =         "1-55934-647-7",
  ISBN-13 =      "978-1-55934-647-4",
  LCCN =         "T11 .P394 1998",
  bibdate =      "Fri Aug 24 07:44:19 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$31.95",
  acknowledgement = ack-nhfb,
  DEWEY =        "808/.0666 21",
  idnumber =     "501",
}


bibtype: book
filename: master.bib
label: Peterson:1998:JRM
author: Ivars Peterson
title: The Jungles of Randomness: a Mathematical Safari
publisher: pub-WILEY
address: pub-WILEY:adr
pages: viii + 239
year: 1998
ISBN: 0-471-16449-6 OR 0471164496
ISBN13: 978-0-471-16449-4 OR 9780471164494
LCCN: QA273.15.P48 1997
bibdate: Sun Dec 28 22:33:36 1997
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1997.12.28 22:33:36 ???
acknowledgement: ack-nhfb
rawauthor: Ivars Peterson
rawtitle: The Jungles of Randomness: a Mathematical Safari
abstract:
Join acclaimed science writer Ivars Peterson on an adventurous trek through an exotic world of weird dice, fractal drums, firefly rhythms and chaotic amusement park rides, as he explores the wilds of randomness. A tricky, intriguing, even elusive concept, randomness affects our lives in an astonishing range of ways - from the fun of games we play and the noise that spoils the music we hear, to the ways viruses grow and atoms combine. Hidden rules and secret patterns lurk within apparently random events and chance encounters. How likely is it that a fair coin will land heads up ten times in a row? How often might you meet a stranger at a party who shares your birthday? Are there really ways to win at roulette or beat a slot machine? How does the gait of a horse differ from that of a cockroach? Peterson uncovers the answers to a rich array of such tantalizing questions, revealing the surprising, ambiguous boundaries between order and chaos. Along the way we also meet a host of characters, both charming and eccentric, who either made striking discoveries about randomness or were profoundly affected by it. There's the case of Williard Longcor, a man gripped with a passion for throwing dice, who meticulously records the outcomes of millions of tosses and helps correct the theory of the distribution of runs. And there's the tragic case of the brilliant novelist Fyodor Dostoyevsky, who became addicted to the random spin of the roulette wheel. The ``wandering mathematician'' Paul Erdos drops in with his famous greeting ``my brain is open,'' and the visionary architect Buckminster Fuller remarks on the similarities between his geodesic domes and the structure of viruses. The Jungles of Randomness offers a delightful journey into the exciting world of mathematical discovery and imparts a rare vision of the fundamental playfulness of mathematics in our lives.

TOC:
The die is cast Sea of life Shell game Call of the firefly Different drums Noise police Complete chaos Trails of a wanderer Gambling with numbers Lifetimes of chance

rawabstract:
Join acclaimed science writer Ivars Peterson on an adventurous trek through an exotic world of weird dice, fractal drums, firefly rhythms and chaotic amusement park rides, as he explores the wilds of randomness. A tricky, intriguing, even elusive concept, randomness affects our lives in an astonishing range of ways - from the fun of games we play and the noise that spoils the music we hear, to the ways viruses grow and atoms combine. Hidden rules and secret patterns lurk within apparently random events and chance encounters. How likely is it that a fair coin will land heads up ten times in a row? How often might you meet a stranger at a party who shares your birthday? Are there really ways to win at roulette or beat a slot machine? How does the gait of a horse differ from that of a cockroach? Peterson uncovers the answers to a rich array of such tantalizing questions, revealing the surprising, ambiguous boundaries between order and chaos. Along the way we also meet a host of characters, both charming and eccentric, who either made striking discoveries about randomness or were profoundly affected by it. There's the case of Williard Longcor, a man gripped with a passion for throwing dice, who meticulously records the outcomes of millions of tosses and helps correct the theory of the distribution of runs. And there's the tragic case of the brilliant novelist Fyodor Dostoyevsky, who became addicted to the random spin of the roulette wheel. The ``wandering mathematician'' Paul Erd{\H{o}}s drops in with his famous greeting ``my brain is open,'' and the visionary architect Buckminster Fuller remarks on the similarities between his geodesic domes and the structure of viruses. The Jungles of Randomness offers a delightful journey into the exciting world of mathematical discovery and imparts a rare vision of the fundamental playfulness of mathematics in our lives.

rawTOC:
The die is cast \\ Sea of life \\ Shell game \\ Call of the firefly \\ Different drums \\ Noise police \\ Complete chaos \\ Trails of a wanderer \\ Gambling with numbers \\ Lifetimes of chance

entry:
@Book{Peterson:1998:JRM,
  author =       "Ivars Peterson",
  title =        "The Jungles of Randomness: a Mathematical Safari",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "viii + 239",
  year =         "1998",
  ISBN =         "0-471-16449-6",
  ISBN-13 =      "978-0-471-16449-4",
  LCCN =         "QA273.15.P48 1997",
  bibdate =      "Sun Dec 28 22:33:36 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$24.95",
  abstract =     "Join acclaimed science writer Ivars Peterson on an
                 adventurous trek through an exotic world of weird dice,
                 fractal drums, firefly rhythms and chaotic amusement
                 park rides, as he explores the wilds of randomness. A
                 tricky, intriguing, even elusive concept, randomness
                 affects our lives in an astonishing range of ways -
                 from the fun of games we play and the noise that spoils
                 the music we hear, to the ways viruses grow and atoms
                 combine. Hidden rules and secret patterns lurk within
                 apparently random events and chance encounters. How
                 likely is it that a fair coin will land heads up ten
                 times in a row? How often might you meet a stranger at
                 a party who shares your birthday? Are there really ways
                 to win at roulette or beat a slot machine? How does the
                 gait of a horse differ from that of a cockroach?
                 Peterson uncovers the answers to a rich array of such
                 tantalizing questions, revealing the surprising,
                 ambiguous boundaries between order and chaos. Along the
                 way we also meet a host of characters, both charming
                 and eccentric, who either made striking discoveries
                 about randomness or were profoundly affected by it.
                 There's the case of Williard Longcor, a man gripped
                 with a passion for throwing dice, who meticulously
                 records the outcomes of millions of tosses and helps
                 correct the theory of the distribution of runs. And
                 there's the tragic case of the brilliant novelist
                 Fyodor Dostoyevsky, who became addicted to the random
                 spin of the roulette wheel. The ``wandering
                 mathematician'' Paul Erd{\H{o}}s drops in with his
                 famous greeting ``my brain is open,'' and the visionary
                 architect Buckminster Fuller remarks on the
                 similarities between his geodesic domes and the
                 structure of viruses. The Jungles of Randomness offers
                 a delightful journey into the exciting world of
                 mathematical discovery and imparts a rare vision of the
                 fundamental playfulness of mathematics in our lives.",
  acknowledgement = ack-nhfb,
  tableofcontents = "The die is cast \\
                 Sea of life \\
                 Shell game \\
                 Call of the firefly \\
                 Different drums \\
                 Noise police \\
                 Complete chaos \\
                 Trails of a wanderer \\
                 Gambling with numbers \\
                 Lifetimes of chance",
}


bibtype: book
filename: master.bib
label: PeytonJones:1987:IFP
author: Simon L. Peyton Jones
title: The Implementation of Functional Programming Languages
publisher: pub-PHI
address: pub-PHI:adr
pages: xviii + 445
year: 1987
ISBN: 0-13-453333-X OR 013453333X
ISBN13: 978-0-13-453333-9 OR 9780134533339
LCCN: QA76.7.P495 1987
bibdate: Fri Sep 11 07:43:36 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.09.11 07:43:36 ???
note: With chapters by Philip Wadler, Peter Hancock, David Turner.
acknowledgement: ack-nhfb
rawauthor: Simon L. {Peyton Jones}
rawnote: With chapters by Philip Wadler, Peter Hancock, David Turner.
rawtitle: The Implementation of Functional Programming Languages
entry:
@Book{PeytonJones:1987:IFP,
  author =       "Simon L. {Peyton Jones}",
  title =        "The Implementation of Functional Programming
                 Languages",
  publisher =    pub-PHI,
  address =      pub-PHI:adr,
  pages =        "xviii + 445",
  year =         "1987",
  ISBN =         "0-13-453333-X",
  ISBN-13 =      "978-0-13-453333-9",
  LCCN =         "QA76.7.P495 1987",
  bibdate =      "Fri Sep 11 07:43:36 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "With chapters by Philip Wadler, Peter Hancock, David
                 Turner.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Pharr:2005:GGP
editor: Matt Pharr and Randima Fernando
title: GPU Gems 2: Programming Techniques for High-performance Graphics and General-purpose Computation
publisher: pub-AW
address: pub-AW:adr
pages: xlix + 814
year: 2005
ISBN: 0-321-33559-7 (hardcover) OR 0321335597 (hardcover)
ISBN13: 978-0-321-33559-3 (hardcover) OR 9780321335593 (hardcover)
LCCN: T385 .G688 2005
bibdate: Mon Apr 5 18:04:41 MDT 2010
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2010.04.05 18:04:41 MDT
URL: http://www.loc.gov/catdir/toc/ecip055/2004030181.html
subject: computer graphics; real-time programming
acknowledgement: ack-nhfb
raweditor: Matt Pharr and Randima Fernando
rawtitle: {GPU} Gems 2: Programming Techniques for High-performance Graphics and General-purpose Computation
abstract:
This sequel to the best-selling, first volume of booktitle GPU Gems details the latest programming techniques for today's graphics processing units (GPUs). As GPUs find their way into mobile phones, handheld gaming devices, and consoles, GPU expertise is even more critical in today's competitive environment. Real-time graphics programmers will discover the latest algorithms for creating advanced visual effects, strategies for managing complex scenes, and techniques for advanced image processing. Readers will also learn new methods for using the substantial processing power of the GPU in other computationally intensive applications, such as scientific computing and finance. Twenty of the book's forty-eight chapters are devoted to GPGPU programming, from basic concepts to advanced techniques. Written by experts in cutting-edge GPU programming, this book offers readers practical means to harness the enormous capabilities of GPUs.

TOC:
1: Toward photorealism in virtual botany / David Whatley 2: Terrain rendering using GPU-based geometry clipmaps / Arul Asirvatham and Hugues Hoppe 3: Inside geometry instancing / Francesco Carucci 4: Segment buffering / Jon Olick 5: Optimizing resource management with multistreaming / Oliver Hoeller and Kurt Pelzer 6: Hardware occlusion queries made useful / Michael Wimmer and Jiri Bittner 7: Adaptive tessellation of subdivision surfaces with displacement mapping / Michael Bunnell 8: Per-pixel displacement mapping with distance functions / William Donnelly 9: Deferred shading in S.T.A.L.K.E.R. / Oles Shishkovtsov 10: Real-time computation of dynamic irradiance environment maps / Gary King 11: Approximate bidirectional texture functions / Jan Kautz 12: Tile-based texture mapping / Li-Yi Wei 13: Implementing the mental images phenomena renderer on the GPU / Martin-Karl Lefrancois 14: Dynamic ambient occlusion and indirect lighting / Michael Bunnell 15: Blueprint rendering and ``sketchy drawings'' / Marc Nienhaus and Jurgen Dollner 16: Accurate atmospheric scattering / Sean O'Neil 17: Efficient soft-edged shadows using pixel shader branching / Yury Uralsky 18: Using vertex texture displacement for realistic water rendering / Yuri Kryachko 19: Generic refraction simulation / Tiago Sousa 20: Fast third-order texture filtering / Christian Sigg and Markus Hadwiger 21: High-quality antialiased rasterization / Dan Wexler and Eric Enderton 22: Fast prefiltered lines / Eric Chan and Fredo Durand 23: Hair animation and rendering in the Nalu demo / Hubert Nguyen and William Donnelly 24: Using lookup tables to accelerate color transformations / Jeremy Selan 25: GPU image processing in Apple's motion / Pete Warden 26: Implementing improved Perlin noise / Simon Green 27: Advanced high-quality filtering / Justin Novosad 28: Mipmap-level measurement / Iain Cantlay 29: Streaming architectures and technology trends / John Owens 30: The GeForce 6 series GPU architecture / Emmett Kilgariff and Randima Fernando 31: Mapping computational concepts to GPUs / Mark Harris 32: Taking the plunge into GPU computing / Ian Buck 33: Implementing efficient parallel data structures on GPUs / Aaron Lefohn, Joe Kniss and John Owens 34: GPU flow-control idioms / Mark Harris and Ian Buck 35: GPU program optimization / Cliff Woolley 36: Stream reduction operations for GPGPU applications / Daniel Horn 37: Octree textures on the GPU / Sylvain Lefebvre, Samuel Hornus and Fabrice Neyret 38: High-quality global illumination rendering using rasterization / Toshiya Hachisuka 39: Global illumination using progressive refinement radiosity / Greg Coombe and Mark Harris 40: Computer vision on the GPU / James Fung 41: Deferred filtering: rendering from difficult data formats / Joe Kniss, Aaron Lefohn and Nathaniel Fout 42: Conservative rasterization / Jon Hasselgren, Tomas Akenine-Moller and Lennart Ohlsson 43: GPU computing for protein structure prediction / Paulius Micikevicius 44: A GPU framework for solving systems of linear equations / Jens Kruger and Rudiger Westermann 45: Options pricing on the GPU / Craig Kolb and Matt Pharr 46: Improved GPU sorting / Peter Kipfer and Rudiger Westermann 47: Flow simulation with complex boundaries / Wei Li, Zhe Fan, Xiaoming Wei and Arie Kaufman 48: Medical image reconstruction with the FFT / Thilaka Sumanaweera and Donald Liu

rawabstract:
This sequel to the best-selling, first volume of \booktitle{GPU Gems} details the latest programming techniques for today's graphics processing units (GPUs). As GPUs find their way into mobile phones, handheld gaming devices, and consoles, GPU expertise is even more critical in today's competitive environment. Real-time graphics programmers will discover the latest algorithms for creating advanced visual effects, strategies for managing complex scenes, and techniques for advanced image processing. Readers will also learn new methods for using the substantial processing power of the GPU in other computationally intensive applications, such as scientific computing and finance. Twenty of the book's forty-eight chapters are devoted to GPGPU programming, from basic concepts to advanced techniques. Written by experts in cutting-edge GPU programming, this book offers readers practical means to harness the enormous capabilities of GPUs.

rawTOC:
1: Toward photorealism in virtual botany / David Whatley \\ 2: Terrain rendering using GPU-based geometry clipmaps / Arul Asirvatham and Hugues Hoppe \\ 3: Inside geometry instancing / Francesco Carucci \\ 4: Segment buffering / Jon Olick \\ 5: Optimizing resource management with multistreaming / Oliver Hoeller and Kurt Pelzer \\ 6: Hardware occlusion queries made useful / Michael Wimmer and Jiri Bittner \\ 7: Adaptive tessellation of subdivision surfaces with displacement mapping / Michael Bunnell \\ 8: Per-pixel displacement mapping with distance functions / William Donnelly \\ 9: Deferred shading in S.T.A.L.K.E.R. / Oles Shishkovtsov \\ 10: Real-time computation of dynamic irradiance environment maps / Gary King \\ 11: Approximate bidirectional texture functions / Jan Kautz \\ 12: Tile-based texture mapping / Li-Yi Wei \\ 13: Implementing the mental images phenomena renderer on the GPU / Martin-Karl Lefran{\c{c}}ois \\ 14: Dynamic ambient occlusion and indirect lighting / Michael Bunnell \\ 15: Blueprint rendering and ``sketchy drawings'' / Marc Nienhaus and Jurgen Dollner \\ 16: Accurate atmospheric scattering / Sean O'Neil \\ 17: Efficient soft-edged shadows using pixel shader branching / Yury Uralsky \\ 18: Using vertex texture displacement for realistic water rendering / Yuri Kryachko \\ 19: Generic refraction simulation / Tiago Sousa \\ 20: Fast third-order texture filtering / Christian Sigg and Markus Hadwiger \\ 21: High-quality antialiased rasterization / Dan Wexler and Eric Enderton \\ 22: Fast prefiltered lines / Eric Chan and Fredo Durand \\ 23: Hair animation and rendering in the Nalu demo / Hubert Nguyen and William Donnelly \\ 24: Using lookup tables to accelerate color transformations / Jeremy Selan \\ 25: GPU image processing in Apple's motion / Pete Warden \\ 26: Implementing improved Perlin noise / Simon Green \\ 27: Advanced high-quality filtering / Justin Novosad \\ 28: Mipmap-level measurement / Iain Cantlay \\ 29: Streaming architectures and technology trends / John Owens \\ 30: The GeForce 6 series GPU architecture / Emmett Kilgariff and Randima Fernando \\ 31: Mapping computational concepts to GPUs / Mark Harris \\ 32: Taking the plunge into GPU computing / Ian Buck \\ 33: Implementing efficient parallel data structures on GPUs / Aaron Lefohn, Joe Kniss and John Owens \\ 34: GPU flow-control idioms / Mark Harris and Ian Buck \\ 35: GPU program optimization / Cliff Woolley \\ 36: Stream reduction operations for GPGPU applications / Daniel Horn \\ 37: Octree textures on the GPU / Sylvain Lefebvre, Samuel Hornus and Fabrice Neyret \\ 38: High-quality global illumination rendering using rasterization / Toshiya Hachisuka \\ 39: Global illumination using progressive refinement radiosity / Greg Coombe and Mark Harris \\ 40: Computer vision on the GPU / James Fung \\ 41: Deferred filtering: rendering from difficult data formats / Joe Kniss, Aaron Lefohn and Nathaniel Fout \\ 42: Conservative rasterization / Jon Hasselgren, Tomas Akenine-Moller and Lennart Ohlsson \\ 43: GPU computing for protein structure prediction / Paulius Micikevicius \\ 44: A GPU framework for solving systems of linear equations / Jens Kruger and Rudiger Westermann \\ 45: Options pricing on the GPU / Craig Kolb and Matt Pharr \\ 46: Improved GPU sorting / Peter Kipfer and Rudiger Westermann \\ 47: Flow simulation with complex boundaries / Wei Li, Zhe Fan, Xiaoming Wei and Arie Kaufman \\ 48: Medical image reconstruction with the FFT / Thilaka Sumanaweera and Donald Liu

entry:
@Book{Pharr:2005:GGP,
  editor =       "Matt Pharr and Randima Fernando",
  title =        "{GPU} Gems 2: Programming Techniques for
                 High-performance Graphics and General-purpose
                 Computation",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xlix + 814",
  year =         "2005",
  ISBN =         "0-321-33559-7 (hardcover)",
  ISBN-13 =      "978-0-321-33559-3 (hardcover)",
  LCCN =         "T385 .G688 2005",
  bibdate =      "Mon Apr 5 18:04:41 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip055/2004030181.html",
  abstract =     "This sequel to the best-selling, first volume of
                 \booktitle{GPU Gems} details the latest programming
                 techniques for today's graphics processing units
                 (GPUs). As GPUs find their way into mobile phones,
                 handheld gaming devices, and consoles, GPU expertise is
                 even more critical in today's competitive environment.
                 Real-time graphics programmers will discover the latest
                 algorithms for creating advanced visual effects,
                 strategies for managing complex scenes, and techniques
                 for advanced image processing. Readers will also learn
                 new methods for using the substantial processing power
                 of the GPU in other computationally intensive
                 applications, such as scientific computing and finance.
                 Twenty of the book's forty-eight chapters are devoted
                 to GPGPU programming, from basic concepts to advanced
                 techniques. Written by experts in cutting-edge GPU
                 programming, this book offers readers practical means
                 to harness the enormous capabilities of GPUs.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "computer graphics; real-time programming",
  tableofcontents = "1: Toward photorealism in virtual botany / David
                 Whatley \\
                 2: Terrain rendering using GPU-based geometry clipmaps
                 / Arul Asirvatham and Hugues Hoppe \\
                 3: Inside geometry instancing / Francesco Carucci \\
                 4: Segment buffering / Jon Olick \\
                 5: Optimizing resource management with multistreaming /
                 Oliver Hoeller and Kurt Pelzer \\
                 6: Hardware occlusion queries made useful / Michael
                 Wimmer and Jiri Bittner \\
                 7: Adaptive tessellation of subdivision surfaces with
                 displacement mapping / Michael Bunnell \\
                 8: Per-pixel displacement mapping with distance
                 functions / William Donnelly \\
                 9: Deferred shading in S.T.A.L.K.E.R. / Oles
                 Shishkovtsov \\
                 10: Real-time computation of dynamic irradiance
                 environment maps / Gary King \\
                 11: Approximate bidirectional texture functions / Jan
                 Kautz \\
                 12: Tile-based texture mapping / Li-Yi Wei \\
                 13: Implementing the mental images phenomena renderer
                 on the GPU / Martin-Karl Lefran{\c{c}}ois \\
                 14: Dynamic ambient occlusion and indirect lighting /
                 Michael Bunnell \\
                 15: Blueprint rendering and ``sketchy drawings'' / Marc
                 Nienhaus and Jurgen Dollner \\
                 16: Accurate atmospheric scattering / Sean O'Neil \\
                 17: Efficient soft-edged shadows using pixel shader
                 branching / Yury Uralsky \\
                 18: Using vertex texture displacement for realistic
                 water rendering / Yuri Kryachko \\
                 19: Generic refraction simulation / Tiago Sousa \\
                 20: Fast third-order texture filtering / Christian Sigg
                 and Markus Hadwiger \\
                 21: High-quality antialiased rasterization / Dan Wexler
                 and Eric Enderton \\
                 22: Fast prefiltered lines / Eric Chan and Fredo Durand
                 \\
                 23: Hair animation and rendering in the Nalu demo /
                 Hubert Nguyen and William Donnelly \\
                 24: Using lookup tables to accelerate color
                 transformations / Jeremy Selan \\
                 25: GPU image processing in Apple's motion / Pete
                 Warden \\
                 26: Implementing improved Perlin noise / Simon Green
                 \\
                 27: Advanced high-quality filtering / Justin Novosad
                 \\
                 28: Mipmap-level measurement / Iain Cantlay \\
                 29: Streaming architectures and technology trends /
                 John Owens \\
                 30: The GeForce 6 series GPU architecture / Emmett
                 Kilgariff and Randima Fernando \\
                 31: Mapping computational concepts to GPUs / Mark
                 Harris \\
                 32: Taking the plunge into GPU computing / Ian Buck \\
                 33: Implementing efficient parallel data structures on
                 GPUs / Aaron Lefohn, Joe Kniss and John Owens \\
                 34: GPU flow-control idioms / Mark Harris and Ian Buck
                 \\
                 35: GPU program optimization / Cliff Woolley \\
                 36: Stream reduction operations for GPGPU applications
                 / Daniel Horn \\
                 37: Octree textures on the GPU / Sylvain Lefebvre,
                 Samuel Hornus and Fabrice Neyret \\
                 38: High-quality global illumination rendering using
                 rasterization / Toshiya Hachisuka \\
                 39: Global illumination using progressive refinement
                 radiosity / Greg Coombe and Mark Harris \\
                 40: Computer vision on the GPU / James Fung \\
                 41: Deferred filtering: rendering from difficult data
                 formats / Joe Kniss, Aaron Lefohn and Nathaniel Fout
                 \\
                 42: Conservative rasterization / Jon Hasselgren, Tomas
                 Akenine-Moller and Lennart Ohlsson \\
                 43: GPU computing for protein structure prediction /
                 Paulius Micikevicius \\
                 44: A GPU framework for solving systems of linear
                 equations / Jens Kruger and Rudiger Westermann \\
                 45: Options pricing on the GPU / Craig Kolb and Matt
                 Pharr \\
                 46: Improved GPU sorting / Peter Kipfer and Rudiger
                 Westermann \\
                 47: Flow simulation with complex boundaries / Wei Li,
                 Zhe Fan, Xiaoming Wei and Arie Kaufman \\
                 48: Medical image reconstruction with the FFT / Thilaka
                 Sumanaweera and Donald Liu",
}


bibtype: article
filename: master.bib
label: Phillips:1936:BC
author: E. W. Phillips
title: Binary calculation
journal: j-J-INST-ACTUARIES
volume: 67
pages: 187--221
year: 1936
ISSN: 0020-2681 OR 00202681
bibdate: Wed Oct 13 11:33:16 2010
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2010.10.13 11:33:16 ???
note: Reprinted in cite [ 7.1]Randell:1982:ODC.
fjournal: Journal of the Institute of Actuaries
acknowledgement: ack-nhfb
rawauthor: E. W. Phillips
rawnote: Reprinted in \cite[\S 7.1]{Randell:1982:ODC}.
rawtitle: Binary calculation
entry:
@Article{Phillips:1936:BC,
  author =       "E. W. Phillips",
  title =        "Binary calculation",
  journal =      j-J-INST-ACTUARIES,
  volume =       "67",
  number =       "??",
  pages =        "187--221",
  year =         "1936",
  ISSN =         "0020-2681",
  bibdate =      "Wed Oct 13 11:33:16 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 7.1]{Randell:1982:ODC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Institute of Actuaries",
}


bibtype: book
filename: master.bib
label: Phillips:1986:NL
author: Jen Phillips
title: The NAG Library
publisher: pub-CLARENDON
address: pub-CLARENDON:adr
pages: viii + 245
year: 1986
ISBN: 0-19-853263-6 OR 0198532636
ISBN13: 978-0-19-853263-7 OR 9780198532637
LCCN: QA297.P53 1986
bibdate: Wed Dec 15 10:40:46 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:40:46 ???
acknowledgement: ack-nhfb
rawauthor: Jen Phillips
rawtitle: The {NAG} Library
entry:
@Book{Phillips:1986:NL,
  author =       "Jen Phillips",
  title =        "The {NAG} Library",
  publisher =    pub-CLARENDON,
  address =      pub-CLARENDON:adr,
  pages =        "viii + 245",
  year =         "1986",
  ISBN =         "0-19-853263-6",
  ISBN-13 =      "978-0-19-853263-7",
  LCCN =         "QA297.P53 1986",
  bibdate =      "Wed Dec 15 10:40:46 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$14.50",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Piegl:1997:NB
author: Les Piegl and Wayne Tiller
title: The NURBS Book
publisher: pub-SV
address: pub-SV:adr
edition: Second
pages: xiv + 646
year: 1997
ISBN: 3-540-61545-8 OR 3540615458
ISBN13: 978-3-540-61545-3 OR 9783540615453
LCCN: QA224 .P54 1997
bibdate: Wed Mar 14 08:57:13 2001
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2001.03.14 08:57:13 ???
series: Monographs in visual communication
acknowledgement: ack-nhfb
rawauthor: Les Piegl and Wayne Tiller
rawtitle: The {NURBS} Book
abstract:
The second, revised edition of this book covers all aspects of non-uniform rational B-splines necessary to design geometry in a computer-aided environment. Basic B-spline features, curve and surface algorithms, and state-of-the-art geometry tools are all discussed. Detailed code for design algorithms and computational tricks are covered, too, in a lucid, easy-to-understand style, with a minimum of mathematics and using numerous worked examples.

TOC:
1: Curve and surface basics 2: B-spline basis functions 3: B-spline curves and surfaces 4: Rational B-spline curves and surfaces 5: Fundamental geometric algorithms 6: Advanced geometric algorithms 7: Conics and circles 8: Construction of common surfaces 9: Curve and surface fitting 10: Advanced surface construction techniques 11: Shape modification tools 12: Standards and data exchange 13: B-spline programming concepts

rawabstract:
The second, revised edition of this book covers all aspects of non-uniform rational B-splines necessary to design geometry in a computer-aided environment. Basic B-spline features, curve and surface algorithms, and state-of-the-art geometry tools are all discussed. Detailed code for design algorithms and computational tricks are covered, too, in a lucid, easy-to-understand style, with a minimum of mathematics and using numerous worked examples.

rawTOC:
1: Curve and surface basics \\ 2: B-spline basis functions \\ 3: B-spline curves and surfaces \\ 4: Rational B-spline curves and surfaces \\ 5: Fundamental geometric algorithms \\ 6: Advanced geometric algorithms \\ 7: Conics and circles \\ 8: Construction of common surfaces \\ 9: Curve and surface fitting \\ 10: Advanced surface construction techniques \\ 11: Shape modification tools \\ 12: Standards and data exchange \\ 13: B-spline programming concepts

entry:
@Book{Piegl:1997:NB,
  author =       "Les Piegl and Wayne Tiller",
  title =        "The {NURBS} Book",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xiv + 646",
  year =         "1997",
  ISBN =         "3-540-61545-8",
  ISBN-13 =      "978-3-540-61545-3",
  LCCN =         "QA224 .P54 1997",
  bibdate =      "Wed Mar 14 08:57:13 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$59.95",
  series =       "Monographs in visual communication",
  abstract =     "The second, revised edition of this book covers all
                 aspects of non-uniform rational B-splines necessary to
                 design geometry in a computer-aided environment. Basic
                 B-spline features, curve and surface algorithms, and
                 state-of-the-art geometry tools are all discussed.
                 Detailed code for design algorithms and computational
                 tricks are covered, too, in a lucid, easy-to-understand
                 style, with a minimum of mathematics and using numerous
                 worked examples.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "1: Curve and surface basics \\
                 2: B-spline basis functions \\
                 3: B-spline curves and surfaces \\
                 4: Rational B-spline curves and surfaces \\
                 5: Fundamental geometric algorithms \\
                 6: Advanced geometric algorithms \\
                 7: Conics and circles \\
                 8: Construction of common surfaces \\
                 9: Curve and surface fitting \\
                 10: Advanced surface construction techniques \\
                 11: Shape modification tools \\
                 12: Standards and data exchange \\
                 13: B-spline programming concepts",
}


bibtype: book
filename: master.bib
label: Pinker:1994:LI
author: Steven Pinker
title: The Language Instinct
publisher: pub-MORROW
address: pub-MORROW:adr
pages: 494
year: 1994
ISBN: 0-688-12141-1 OR 0688121411
ISBN13: 978-0-688-12141-9 OR 9780688121419
LCCN: P106.P476 1994
bibdate: Wed Apr 6 23:37:04 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.04.06 23:37:04 ???
acknowledgement: ack-nhfb
rawauthor: Steven Pinker
rawtitle: The Language Instinct
abstract:
Everyone has questions about language. Some are from everyday experience: Why do immigrants struggle with a new language, only to have their fluent children ridicule their grammatical errors? Why can't computers converse with us? Why is the hockey team in Toronto called the Maple Leafs, not the Maple Leaves? Some are from popular science: Have scientists really reconstructed the first language spoken on earth? Are there genes for grammar? Can chimpanzees learn sign language? And some are from our deepest ponderings about the human condition: Does our language control our thoughts? How could language have evolved? Is language deteriorating? Today laypeople can chitchat about black holes and dinosaur extinctions, but their curiosity about their own speech has been left unsatisfied --- until now. In booktitle The Language Instinct, Steven Pinker, one of the world's leading scientists of language and the mind, lucidly explains everything you always wanted to know about language: how it works, how children learn it, how it changes, how the brain computes it, how it evolved. But booktitle The Language Instinct is no encyclopedia. With wit, erudition, and deft use of everyday examples of humor and wordplay, Pinker weaves our vast knowledge of language into a compelling theory: that language is a human instinct, wired into our brains by evolution like web spinning in spiders or sonar in bats. The theory not only challenges conventional wisdom about language itself (especially from the self-appointed ``experts'' who claim to be safe-guarding the language hut who understand it less well than a typical teenager). It is part of a whole new vision of the human mind: not a general-purpose computer, but a collection of instincts adapted to solving evolutionarily significant problems - the mind as a Swiss Army knife. Entertaining, insightful, provocative, booktitle The Language Instinct will change the way you talk about talking and think about thinking.

TOC:
An instinct to acquire an art Chatterboxes Mentalese How language works Words, words, words The sounds of silence Talking heads The Tower of Babel Baby born talking--describes heaven Language organs and grammar genes The big bang The language mavens Mind design

rawabstract:
Everyone has questions about language. Some are from everyday experience: Why do immigrants struggle with a new language, only to have their fluent children ridicule their grammatical errors? Why can't computers converse with us? Why is the hockey team in Toronto called the Maple Leafs, not the Maple Leaves? Some are from popular science: Have scientists really reconstructed the first language spoken on earth? Are there genes for grammar? Can chimpanzees learn sign language? And some are from our deepest ponderings about the human condition: Does our language control our thoughts? How could language have evolved? Is language deteriorating? Today laypeople can chitchat about black holes and dinosaur extinctions, but their curiosity about their own speech has been left unsatisfied --- until now. In \booktitle{The Language Instinct}, Steven Pinker, one of the world's leading scientists of language and the mind, lucidly explains everything you always wanted to know about language: how it works, how children learn it, how it changes, how the brain computes it, how it evolved. But \booktitle{The Language Instinct} is no encyclopedia. With wit, erudition, and deft use of everyday examples of humor and wordplay, Pinker weaves our vast knowledge of language into a compelling theory: that language is a human instinct, wired into our brains by evolution like web spinning in spiders or sonar in bats. The theory not only challenges conventional wisdom about language itself (especially from the self-appointed ``experts'' who claim to be safe-guarding the language hut who understand it less well than a typical teenager). It is part of a whole new vision of the human mind: not a general-purpose computer, but a collection of instincts adapted to solving evolutionarily significant problems - the mind as a Swiss Army knife. Entertaining, insightful, provocative, \booktitle{The Language Instinct} will change the way you talk about talking and think about thinking.

rawTOC:
An instinct to acquire an art \\ Chatterboxes \\ Mentalese \\ How language works \\ Words, words, words \\ The sounds of silence \\ Talking heads \\ The Tower of Babel \\ Baby born talking--describes heaven \\ Language organs and grammar genes \\ The big bang \\ The language mavens \\ Mind design

entry:
@Book{Pinker:1994:LI,
  author =       "Steven Pinker",
  title =        "The Language Instinct",
  publisher =    pub-MORROW,
  address =      pub-MORROW:adr,
  pages =        "494",
  year =         "1994",
  ISBN =         "0-688-12141-1",
  ISBN-13 =      "978-0-688-12141-9",
  LCCN =         "P106.P476 1994",
  bibdate =      "Wed Apr 6 23:37:04 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$23.00",
  abstract =     "Everyone has questions about language. Some are from
                 everyday experience: Why do immigrants struggle with a
                 new language, only to have their fluent children
                 ridicule their grammatical errors? Why can't computers
                 converse with us? Why is the hockey team in Toronto
                 called the Maple Leafs, not the Maple Leaves? Some are
                 from popular science: Have scientists really
                 reconstructed the first language spoken on earth? Are
                 there genes for grammar? Can chimpanzees learn sign
                 language? And some are from our deepest ponderings
                 about the human condition: Does our language control
                 our thoughts? How could language have evolved? Is
                 language deteriorating? Today laypeople can chitchat
                 about black holes and dinosaur extinctions, but their
                 curiosity about their own speech has been left
                 unsatisfied --- until now. In \booktitle{The Language
                 Instinct}, Steven Pinker, one of the world's leading
                 scientists of language and the mind, lucidly explains
                 everything you always wanted to know about language:
                 how it works, how children learn it, how it changes,
                 how the brain computes it, how it evolved. But
                 \booktitle{The Language Instinct} is no encyclopedia.
                 With wit, erudition, and deft use of everyday examples
                 of humor and wordplay, Pinker weaves our vast knowledge
                 of language into a compelling theory: that language is
                 a human instinct, wired into our brains by evolution
                 like web spinning in spiders or sonar in bats. The
                 theory not only challenges conventional wisdom about
                 language itself (especially from the self-appointed
                 ``experts'' who claim to be safe-guarding the language
                 hut who understand it less well than a typical
                 teenager). It is part of a whole new vision of the
                 human mind: not a general-purpose computer, but a
                 collection of instincts adapted to solving
                 evolutionarily significant problems - the mind as a
                 Swiss Army knife. Entertaining, insightful,
                 provocative, \booktitle{The Language Instinct} will
                 change the way you talk about talking and think about
                 thinking.",
  acknowledgement = ack-nhfb,
  tableofcontents = "An instinct to acquire an art \\
                 Chatterboxes \\
                 Mentalese \\
                 How language works \\
                 Words, words, words \\
                 The sounds of silence \\
                 Talking heads \\
                 The Tower of Babel \\
                 Baby born talking--describes heaven \\
                 Language organs and grammar genes \\
                 The big bang \\
                 The language mavens \\
                 Mind design",
}


bibtype: book
filename: master.bib
label: Pinker:1997:HMW
author: Steven Pinker
title: How the Mind Works
publisher: pub-NORTON
address: pub-NORTON:adr
pages: xii + 660
year: 1997
ISBN: 0-393-04535-8 OR 0393045358
ISBN13: 978-0-393-04535-2 OR 9780393045352
LCCN: QP360.5.P56 1997
bibdate: Sun Dec 28 22:27:17 1997
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1997.12.28 22:27:17 ???
acknowledgement: ack-nhfb
rawauthor: Steven Pinker
rawtitle: How the Mind Works
abstract:
In this book the author, a cognitive scientist explains how the brain evolved to store and use information, allowing our ancestors to control their environment, and why we think and act as we do. He explains what the mind is, how it evolved, and how it allows us to see, think, feel, laugh, interact, enjoy the arts, and ponder the mysteries of life. This work explains many of the imponderables of everyday life. Why does a face look more attractive with makeup? How do ``Magic-Eye'' 3-D stereograms work? Why do we feel that a run of heads makes the coin more likely to land tails? Why is the thought of eating worms disgusting? Why do men challenge each other to duels and murder their ex-wives? Why are children bratty? Why do fools fall in love? Why are we soothed by paintings and music? And why do puzzles like the self, free will, and consciousness leave us dizzy? The arguments in the book are as bold as its title. The author rehabilitates unfashionable ideas, such as that the mind is a computer and that human nature was shaped by natural selection. And he challenges fashionable ones, such as that passionate emotions are irrational, that parents socialize their children, that creativity springs from the unconscious, that nature is good and modern society corrupting, and that art and religion are expressions of our higher spiritual yearnings.

TOC:
Standard equipment Thinking machines Revenge of the nerds The mind's eye Good ideas Hotheads Family values The meaning of life

rawabstract:
In this book the author, a cognitive scientist explains how the brain evolved to store and use information, allowing our ancestors to control their environment, and why we think and act as we do. He explains what the mind is, how it evolved, and how it allows us to see, think, feel, laugh, interact, enjoy the arts, and ponder the mysteries of life. This work explains many of the imponderables of everyday life. Why does a face look more attractive with makeup? How do ``Magic-Eye'' 3-D stereograms work? Why do we feel that a run of heads makes the coin more likely to land tails? Why is the thought of eating worms disgusting? Why do men challenge each other to duels and murder their ex-wives? Why are children bratty? Why do fools fall in love? Why are we soothed by paintings and music? And why do puzzles like the self, free will, and consciousness leave us dizzy? The arguments in the book are as bold as its title. The author rehabilitates unfashionable ideas, such as that the mind is a computer and that human nature was shaped by natural selection. And he challenges fashionable ones, such as that passionate emotions are irrational, that parents socialize their children, that creativity springs from the unconscious, that nature is good and modern society corrupting, and that art and religion are expressions of our higher spiritual yearnings.

rawTOC:
Standard equipment \\ Thinking machines \\ Revenge of the nerds \\ The mind's eye \\ Good ideas \\ Hotheads \\ Family values \\ The meaning of life

entry:
@Book{Pinker:1997:HMW,
  author =       "Steven Pinker",
  title =        "How the Mind Works",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "xii + 660",
  year =         "1997",
  ISBN =         "0-393-04535-8",
  ISBN-13 =      "978-0-393-04535-2",
  LCCN =         "QP360.5.P56 1997",
  bibdate =      "Sun Dec 28 22:27:17 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$29.95",
  abstract =     "In this book the author, a cognitive scientist
                 explains how the brain evolved to store and use
                 information, allowing our ancestors to control their
                 environment, and why we think and act as we do. He
                 explains what the mind is, how it evolved, and how it
                 allows us to see, think, feel, laugh, interact, enjoy
                 the arts, and ponder the mysteries of life. This work
                 explains many of the imponderables of everyday life.
                 Why does a face look more attractive with makeup? How
                 do ``Magic-Eye'' 3-D stereograms work? Why do we feel
                 that a run of heads makes the coin more likely to land
                 tails? Why is the thought of eating worms disgusting?
                 Why do men challenge each other to duels and murder
                 their ex-wives? Why are children bratty? Why do fools
                 fall in love? Why are we soothed by paintings and
                 music? And why do puzzles like the self, free will, and
                 consciousness leave us dizzy? The arguments in the book
                 are as bold as its title. The author rehabilitates
                 unfashionable ideas, such as that the mind is a
                 computer and that human nature was shaped by natural
                 selection. And he challenges fashionable ones, such as
                 that passionate emotions are irrational, that parents
                 socialize their children, that creativity springs from
                 the unconscious, that nature is good and modern society
                 corrupting, and that art and religion are expressions
                 of our higher spiritual yearnings.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Standard equipment \\
                 Thinking machines \\
                 Revenge of the nerds \\
                 The mind's eye \\
                 Good ideas \\
                 Hotheads \\
                 Family values \\
                 The meaning of life",
}


bibtype: book
filename: master.bib
label: Pinker:1999:WRI
author: Steven Pinker
title: Words and Rules: the Ingredients of Language
publisher: pub-BASIC-BOOKS
address: pub-BASIC-BOOKS:adr
pages: xi + 348
year: 1999
LCCN: P106 .P477 1999
bibdate: Wed Jun 21 05:55:43 2000
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2000.06.21 05:55:43 ???
acknowledgement: ack-nhfb
rawauthor: Steven Pinker
rawtitle: Words and Rules: the Ingredients of Language
ISBN:
0-465-07269-0 (hardcover), 0-06-095840-5 (paperback), 0-465-04971-0 (e-book) OR 0465072690 (hardcover), 0060958405 (paperback), 0465049710 (ebook)

ISBN13:
978-0-465-07269-9 (hardcover), 978-0-06-095840-4 (paperback), 978-0-465-04971-4 (e-book) OR 9780465072699 (hardcover), 9780060958404 (paperback), 9780465049714 (ebook)

abstract:
In booktitle Words and Rules, Pinker explains the profound mysteries of language by picking a deceptively single phenomenon and examining it from every angle. The phenomenon --- regular and irregular verbs connects an astonishing array of topics in the sciences and humanities: the history of languages; the theories of Noam Chomsky and his critics; the attempts to simulate language using computer simulations of neural networks; the illuminating errors of children as they begin to speak; the nature of human concepts; the peculiarities of the English language; major ideas in the history of Western philosophy; the latest techniques in identifying genes and imaging the living brain.

TOC:
The infinite library Dissection by linguistics Broken telephone In single combat Word nerds Of mice and men Kids say the darnedest things The horrors of the German language The black box A digital mind in an analog world

rawabstract:
In \booktitle{Words and Rules}, Pinker explains the profound mysteries of language by picking a deceptively single phenomenon and examining it from every angle. The phenomenon --- regular and irregular verbs connects an astonishing array of topics in the sciences and humanities: the history of languages; the theories of Noam Chomsky and his critics; the attempts to simulate language using computer simulations of neural networks; the illuminating errors of children as they begin to speak; the nature of human concepts; the peculiarities of the English language; major ideas in the history of Western philosophy; the latest techniques in identifying genes and imaging the living brain.

rawTOC:
The infinite library \\ Dissection by linguistics \\ Broken telephone \\ In single combat \\ Word nerds \\ Of mice and men \\ Kids say the darnedest things \\ The horrors of the German language \\ The black box \\ A digital mind in an analog world

entry:
@Book{Pinker:1999:WRI,
  author =       "Steven Pinker",
  title =        "Words and Rules: the Ingredients of Language",
  publisher =    pub-BASIC-BOOKS,
  address =      pub-BASIC-BOOKS:adr,
  pages =        "xi + 348",
  year =         "1999",
  ISBN =         "0-465-07269-0 (hardcover), 0-06-095840-5 (paperback),
                 0-465-04971-0 (e-book)",
  ISBN-13 =      "978-0-465-07269-9 (hardcover), 978-0-06-095840-4
                 (paperback), 978-0-465-04971-4 (e-book)",
  LCCN =         "P106 .P477 1999",
  bibdate =      "Wed Jun 21 05:55:43 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "In \booktitle{Words and Rules}, Pinker explains the
                 profound mysteries of language by picking a deceptively
                 single phenomenon and examining it from every angle.
                 The phenomenon --- regular and irregular verbs connects
                 an astonishing array of topics in the sciences and
                 humanities: the history of languages; the theories of
                 Noam Chomsky and his critics; the attempts to simulate
                 language using computer simulations of neural networks;
                 the illuminating errors of children as they begin to
                 speak; the nature of human concepts; the peculiarities
                 of the English language; major ideas in the history of
                 Western philosophy; the latest techniques in
                 identifying genes and imaging the living brain.",
  acknowledgement = ack-nhfb,
  tableofcontents = "The infinite library \\
                 Dissection by linguistics \\
                 Broken telephone \\
                 In single combat \\
                 Word nerds \\
                 Of mice and men \\
                 Kids say the darnedest things \\
                 The horrors of the German language \\
                 The black box \\
                 A digital mind in an analog world",
}


bibtype: book
filename: master.bib
label: Pinker:2002:BSM
author: Steven Pinker
title: The blank slate: the modern denial of human nature
publisher: pub-VIKING
address: pub-VIKING:adr
pages: xvi + 509
year: 2002
ISBN: 0-670-03151-8 (hardcover) OR 0670031518 (hardcover)
ISBN13: 978-0-670-03151-1 (hardcover) OR 9780670031511 (hardcover)
LCCN: BF341 .P47 2002
bibdate: Sat Apr 16 15:14:03 MDT 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2005.04.16 15:14:03 MDT
subject: Nature and nurture
acknowledgement: ack-nhfb
rawauthor: Steven Pinker
rawtitle: The blank slate: the modern denial of human nature
TOC:
Part 1. The blank slate, the noble savage, and the ghost in the machine -- The official theory -- Silly putty -- The last wall to fall -- Culture vultures -- The slate's last standpar Part 2. Fear and loathing -- Political scientists -- The holy trinitypar Part 3. Human nature with a human face -- The fear of inequality -- The fear of imperfectibility -- The fear of determinism -- The fear of nihilismpar Part 4. Know thyself -- In touch with reality -- Out of our depths -- The many roots of our suffering -- The sanctimonious animalpar Part 5. Hot buttons -- Politics -- Violence -- Gender -- Children -- The artspar Part 6. The voice of the speciespar Appendix: Donald E. Brown's list of human universals.

rawTOC:
Part 1. The blank slate, the noble savage, and the ghost in the machine -- The official theory -- Silly putty -- The last wall to fall -- Culture vultures -- The slate's last stand\par Part 2. Fear and loathing -- Political scientists -- The holy trinity\par Part 3. Human nature with a human face -- The fear of inequality -- The fear of imperfectibility -- The fear of determinism -- The fear of nihilism\par Part 4. Know thyself -- In touch with reality -- Out of our depths -- The many roots of our suffering -- The sanctimonious animal\par Part 5. Hot buttons -- Politics -- Violence -- Gender -- Children -- The arts\par Part 6. The voice of the species\par Appendix: Donald E. Brown's list of human universals.

entry:
@Book{Pinker:2002:BSM,
  author =       "Steven Pinker",
  title =        "The blank slate: the modern denial of human nature",
  publisher =    pub-VIKING,
  address =      pub-VIKING:adr,
  pages =        "xvi + 509",
  year =         "2002",
  ISBN =         "0-670-03151-8 (hardcover)",
  ISBN-13 =      "978-0-670-03151-1 (hardcover)",
  LCCN =         "BF341 .P47 2002",
  bibdate =      "Sat Apr 16 15:14:03 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Nature and nurture",
  tableofcontents = "Part 1. The blank slate, the noble savage, and the
                 ghost in the machine -- The official theory -- Silly
                 putty -- The last wall to fall -- Culture vultures --
                 The slate's last stand\par

                 Part 2. Fear and loathing -- Political scientists --
                 The holy trinity\par

                 Part 3. Human nature with a human face -- The fear of
                 inequality -- The fear of imperfectibility -- The fear
                 of determinism -- The fear of nihilism\par

                 Part 4. Know thyself -- In touch with reality -- Out of
                 our depths -- The many roots of our suffering -- The
                 sanctimonious animal\par

                 Part 5. Hot buttons -- Politics -- Violence -- Gender
                 -- Children -- The arts\par

                 Part 6. The voice of the species\par

                 Appendix: Donald E. Brown's list of human universals.",
}


bibtype: book
filename: master.bib
label: Pinker:2003:BSM
author: Steven Pinker
title: The blank slate: the modern denial of human nature
publisher: pub-PENGUIN
address: pub-PENGUIN:adr
pages: xvi + 509
year: 2003
LCCN: BF341 .P47 2002
bibdate: Mon Nov 21 06:19:35 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2005.11.21 06:19:35 ???
remark: Penguin reprint edition.
subject: Characters and characteristics; Developmental psychology; Nature and nurture
acknowledgement: ack-nhfb
rawauthor: Steven Pinker
rawtitle: The blank slate: the modern denial of human nature
ISBN:
0-14-200334-4 (paperback), 0-14-027605-X (paperback) OR 0142003344 (paperback), 014027605X (paperback)

ISBN13:
978-0-14-200334-3 (paperback), 978-0-14-027605-3 (paperback) OR 9780142003343 (paperback), 9780140276053 (paperback)

TOC:
Part 1. The blank slate, the noble savage, and the ghost in the machine -- The official theory -- Silly putty -- The last wall to fall -- Culture vultures -- The slate's last standpar Part 2. Fear and loathing -- Political scientists -- The holy trinitypar Part 3. Human nature with a human face -- The fear of inequality -- The fear of imperfectibility -- The fear of determinism -- The fear of nihilismpar Part 4. Know thyself -- In touch with reality -- Out of our depths -- The many roots of our suffering -- The sanctimonious animalpar Part 5. Hot buttons -- Politics -- Violence -- Gender -- Children -- The artspar Part 6. The voice of the speciespar Appendix: Donald E. Brown's list of human universals.

rawTOC:
Part 1. The blank slate, the noble savage, and the ghost in the machine -- The official theory -- Silly putty -- The last wall to fall -- Culture vultures -- The slate's last stand\par Part 2. Fear and loathing -- Political scientists -- The holy trinity\par Part 3. Human nature with a human face -- The fear of inequality -- The fear of imperfectibility -- The fear of determinism -- The fear of nihilism\par Part 4. Know thyself -- In touch with reality -- Out of our depths -- The many roots of our suffering -- The sanctimonious animal\par Part 5. Hot buttons -- Politics -- Violence -- Gender -- Children -- The arts\par Part 6. The voice of the species\par Appendix: Donald E. Brown's list of human universals.

entry:
@Book{Pinker:2003:BSM,
  author =       "Steven Pinker",
  title =        "The blank slate: the modern denial of human nature",
  publisher =    pub-PENGUIN,
  address =      pub-PENGUIN:adr,
  pages =        "xvi + 509",
  year =         "2003",
  ISBN =         "0-14-200334-4 (paperback), 0-14-027605-X (paperback)",
  ISBN-13 =      "978-0-14-200334-3 (paperback), 978-0-14-027605-3
                 (paperback)",
  LCCN =         "BF341 .P47 2002",
  bibdate =      "Mon Nov 21 06:19:35 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  remark =       "Penguin reprint edition.",
  subject =      "Characters and characteristics; Developmental
                 psychology; Nature and nurture",
  tableofcontents = "Part 1. The blank slate, the noble savage, and the
                 ghost in the machine -- The official theory -- Silly
                 putty -- The last wall to fall -- Culture vultures --
                 The slate's last stand\par

                 Part 2. Fear and loathing -- Political scientists --
                 The holy trinity\par

                 Part 3. Human nature with a human face -- The fear of
                 inequality -- The fear of imperfectibility -- The fear
                 of determinism -- The fear of nihilism\par

                 Part 4. Know thyself -- In touch with reality -- Out of
                 our depths -- The many roots of our suffering -- The
                 sanctimonious animal\par

                 Part 5. Hot buttons -- Politics -- Violence -- Gender
                 -- Children -- The arts\par

                 Part 6. The voice of the species\par

                 Appendix: Donald E. Brown's list of human universals.",
}


bibtype: book
filename: master.bib
label: Pinker:2011:BAO
author: Steven Pinker
title: The better angels of our nature: why violence has declined
publisher: Viking
address: New York, NY, USA
pages: xxviii + 802
year: 2011
LCCN: HM1116 .P57 2011
bibdate: Fri Aug 15 14:00:42 MDT 2014
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2014.08.15 14:00:42 MDT
subject: Violence; Psychological aspects; Social aspects; Nonviolence
acknowledgement: ack-nhfb
authordates: 1954--
rawauthor: Steven Pinker
rawtitle: The better angels of our nature: why violence has declined
ISBN:
0-670-02295-0 (hardcover), 0-670-02315-9 (paperback) OR 0670022950 (hardcover), 0670023159 (paperback)

ISBN13:
978-0-670-02295-3 (hardcover), 978-0-670-02315-8 (paperback) OR 9780670022953 (hardcover), 9780670023158 (paperback)

abstract:
We've all asked, ``What is the world coming to?'' But we seldom ask, ``How bad was the world in the past?'' Cognitive scientist Steven Pinker shows that the past was much worse. Evidence of a bloody history has always been around us: genocides in the Old Testament, gory mutilations in Shakespeare and Grimm, monarchs who beheaded their relatives, and American founders who dueled with their rivals. The murder rate in medieval Europe was more than thirty times what it is today. Slavery, sadistic punishments, and frivolous executions were common features of life for millennia, then were suddenly abolished. How could this have happened, if human nature has not changed? Pinker argues that thanks to the spread of government, literacy, trade, and cosmopolitanism, we increasingly control our impulses, empathize with others, debunk toxic ideologies, and deploy our powers of reason to reduce the temptations of violence.

TOC:
A foreign country. Human prehistory; Homeric Greece; The Hebrew bible; The Roman Empire and early Christendom; Medieval knights; Early modern Europe; Honor in Europe and the early United States; The 20th century The pacification process. The logic of violence; Violence in human ancestors; Kinds of human societies; Rates of violence in state and nonstate societies; Civilization and its discontents The civilizing process. The European homicide decline; Explaining the European homicide decline; Violence and class; Violence around the world; Violence in these United States; Decivilization in the 1960s; Recivilization in the 1990s The humanitarian revolution. Superstitious killing: human sacrifice, witchcraft, and blood libel; Superstitious killing: violence against blasphemers, heretics, and apostates; Cruel and unusual punishments; Capital punishment; Slavery; Despotism and political violence; Major war; Whence the humanitarian revolution?; The rise of empathy and the regard for human life; The republic of letters and enlightenment humanism; Civilization and enlightenment; Blood and soil The long peace. Statistics and narratives; Was the 20th century really the worst?; The statistics of deadly quarrels, Part 1: the timing of wars; The statistics of deadly quarrels, Part 2: the magnitude of wars; The trajectory of great power war; The trajectory of European war; The Hobbesian background and the ages of dynasties and religions; Three currents in the age of sovereignty; Counter-enlightenment ideologies and the age of nationalism; Humanism and totalitarianism in the age of ideology; The Long Peace: some numbers; The Long Peace: attitudes and events; Is the Long Peace a nuclear peace?; Is the Long Peace a democratic peace?; Is the Long Peace a liberal peace?; Is the Long Peace a Kantian peace? The new peace. The trajectory of war in the rest of the world; The trajectory of genocide; The trajectory of terrorism; Where angels fear to tread The rights revolutions. Civil rights and the decline of lynching and racial pogroms; Women's rights and the decline of rape and battering; Children's rights and the decline of infanticide, spanking, child abuse, and bullying; Gay rights, the decline of gay-bashing, and the decriminalization of homosexuality; Animal rights and the decline of cruelty to animals; Whence the rights revolutions?; From history to psychology Inner demons. The dark side; The moralization gap and the myth of pure evil; Organs of violence; Predation; Dominance; Revenge; Sadism; Ideology; Pure evil, inner demons, and the decline of violence Better angels. Empathy; Self-control; Recent biological evolution?; Morality and taboo; Reason On angels' wings. Important but inconsistent; The pacifist's dilemma; The Leviathan; Gentle commerce; Feminization; The expanding circle; The escalator of reason; Reflections

rawabstract:
We've all asked, ``What is the world coming to?'' But we seldom ask, ``How bad was the world in the past?'' Cognitive scientist Steven Pinker shows that the past was much worse. Evidence of a bloody history has always been around us: genocides in the Old Testament, gory mutilations in Shakespeare and Grimm, monarchs who beheaded their relatives, and American founders who dueled with their rivals. The murder rate in medieval Europe was more than thirty times what it is today. Slavery, sadistic punishments, and frivolous executions were common features of life for millennia, then were suddenly abolished. How could this have happened, if human nature has not changed? Pinker argues that thanks to the spread of government, literacy, trade, and cosmopolitanism, we increasingly control our impulses, empathize with others, debunk toxic ideologies, and deploy our powers of reason to reduce the temptations of violence.

rawTOC:
A foreign country. Human prehistory; Homeric Greece; The Hebrew bible; The Roman Empire and early Christendom; Medieval knights; Early modern Europe; Honor in Europe and the early United States; The 20th century \\ The pacification process. The logic of violence; Violence in human ancestors; Kinds of human societies; Rates of violence in state and nonstate societies; Civilization and its discontents \\ The civilizing process. The European homicide decline; Explaining the European homicide decline; Violence and class; Violence around the world; Violence in these United States; Decivilization in the 1960s; Recivilization in the 1990s \\ The humanitarian revolution. Superstitious killing: human sacrifice, witchcraft, and blood libel; Superstitious killing: violence against blasphemers, heretics, and apostates; Cruel and unusual punishments; Capital punishment; Slavery; Despotism and political violence; Major war; Whence the humanitarian revolution?; The rise of empathy and the regard for human life; The republic of letters and enlightenment humanism; Civilization and enlightenment; Blood and soil \\ The long peace. Statistics and narratives; Was the 20th century really the worst?; The statistics of deadly quarrels, Part 1: the timing of wars; The statistics of deadly quarrels, Part 2: the magnitude of wars; The trajectory of great power war; The trajectory of European war; The Hobbesian background and the ages of dynasties and religions; Three currents in the age of sovereignty; Counter-enlightenment ideologies and the age of nationalism; Humanism and totalitarianism in the age of ideology; The Long Peace: some numbers; The Long Peace: attitudes and events; Is the Long Peace a nuclear peace?; Is the Long Peace a democratic peace?; Is the Long Peace a liberal peace?; Is the Long Peace a Kantian peace? \\ The new peace. The trajectory of war in the rest of the world; The trajectory of genocide; The trajectory of terrorism; Where angels fear to tread \\ The rights revolutions. Civil rights and the decline of lynching and racial pogroms; Women's rights and the decline of rape and battering; Children's rights and the decline of infanticide, spanking, child abuse, and bullying; Gay rights, the decline of gay-bashing, and the decriminalization of homosexuality; Animal rights and the decline of cruelty to animals; Whence the rights revolutions?; From history to psychology \\ Inner demons. The dark side; The moralization gap and the myth of pure evil; Organs of violence; Predation; Dominance; Revenge; Sadism; Ideology; Pure evil, inner demons, and the decline of violence \\ Better angels. Empathy; Self-control; Recent biological evolution?; Morality and taboo; Reason \\ On angels' wings. Important but inconsistent; The pacifist's dilemma; The Leviathan; Gentle commerce; Feminization; The expanding circle; The escalator of reason; Reflections

entry:
@Book{Pinker:2011:BAO,
  author =       "Steven Pinker",
  title =        "The better angels of our nature: why violence has
                 declined",
  publisher =    "Viking",
  address =      "New York, NY, USA",
  pages =        "xxviii + 802",
  year =         "2011",
  ISBN =         "0-670-02295-0 (hardcover), 0-670-02315-9 (paperback)",
  ISBN-13 =      "978-0-670-02295-3 (hardcover), 978-0-670-02315-8
                 (paperback)",
  LCCN =         "HM1116 .P57 2011",
  bibdate =      "Fri Aug 15 14:00:42 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "We've all asked, ``What is the world coming to?'' But
                 we seldom ask, ``How bad was the world in the past?''
                 Cognitive scientist Steven Pinker shows that the past
                 was much worse. Evidence of a bloody history has always
                 been around us: genocides in the Old Testament, gory
                 mutilations in Shakespeare and Grimm, monarchs who
                 beheaded their relatives, and American founders who
                 dueled with their rivals. The murder rate in medieval
                 Europe was more than thirty times what it is today.
                 Slavery, sadistic punishments, and frivolous executions
                 were common features of life for millennia, then were
                 suddenly abolished. How could this have happened, if
                 human nature has not changed? Pinker argues that thanks
                 to the spread of government, literacy, trade, and
                 cosmopolitanism, we increasingly control our impulses,
                 empathize with others, debunk toxic ideologies, and
                 deploy our powers of reason to reduce the temptations
                 of violence.",
  acknowledgement = ack-nhfb,
  author-dates = "1954--",
  subject =      "Violence; Psychological aspects; Social aspects;
                 Nonviolence",
  tableofcontents = "A foreign country. Human prehistory; Homeric
                 Greece; The Hebrew bible; The Roman Empire and early
                 Christendom; Medieval knights; Early modern Europe;
                 Honor in Europe and the early United States; The 20th
                 century \\
                 The pacification process. The logic of violence;
                 Violence in human ancestors; Kinds of human societies;
                 Rates of violence in state and nonstate societies;
                 Civilization and its discontents \\
                 The civilizing process. The European homicide decline;
                 Explaining the European homicide decline; Violence and
                 class; Violence around the world; Violence in these
                 United States; Decivilization in the 1960s;
                 Recivilization in the 1990s \\
                 The humanitarian revolution. Superstitious killing:
                 human sacrifice, witchcraft, and blood libel;
                 Superstitious killing: violence against blasphemers,
                 heretics, and apostates; Cruel and unusual punishments;
                 Capital punishment; Slavery; Despotism and political
                 violence; Major war; Whence the humanitarian
                 revolution?; The rise of empathy and the regard for
                 human life; The republic of letters and enlightenment
                 humanism; Civilization and enlightenment; Blood and
                 soil \\
                 The long peace. Statistics and narratives; Was the 20th
                 century really the worst?; The statistics of deadly
                 quarrels, Part 1: the timing of wars; The statistics of
                 deadly quarrels, Part 2: the magnitude of wars; The
                 trajectory of great power war; The trajectory of
                 European war; The Hobbesian background and the ages of
                 dynasties and religions; Three currents in the age of
                 sovereignty; Counter-enlightenment ideologies and the
                 age of nationalism; Humanism and totalitarianism in the
                 age of ideology; The Long Peace: some numbers; The Long
                 Peace: attitudes and events; Is the Long Peace a
                 nuclear peace?; Is the Long Peace a democratic peace?;
                 Is the Long Peace a liberal peace?; Is the Long Peace a
                 Kantian peace? \\
                 The new peace. The trajectory of war in the rest of the
                 world; The trajectory of genocide; The trajectory of
                 terrorism; Where angels fear to tread \\
                 The rights revolutions. Civil rights and the decline of
                 lynching and racial pogroms; Women's rights and the
                 decline of rape and battering; Children's rights and
                 the decline of infanticide, spanking, child abuse, and
                 bullying; Gay rights, the decline of gay-bashing, and
                 the decriminalization of homosexuality; Animal rights
                 and the decline of cruelty to animals; Whence the
                 rights revolutions?; From history to psychology \\
                 Inner demons. The dark side; The moralization gap and
                 the myth of pure evil; Organs of violence; Predation;
                 Dominance; Revenge; Sadism; Ideology; Pure evil, inner
                 demons, and the decline of violence \\
                 Better angels. Empathy; Self-control; Recent biological
                 evolution?; Morality and taboo; Reason \\
                 On angels' wings. Important but inconsistent; The
                 pacifist's dilemma; The Leviathan; Gentle commerce;
                 Feminization; The expanding circle; The escalator of
                 reason; Reflections",
}


bibtype: book
filename: master.bib
label: Pinker:2014:SST
author: Steven Pinker
title: The Sense of Style: the Thinking Person's Guide to Writing in the 21st Century!
publisher: pub-VIKING
address: pub-VIKING:adr
pages: viii + 359
year: 2014
LCCN: PE1421 .P56 2014
bibdate: Tue Dec 20 08:13:43 MST 2016
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2016.12.20 08:13:43 MST
acknowledgement: ack-nhfb
authordates: 1954--
rawauthor: Steven Pinker
rawtitle: The Sense of Style: the Thinking Person's Guide to Writing in the 21st Century!
ISBN:
0-670-02585-2 (hardcover), 0-525-42792-9 (Export Edition) OR 0670025852 (hardcover), 0525427929 (Export Edition)

ISBN13:
978-0-670-02585-5 (hardcover), 978-0-525-42792-6 (Export Edition) OR 9780670025855 (hardcover), 9780525427926 (Export Edition)

abstract:
A short and entertaining book on the modern art of writing well by New York Times bestselling author Steven Pinker. Why is so much writing so bad, and how can we make it better? Is the English language being corrupted by texting and social media? Do the kids today even care about good writing? Why should any of us care? In booktitle The Sense of Style, the bestselling linguist and cognitive scientist Steven Pinker answers these questions and more. Rethinking the usage guide for the 21st century, Pinker doesn't carp about the decline of language or recycle pet peeves from the rulebooks of a century ago. Instead, he applies insights from the sciences of language and mind to the challenge of crafting clear, coherent, and stylish prose. In this short, cheerful, and eminently practical book, Pinker shows how writing depends on imagination, empathy, coherence, grammatical knowhow,and an ability to savor and reverse-engineer the good prose of others. He replaces dogma about usage with reason and evidence, allowing writers and editors to apply the guidelines judiciously, rather than robotically, being mindful of what they are designed to accomplish. Filled with examples of great and gruesome prose, Pinker shows us how the art of writing can be a form of pleasurable mastery and a fascinating intellectual topic in its own right.par Pinker has a lot of ideas and sometimes controversial opinions about writing and in this entertaining and instructive book he rethinks the usage guide for the 21st century. Don't blame the internet, he says, good writing has always been hard. It requires imagination, taking pleasure in reading, overcoming the difficult we all have in imaging what it's like to not know something we do know.

subject:
English language; Style; Grammar; language arts and disciplines / Style Manuals; language arts and disciplines / Grammar and Punctuation; reference / Writing Skills

TOC:
Good writing A window onto the world The curse of knowledge The web, the tree, and the string Arcs of coherence Telling right from wrong

rawabstract:
A short and entertaining book on the modern art of writing well by New York Times bestselling author Steven Pinker. Why is so much writing so bad, and how can we make it better? Is the English language being corrupted by texting and social media? Do the kids today even care about good writing? Why should any of us care? In \booktitle{The Sense of Style}, the bestselling linguist and cognitive scientist Steven Pinker answers these questions and more. Rethinking the usage guide for the 21st century, Pinker doesn't carp about the decline of language or recycle pet peeves from the rulebooks of a century ago. Instead, he applies insights from the sciences of language and mind to the challenge of crafting clear, coherent, and stylish prose. In this short, cheerful, and eminently practical book, Pinker shows how writing depends on imagination, empathy, coherence, grammatical knowhow,and an ability to savor and reverse-engineer the good prose of others. He replaces dogma about usage with reason and evidence, allowing writers and editors to apply the guidelines judiciously, rather than robotically, being mindful of what they are designed to accomplish. Filled with examples of great and gruesome prose, Pinker shows us how the art of writing can be a form of pleasurable mastery and a fascinating intellectual topic in its own right.\par Pinker has a lot of ideas and sometimes controversial opinions about writing and in this entertaining and instructive book he rethinks the usage guide for the 21st century. Don't blame the internet, he says, good writing has always been hard. It requires imagination, taking pleasure in reading, overcoming the difficult we all have in imaging what it's like to not know something we do know.

rawTOC:
Good writing \\ A window onto the world \\ The curse of knowledge \\ The web, the tree, and the string \\ Arcs of coherence \\ Telling right from wrong

entry:
@Book{Pinker:2014:SST,
  author =       "Steven Pinker",
  title =        "The Sense of Style: the Thinking Person's Guide to
                 Writing in the 21st Century!",
  publisher =    pub-VIKING,
  address =      pub-VIKING:adr,
  pages =        "viii + 359",
  year =         "2014",
  ISBN =         "0-670-02585-2 (hardcover), 0-525-42792-9 (Export
                 Edition)",
  ISBN-13 =      "978-0-670-02585-5 (hardcover), 978-0-525-42792-6
                 (Export Edition)",
  LCCN =         "PE1421 .P56 2014",
  bibdate =      "Tue Dec 20 08:13:43 MST 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "A short and entertaining book on the modern art of
                 writing well by New York Times bestselling author
                 Steven Pinker. Why is so much writing so bad, and how
                 can we make it better? Is the English language being
                 corrupted by texting and social media? Do the kids
                 today even care about good writing? Why should any of
                 us care? In \booktitle{The Sense of Style}, the
                 bestselling linguist and cognitive scientist Steven
                 Pinker answers these questions and more. Rethinking the
                 usage guide for the 21st century, Pinker doesn't carp
                 about the decline of language or recycle pet peeves
                 from the rulebooks of a century ago. Instead, he
                 applies insights from the sciences of language and mind
                 to the challenge of crafting clear, coherent, and
                 stylish prose. In this short, cheerful, and eminently
                 practical book, Pinker shows how writing depends on
                 imagination, empathy, coherence, grammatical
                 knowhow,and an ability to savor and reverse-engineer
                 the good prose of others. He replaces dogma about usage
                 with reason and evidence, allowing writers and editors
                 to apply the guidelines judiciously, rather than
                 robotically, being mindful of what they are designed to
                 accomplish. Filled with examples of great and gruesome
                 prose, Pinker shows us how the art of writing can be a
                 form of pleasurable mastery and a fascinating
                 intellectual topic in its own right.\par

                 Pinker has a lot of ideas and sometimes controversial
                 opinions about writing and in this entertaining and
                 instructive book he rethinks the usage guide for the
                 21st century. Don't blame the internet, he says, good
                 writing has always been hard. It requires imagination,
                 taking pleasure in reading, overcoming the difficult we
                 all have in imaging what it's like to not know
                 something we do know.",
  acknowledgement = ack-nhfb,
  author-dates = "1954--",
  libnote =      "Not in my library.",
  subject =      "English language; Style; Grammar; language arts and
                 disciplines / Style Manuals; language arts and
                 disciplines / Grammar and Punctuation; reference /
                 Writing Skills",
  tableofcontents = "Good writing \\
                 A window onto the world \\
                 The curse of knowledge \\
                 The web, the tree, and the string \\
                 Arcs of coherence \\
                 Telling right from wrong",
}


bibtype: book
filename: master.bib
label: Pissanetsky:1984:SMT
author: Sergio Pissanetsky
title: Sparse Matrix Technology
publisher: pub-ACADEMIC
address: pub-ACADEMIC:adr
pages: xiii + 321
year: 1984
ISBN: 0-12-557580-7 OR 0125575807
ISBN13: 978-0-12-557580-5 OR 9780125575805
LCCN: QA188 .P57 1984
bibdate: Wed Dec 15 18:10:01 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 18:10:01 ???
acknowledgement: ack-nhfb
rawauthor: Sergio Pissanetsky
rawtitle: Sparse Matrix Technology
abstract:
Sparse Matrix Technology presents the methods, concepts, ideas, and applications of sparse matrix technology. The text provides the fundamental methods, procedures, techniques, and applications of sparse matrix technology in software development. The book covers topics on storage schemes and computational techniques needed for sparse matrix technology; sparse matrix methods and algorithms for the direct solution of linear equations; and algorithms for different purposes connected with sparse matrix technology. Engineers, programmers, analysts, teachers, and students in the computer sciences ldots 

rawabstract:
Sparse Matrix Technology presents the methods, concepts, ideas, and applications of sparse matrix technology. The text provides the fundamental methods, procedures, techniques, and applications of sparse matrix technology in software development. The book covers topics on storage schemes and computational techniques needed for sparse matrix technology; sparse matrix methods and algorithms for the direct solution of linear equations; and algorithms for different purposes connected with sparse matrix technology. Engineers, programmers, analysts, teachers, and students in the computer sciences \ldots{}

entry:
@Book{Pissanetsky:1984:SMT,
  author =       "Sergio Pissanetsky",
  title =        "Sparse Matrix Technology",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xiii + 321",
  year =         "1984",
  ISBN =         "0-12-557580-7",
  ISBN-13 =      "978-0-12-557580-5",
  LCCN =         "QA188 .P57 1984",
  bibdate =      "Wed Dec 15 18:10:01 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Sparse Matrix Technology presents the methods,
                 concepts, ideas, and applications of sparse matrix
                 technology. The text provides the fundamental methods,
                 procedures, techniques, and applications of sparse
                 matrix technology in software development. The book
                 covers topics on storage schemes and computational
                 techniques needed for sparse matrix technology; sparse
                 matrix methods and algorithms for the direct solution
                 of linear equations; and algorithms for different
                 purposes connected with sparse matrix technology.
                 Engineers, programmers, analysts, teachers, and
                 students in the computer sciences \ldots{}",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: master.bib
label: Pitman:2005:MSP
author: Jim Pitman and David Aldous
title: The Mathematics Survey Project
journal: j-NAMS
volume: 52
number: 11
pages: 1357--1360
month: dec
monthnumber: 12
year: 2005
CODEN: AMNOAN
ISSN: 0002-9920 (print), 1088-9477 (electronic) OR 00029920 (print), 10889477 (electronic)
bibdate: Tue Dec 13 10:15:38 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2005.12.13 10:15:38 ???
URL: http://www.ams.org/notices/200511/comm-pitman.pdf
fjournal: Notices of the American Mathematical Society
acknowledgement: ack-nhfb
journalURL: http://www.ams.org/notices/
rawauthor: Jim Pitman and David Aldous
rawtitle: The {Mathematics Survey Project}
entry:
@Article{Pitman:2005:MSP,
  author =       "Jim Pitman and David Aldous",
  title =        "The {Mathematics Survey Project}",
  journal =      j-NAMS,
  volume =       "52",
  number =       "11",
  pages =        "1357--1360",
  month =        dec,
  year =         "2005",
  CODEN =        "AMNOAN",
  ISSN =         "0002-9920 (print), 1088-9477 (electronic)",
  bibdate =      "Tue Dec 13 10:15:38 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://www.ams.org/notices/200511/comm-pitman.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Notices of the American Mathematical Society",
  journal-URL =  "http://www.ams.org/notices/",
}


bibtype: book
filename: master.bib
label: Pitzer:1953:QC
author: Kenneth S. (Kenneth Sanborn) Pitzer
title: Quantum Chemistry
publisher: pub-PH
address: pub-PH:adr
pages: x + 529
year: 1953
LCCN: QC174.1 .P49
bibdate: Sat Jul 25 13:55:27 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.07.25 13:55:27 ???
acknowledgement: ack-nhfb
rawauthor: Kenneth S. (Kenneth Sanborn) Pitzer
rawtitle: Quantum Chemistry
entry:
@Book{Pitzer:1953:QC,
  author =       "Kenneth S. (Kenneth Sanborn) Pitzer",
  title =        "Quantum Chemistry",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "x + 529",
  year =         "1953",
  LCCN =         "QC174.1 .P49",
  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: Plauger:1992:SCL
author: P. J. Plauger
title: The Standard C Library
publisher: pub-PH
address: pub-PH:adr
pages: xiv + 498
year: 1992
ISBN: 0-13-838012-0 OR 0138380120
ISBN13: 978-0-13-838012-0 OR 9780138380120
LCCN: QA76.73.C15 P563 1991
bibdate: Wed Dec 15 10:40:47 1993
bibtimestamp: 1993.12.15 10:40:47 ???
acknowledgement: ack-nhfb
rawauthor: P. J. Plauger
rawtitle: The {Standard C} Library
bibsource:
https://www.math.utah.edu/pub/tex/bib/ansistd.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/litprog.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

abstract:
booktitle The Standard C Library shows you how to use all of the library functions mandated by the ANSI and ISO Standards for the programming language C. To help you understand how to use the library, this book also shows you how to implement it. You see approximately 9,000 lines of tested, working code that is highly portable across diverse computer architectures. booktitle The Standard C Library explains how the library was meant to be used and how it can be used. It places particular emphasis on features added to C as part of the C Standard. These features include support for multiple locales (cultural conventions) and very large character sets (such as Kanji). The code presented in this book has been tested with C compilers from Borland, Saber, Project Gnu, Sun, UNIX, and VAX, ULTRIX. It has passed the widely used Plum Hall Validation Suite tests for library functions. It has also survived an assortment of public-domain programs designed to stress C implementations and illuminate their darker corners. The mathematical functions are particularly well-engineered and tested. Finally, booktitle The Standard C Library shows you many principles of library design in general. You learn how to design and implement libraries that are highly cohesive and reusable.

TOC:
Preface / ix Introduction / 1 <assert.h> / 17 <ctype.h> / 25 <errno.h> / 47 <float.h> / 57 <limits.h> / 73 <locale.h> / 81 <math.h> / 127 <setjmp.h> / 181 <signal.h> / 193 <stdarg.h> / 205 <stddef.h> / 215 <stdio.h> / 225 <stdlib.h> / 333 <string.h> / 387 <time.h> / 415 Interfaces / 445 Names / 453 Terms / 463 Index / 475

rawabstract:
\booktitle{The Standard C Library} shows you how to use all of the library functions mandated by the ANSI and ISO Standards for the programming language C. To help you understand how to use the library, this book also shows you how to implement it. You see approximately 9,000 lines of tested, working code that is highly portable across diverse computer architectures. \booktitle{The Standard C Library} explains how the library was meant to be used and how it can be used. It places particular emphasis on features added to C as part of the C Standard. These features include support for multiple locales (cultural conventions) and very large character sets (such as Kanji). The code presented in this book has been tested with C compilers from Borland, Saber, Project Gnu, Sun, UNIX, and VAX, ULTRIX. It has passed the widely used Plum Hall Validation Suite tests for library functions. It has also survived an assortment of public-domain programs designed to stress C implementations and illuminate their darker corners. The mathematical functions are particularly well-engineered and tested. Finally, \booktitle{The Standard C Library} shows you many principles of library design in general. You learn how to design and implement libraries that are highly cohesive and reusable.

rawTOC:
Preface / ix \\ Introduction / 1 \\ <assert.h> / 17 \\ <ctype.h> / 25 \\ <errno.h> / 47 \\ <float.h> / 57 \\ <limits.h> / 73 \\ <locale.h> / 81 \\ <math.h> / 127 \\ <setjmp.h> / 181 \\ <signal.h> / 193 \\ <stdarg.h> / 205 \\ <stddef.h> / 215 \\ <stdio.h> / 225 \\ <stdlib.h> / 333 \\ <string.h> / 387 \\ <time.h> / 415 \\ Interfaces / 445 \\ Names / 453 \\ Terms / 463 \\ Index / 475

entry:
@Book{Plauger:1992:SCL,
  author =       "P. J. Plauger",
  title =        "The {Standard C} Library",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiv + 498",
  year =         "1992",
  ISBN =         "0-13-838012-0",
  ISBN-13 =      "978-0-13-838012-0",
  LCCN =         "QA76.73.C15 P563 1991",
  bibdate =      "Wed Dec 15 10:40:47 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ansistd.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/litprog.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "\booktitle{The Standard C Library} shows you how to
                 use all of the library functions mandated by the ANSI
                 and ISO Standards for the programming language C. To
                 help you understand how to use the library, this book
                 also shows you how to implement it. You see
                 approximately 9,000 lines of tested, working code that
                 is highly portable across diverse computer
                 architectures. \booktitle{The Standard C Library}
                 explains how the library was meant to be used and how
                 it can be used. It places particular emphasis on
                 features added to C as part of the C Standard. These
                 features include support for multiple locales (cultural
                 conventions) and very large character sets (such as
                 Kanji). The code presented in this book has been tested
                 with C compilers from Borland, Saber, Project Gnu, Sun,
                 UNIX, and VAX, ULTRIX. It has passed the widely used
                 Plum Hall Validation Suite tests for library functions.
                 It has also survived an assortment of public-domain
                 programs designed to stress C implementations and
                 illuminate their darker corners. The mathematical
                 functions are particularly well-engineered and tested.
                 Finally, \booktitle{The Standard C Library} shows you
                 many principles of library design in general. You learn
                 how to design and implement libraries that are highly
                 cohesive and reusable.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / ix \\
                 Introduction / 1 \\
                 <assert.h> / 17 \\
                 <ctype.h> / 25 \\
                 <errno.h> / 47 \\
                 <float.h> / 57 \\
                 <limits.h> / 73 \\
                 <locale.h> / 81 \\
                 <math.h> / 127 \\
                 <setjmp.h> / 181 \\
                 <signal.h> / 193 \\
                 <stdarg.h> / 205 \\
                 <stddef.h> / 215 \\
                 <stdio.h> / 225 \\
                 <stdlib.h> / 333 \\
                 <string.h> / 387 \\
                 <time.h> / 415 \\
                 Interfaces / 445 \\
                 Names / 453 \\
                 Terms / 463 \\
                 Index / 475",
}


bibtype: book
filename: master.bib
label: Plauger:1993:PPEa
author: P. J. Plauger
title: Programming on Purpose: Essays on Software Design
volume: 1
publisher: pub-PH
address: pub-PH:adr
pages: viii + 236
year: 1993
ISBN: 0-13-721374-3 OR 0137213743
ISBN13: 978-0-13-721374-0 OR 9780137213740
LCCN: QA76.76.D47 P55 1993
bibdate: Wed Jan 5 12:50:18 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.01.05 12:50:18 ???
acknowledgement: ack-nhfb
rawauthor: P. J. Plauger
rawtitle: Programming on Purpose: Essays on Software Design
remark:
Originally published in the author's monthly column in Computer language magazine, 1986-1992. Contents: Volume I: Essays on software design -- volume II: Essays on software people -- volume III: Essays on software technology.

TOC:
1: Which Tool is Best? 2: Writing Predicates 3: Generating Data 4: Finite-State Machines 5: Recognizing Input 6: Handling Exceptions 7: Which Tool is Next? 8: Order Out of Chaos 9: Marrying Data Structures 10: Divorcing Data Structures 11: Who's the Boss? 12: By Any Other Name 13: Searching 14: Synchronization 15: Which Tool is Last? 16: A Designer's Bibliography 17: A Designer's Reference Shelf 18: A Preoccupation with Time 19: Structuring Time 20: Abstract It 21: Encapsulate It 22: Inherit It 23: Heresies of Software Design 24: Remedial Software Engineering

rawTOC:
1: Which Tool is Best? \\ 2: Writing Predicates \\ 3: Generating Data \\ 4: Finite-State Machines \\ 5: Recognizing Input \\ 6: Handling Exceptions \\ 7: Which Tool is Next? \\ 8: Order Out of Chaos \\ 9: Marrying Data Structures \\ 10: Divorcing Data Structures \\ 11: Who's the Boss? \\ 12: By Any Other Name \\ 13: Searching \\ 14: Synchronization \\ 15: Which Tool is Last? \\ 16: A Designer's Bibliography \\ 17: A Designer's Reference Shelf \\ 18: A Preoccupation with Time \\ 19: Structuring Time \\ 20: Abstract It \\ 21: Encapsulate It \\ 22: Inherit It \\ 23: Heresies of Software Design \\ 24: Remedial Software Engineering

entry:
@Book{Plauger:1993:PPEa,
  author =       "P. J. Plauger",
  title =        "Programming on Purpose: Essays on Software Design",
  volume =       "1",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "viii + 236",
  year =         "1993",
  ISBN =         "0-13-721374-3",
  ISBN-13 =      "978-0-13-721374-0",
  LCCN =         "QA76.76.D47 P55 1993",
  bibdate =      "Wed Jan 5 12:50:18 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$19.95",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  remark =       "Originally published in the author's monthly column in
                 Computer language magazine, 1986-1992. Contents: Volume
                 I: Essays on software design -- volume II: Essays on
                 software people -- volume III: Essays on software
                 technology.",
  tableofcontents = "1: Which Tool is Best? \\
                 2: Writing Predicates \\
                 3: Generating Data \\
                 4: Finite-State Machines \\
                 5: Recognizing Input \\
                 6: Handling Exceptions \\
                 7: Which Tool is Next? \\
                 8: Order Out of Chaos \\
                 9: Marrying Data Structures \\
                 10: Divorcing Data Structures \\
                 11: Who's the Boss? \\
                 12: By Any Other Name \\
                 13: Searching \\
                 14: Synchronization \\
                 15: Which Tool is Last? \\
                 16: A Designer's Bibliography \\
                 17: A Designer's Reference Shelf \\
                 18: A Preoccupation with Time \\
                 19: Structuring Time \\
                 20: Abstract It \\
                 21: Encapsulate It \\
                 22: Inherit It \\
                 23: Heresies of Software Design \\
                 24: Remedial Software Engineering",
}


bibtype: book
filename: master.bib
label: Plauger:1993:PPIb
author: P. J. Plauger
title: Programming on Purpose II: Essays on Software People
volume: 2
publisher: pub-PH
address: pub-PH:adr
pages: viii + 204
year: 1993
ISBN: 0-13-328105-1 OR 0133281051
ISBN13: 978-0-13-328105-7 OR 9780133281057
LCCN: QA76.76.D47 P56 1993
bibdate: Wed Jan 5 12:50:18 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.01.05 12:50:18 ???
acknowledgement: ack-nhfb
rawauthor: P. J. Plauger
rawtitle: Programming on Purpose {II}: Essays on Software People
abstract:
P. J. Plauger's monthly column ``Programming on Purpose'' has been entertaining readers of Computer Language magazine for years. He writes as readily on how to be a software entrepreneur as he does on the innards of floating-point arithmetic or the turbulent world of software design methodologies. By popular demand, he has gathered six and a half years' output into several collections, each with a common theme. Essays on Software People explores the often-neglected human side of the computer software business. Here you will learn how to be really ingenious, and how to protect the fruits of your ingenuity, how to mix technology with politics, and how not to write shelfware. The budding entrepreneur will find pragmatic advice on dealing with everyone from customers to employees to venture capitalists. Plauger's style is clear without being simplistic, reducing complex themes to bite-size chunks.

remark:
Originally published in the author's monthly column in Computer language magazine, 1986-1992. Contents: Volume I: Essays on software design -- volume II: Essays on software people -- volume III: Essays on software technology.

rawabstract:
P. J. Plauger's monthly column ``Programming on Purpose'' has been entertaining readers of Computer Language magazine for years. He writes as readily on how to be a software entrepreneur as he does on the innards of floating-point arithmetic or the turbulent world of software design methodologies. By popular demand, he has gathered six and a half years' output into several collections, each with a common theme. Essays on Software People explores the often-neglected human side of the computer software business. Here you will learn how to be really ingenious, and how to protect the fruits of your ingenuity, how to mix technology with politics, and how not to write shelfware. The budding entrepreneur will find pragmatic advice on dealing with everyone from customers to employees to venture capitalists. Plauger's style is clear without being simplistic, reducing complex themes to bite-size chunks.

entry:
@Book{Plauger:1993:PPIb,
  author =       "P. J. Plauger",
  title =        "Programming on Purpose {II}: Essays on Software
                 People",
  volume =       "2",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "viii + 204",
  year =         "1993",
  ISBN =         "0-13-328105-1",
  ISBN-13 =      "978-0-13-328105-7",
  LCCN =         "QA76.76.D47 P56 1993",
  bibdate =      "Wed Jan 5 12:50:18 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$19.95",
  abstract =     "P. J. Plauger's monthly column ``Programming on
                 Purpose'' has been entertaining readers of Computer
                 Language magazine for years. He writes as readily on
                 how to be a software entrepreneur as he does on the
                 innards of floating-point arithmetic or the turbulent
                 world of software design methodologies. By popular
                 demand, he has gathered six and a half years' output
                 into several collections, each with a common theme.
                 Essays on Software People explores the often-neglected
                 human side of the computer software business. Here you
                 will learn how to be really ingenious, and how to
                 protect the fruits of your ingenuity, how to mix
                 technology with politics, and how not to write
                 shelfware. The budding entrepreneur will find pragmatic
                 advice on dealing with everyone from customers to
                 employees to venture capitalists. Plauger's style is
                 clear without being simplistic, reducing complex themes
                 to bite-size chunks.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  remark =       "Originally published in the author's monthly column in
                 Computer language magazine, 1986-1992. Contents: Volume
                 I: Essays on software design -- volume II: Essays on
                 software people -- volume III: Essays on software
                 technology.",
}


bibtype: book
filename: master.bib
label: Plauger:1993:PPIc
author: P. J. Plauger
title: Programming on Purpose III: Essays on Software Technology
volume: 3
publisher: pub-PHPTR
address: pub-PHPTR:adr
pages: viii + 224
year: 1993
ISBN: 0-13-328113-2 OR 0133281132
ISBN13: 978-0-13-328113-2 OR 9780133281132
LCCN: QA76.76.D47 P53 1994
bibdate: Wed Jul 6 14:26:01 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.07.06 14:26:01 ???
acknowledgement: ack-nhfb
rawauthor: P. J. Plauger
rawtitle: Programming on Purpose {III}: Essays on Software Technology
remark:
Originally published in the author's monthly column in Computer language magazine, 1986-1992. Contents: Volume I: Essays on software design -- volume II: Essays on software people -- volume III: Essays on software technology.

TOC:
You Must Be Joking Computer Arithmetic Floating-Point Arithmetic The Central Folly Safe Math Do-It-Yourself Math Functions Locking the Barn Door Half a Secret It's (Almost) Alive The (Almost) Right Stuff Instant Lies What Meets the Eye Technicolor and Cinemascope What Meets the Ear Warm Fuzzies Font Follies Text Editors Approximating Functions Economizing Polynomials Technical Writing All I Want to Do Is Programming for the Billions All Sorts of Sorts Transforming Strings Books for Our Times Through the Grapevine List of Columns Bibliography Index

rawTOC:
You Must Be Joking \\ Computer Arithmetic \\ Floating-Point Arithmetic \\ The Central Folly \\ Safe Math \\ Do-It-Yourself Math Functions \\ Locking the Barn Door \\ Half a Secret \\ It's (Almost) Alive \\ The (Almost) Right Stuff \\ Instant Lies \\ What Meets the Eye \\ Technicolor and Cinemascope \\ What Meets the Ear \\ Warm Fuzzies \\ Font Follies \\ Text Editors \\ Approximating Functions \\ Economizing Polynomials \\ Technical Writing \\ All I Want to Do Is \\ Programming for the Billions \\ All Sorts of Sorts \\ Transforming Strings \\ Books for Our Times \\ Through the Grapevine \\ List of Columns \\ Bibliography \\ Index

entry:
@Book{Plauger:1993:PPIc,
  author =       "P. J. Plauger",
  title =        "Programming on Purpose {III}: Essays on Software
                 Technology",
  volume =       "3",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  pages =        "viii + 224",
  year =         "1993",
  ISBN =         "0-13-328113-2",
  ISBN-13 =      "978-0-13-328113-2",
  LCCN =         "QA76.76.D47 P53 1994",
  bibdate =      "Wed Jul 6 14:26:01 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$19.95",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  remark =       "Originally published in the author's monthly column in
                 Computer language magazine, 1986-1992. Contents: Volume
                 I: Essays on software design -- volume II: Essays on
                 software people -- volume III: Essays on software
                 technology.",
  tableofcontents = "You Must Be Joking \\
                 Computer Arithmetic \\
                 Floating-Point Arithmetic \\
                 The Central Folly \\
                 Safe Math \\
                 Do-It-Yourself Math Functions \\
                 Locking the Barn Door \\
                 Half a Secret \\
                 It's (Almost) Alive \\
                 The (Almost) Right Stuff \\
                 Instant Lies \\
                 What Meets the Eye \\
                 Technicolor and Cinemascope \\
                 What Meets the Ear \\
                 Warm Fuzzies \\
                 Font Follies \\
                 Text Editors \\
                 Approximating Functions \\
                 Economizing Polynomials \\
                 Technical Writing \\
                 All I Want to Do Is \\
                 Programming for the Billions \\
                 All Sorts of Sorts \\
                 Transforming Strings \\
                 Books for Our Times \\
                 Through the Grapevine \\
                 List of Columns \\
                 Bibliography \\
                 Index",
}


bibtype: book
filename: master.bib
label: Plauger:2000:CST
author: P. J. Plauger and Alexander A. Stepanov and Meng Lee and David R. Musser
title: The C++ Standard Template Library
publisher: pub-PH
address: pub-PH:adr
pages: xii + 485
year: 2000
ISBN: 0-13-437633-1 (paperback) OR 0134376331 (paperback)
ISBN13: 978-0-13-437633-2 (paperback) OR 9780134376332 (paperback)
LCCN: QA76.73.C153 C17 2000
bibdate: Fri Nov 24 07:39:59 2000
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2000.11.24 07:39:59 ???
acknowledgement: ack-nhfb
rawauthor: P. J. Plauger and Alexander A. Stepanov and Meng Lee and David R. Musser
rawtitle: The {C++ Standard Template Library}
entry:
@Book{Plauger:2000:CST,
  author =       "P. J. Plauger and Alexander A. Stepanov and Meng Lee
                 and David R. Musser",
  title =        "The {C++ Standard Template Library}",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xii + 485",
  year =         "2000",
  ISBN =         "0-13-437633-1 (paperback)",
  ISBN-13 =      "978-0-13-437633-2 (paperback)",
  LCCN =         "QA76.73.C153 C17 2000",
  bibdate =      "Fri Nov 24 07:39:59 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$40.00",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
}


bibtype: book
filename: master.bib
label: Plotnik:1982:EEM
author: Arthur Plotnik
title: The Elements of Editing: a Modern Guide for Editors and Journalists
publisher: pub-COLLIER
address: pub-COLLIER:adr
pages: xiii + 156
year: 1982
ISBN: 0-02-597700-8 OR 0025977008
ISBN13: 978-0-02-597700-6 OR 9780025977006
LCCN: PN4778 .P59 1982
bibdate: Wed Dec 15 10:40:48 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:40:48 ???
acknowledgement: ack-nhfb
rawauthor: Arthur Plotnik
rawtitle: The Elements of Editing: a Modern Guide for Editors and Journalists
abstract:
Concise, practical, and comprehensive, booktitle The Elements of Editing synthesizes the information today's writers, editors, journalists, and students need and use most. From an inside look at the delicate relationship between author and editor to preparing a manuscript for the printer; from graphics and photography to copyright and libel law, no other book about editing covers so much material so thoroughly. For aspiring and practicing writers, editors, and everyone who wants to present a crisp, clean sentence.

TOC:
Preface: grope no more in vain Acknowledgments The editorial personality: good and bad compulsiveness Order out of chaos: ten basic steps in ``processing'' a manuscript Editor and writer: an uneasy alliance The agony and the agony: line editors and their craft Troubleshooting: the editor's million-dollar talent Information retrieval for editors: a modern approach to research and reference An editor's introduction to copyright: with fifteen quintessential Q's and A's The book editor: entrepreneur in a mad marketplace Art for communication's sake: a guide to editorial graphics Basic photography for editors: camera operation, picture-taking, and photo editing Afterword: the electronic editor

rawabstract:
Concise, practical, and comprehensive, \booktitle{The Elements of Editing} synthesizes the information today's writers, editors, journalists, and students need and use most. From an inside look at the delicate relationship between author and editor to preparing a manuscript for the printer; from graphics and photography to copyright and libel law, no other book about editing covers so much material so thoroughly. For aspiring and practicing writers, editors, and everyone who wants to present a crisp, clean sentence.

rawTOC:
Preface: grope no more in vain \\ Acknowledgments \\ The editorial personality: good and bad compulsiveness \\ Order out of chaos: ten basic steps in ``processing'' a manuscript \\ Editor and writer: an uneasy alliance \\ The agony and the agony: line editors and their craft \\ Troubleshooting: the editor's million-dollar talent \\ Information retrieval for editors: a modern approach to research and reference \\ An editor's introduction to copyright: with fifteen quintessential Q's and A's \\ The book editor: entrepreneur in a mad marketplace \\ Art for communication's sake: a guide to editorial graphics \\ Basic photography for editors: camera operation, picture-taking, and photo editing \\ Afterword: the electronic editor

entry:
@Book{Plotnik:1982:EEM,
  author =       "Arthur Plotnik",
  title =        "The Elements of Editing: a Modern Guide for Editors
                 and Journalists",
  publisher =    pub-COLLIER,
  address =      pub-COLLIER:adr,
  pages =        "xiii + 156",
  year =         "1982",
  ISBN =         "0-02-597700-8",
  ISBN-13 =      "978-0-02-597700-6",
  LCCN =         "PN4778 .P59 1982",
  bibdate =      "Wed Dec 15 10:40:48 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Concise, practical, and comprehensive, \booktitle{The
                 Elements of Editing} synthesizes the information
                 today's writers, editors, journalists, and students
                 need and use most. From an inside look at the delicate
                 relationship between author and editor to preparing a
                 manuscript for the printer; from graphics and
                 photography to copyright and libel law, no other book
                 about editing covers so much material so thoroughly.
                 For aspiring and practicing writers, editors, and
                 everyone who wants to present a crisp, clean
                 sentence.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface: grope no more in vain \\
                 Acknowledgments \\
                 The editorial personality: good and bad compulsiveness
                 \\
                 Order out of chaos: ten basic steps in ``processing'' a
                 manuscript \\
                 Editor and writer: an uneasy alliance \\
                 The agony and the agony: line editors and their craft
                 \\
                 Troubleshooting: the editor's million-dollar talent \\
                 Information retrieval for editors: a modern approach to
                 research and reference \\
                 An editor's introduction to copyright: with fifteen
                 quintessential Q's and A's \\
                 The book editor: entrepreneur in a mad marketplace \\
                 Art for communication's sake: a guide to editorial
                 graphics \\
                 Basic photography for editors: camera operation,
                 picture-taking, and photo editing \\
                 Afterword: the electronic editor",
}


bibtype: book
filename: master.bib
label: Plum:1987:NDC
author: T. Plum
title: Notes on the Draft C Standard
publisher: pub-PLUMHALL
address: pub-PLUMHALL:adr
pages: 92
year: 1987
ISBN: 0-911537-06-6 OR 0911537066
ISBN13: 978-0-911537-06-2 OR 9780911537062
LCCN: QA76.73.C15 P585 1987
bibdate: Wed Dec 15 10:40:49 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:40:49 ???
acknowledgement: ack-nhfb
rawauthor: T. Plum
rawtitle: Notes on the Draft {C} Standard
entry:
@Book{Plum:1987:NDC,
  author =       "T. Plum",
  title =        "Notes on the Draft {C} Standard",
  publisher =    pub-PLUMHALL,
  address =      pub-PLUMHALL:adr,
  pages =        "92",
  year =         "1987",
  ISBN =         "0-911537-06-6",
  ISBN-13 =      "978-0-911537-06-2",
  LCCN =         "QA76.73.C15 P585 1987",
  bibdate =      "Wed Dec 15 10:40:49 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$10.00",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Pogue:2005:MXT
author: David Pogue
title: Mac OS X, Tiger Edition: the Missing Manual
publisher: pub-ORA
address: pub-ORA:adr
pages: xvi + 847
year: 2005
LCCN: QA76.76.O63 P634 2005
bibdate: Thu Oct 6 08:01:10 MDT 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; melvyl.cdlib.org:210/CDL90
bibtimestamp: 2005.10.06 08:01:10 MDT
series: Missing manual
remark: Covers Mac OS X 10.4.
subject: Mac OS; Macintosh (Computer); Operating systems (Computers)
acknowledgement: ack-nhfb
rawauthor: David Pogue
rawtitle: {Mac OS X}, {Tiger} Edition: the Missing Manual
ISBN:
0-596-00941-0 (paperback), 1-4493-7907-9 (e-book), 1-4493-9210-5 (e-book) OR 0596009410 (paperback), 1449379079 (ebook), 1449392105 (ebook)

ISBN13:
978-0-596-00941-0 (paperback), 978-1-4493-7907-0 (e-book), 978-1-4493-9210-9 (e-book) OR 9780596009410 (paperback), 9781449379070 (ebook), 9781449392109 (ebook)

TOC:
1: Folders and Windows 2: Organizing your stuff 3: Spotlight 4: Dock, desktop, and toolbar 5: Documents, programs, and dashboard 6: Back to Mac OS 9 7: Moving data 8: Automator and AppleScript 9: System preferences 10: free programs 11: CDs, DVDs, and iTunes 12: Accounts, firewalls, and security 13: Networking 14: Graphics, fonts, printing, and faxing 15: Sound, movies, speech, and handwriting 16: Terminal: doorway to Unix 17: Fun with Terminal 18: Hacking Mac OS X 19: Internet setup, Mac, and iSync 20: Mail and address book 21: Safari, iChat, and Sherlock 22: SSH, FTP, VPN, and Web sharing Appendix A: Installing Mac OS X 10.4 Appendix B: Troubleshooting Appendix C: The ``Where'd it go?'' Dictionary (Mac version) Appendix D: The ``Where'd it go?'' Dictionary (Windows version) Appendix E: Where to go from here Appendix F: The Master Mac OS X secret keystroke list

rawTOC:
1: Folders and Windows \\ 2: Organizing your stuff \\ 3: Spotlight \\ 4: Dock, desktop, and toolbar \\ 5: Documents, programs, and dashboard \\ 6: Back to Mac OS 9 \\ 7: Moving data \\ 8: Automator and AppleScript \\ 9: System preferences \\ 10: free programs \\ 11: CDs, DVDs, and iTunes \\ 12: Accounts, firewalls, and security \\ 13: Networking \\ 14: Graphics, fonts, printing, and faxing \\ 15: Sound, movies, speech, and handwriting \\ 16: Terminal: doorway to Unix \\ 17: Fun with Terminal \\ 18: Hacking Mac OS X \\ 19: Internet setup, Mac, and iSync \\ 20: Mail and address book \\ 21: Safari, iChat, and Sherlock \\ 22: SSH, FTP, VPN, and Web sharing \\ Appendix A: Installing Mac OS X 10.4 \\ Appendix B: Troubleshooting \\ Appendix C: The ``Where'd it go?'' Dictionary (Mac version) \\ Appendix D: The ``Where'd it go?'' Dictionary (Windows version) \\ Appendix E: Where to go from here \\ Appendix F: The Master Mac OS X secret keystroke list

entry:
@Book{Pogue:2005:MXT,
  author =       "David Pogue",
  title =        "{Mac OS X}, {Tiger} Edition: the Missing Manual",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xvi + 847",
  year =         "2005",
  ISBN =         "0-596-00941-0 (paperback), 1-4493-7907-9 (e-book),
                 1-4493-9210-5 (e-book)",
  ISBN-13 =      "978-0-596-00941-0 (paperback), 978-1-4493-7907-0
                 (e-book), 978-1-4493-9210-9 (e-book)",
  LCCN =         "QA76.76.O63 P634 2005",
  bibdate =      "Thu Oct 6 08:01:10 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  series =       "Missing manual",
  acknowledgement = ack-nhfb,
  remark =       "Covers Mac OS X 10.4.",
  subject =      "Mac OS; Macintosh (Computer); Operating systems
                 (Computers)",
  tableofcontents = "1: Folders and Windows \\
                 2: Organizing your stuff \\
                 3: Spotlight \\
                 4: Dock, desktop, and toolbar \\
                 5: Documents, programs, and dashboard \\
                 6: Back to Mac OS 9 \\
                 7: Moving data \\
                 8: Automator and AppleScript \\
                 9: System preferences \\
                 10: free programs \\
                 11: CDs, DVDs, and iTunes \\
                 12: Accounts, firewalls, and security \\
                 13: Networking \\
                 14: Graphics, fonts, printing, and faxing \\
                 15: Sound, movies, speech, and handwriting \\
                 16: Terminal: doorway to Unix \\
                 17: Fun with Terminal \\
                 18: Hacking Mac OS X \\
                 19: Internet setup, Mac, and iSync \\
                 20: Mail and address book \\
                 21: Safari, iChat, and Sherlock \\
                 22: SSH, FTP, VPN, and Web sharing \\
                 Appendix A: Installing Mac OS X 10.4 \\
                 Appendix B: Troubleshooting \\
                 Appendix C: The ``Where'd it go?'' Dictionary (Mac
                 version) \\
                 Appendix D: The ``Where'd it go?'' Dictionary (Windows
                 version) \\
                 Appendix E: Where to go from here \\
                 Appendix F: The Master Mac OS X secret keystroke list",
}


bibtype: book
filename: master.bib
label: Pollack:2003:USL
author: Henry N. Pollack
title: Uncertain science ldots : uncertain world
publisher: pub-CAMBRIDGE
address: pub-CAMBRIDGE:adr
pages: xii + 243
year: 2003
LCCN: Q175 .P835 2003
bibdate: Thu Aug 30 10:07:25 MDT 2018
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2018.08.30 10:07:25 MDT
acknowledgement: ack-nhfb
rawauthor: Henry N. Pollack
rawtitle: Uncertain science \ldots{}: uncertain world
ISBN:
0-511-07776-9, 0-511-07465-4, 0-511-54137-6, 0-521-78188-4, 0-511-07619-3 OR 0511077769, 0511074654, 0511541376, 0521781884, 0511076193

ISBN13:
978-0-511-07776-0, 978-0-511-07465-3, 978-0-511-54137-7, 978-0-521-78188-6, 978-0-511-07619-0 OR 9780511077760, 9780511074653, 9780511541377, 9780521781886, 9780511076190

abstract:
Scientific uncertainty puzzles many people. The puzzlement arises when scientists have more than one answer, and disagree among themselves. This book helps people find their way through this maze of scientific contradiction and uncertainty. By acquainting them with the ways that uncertainty arises in science, how scientists accommodate and make use of uncertainty, and how they reach conclusions in the face of uncertainty, the book enables readers to confidently evaluate uncertainty from their own perspectives, in terms of their own experiences.

TOC:
Setting the stage Uncertain about science Can the media help? Unfamiliarity breeds uncertainty Fever or chill? A fifty--fifty chance I'm not quite sure how this works See what happens if ldots Reconstructing the past Predicting the future Out of the blue In a climate of uncertainty

rawabstract:
Scientific uncertainty puzzles many people. The puzzlement arises when scientists have more than one answer, and disagree among themselves. This book helps people find their way through this maze of scientific contradiction and uncertainty. By acquainting them with the ways that uncertainty arises in science, how scientists accommodate and make use of uncertainty, and how they reach conclusions in the face of uncertainty, the book enables readers to confidently evaluate uncertainty from their own perspectives, in terms of their own experiences.

rawTOC:
Setting the stage \\ Uncertain about science \\ Can the media help? \\ Unfamiliarity breeds uncertainty \\ Fever or chill? \\ A fifty--fifty chance \\ I'm not quite sure how this works \\ See what happens if \ldots{} \\ Reconstructing the past \\ Predicting the future \\ Out of the blue \\ In a climate of uncertainty

entry:
@Book{Pollack:2003:USL,
  author =       "Henry N. Pollack",
  title =        "Uncertain science \ldots{}: uncertain world",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xii + 243",
  year =         "2003",
  ISBN =         "0-511-07776-9, 0-511-07465-4, 0-511-54137-6,
                 0-521-78188-4, 0-511-07619-3",
  ISBN-13 =      "978-0-511-07776-0, 978-0-511-07465-3,
                 978-0-511-54137-7, 978-0-521-78188-6,
                 978-0-511-07619-0",
  LCCN =         "Q175 .P835 2003",
  bibdate =      "Thu Aug 30 10:07:25 MDT 2018",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Scientific uncertainty puzzles many people. The
                 puzzlement arises when scientists have more than one
                 answer, and disagree among themselves. This book helps
                 people find their way through this maze of scientific
                 contradiction and uncertainty. By acquainting them with
                 the ways that uncertainty arises in science, how
                 scientists accommodate and make use of uncertainty, and
                 how they reach conclusions in the face of uncertainty,
                 the book enables readers to confidently evaluate
                 uncertainty from their own perspectives, in terms of
                 their own experiences.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Setting the stage \\
                 Uncertain about science \\
                 Can the media help? \\
                 Unfamiliarity breeds uncertainty \\
                 Fever or chill? \\
                 A fifty--fifty chance \\
                 I'm not quite sure how this works \\
                 See what happens if \ldots{} \\
                 Reconstructing the past \\
                 Predicting the future \\
                 Out of the blue \\
                 In a climate of uncertainty",
}


bibtype: book
filename: master.bib
label: Pollack:2010:WI
author: H. N. Pollack
title: A world without ice
publisher: Avery
address: New York, NY, USA
pages: xii + 290
year: 2010
ISBN: 1-58333-407-6 OR 1583334076
ISBN13: 978-1-58333-407-2 OR 9781583334072
LCCN: GB2405 .P55 2010
bibdate: Wed Dec 7 07:18:44 MST 2011
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2011.12.07 07:18:44 MST
subject: Glaciers; Ice; Global warming
acknowledgement: ack-nhfb
rawauthor: H. N. Pollack
rawtitle: A world without ice
TOC:
Discovering ice Ice and life: on earth and beyond When ice ruled the world Warming up Nature at work Human footprints Melting ice, rising seas Choices amid change

rawTOC:
Discovering ice \\ Ice and life: on earth and beyond \\ When ice ruled the world \\ Warming up \\ Nature at work \\ Human footprints \\ Melting ice, rising seas \\ Choices amid change

entry:
@Book{Pollack:2010:WI,
  author =       "H. N. Pollack",
  title =        "A world without ice",
  publisher =    "Avery",
  address =      "New York, NY, USA",
  pages =        "xii + 290",
  year =         "2010",
  ISBN =         "1-58333-407-6",
  ISBN-13 =      "978-1-58333-407-2",
  LCCN =         "GB2405 .P55 2010",
  bibdate =      "Wed Dec 7 07:18:44 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Glaciers; Ice; Global warming",
  tableofcontents = "Discovering ice \\
                 Ice and life: on earth and beyond \\
                 When ice ruled the world \\
                 Warming up \\
                 Nature at work \\
                 Human footprints \\
                 Melting ice, rising seas \\
                 Choices amid change",
}


bibtype: misc
filename: master.bib
label: Polytron:polyawk
author: Polytron Corporation
title: PolyAWK
pages: xii + 290
year: 1987
bibsource: https://www.math.utah.edu/pub/tex/bib/gnu.bib; https://www.math.utah.edu/pub/tex/bib/master.bib
note: 170 NW 167th Place, Beaverton, OR 97006. See also cite Aho:1988:APL.
acknowledgement: ack-nhfb
rawauthor: Polytron Corporation
rawnote: 170 NW 167th Place, Beaverton, OR 97006. See also \cite{Aho:1988:APL}.
rawtitle: {PolyAWK}
entry:
@Misc{Polytron:polyawk,
  author =       "Polytron Corporation",
  title =        "{PolyAWK}",
  year =         "1987",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/gnu.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "170 NW 167th Place, Beaverton, OR 97006. See also
                 \cite{Aho:1988:APL}.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Preparata:1985:CGI
author: Franco P. Preparata and Michael Ian Shamos
title: Computational Geometry: an Introduction
publisher: pub-SV
address: pub-SV:adr
pages: xii + 390
year: 1985
DOI: https://doi.org/10.1007/978-1-4612-1098-6
ISSN: 0172-603X OR 0172603X
LCCN: QA447 .P735 1985
bibdate: Wed Dec 15 10:40:51 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:40:51 ???
acknowledgement: ack-nhfb
rawauthor: Franco P. Preparata and Michael Ian Shamos
rawtitle: Computational Geometry: an Introduction
ISBN:
0-387-96131-3, 1-4612-1098-4 (e-book), 1-4612-7010-3 (print) OR 0387961313, 1461210984 (ebook), 1461270103 (print)

ISBN13:
978-0-387-96131-6, 978-1-4612-1098-6 (e-book), 978-1-4612-7010-2 (print) OR 9780387961316, 9781461210986 (ebook), 9781461270102 (print)

abstract:
From the reviews: ``This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry. The book is well organized and lucidly written; a timely contribution by two founders of the field. It clearly demonstrates that computational geometry in the plane is now a fairly well-understood branch of computer science and mathematics. It also points the way to the solution of the more challenging problems in dimensions higher than two.'' #Mathematical Reviews#1 ``This remarkable book is a comprehensive and systematic study on research results obtained especially in the last ten years. The very clear presentation concentrates on basic ideas, fundamental combinatorial structures, and crucial algorithmic techniques. The plenty of results is clever organized following these guidelines and within the framework of some detailed case studies. A large number of figures and examples also aid the understanding of the material. Therefore, it can be highly recommended as an early graduate text but it should prove also to be essential to researchers and professionals in applied fields of computer-aided design, computer graphics, and robotics.'' #Biometrical Journal#2.

TOC:
1 Introduction 1.1 Historical Perspective 1.2 Algorithmic Background 1.3 Geometric Preliminaries 1.4 Models of Computation 2 Geometric Searching 2.1 Introduction to Geometric Searching 2.2 Point-Location Problems 2.3 Range-Searching Problems 2.4 Iterated Search and Fractional Cascading 2.5 Notes and Comments 2.6 Exercises 3 Convex Hulls: Basic Algorithms 3.1 Preliminaries 3.2 Problem Statement and Lower Bounds 3.3 Convex Hull Algorithms in the Plane 3.4 Convex Hulls in More Than Two Dimensions 3.5 Notes and Comments 3.6 Exercises 4 Convex Hulls: Extensions and Applications 4.1 Extensions and Variants 4.2 Applications to Statistics 4.3 Notes and Comments 4.4 Exercises 5 Proximity: Fundamental Algorithms 5.1 A Collection of Problems 5.2 A Computational Prototype: Element Uniqueness 5.3 Lower Bounds 5.4 The Closest Pair Problem: A Divide-and-Conquer Approach 5.5 The Locus Approach to Proximity Problems: The Voronoi Diagram 5.6 Proximity Problems Solved by the Voronoi Diagram 5.7 Notes and Comments 5.8 Exercises 6 Proximity: Variants and Generalizations 6.1 Euclidean Minimum Spanning Trees 6.2 Planar Triangulations 6.3 Generalizations of the Voronoi Diagram 6.4 Gaps and Covers 6.5 Notes and Comments 6.6 Exercises 7 Intersections 7.1 A Sample of Applications 7.2 Planar Applications 7.3 Three-Dimensional Applications 7.4 Notes and Comments 7.5 Exercises 8 The Geometry of Rectangles 8.1 Some Applications of the Geometry of Rectangles 8.2 Domain of Validity of the Results 8.3 General Considerations on Static-Mode Algorithms 8.4 Measure and Perimeter of a Union of Rectangles 8.5 The Contour of a Union of Rectangles 8.6 The Closure of a Union of Rectangles 8.7 The External Contour of a Union of Rectangles 8.8 Intersections of Rectangles and Related Problems 8.9 Notes and Comments 8.10 Exercises References Author Index

rawabstract:
From the reviews: ``This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry. The book is well organized and lucidly written; a timely contribution by two founders of the field. It clearly demonstrates that computational geometry in the plane is now a fairly well-understood branch of computer science and mathematics. It also points the way to the solution of the more challenging problems in dimensions higher than two.'' \#Mathematical Reviews\#1 ``This remarkable book is a comprehensive and systematic study on research results obtained especially in the last ten years. The very clear presentation concentrates on basic ideas, fundamental combinatorial structures, and crucial algorithmic techniques. The plenty of results is clever organized following these guidelines and within the framework of some detailed case studies. A large number of figures and examples also aid the understanding of the material. Therefore, it can be highly recommended as an early graduate text but it should prove also to be essential to researchers and professionals in applied fields of computer-aided design, computer graphics, and robotics.'' \#Biometrical Journal\#2.

shortTOC:
Introduction Geometric Searching Convex Hulls: Basic Algorithms Convex Hulls: Extensions and Applications Proximity: Fundamental Algorithms Proximity: Variants and Generalizations Intersections The Geometry of Rectangles References Author Index Subject Index

rawshortTOC:
Introduction \\ Geometric Searching \\ Convex Hulls: Basic Algorithms \\ Convex Hulls: Extensions and Applications \\ Proximity: Fundamental Algorithms \\ Proximity: Variants and Generalizations \\ Intersections \\ The Geometry of Rectangles \\ References \\ Author Index \\ Subject Index

rawTOC:
1 Introduction \\ 1.1 Historical Perspective \\ 1.2 Algorithmic Background \\ 1.3 Geometric Preliminaries \\ 1.4 Models of Computation \\ 2 Geometric Searching \\ 2.1 Introduction to Geometric Searching \\ 2.2 Point-Location Problems \\ 2.3 Range-Searching Problems \\ 2.4 Iterated Search and Fractional Cascading \\ 2.5 Notes and Comments \\ 2.6 Exercises \\ 3 Convex Hulls: Basic Algorithms \\ 3.1 Preliminaries \\ 3.2 Problem Statement and Lower Bounds \\ 3.3 Convex Hull Algorithms in the Plane \\ 3.4 Convex Hulls in More Than Two Dimensions \\ 3.5 Notes and Comments \\ 3.6 Exercises \\ 4 Convex Hulls: Extensions and Applications \\ 4.1 Extensions and Variants \\ 4.2 Applications to Statistics \\ 4.3 Notes and Comments \\ 4.4 Exercises \\ 5 Proximity: Fundamental Algorithms \\ 5.1 A Collection of Problems \\ 5.2 A Computational Prototype: Element Uniqueness \\ 5.3 Lower Bounds \\ 5.4 The Closest Pair Problem: A Divide-and-Conquer Approach \\ 5.5 The Locus Approach to Proximity Problems: The Voronoi Diagram \\ 5.6 Proximity Problems Solved by the Voronoi Diagram \\ 5.7 Notes and Comments \\ 5.8 Exercises \\ 6 Proximity: Variants and Generalizations \\ 6.1 Euclidean Minimum Spanning Trees \\ 6.2 Planar Triangulations \\ 6.3 Generalizations of the Voronoi Diagram \\ 6.4 Gaps and Covers \\ 6.5 Notes and Comments \\ 6.6 Exercises \\ 7 Intersections \\ 7.1 A Sample of Applications \\ 7.2 Planar Applications \\ 7.3 Three-Dimensional Applications \\ 7.4 Notes and Comments \\ 7.5 Exercises \\ 8 The Geometry of Rectangles \\ 8.1 Some Applications of the Geometry of Rectangles \\ 8.2 Domain of Validity of the Results \\ 8.3 General Considerations on Static-Mode Algorithms \\ 8.4 Measure and Perimeter of a Union of Rectangles \\ 8.5 The Contour of a Union of Rectangles \\ 8.6 The Closure of a Union of Rectangles \\ 8.7 The External Contour of a Union of Rectangles \\ 8.8 Intersections of Rectangles and Related Problems \\ 8.9 Notes and Comments \\ 8.10 Exercises \\ References \\ Author Index

entry:
@Book{Preparata:1985:CGI,
  author =       "Franco P. Preparata and Michael Ian Shamos",
  title =        "Computational Geometry: an Introduction",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 390",
  year =         "1985",
  DOI =          "https://doi.org/10.1007/978-1-4612-1098-6",
  ISBN =         "0-387-96131-3, 1-4612-1098-4 (e-book), 1-4612-7010-3
                 (print)",
  ISBN-13 =      "978-0-387-96131-6, 978-1-4612-1098-6 (e-book),
                 978-1-4612-7010-2 (print)",
  ISSN =         "0172-603X",
  LCCN =         "QA447 .P735 1985",
  bibdate =      "Wed Dec 15 10:40:51 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$32.00",
  abstract =     "From the reviews: ``This book offers a coherent
                 treatment, at the graduate textbook level, of the field
                 that has come to be known in the last decade or so as
                 computational geometry. The book is well organized and
                 lucidly written; a timely contribution by two founders
                 of the field. It clearly demonstrates that
                 computational geometry in the plane is now a fairly
                 well-understood branch of computer science and
                 mathematics. It also points the way to the solution of
                 the more challenging problems in dimensions higher than
                 two.'' \#Mathematical Reviews\#1 ``This remarkable book
                 is a comprehensive and systematic study on research
                 results obtained especially in the last ten years. The
                 very clear presentation concentrates on basic ideas,
                 fundamental combinatorial structures, and crucial
                 algorithmic techniques. The plenty of results is clever
                 organized following these guidelines and within the
                 framework of some detailed case studies. A large number
                 of figures and examples also aid the understanding of
                 the material. Therefore, it can be highly recommended
                 as an early graduate text but it should prove also to
                 be essential to researchers and professionals in
                 applied fields of computer-aided design, computer
                 graphics, and robotics.'' \#Biometrical Journal\#2.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Introduction \\
                 Geometric Searching \\
                 Convex Hulls: Basic Algorithms \\
                 Convex Hulls: Extensions and Applications \\
                 Proximity: Fundamental Algorithms \\
                 Proximity: Variants and Generalizations \\
                 Intersections \\
                 The Geometry of Rectangles \\
                 References \\
                 Author Index \\
                 Subject Index",
  tableofcontents = "1 Introduction \\
                 1.1 Historical Perspective \\
                 1.2 Algorithmic Background \\
                 1.3 Geometric Preliminaries \\
                 1.4 Models of Computation \\
                 2 Geometric Searching \\
                 2.1 Introduction to Geometric Searching \\
                 2.2 Point-Location Problems \\
                 2.3 Range-Searching Problems \\
                 2.4 Iterated Search and Fractional Cascading \\
                 2.5 Notes and Comments \\
                 2.6 Exercises \\
                 3 Convex Hulls: Basic Algorithms \\
                 3.1 Preliminaries \\
                 3.2 Problem Statement and Lower Bounds \\
                 3.3 Convex Hull Algorithms in the Plane \\
                 3.4 Convex Hulls in More Than Two Dimensions \\
                 3.5 Notes and Comments \\
                 3.6 Exercises \\
                 4 Convex Hulls: Extensions and Applications \\
                 4.1 Extensions and Variants \\
                 4.2 Applications to Statistics \\
                 4.3 Notes and Comments \\
                 4.4 Exercises \\
                 5 Proximity: Fundamental Algorithms \\
                 5.1 A Collection of Problems \\
                 5.2 A Computational Prototype: Element Uniqueness \\
                 5.3 Lower Bounds \\
                 5.4 The Closest Pair Problem: A Divide-and-Conquer
                 Approach \\
                 5.5 The Locus Approach to Proximity Problems: The
                 Voronoi Diagram \\
                 5.6 Proximity Problems Solved by the Voronoi Diagram
                 \\
                 5.7 Notes and Comments \\
                 5.8 Exercises \\
                 6 Proximity: Variants and Generalizations \\
                 6.1 Euclidean Minimum Spanning Trees \\
                 6.2 Planar Triangulations \\
                 6.3 Generalizations of the Voronoi Diagram \\
                 6.4 Gaps and Covers \\
                 6.5 Notes and Comments \\
                 6.6 Exercises \\
                 7 Intersections \\
                 7.1 A Sample of Applications \\
                 7.2 Planar Applications \\
                 7.3 Three-Dimensional Applications \\
                 7.4 Notes and Comments \\
                 7.5 Exercises \\
                 8 The Geometry of Rectangles \\
                 8.1 Some Applications of the Geometry of Rectangles \\
                 8.2 Domain of Validity of the Results \\
                 8.3 General Considerations on Static-Mode Algorithms
                 \\
                 8.4 Measure and Perimeter of a Union of Rectangles \\
                 8.5 The Contour of a Union of Rectangles \\
                 8.6 The Closure of a Union of Rectangles \\
                 8.7 The External Contour of a Union of Rectangles \\
                 8.8 Intersections of Rectangles and Related Problems
                 \\
                 8.9 Notes and Comments \\
                 8.10 Exercises \\
                 References \\
                 Author Index",
}


bibtype: book
filename: master.bib
label: Press:1986:NRA
author: William H. Press and Brian P. Flannery and Saul A. Teukolsky and William T. Vetterling
title: Numerical Recipes: The Art of Scientific Computing (FORTRAN Version)
publisher: pub-CAMBRIDGE
address: pub-CAMBRIDGE:adr
pages: xx + 702
year: 1986
ISBN: 0-521-38330-7 OR 0521383307
ISBN13: 978-0-521-38330-1 OR 9780521383301
LCCN: QA297 .N866 1989
bibdate: Wed Dec 15 10:40:52 1993
bibtimestamp: 1993.12.15 10:40:52 ???
acknowledgement: ack-nhfb
rawauthor: William H. Press and Brian P. Flannery and Saul A. Teukolsky and William T. Vetterling
rawtitle: Numerical Recipes: The Art of Scientific Computing ({FORTRAN} Version)
bibsource:
https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; https://www.math.utah.edu/pub/tex/bib/csmmepcb.bib; https://www.math.utah.edu/pub/tex/bib/fortran2.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

subject:
bibliotheque programme; logiciel scientifique; programmation Fortran; calcul numerique; calcul scientifique; Numerische Mathematik; Analyse numerique; Logiciels; Fortran (Langage de programmation); Sciences; Mathematiques; Programmation informatique; Traitement des donnees; Analyse mathematique; Modeles mathematiques; Calcul; FORTRAN (Computer program language); Numerical analysis; Computer programs; Science; Mathematics; Numerieke wiskunde; Dataprocessing; Statistiek; FORTRAN; Computadores (Software); Informatique; Logiciels; Fortran (langage de programmation); Computer programs; FORTRAN (Computer program language)

TOC:
Preface / xi List of Computer Programs / xv 1: Preliminaries / 1 1.0 Introduction / 1 1.1 Program Organization and Control Structures / 4 1.2 Error, Accuracy, and Stability / 15 2: Solution of Linear Algebraic Equations / 19 2.0 Introduction / 19 2.1 Gauss-Jordan Elimination / 24 2.2 Gaussian Elimination with Backsubstitution / 29 2.3 LU Decomposition / 31 2.4 Inverse of a Matrix / 38 2.5 Determinant of a Matrix / 39 2.6 Tridiagonal Systems of Equations / 40 2.7 Iterative Improvement of a Solution to Linear Equations / 41 2.8 Vandermonde Matrices and Toeplitz Matrices / 43 2.9 Singular Value Decomposition / 52 2.10 Sparse Linear Systems / 64 2.11 Is Matrix Inversion an N3 Process? / 74 3: Interpolation and Extrapolation / 77 3.0 Introduction / 77 3.1 Polynomial Interpolation and Extrapolation / 80 3.2 Rational Function Interpolation and Extrapolation / 83 3.3 Cubic Spline Interpolation / 86 3.4 How to Search an Ordered Table / 89 3.5 Coefficients of the Interpolating Polynomial / 92 3.6 Interpolation in Two or More Dimensions / 95 4: Integration of Functions / 102 4.0 Introduction / 102 4.1 Classical Formulas for Equally-Spaced Abscissas / 103 4.2 Elementary Algorithms / 110 4.3 Romberg Integration / 114 4.4 Improper Integrals / 115 4.5 Gaussian Quadratures / 121 4.6 Multidimensional Integrals / 126 5: Evaluation of Functions / 131 5.0 Introduction / 131 5.1 Series and Their Convergence / 132 5.2 Evaluation of Continued Fractions / 135 5.3 Polynomials and Rational Functions / 137 5.4 Recurrence Relations and Clenshaw's Recurrence Formula / 141 5.5 Quadratic and Cubic Equations / 145 5.6 Chebyshev Approximation / 147 5.7 Derivatives or Integrals of a Chebyshev-approximated Function / 151 5.8 Polynomial Approximation from Chebyshev Coefficients / 153 6: Special Functions / 155 6.0 Introduction / 155 6.1 Gamma Function, Beta Function, Factorials, and Binomial Coefficients / 156 6.2 Incomplete Gamma Function, Error Function, Chi-Square Probability Function, Cumulative Poisson Function / 160 6.3 Incomplete Beta Function, Student's Distribution, F-Distribution, Cumulative Binomial Distribution / 166 6.4 Bessel Functions of Integer Order / 170 6.5 Modified Bessel Functions of Integer Order / 176 6.6 Spherical Harmonics / 180 6.7 Elliptic Integrals and Jacobian Elliptic Functions / 183 7: Random Numbers / 191 7.0 Introduction / 191 7.1 Uniform Deviates / 192 7.2 Transformation Method: Exponential and Normal Deviates / 200 7.3 Rejection Method: Gamma, Poisson, Binomial Deviates / 203 7.4 Generation of Random Bits / 209 7.5 The Data Encryption Standard / 214 7.6 Monte Carlo Integration / 221 8: Sorting / 226 8.0 Introduction / 226 8.1 Straight Insertion and Shell's Method / 227 8.2 Heapsort / 229 8.3 Indexing and Ranking / 232 8.4 Quicksort / 235 8.5 Determination of Equivalence Classes / 237 9: Root Finding and Nonlinear Sets of Equations / 240 9.0 Introduction / 240 9.1 Bracketing and Bisection / 243 9.2 Secant Method and False Position Method / 248 9.3 Van Wijngaarden--Dekker--Brent Method / 251 9.4 Newton--Raphson Method Using Derivative / 254 9.5 Roots of Polynomials / 259 9.6 Newton--Raphson Method for Nonlinear Systems of Equations / 269 10: Minimization or Maximization of Functions / 274 10.0 Introduction / 274 10.1 Golden Section Search in One Dimension / 277 10.2 Parabolic Interpolation and Brent's Method in One Dimension / 283 10.3 One-Dimensional Search with First Derivatives / 286 10.4 Downhill Simplex Method in Multidimensions / 289 10.5 Direction Set (Powell's) Methods in Multidimensions / 294 10.6 Conjugate Gradient Methods in Multidimensions / 301 10.7 Variable Metric Methods in Multidimensions / 307 10.8 Linear Programming and the Simplex Method / 312 10.9 Combinatorial Minimization: Method of Simulated Annealing / 326 11: Eigensystems / 335 11.0 Introduction / 335 11.1 Jacobi Transformations of a Symmetric Matrix / 342 11.2 Reduction of a Symmetric Matrix to Tridiagonal Form: Givens and Householder Reductions / 349 11.3 Eigenvalues and Eigenvectors of a Tridiagonal Matrix / 356 11.4 Hermitian Matrices / 364 11.5 Reduction of a General Matrix to Hessenberg Form / 365 11.6 The QR Algorithm for Real Hessenberg Matrices / 369 11.7 Improving Eigenvalues and/or Finding Eigenvectors by Inverse Iteration / 377 12: Fourier Transform Spectral Methods / 381 12.0 Introduction / 381 12.1 Fourier Transform of Discretely Sampled Data / 386 12.2 Fast Fourier Transform (FFT) / 390 12.3 FFT of Real Functions, Sine and Cosine Transforms / 397 12.4 Convolution and Deconvolution Using the FFT / 407 12.5 Correlation and Autocorrelation Using the FFT / 415 12.6 Optimal (Wiener) Filtering with the FFT / 417 12.7 Power Spectrum Estimation Using the FFT / 420 12.8 Power Spectrum Estimation by the Maximum Entropy (All Poles) Method / 430 12.9 Digital Filtering in the Time Domain / 436 12.10 Linear Prediction and Linear Predictive Coding / 444 12.11 FFT in Two or More Dimensions / 449 13: Statistical Description of Data / 454 13.0 Introduction / 454 13.1 Moments of a Distribution: Mean, Variance, Skewness, and so forth / 455 13.2 Efficient Search for the Median / 459 13.3 Estimation of the Mode for Continuous Data / 462 13.4 Do Two Distributions Have the Same Means or Variances? / 464 13.5 Are Two Distributions Different? / 469 13.6 Contingency Table Analysis of Two Distributions / 476 13.7 Linear Correlation / 484 13.8 Nonparametric or Rank Correlation / 488 13.9 Smoothing of Data / 495 14: Modeling of Data / 498 14.0 Introduction / 498 14.1 Least Squares as a Maximum Likelihood Estimator / 499 14.2 Fitting Data to a Straight Line / 504 14.3 General Linear Least Squares / 509 14.4 Nonlinear Models / 521 14.5 Confidence Limits on Estimated Model Parameters / 529 14.6 Robust Estimation / 539 15: Integration of Ordinary Differential Equations / 547 15.0 Introduction / 547 15.1 Runge--Kutta Method / 550 15.2 Adaptive Stepsize Control for Runge--Kutta / 554 15.3 Modified Midpoint Method / 560 15.4 Richardson Extrapolation and the Bulirsch--Stoer Method / 563 15.5 Predictor-Corrector Methods / 569 15.6 Stiff Sets of Equations / 572 16: Two Point Boundary Value Problems / 578 16.0 Introduction / 578 16.1 The Shooting Method / 582 16.2 Shooting to a Fitting Point / 586 16.3 Relaxation Methods / 588 16.4 A Worked Example: Spheroidal Harmonics / 600 16.5 Automated Allocation of Mesh Points / 608 16.6 Handling Internal Boundary Conditions or Singular Points / 611 17: Partial Differential Equations / 615 17.0 Introduction / 615 17.1 Flux-Conservative Initial Value Problems / 623 17.2 Diffusive Initial Value Problems / 635 17.3 Initial Value Problems in Multidimensions / 642 17.4 Fourier and Cyclic Reduction Methods for Boundary Value Problems / 646 17.5 Relaxation Methods for Boundary Value Problems / 652 17.6 Operator Splitting,Methods and ADI / 660 References / 668 Numerical Recipes in Other Languages / 673 Table of Program Dependencies / 675 Index / 681

shortTOC:
Preface List of computer programs 1: Preliminaries 2: Solution of linear algebraic equations 3: Interpolation and extrapolation 4: Integration of functions 5: Evaluation of functions 6: Special functions 7: Random numbers 8: Sorting 9: Root finding and nonlinear sets of equations 10: Minimization or maximization of functions 11: Eigensystems 12: Fourier transform spectral methods 13: Statistical description of data 14: Modeling of data 15: Integration of ordinary differential equations 16: Two point boundary value problems 17: Partial differential equations 18: References Numerical recipes in other languages Table of program dependencies Index

rawshortTOC:
Preface \\ List of computer programs \\ 1: Preliminaries \\ 2: Solution of linear algebraic equations \\ 3: Interpolation and extrapolation \\ 4: Integration of functions \\ 5: Evaluation of functions \\ 6: Special functions \\ 7: Random numbers \\ 8: Sorting \\ 9: Root finding and nonlinear sets of equations \\ 10: Minimization or maximization of functions \\ 11: Eigensystems \\ 12: Fourier transform spectral methods \\ 13: Statistical description of data \\ 14: Modeling of data \\ 15: Integration of ordinary differential equations \\ 16: Two point boundary value problems \\ 17: Partial differential equations \\ 18: References \\ Numerical recipes in other languages \\ Table of program dependencies \\ Index

rawTOC:
Preface / xi \\ List of Computer Programs / xv \\ 1: Preliminaries / 1 \\ 1.0 Introduction / 1 \\ 1.1 Program Organization and Control Structures / 4 \\ 1.2 Error, Accuracy, and Stability / 15 \\ 2: Solution of Linear Algebraic Equations / 19 \\ 2.0 Introduction / 19 \\ 2.1 Gauss-Jordan Elimination / 24 \\ 2.2 Gaussian Elimination with Backsubstitution / 29 \\ 2.3 LU Decomposition / 31 \\ 2.4 Inverse of a Matrix / 38 \\ 2.5 Determinant of a Matrix / 39 \\ 2.6 Tridiagonal Systems of Equations / 40 \\ 2.7 Iterative Improvement of a Solution to Linear Equations / 41 \\ 2.8 Vandermonde Matrices and Toeplitz Matrices / 43 \\ 2.9 Singular Value Decomposition / 52 \\ 2.10 Sparse Linear Systems / 64 \\ 2.11 Is Matrix Inversion an N3 Process? / 74 \\ 3: Interpolation and Extrapolation / 77 \\ 3.0 Introduction / 77 \\ 3.1 Polynomial Interpolation and Extrapolation / 80 \\ 3.2 Rational Function Interpolation and Extrapolation / 83 \\ 3.3 Cubic Spline Interpolation / 86 \\ 3.4 How to Search an Ordered Table / 89 \\ 3.5 Coefficients of the Interpolating Polynomial / 92 \\ 3.6 Interpolation in Two or More Dimensions / 95 \\ 4: Integration of Functions / 102 \\ 4.0 Introduction / 102 \\ 4.1 Classical Formulas for Equally-Spaced Abscissas / 103 \\ 4.2 Elementary Algorithms / 110 \\ 4.3 Romberg Integration / 114 \\ 4.4 Improper Integrals / 115 \\ 4.5 Gaussian Quadratures / 121 \\ 4.6 Multidimensional Integrals / 126 \\ 5: Evaluation of Functions / 131 \\ 5.0 Introduction / 131 \\ 5.1 Series and Their Convergence / 132 \\ 5.2 Evaluation of Continued Fractions / 135 \\ 5.3 Polynomials and Rational Functions / 137 \\ 5.4 Recurrence Relations and Clenshaw's Recurrence Formula / 141 \\ 5.5 Quadratic and Cubic Equations / 145 \\ 5.6 Chebyshev Approximation / 147 \\ 5.7 Derivatives or Integrals of a Chebyshev-approximated Function / 151 \\ 5.8 Polynomial Approximation from Chebyshev Coefficients / 153 \\ 6: Special Functions / 155 \\ 6.0 Introduction / 155 \\ 6.1 Gamma Function, Beta Function, Factorials, and Binomial Coefficients / 156 \\ 6.2 Incomplete Gamma Function, Error Function, Chi-Square Probability Function, Cumulative Poisson Function / 160 \\ 6.3 Incomplete Beta Function, Student's Distribution, F-Distribution, Cumulative Binomial Distribution / 166 \\ 6.4 Bessel Functions of Integer Order / 170 \\ 6.5 Modified Bessel Functions of Integer Order / 176 \\ 6.6 Spherical Harmonics / 180 \\ 6.7 Elliptic Integrals and Jacobian Elliptic Functions / 183 \\ 7: Random Numbers / 191 \\ 7.0 Introduction / 191 \\ 7.1 Uniform Deviates / 192 \\ 7.2 Transformation Method: Exponential and Normal Deviates / 200 \\ 7.3 Rejection Method: Gamma, Poisson, Binomial Deviates / 203 \\ 7.4 Generation of Random Bits / 209 \\ 7.5 The Data Encryption Standard / 214 \\ 7.6 Monte Carlo Integration / 221 \\ 8: Sorting / 226 \\ 8.0 Introduction / 226 \\ 8.1 Straight Insertion and Shell's Method / 227 \\ 8.2 Heapsort / 229 \\ 8.3 Indexing and Ranking / 232 \\ 8.4 Quicksort / 235 \\ 8.5 Determination of Equivalence Classes / 237 \\ 9: Root Finding and Nonlinear Sets of Equations / 240 \\ 9.0 Introduction / 240 \\ 9.1 Bracketing and Bisection / 243 \\ 9.2 Secant Method and False Position Method / 248 \\ 9.3 Van Wijngaarden--Dekker--Brent Method / 251 \\ 9.4 Newton--Raphson Method Using Derivative / 254 \\ 9.5 Roots of Polynomials / 259 \\ 9.6 Newton--Raphson Method for Nonlinear Systems of Equations / 269 \\ 10: Minimization or Maximization of Functions / 274 \\ 10.0 Introduction / 274 \\ 10.1 Golden Section Search in One Dimension / 277 \\ 10.2 Parabolic Interpolation and Brent's Method in One Dimension / 283 \\ 10.3 One-Dimensional Search with First Derivatives / 286 \\ 10.4 Downhill Simplex Method in Multidimensions / 289 \\ 10.5 Direction Set (Powell's) Methods in Multidimensions / 294 \\ 10.6 Conjugate Gradient Methods in Multidimensions / 301 \\ 10.7 Variable Metric Methods in Multidimensions / 307 \\ 10.8 Linear Programming and the Simplex Method / 312 \\ 10.9 Combinatorial Minimization: Method of Simulated Annealing / 326 \\ 11: Eigensystems / 335 \\ 11.0 Introduction / 335 \\ 11.1 Jacobi Transformations of a Symmetric Matrix / 342 \\ 11.2 Reduction of a Symmetric Matrix to Tridiagonal Form: Givens and Householder Reductions / 349 \\ 11.3 Eigenvalues and Eigenvectors of a Tridiagonal Matrix / 356 \\ 11.4 Hermitian Matrices / 364 \\ 11.5 Reduction of a General Matrix to Hessenberg Form / 365 \\ 11.6 The QR Algorithm for Real Hessenberg Matrices / 369 \\ 11.7 Improving Eigenvalues and/or Finding Eigenvectors by Inverse Iteration / 377 \\ 12: Fourier Transform Spectral Methods / 381 \\ 12.0 Introduction / 381 \\ 12.1 Fourier Transform of Discretely Sampled Data / 386 \\ 12.2 Fast Fourier Transform (FFT) / 390 \\ 12.3 FFT of Real Functions, Sine and Cosine Transforms / 397 \\ 12.4 Convolution and Deconvolution Using the FFT / 407 \\ 12.5 Correlation and Autocorrelation Using the FFT / 415 \\ 12.6 Optimal (Wiener) Filtering with the FFT / 417 \\ 12.7 Power Spectrum Estimation Using the FFT / 420 \\ 12.8 Power Spectrum Estimation by the Maximum Entropy (All Poles) Method / 430 \\ 12.9 Digital Filtering in the Time Domain / 436 \\ 12.10 Linear Prediction and Linear Predictive Coding / 444 \\ 12.11 FFT in Two or More Dimensions / 449 \\ 13: Statistical Description of Data / 454 \\ 13.0 Introduction / 454 \\ 13.1 Moments of a Distribution: Mean, Variance, Skewness, and so forth / 455 \\ 13.2 Efficient Search for the Median / 459 \\ 13.3 Estimation of the Mode for Continuous Data / 462 \\ 13.4 Do Two Distributions Have the Same Means or Variances? / 464 \\ 13.5 Are Two Distributions Different? / 469 \\ 13.6 Contingency Table Analysis of Two Distributions / 476 \\ 13.7 Linear Correlation / 484 \\ 13.8 Nonparametric or Rank Correlation / 488 \\ 13.9 Smoothing of Data / 495 \\ 14: Modeling of Data / 498 \\ 14.0 Introduction / 498 \\ 14.1 Least Squares as a Maximum Likelihood Estimator / 499 \\ 14.2 Fitting Data to a Straight Line / 504 \\ 14.3 General Linear Least Squares / 509 \\ 14.4 Nonlinear Models / 521 \\ 14.5 Confidence Limits on Estimated Model Parameters / 529 \\ 14.6 Robust Estimation / 539 \\ 15: Integration of Ordinary Differential Equations / 547 \\ 15.0 Introduction / 547 \\ 15.1 Runge--Kutta Method / 550 \\ 15.2 Adaptive Stepsize Control for Runge--Kutta / 554 \\ 15.3 Modified Midpoint Method / 560 \\ 15.4 Richardson Extrapolation and the Bulirsch--Stoer Method / 563 \\ 15.5 Predictor-Corrector Methods / 569 \\ 15.6 Stiff Sets of Equations / 572 \\ 16: Two Point Boundary Value Problems / 578 \\ 16.0 Introduction / 578 \\ 16.1 The Shooting Method / 582 \\ 16.2 Shooting to a Fitting Point / 586 \\ 16.3 Relaxation Methods / 588 \\ 16.4 A Worked Example: Spheroidal Harmonics / 600 \\ 16.5 Automated Allocation of Mesh Points / 608 \\ 16.6 Handling Internal Boundary Conditions or Singular Points / 611 \\ 17: Partial Differential Equations / 615 \\ 17.0 Introduction / 615 \\ 17.1 Flux-Conservative Initial Value Problems / 623 \\ 17.2 Diffusive Initial Value Problems / 635 \\ 17.3 Initial Value Problems in Multidimensions / 642 \\ 17.4 Fourier and Cyclic Reduction Methods for Boundary Value Problems / 646 \\ 17.5 Relaxation Methods for Boundary Value Problems / 652 \\ 17.6 Operator Splitting,Methods and ADI / 660 \\ References / 668 \\ Numerical Recipes in Other Languages / 673 \\ Table of Program Dependencies / 675 \\ Index / 681

entry:
@Book{Press:1986:NRA,
  author =       "William H. Press and Brian P. Flannery and Saul A.
                 Teukolsky and William T. Vetterling",
  title =        "Numerical Recipes: The Art of Scientific Computing
                 ({FORTRAN} Version)",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xx + 702",
  year =         "1986",
  ISBN =         "0-521-38330-7",
  ISBN-13 =      "978-0-521-38330-1",
  LCCN =         "QA297 .N866 1989",
  bibdate =      "Wed Dec 15 10:40:52 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/csmmepcb.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran2.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Preface \\
                 List of computer programs \\
                 1: Preliminaries \\
                 2: Solution of linear algebraic equations \\
                 3: Interpolation and extrapolation \\
                 4: Integration of functions \\
                 5: Evaluation of functions \\
                 6: Special functions \\
                 7: Random numbers \\
                 8: Sorting \\
                 9: Root finding and nonlinear sets of equations \\
                 10: Minimization or maximization of functions \\
                 11: Eigensystems \\
                 12: Fourier transform spectral methods \\
                 13: Statistical description of data \\
                 14: Modeling of data \\
                 15: Integration of ordinary differential equations \\
                 16: Two point boundary value problems \\
                 17: Partial differential equations \\
                 18: References \\
                 Numerical recipes in other languages \\
                 Table of program dependencies \\
                 Index",
  subject =      "biblioth{\`e}que programme; logiciel scientifique;
                 programmation Fortran; calcul num{\'e}rique; calcul
                 scientifique; Numerische Mathematik; Analyse
                 num{\'e}rique; Logiciels; Fortran (Langage de
                 programmation); Sciences; Math{\'e}matiques;
                 Programmation informatique; Traitement des donn{\'e}es;
                 Analyse math{\'e}matique; Mod{\`e}les
                 math{\'e}matiques; Calcul; FORTRAN (Computer program
                 language); Numerical analysis; Computer programs;
                 Science; Mathematics; Numerieke wiskunde;
                 Dataprocessing; Statistiek; FORTRAN; Computadores
                 (Software); Informatique; Logiciels; Fortran (langage
                 de programmation); Computer programs; FORTRAN (Computer
                 program language)",
  tableofcontents = "Preface / xi \\
                 List of Computer Programs / xv \\
                 1: Preliminaries / 1 \\
                 1.0 Introduction / 1 \\
                 1.1 Program Organization and Control Structures / 4 \\
                 1.2 Error, Accuracy, and Stability / 15 \\
                 2: Solution of Linear Algebraic Equations / 19 \\
                 2.0 Introduction / 19 \\
                 2.1 Gauss-Jordan Elimination / 24 \\
                 2.2 Gaussian Elimination with Backsubstitution / 29 \\
                 2.3 LU Decomposition / 31 \\
                 2.4 Inverse of a Matrix / 38 \\
                 2.5 Determinant of a Matrix / 39 \\
                 2.6 Tridiagonal Systems of Equations / 40 \\
                 2.7 Iterative Improvement of a Solution to Linear
                 Equations / 41 \\
                 2.8 Vandermonde Matrices and Toeplitz Matrices / 43 \\
                 2.9 Singular Value Decomposition / 52 \\
                 2.10 Sparse Linear Systems / 64 \\
                 2.11 Is Matrix Inversion an N3 Process? / 74 \\
                 3: Interpolation and Extrapolation / 77 \\
                 3.0 Introduction / 77 \\
                 3.1 Polynomial Interpolation and Extrapolation / 80 \\
                 3.2 Rational Function Interpolation and Extrapolation /
                 83 \\
                 3.3 Cubic Spline Interpolation / 86 \\
                 3.4 How to Search an Ordered Table / 89 \\
                 3.5 Coefficients of the Interpolating Polynomial / 92
                 \\
                 3.6 Interpolation in Two or More Dimensions / 95 \\
                 4: Integration of Functions / 102 \\
                 4.0 Introduction / 102 \\
                 4.1 Classical Formulas for Equally-Spaced Abscissas /
                 103 \\
                 4.2 Elementary Algorithms / 110 \\
                 4.3 Romberg Integration / 114 \\
                 4.4 Improper Integrals / 115 \\
                 4.5 Gaussian Quadratures / 121 \\
                 4.6 Multidimensional Integrals / 126 \\
                 5: Evaluation of Functions / 131 \\
                 5.0 Introduction / 131 \\
                 5.1 Series and Their Convergence / 132 \\
                 5.2 Evaluation of Continued Fractions / 135 \\
                 5.3 Polynomials and Rational Functions / 137 \\
                 5.4 Recurrence Relations and Clenshaw's Recurrence
                 Formula / 141 \\
                 5.5 Quadratic and Cubic Equations / 145 \\
                 5.6 Chebyshev Approximation / 147 \\
                 5.7 Derivatives or Integrals of a
                 Chebyshev-approximated Function / 151 \\
                 5.8 Polynomial Approximation from Chebyshev
                 Coefficients / 153 \\
                 6: Special Functions / 155 \\
                 6.0 Introduction / 155 \\
                 6.1 Gamma Function, Beta Function, Factorials, and
                 Binomial Coefficients / 156 \\
                 6.2 Incomplete Gamma Function, Error Function,
                 Chi-Square Probability Function, Cumulative Poisson
                 Function / 160 \\
                 6.3 Incomplete Beta Function, Student's Distribution,
                 F-Distribution, Cumulative Binomial Distribution / 166
                 \\
                 6.4 Bessel Functions of Integer Order / 170 \\
                 6.5 Modified Bessel Functions of Integer Order / 176
                 \\
                 6.6 Spherical Harmonics / 180 \\
                 6.7 Elliptic Integrals and Jacobian Elliptic Functions
                 / 183 \\
                 7: Random Numbers / 191 \\
                 7.0 Introduction / 191 \\
                 7.1 Uniform Deviates / 192 \\
                 7.2 Transformation Method: Exponential and Normal
                 Deviates / 200 \\
                 7.3 Rejection Method: Gamma, Poisson, Binomial Deviates
                 / 203 \\
                 7.4 Generation of Random Bits / 209 \\
                 7.5 The Data Encryption Standard / 214 \\
                 7.6 Monte Carlo Integration / 221 \\
                 8: Sorting / 226 \\
                 8.0 Introduction / 226 \\
                 8.1 Straight Insertion and Shell's Method / 227 \\
                 8.2 Heapsort / 229 \\
                 8.3 Indexing and Ranking / 232 \\
                 8.4 Quicksort / 235 \\
                 8.5 Determination of Equivalence Classes / 237 \\
                 9: Root Finding and Nonlinear Sets of Equations / 240
                 \\
                 9.0 Introduction / 240 \\
                 9.1 Bracketing and Bisection / 243 \\
                 9.2 Secant Method and False Position Method / 248 \\
                 9.3 Van Wijngaarden--Dekker--Brent Method / 251 \\
                 9.4 Newton--Raphson Method Using Derivative / 254 \\
                 9.5 Roots of Polynomials / 259 \\
                 9.6 Newton--Raphson Method for Nonlinear Systems of
                 Equations / 269 \\
                 10: Minimization or Maximization of Functions / 274 \\
                 10.0 Introduction / 274 \\
                 10.1 Golden Section Search in One Dimension / 277 \\
                 10.2 Parabolic Interpolation and Brent's Method in One
                 Dimension / 283 \\
                 10.3 One-Dimensional Search with First Derivatives /
                 286 \\
                 10.4 Downhill Simplex Method in Multidimensions / 289
                 \\
                 10.5 Direction Set (Powell's) Methods in
                 Multidimensions / 294 \\
                 10.6 Conjugate Gradient Methods in Multidimensions /
                 301 \\
                 10.7 Variable Metric Methods in Multidimensions / 307
                 \\
                 10.8 Linear Programming and the Simplex Method / 312
                 \\
                 10.9 Combinatorial Minimization: Method of Simulated
                 Annealing / 326 \\
                 11: Eigensystems / 335 \\
                 11.0 Introduction / 335 \\
                 11.1 Jacobi Transformations of a Symmetric Matrix / 342
                 \\
                 11.2 Reduction of a Symmetric Matrix to Tridiagonal
                 Form: Givens and Householder Reductions / 349 \\
                 11.3 Eigenvalues and Eigenvectors of a Tridiagonal
                 Matrix / 356 \\
                 11.4 Hermitian Matrices / 364 \\
                 11.5 Reduction of a General Matrix to Hessenberg Form /
                 365 \\
                 11.6 The QR Algorithm for Real Hessenberg Matrices /
                 369 \\
                 11.7 Improving Eigenvalues and/or Finding Eigenvectors
                 by Inverse Iteration / 377 \\
                 12: Fourier Transform Spectral Methods / 381 \\
                 12.0 Introduction / 381 \\
                 12.1 Fourier Transform of Discretely Sampled Data / 386
                 \\
                 12.2 Fast Fourier Transform (FFT) / 390 \\
                 12.3 FFT of Real Functions, Sine and Cosine Transforms
                 / 397 \\
                 12.4 Convolution and Deconvolution Using the FFT / 407
                 \\
                 12.5 Correlation and Autocorrelation Using the FFT /
                 415 \\
                 12.6 Optimal (Wiener) Filtering with the FFT / 417 \\
                 12.7 Power Spectrum Estimation Using the FFT / 420 \\
                 12.8 Power Spectrum Estimation by the Maximum Entropy
                 (All Poles) Method / 430 \\
                 12.9 Digital Filtering in the Time Domain / 436 \\
                 12.10 Linear Prediction and Linear Predictive Coding /
                 444 \\
                 12.11 FFT in Two or More Dimensions / 449 \\
                 13: Statistical Description of Data / 454 \\
                 13.0 Introduction / 454 \\
                 13.1 Moments of a Distribution: Mean, Variance,
                 Skewness, and so forth / 455 \\
                 13.2 Efficient Search for the Median / 459 \\
                 13.3 Estimation of the Mode for Continuous Data / 462
                 \\
                 13.4 Do Two Distributions Have the Same Means or
                 Variances? / 464 \\
                 13.5 Are Two Distributions Different? / 469 \\
                 13.6 Contingency Table Analysis of Two Distributions /
                 476 \\
                 13.7 Linear Correlation / 484 \\
                 13.8 Nonparametric or Rank Correlation / 488 \\
                 13.9 Smoothing of Data / 495 \\
                 14: Modeling of Data / 498 \\
                 14.0 Introduction / 498 \\
                 14.1 Least Squares as a Maximum Likelihood Estimator /
                 499 \\
                 14.2 Fitting Data to a Straight Line / 504 \\
                 14.3 General Linear Least Squares / 509 \\
                 14.4 Nonlinear Models / 521 \\
                 14.5 Confidence Limits on Estimated Model Parameters /
                 529 \\
                 14.6 Robust Estimation / 539 \\
                 15: Integration of Ordinary Differential Equations /
                 547 \\
                 15.0 Introduction / 547 \\
                 15.1 Runge--Kutta Method / 550 \\
                 15.2 Adaptive Stepsize Control for Runge--Kutta / 554
                 \\
                 15.3 Modified Midpoint Method / 560 \\
                 15.4 Richardson Extrapolation and the Bulirsch--Stoer
                 Method / 563 \\
                 15.5 Predictor-Corrector Methods / 569 \\
                 15.6 Stiff Sets of Equations / 572 \\
                 16: Two Point Boundary Value Problems / 578 \\
                 16.0 Introduction / 578 \\
                 16.1 The Shooting Method / 582 \\
                 16.2 Shooting to a Fitting Point / 586 \\
                 16.3 Relaxation Methods / 588 \\
                 16.4 A Worked Example: Spheroidal Harmonics / 600 \\
                 16.5 Automated Allocation of Mesh Points / 608 \\
                 16.6 Handling Internal Boundary Conditions or Singular
                 Points / 611 \\
                 17: Partial Differential Equations / 615 \\
                 17.0 Introduction / 615 \\
                 17.1 Flux-Conservative Initial Value Problems / 623 \\
                 17.2 Diffusive Initial Value Problems / 635 \\
                 17.3 Initial Value Problems in Multidimensions / 642
                 \\
                 17.4 Fourier and Cyclic Reduction Methods for Boundary
                 Value Problems / 646 \\
                 17.5 Relaxation Methods for Boundary Value Problems /
                 652 \\
                 17.6 Operator Splitting,Methods and ADI / 660 \\
                 References / 668 \\
                 Numerical Recipes in Other Languages / 673 \\
                 Table of Program Dependencies / 675 \\
                 Index / 681",
}


bibtype: book
filename: master.bib
label: Press:2007:NRA
author: William H. Press and Saul A. Teukolsky and William T. Vetterling and Brian P. Flannery
title: Numerical Recipes --- The Art of Scientific Computing
publisher: pub-CAMBRIDGE
address: pub-CAMBRIDGE:adr
edition: Third
pages: xxi + 1235
year: 2007
LCCN: QA297 .N866 2007
bibdate: Wed Dec 15 10:40:52 1993
bibtimestamp: 1993.12.15 10:40:52 ???
URL: http://www.cambridge.org/numericalrecipes
subject: numerical analysis; computer programs; science; mathematics; C++ (computer program language)
acknowledgement: ack-nhfb
rawauthor: William H. Press and Saul A. Teukolsky and William T. Vetterling and Brian P. Flannery
rawtitle: Numerical Recipes --- The Art of Scientific Computing
ISBN:
0-521-88068-8 (hardcover), 0-521-88407-1 (with source code CD ROM), 0-521-70685-8 (source code CD ROM) OR 0521880688 (hardcover), 0521884071 (with source code CD ROM), 0521706858 (source code CD ROM)

ISBN13:
978-0-521-88068-8 (hardcover), 978-0-521-88407-5 (with source code CD ROM), 978-0-521-70685-8 (source code CD ROM) OR 9780521880688 (hardcover), 9780521884075 (with source code CD ROM), 9780521706858 (source code CD ROM)

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

TOC:
1. Preliminaries 2. Solution of linear algebraic equations 3. Interpolation and extrapolation 4. Integration of functions 5. Evaluation of functions 6. Special functions 7. Random numbers 8. Sorting and selection 9. Root finding and nonlinear sets of equations 10. Minimization or maximization of functions 11. Eigensystems 12. Fast Fourier Transform 13. Fourier and spectral applications 14. Statistical description of data 15. Modeling of data 16. Classification and inference 17. Integration of ordinary differential equations 18. Two-point boundary value problems 19. Integral equations and inverse theory 20. Partial differential equations 21. Computational geometry 22. Less-numerical algorithms

rawTOC:
1. Preliminaries \\ 2. Solution of linear algebraic equations \\ 3. Interpolation and extrapolation \\ 4. Integration of functions \\ 5. Evaluation of functions \\ 6. Special functions \\ 7. Random numbers \\ 8. Sorting and selection \\ 9. Root finding and nonlinear sets of equations \\ 10. Minimization or maximization of functions \\ 11. Eigensystems \\ 12. Fast Fourier Transform \\ 13. Fourier and spectral applications \\ 14. Statistical description of data \\ 15. Modeling of data \\ 16. Classification and inference \\ 17. Integration of ordinary differential equations \\ 18. Two-point boundary value problems \\ 19. Integral equations and inverse theory \\ 20. Partial differential equations \\ 21. Computational geometry \\ 22. Less-numerical algorithms

entry:
@Book{Press:2007:NRA,
  author =       "William H. Press and Saul A. Teukolsky and William T.
                 Vetterling and Brian P. Flannery",
  title =        "Numerical Recipes --- The Art of Scientific
                 Computing",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  edition =      "Third",
  pages =        "xxi + 1235",
  year =         "2007",
  ISBN =         "0-521-88068-8 (hardcover), 0-521-88407-1 (with source
                 code CD ROM), 0-521-70685-8 (source code CD ROM)",
  ISBN-13 =      "978-0-521-88068-8 (hardcover), 978-0-521-88407-5 (with
                 source code CD ROM), 978-0-521-70685-8 (source code CD
                 ROM)",
  LCCN =         "QA297 .N866 2007",
  bibdate =      "Wed Dec 15 10:40:52 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana2000.bib",
  URL =          "http://www.cambridge.org/numericalrecipes",
  acknowledgement = ack-nhfb,
  subject =      "numerical analysis; computer programs; science;
                 mathematics; C++ (computer program language)",
  tableofcontents = "1. Preliminaries \\
                 2. Solution of linear algebraic equations \\
                 3. Interpolation and extrapolation \\
                 4. Integration of functions \\
                 5. Evaluation of functions \\
                 6. Special functions \\
                 7. Random numbers \\
                 8. Sorting and selection \\
                 9. Root finding and nonlinear sets of equations \\
                 10. Minimization or maximization of functions \\
                 11. Eigensystems \\
                 12. Fast Fourier Transform \\
                 13. Fourier and spectral applications \\
                 14. Statistical description of data \\
                 15. Modeling of data \\
                 16. Classification and inference \\
                 17. Integration of ordinary differential equations \\
                 18. Two-point boundary value problems \\
                 19. Integral equations and inverse theory \\
                 20. Partial differential equations \\
                 21. Computational geometry \\
                 22. Less-numerical algorithms",
}


bibtype: article
filename: master.bib
label: Price:1989:BT
author: Walter J. Price
title: A Benchmark Tutorial
journal: j-IEEE-MICRO
volume: 9
number: 5
pages: 28--43
month: sep
monthnumber: 9
year: 1989
CODEN: IEMIDZ
DOI: https://doi.org/10.1109/40.45825
ISSN: 0272-1732 (print), 1937-4143 (electronic) OR 02721732 (print), 19374143 (electronic)
ISSNL: 0272-1732 OR 02721732
bibdate: Thu Dec 14 06:08:58 MST 2000
bibtimestamp: 2000.12.14 06:08:58 MST
fjournal: IEEE Micro
acknowledgement: ack-nhfb
affiliation: Motorola Inc, Tempe, AZ, USA
corpsource: Motorola Inc., Tempe, AZ, USA
treatment: P Practical
rawauthor: Walter J. Price
rawtitle: A Benchmark Tutorial
bibsource:
Compendex database; https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; Science Citation Index database (1980--2000)

keywords:
1.1; benchmark tests; Benchmarking; benchmarking; benchmarks; Computer Operating Systems; computer systems; Computer Systems, Digital; computer testing; Dhrystone; Digital Review; Dodec; Fortran Kernel; Khornerstone; Linpack; Livermore; Measurement Standards; Measurements--Standards; Performance; performance evaluation; single-precision Whetstone; SPICE; Stanford

classcodes:
C5470 (Performance evaluation and testing); C6150G (Diagnostic, testing, debugging and evaluating systems)

entry:
@Article{Price:1989:BT,
  author =       "Walter J. Price",
  title =        "A Benchmark Tutorial",
  journal =      j-IEEE-MICRO,
  volume =       "9",
  number =       "5",
  pages =        "28--43",
  month =        sep # "\slash " # oct,
  year =         "1989",
  CODEN =        "IEMIDZ",
  DOI =          "https://doi.org/10.1109/40.45825",
  ISSN =         "0272-1732 (print), 1937-4143 (electronic)",
  ISSN-L =       "0272-1732",
  bibdate =      "Thu Dec 14 06:08:58 MST 2000",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 Science Citation Index database (1980--2000)",
  acknowledgement = ack-nhfb,
  affiliation =  "Motorola Inc, Tempe, AZ, USA",
  classcodes =   "C5470 (Performance evaluation and testing); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems)",
  classification = "722; 723; 902",
  corpsource =   "Motorola Inc., Tempe, AZ, USA",
  fjournal =     "IEEE Micro",
  keywords =     "1.1; benchmark tests; Benchmarking; benchmarking;
                 benchmarks; Computer Operating Systems; computer
                 systems; Computer Systems, Digital; computer testing;
                 Dhrystone; Digital Review; Dodec; Fortran Kernel;
                 Khornerstone; Linpack; Livermore; Measurement
                 Standards; Measurements--Standards; Performance;
                 performance evaluation; single-precision Whetstone;
                 SPICE; Stanford",
  treatment =    "P Practical",
}


bibtype: book
filename: master.bib
label: Price:2021:GWB
author: David A. (David Andrew) Price
title: Geniuses at War: Bletchley Park, Colossus, and the Dawn of the Digital Age
publisher: Alfred A. Knopf
address: New York, NY, USA
pages: 243
year: 2021
ISBN: 0-525-52154-2 (hardcover), 0-525-52155-0 (e-book) OR 0525521542 (hardcover), 0525521550 (ebook)
LCCN: D810.C88 P75 2021
bibdate: Tue Dec 21 10:55:02 MST 2021
bibtimestamp: 2021.12.21 10:55:02 MST
acknowledgement: ack-nhfb
authordates: 1961--
rawauthor: David A. (David Andrew) Price
rawtitle: Geniuses at War: {Bletchley Park}, {Colossus}, and the Dawn of the Digital Age
ISBN13:
978-0-525-52154-9 (hardcover), 978-0-525-52155-6 (e-book) OR 9780525521549 (hardcover), 9780525521556 (ebook)

bibsource:
fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
``Geniuses at War is the dramatic, untold story of the brilliant team who built the world's first digital electronic computer at Bletchley Park, during a critical time in World War II. Decoding the communication of the Nazi high command was imperative for the success of the Allied invasion of Normandy. The Nazi missives were encrypted by the ''Tunny`` cipher, a code that was orders of magnitude more difficult to crack than the infamous Enigma code. But Tommy Flowers, a maverick English working-class engineer, devised the ingenious, daring, and controversial plan to build a machine that could think at breathtaking speed and break the code in nearly real time. Together with the pioneering mathematician Max Newman and Enigma code-breaker Alan Turing, Flowers and his team produced--against the odds, the clock, and a resistant leadership--Colossus, the world's first digital electronic computer, the machine that would help bring the war to an end. With fascinating detail and illuminating insight, David A. Price's Geniuses at War tells, for the first time, the mesmerizing story of the great minds behind Colossus, and chronicles their remarkable feats of engineering genius which ushered in the dawn of the digital age''

subject:
Cryptography; Great Britain; History; 20th century; Lorenz cipher system; World War, 1939-1945; Electronic intelligence; Cryptography.; Electronic intelligence.; Lorenz cipher system.; Bletchley Park (Milton Keynes, England); England; Milton Keynes; Bletchley Park

TOC:
Prologue / 3 1: The right type of recruit / 11 2: The palace coup / 43 3: Breaking Tunny / 69 4: The soul of a new machine / 102 5: Decrypting for D-Day / 129 6: After the war / 160 Epilogue: Turing's child machine, 1968 / 184 Acknowledgments / 189 Notes / 191 Bibliography / 217 Index / 233

rawabstract:
``Geniuses at War is the dramatic, untold story of the brilliant team who built the world's first digital electronic computer at Bletchley Park, during a critical time in World War II. Decoding the communication of the Nazi high command was imperative for the success of the Allied invasion of Normandy. The Nazi missives were encrypted by the ''Tunny`` cipher, a code that was orders of magnitude more difficult to crack than the infamous Enigma code. But Tommy Flowers, a maverick English working-class engineer, devised the ingenious, daring, and controversial plan to build a machine that could think at breathtaking speed and break the code in nearly real time. Together with the pioneering mathematician Max Newman and Enigma code-breaker Alan Turing, Flowers and his team produced--against the odds, the clock, and a resistant leadership--Colossus, the world's first digital electronic computer, the machine that would help bring the war to an end. With fascinating detail and illuminating insight, David A. Price's Geniuses at War tells, for the first time, the mesmerizing story of the great minds behind Colossus, and chronicles their remarkable feats of engineering genius which ushered in the dawn of the digital age''

rawTOC:
Prologue / 3 \\ 1: The right type of recruit / 11 \\ 2: The palace coup / 43 \\ 3: Breaking Tunny / 69 \\ 4: The soul of a new machine / 102 \\ 5: Decrypting for D-Day / 129 \\ 6: After the war / 160 \\ Epilogue: Turing's child machine, 1968 / 184 \\ Acknowledgments / 189 \\ Notes / 191 \\ Bibliography / 217 \\ Index / 233

entry:
@Book{Price:2021:GWB,
  author =       "David A. (David Andrew) Price",
  title =        "Geniuses at War: {Bletchley Park}, {Colossus}, and the
                 Dawn of the Digital Age",
  publisher =    "Alfred A. Knopf",
  address =      "New York, NY, USA",
  pages =        "243",
  year =         "2021",
  ISBN =         "0-525-52154-2 (hardcover), 0-525-52155-0 (e-book)",
  ISBN-13 =      "978-0-525-52154-9 (hardcover), 978-0-525-52155-6
                 (e-book)",
  LCCN =         "D810.C88 P75 2021",
  bibdate =      "Tue Dec 21 10:55:02 MST 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "``Geniuses at War is the dramatic, untold story of the
                 brilliant team who built the world's first digital
                 electronic computer at Bletchley Park, during a
                 critical time in World War II. Decoding the
                 communication of the Nazi high command was imperative
                 for the success of the Allied invasion of Normandy. The
                 Nazi missives were encrypted by the ''Tunny`` cipher, a
                 code that was orders of magnitude more difficult to
                 crack than the infamous Enigma code. But Tommy Flowers,
                 a maverick English working-class engineer, devised the
                 ingenious, daring, and controversial plan to build a
                 machine that could think at breathtaking speed and
                 break the code in nearly real time. Together with the
                 pioneering mathematician Max Newman and Enigma
                 code-breaker Alan Turing, Flowers and his team
                 produced--against the odds, the clock, and a resistant
                 leadership--Colossus, the world's first digital
                 electronic computer, the machine that would help bring
                 the war to an end. With fascinating detail and
                 illuminating insight, David A. Price's Geniuses at War
                 tells, for the first time, the mesmerizing story of the
                 great minds behind Colossus, and chronicles their
                 remarkable feats of engineering genius which ushered in
                 the dawn of the digital age''",
  acknowledgement = ack-nhfb,
  author-dates = "1961--",
  subject =      "Cryptography; Great Britain; History; 20th century;
                 Lorenz cipher system; World War, 1939-1945; Electronic
                 intelligence; Cryptography.; Electronic intelligence.;
                 Lorenz cipher system.; Bletchley Park (Milton Keynes,
                 England); England; Milton Keynes; Bletchley Park",
  tableofcontents = "Prologue / 3 \\
                 1: The right type of recruit / 11 \\
                 2: The palace coup / 43 \\
                 3: Breaking Tunny / 69 \\
                 4: The soul of a new machine / 102 \\
                 5: Decrypting for D-Day / 129 \\
                 6: After the war / 160 \\
                 Epilogue: Turing's child machine, 1968 / 184 \\
                 Acknowledgments / 189 \\
                 Notes / 191 \\
                 Bibliography / 217 \\
                 Index / 233",
}


bibtype: book
filename: master.bib
label: Primack:2006:VCU
author: J. R. (Joel R.) Primack and Nancy Ellen Abrams
title: The view from the center of the universe: discovering our extraordinary place in the cosmos
publisher: Riverhead Books
address: New York, NY, USA
pages: 386
year: 2006
ISBN: 1-59448-914-9 OR 1594489149
ISBN13: 978-1-59448-914-3 OR 9781594489143
LCCN: QB981 .P85 2006
bibdate: Thu Apr 13 04:57:47 MDT 2006
bibtimestamp: 2006.04.13 04:57:47 MDT
subject: cosmology; history; physics; philosophy
acknowledgement: ack-nhfb
rawauthor: J. R. (Joel R.) Primack and Nancy Ellen Abrams
rawtitle: The view from the center of the universe: discovering our extraordinary place in the cosmos
TOC:
Part 1. Cosmological revolutions 1: Wrapping your mind around the universe / 15 2: From the flat Earth to the heavenly spheres / 39 3: From the center of the universe to no place special / 67 Part 2. The new scientific picture of the universe 4: What is the universe made of?: the cosmic density pyramid / 89 5: What is the center of the universe?: the cosmic spheres of time / 122 6: What size is the universe?: the cosmic uroboros / 156 7: Where do we come from?: the cosmic Las Vegas / 179 8: Are we alone?: the possibility of alien wisdom / 206 Part 3. The meaningful universe Think cosmically, act globally / 239 Taking our extraordinary place in the cosmos / 269 Acknowledgments / 301 Notes / 303 Index / 377

rawTOC:
Part 1. Cosmological revolutions \\ 1: Wrapping your mind around the universe / 15 \\ 2: From the flat Earth to the heavenly spheres / 39 \\ 3: From the center of the universe to no place special / 67 \\ Part 2. The new scientific picture of the universe \\ 4: What is the universe made of?: the cosmic density pyramid / 89 \\ 5: What is the center of the universe?: the cosmic spheres of time / 122 \\ 6: What size is the universe?: the cosmic uroboros / 156 \\ 7: Where do we come from?: the cosmic Las Vegas / 179 \\ 8: Are we alone?: the possibility of alien wisdom / 206 \\ Part 3. The meaningful universe \\ Think cosmically, act globally / 239 \\ Taking our extraordinary place in the cosmos / 269 \\ Acknowledgments / 301 \\ Notes / 303 \\ Index / 377

entry:
@Book{Primack:2006:VCU,
  author =       "J. R. (Joel R.) Primack and Nancy Ellen Abrams",
  title =        "The view from the center of the universe: discovering
                 our extraordinary place in the cosmos",
  publisher =    "Riverhead Books",
  address =      "New York, NY, USA",
  pages =        "386",
  year =         "2006",
  ISBN =         "1-59448-914-9",
  ISBN-13 =      "978-1-59448-914-3",
  LCCN =         "QB981 .P85 2006",
  bibdate =      "Thu Apr 13 04:57:47 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "cosmology; history; physics; philosophy",
  tableofcontents = "Part 1. Cosmological revolutions \\
                 1: Wrapping your mind around the universe / 15 \\
                 2: From the flat Earth to the heavenly spheres / 39 \\
                 3: From the center of the universe to no place special
                 / 67 \\
                 Part 2. The new scientific picture of the universe \\
                 4: What is the universe made of?: the cosmic density
                 pyramid / 89 \\
                 5: What is the center of the universe?: the cosmic
                 spheres of time / 122 \\
                 6: What size is the universe?: the cosmic uroboros /
                 156 \\
                 7: Where do we come from?: the cosmic Las Vegas / 179
                 \\
                 8: Are we alone?: the possibility of alien wisdom / 206
                 \\
                 Part 3. The meaningful universe \\
                 Think cosmically, act globally / 239 \\
                 Taking our extraordinary place in the cosmos / 269 \\
                 Acknowledgments / 301 \\
                 Notes / 303 \\
                 Index / 377",
}


bibtype: book
filename: master.bib
label: Prior:1955:FL
author: A. N. Prior
title: Formal Logic
publisher: pub-CLARENDON
address: pub-CLARENDON:adr
pages: ix + 329
year: 1955
LCCN: BC108.P8
bibdate: Wed Jul 6 14:58:01 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.07.06 14:58:01 ???
acknowledgement: ack-nhfb
rawauthor: A. N. Prior
rawtitle: Formal Logic
entry:
@Book{Prior:1955:FL,
  author =       "A. N. Prior",
  title =        "Formal Logic",
  publisher =    pub-CLARENDON,
  address =      pub-CLARENDON:adr,
  pages =        "ix + 329",
  year =         "1955",
  LCCN =         "BC108.P8",
  bibdate =      "Wed Jul 6 14:58:01 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Prueitt:1984:AC
author: Melvin L. Prueitt
title: Art and the Computer
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
pages: ix + 246
year: 1984
LCCN: N7433.8.P7 1984
bibdate: Wed Dec 15 10:40:53 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:40:53 ???
acknowledgement: ack-nhfb
rawauthor: Melvin L. Prueitt
rawtitle: Art and the Computer
ISBN:
0-07-050894-1 (hardcover), 0-07-050899-2 (paperback) OR 0070508941 (hardcover), 0070508992 (paperback)

ISBN13:
978-0-07-050894-1 (hardcover), 978-0-07-050899-6 (paperback) OR 9780070508941 (hardcover), 9780070508996 (paperback)

entry:
@Book{Prueitt:1984:AC,
  author =       "Melvin L. Prueitt",
  title =        "Art and the Computer",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "ix + 246",
  year =         "1984",
  ISBN =         "0-07-050894-1 (hardcover), 0-07-050899-2 (paperback)",
  ISBN-13 =      "978-0-07-050894-1 (hardcover), 978-0-07-050899-6
                 (paperback)",
  LCCN =         "N7433.8.P7 1984",
  bibdate =      "Wed Dec 15 10:40:53 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$39.95 (hardcover), US\$29.95 (paperback)",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Pryor:1966:IFR
author: William A. Pryor
title: Introduction to Free Radical Chemistry
publisher: pub-PH
address: pub-PH:adr
pages: xvii + 110
year: 1966
LCCN: QD255 .P77
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: William A. Pryor
rawtitle: Introduction to Free Radical Chemistry
entry:
@Book{Pryor:1966:IFR,
  author =       "William A. Pryor",
  title =        "Introduction to Free Radical Chemistry",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xvii + 110",
  year =         "1966",
  LCCN =         "QD255 .P77",
  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: Pyle:1981:APL
author: I. C. Pyle
title: The Ada Programming Language
publisher: pub-PHI
address: pub-PHI:adr
pages: x + 293
year: 1981
ISBN: 0-13-003921-7 OR 0130039217
ISBN13: 978-0-13-003921-7 OR 9780130039217
LCCN: QA76.73.A35 P94
bibdate: Wed Dec 15 10:40:53 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:40:53 ???
acknowledgement: ack-nhfb
rawauthor: I. C. Pyle
rawtitle: The {Ada} Programming Language
entry:
@Book{Pyle:1981:APL,
  author =       "I. C. Pyle",
  title =        "The {Ada} Programming Language",
  publisher =    pub-PHI,
  address =      pub-PHI:adr,
  pages =        "x + 293",
  year =         "1981",
  ISBN =         "0-13-003921-7",
  ISBN-13 =      "978-0-13-003921-7",
  LCCN =         "QA76.73.A35 P94",
  bibdate =      "Wed Dec 15 10:40:53 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$14.95",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Pyne:2010:VSN
author: Stephen J. Pyne
title: Voyager: Seeking Newer Worlds in the Third Great Age of Discovery
publisher: pub-VIKING
address: pub-VIKING:adr
pages: xix + 444 + 8
year: 2010
ISBN: 0-670-02183-0 OR 0670021830
ISBN13: 978-0-670-02183-3 OR 9780670021833
LCCN: TL789.8.U6 V5275 2010
bibdate: Fri Nov 12 14:55:11 MST 2010
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2010.11.12 14:55:11 MST
subject: astronautics; United States; history; aeronautics; planets; exploration
acknowledgement: ack-nhfb
rawauthor: Stephen J. Pyne
rawtitle: {Voyager}: Seeking Newer Worlds in the Third Great Age of Discovery
TOC:
Illustrations Mission statement: Voyager of discovery Part 1. The beginning of beyond: journey of an idea 1: Escape velocity 2: Grand tour 3: Great ages of discovery 4: Voyager 5: Launch Part 2. Beyond the sunset: journey across the solar system Beyond Earth 6: New moon 7: Cruise 8: Missing Mars Beyond the inner planets 9: Cruise 10: Encounter: asteroid belt 11: Cruise 12: Encounter: Jupiter 13: Cruise 14: Encounter: Saturn 15: Cruise 16: Encounter: Uranus 17: Cruise 18: Encounter: Neptune 19: Cruise 20: Last light Part 3. Beyond the utmost bond: journey to the stars Beyond bow shock 21: Voyager Interstellar Mission 22: Far travelers 23: New worlds, new laws Beyond narrative 24: Voyager's voice 25: Voyager's record 26: Voyager's returns Beyond tomorrow Afterword Appendix: Chronology of major lunar and planetary missions Status of Voyagers (August 2009) The grand tour and its encounters The coldest war Notes Sources Index

rawTOC:
Illustrations \\ Mission statement: Voyager of discovery \\ Part 1. The beginning of beyond: journey of an idea \\ 1: Escape velocity \\ 2: Grand tour \\ 3: Great ages of discovery \\ 4: Voyager \\ 5: Launch \\ Part 2. Beyond the sunset: journey across the solar system \\ Beyond Earth \\ 6: New moon \\ 7: Cruise \\ 8: Missing Mars \\ Beyond the inner planets \\ 9: Cruise \\ 10: Encounter: asteroid belt \\ 11: Cruise \\ 12: Encounter: Jupiter \\ 13: Cruise \\ 14: Encounter: Saturn \\ 15: Cruise \\ 16: Encounter: Uranus \\ 17: Cruise \\ 18: Encounter: Neptune \\ 19: Cruise \\ 20: Last light \\ Part 3. Beyond the utmost bond: journey to the stars \\ Beyond bow shock \\ 21: Voyager Interstellar Mission \\ 22: Far travelers \\ 23: New worlds, new laws \\ Beyond narrative \\ 24: Voyager's voice \\ 25: Voyager's record \\ 26: Voyager's returns \\ Beyond tomorrow \\ Afterword \\ Appendix: Chronology of major lunar and planetary missions \\ Status of Voyagers (August 2009) \\ The grand tour and its encounters \\ The coldest war \\ Notes \\ Sources \\ Index

entry:
@Book{Pyne:2010:VSN,
  author =       "Stephen J. Pyne",
  title =        "{Voyager}: Seeking Newer Worlds in the Third Great Age
                 of Discovery",
  publisher =    pub-VIKING,
  address =      pub-VIKING:adr,
  pages =        "xix + 444 + 8",
  year =         "2010",
  ISBN =         "0-670-02183-0",
  ISBN-13 =      "978-0-670-02183-3",
  LCCN =         "TL789.8.U6 V5275 2010",
  bibdate =      "Fri Nov 12 14:55:11 MST 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "astronautics; United States; history; aeronautics;
                 planets; exploration",
  tableofcontents = "Illustrations \\
                 Mission statement: Voyager of discovery \\
                 Part 1. The beginning of beyond: journey of an idea \\
                 1: Escape velocity \\
                 2: Grand tour \\
                 3: Great ages of discovery \\
                 4: Voyager \\
                 5: Launch \\
                 Part 2. Beyond the sunset: journey across the solar
                 system \\
                 Beyond Earth \\
                 6: New moon \\
                 7: Cruise \\
                 8: Missing Mars \\
                 Beyond the inner planets \\
                 9: Cruise \\
                 10: Encounter: asteroid belt \\
                 11: Cruise \\
                 12: Encounter: Jupiter \\
                 13: Cruise \\
                 14: Encounter: Saturn \\
                 15: Cruise \\
                 16: Encounter: Uranus \\
                 17: Cruise \\
                 18: Encounter: Neptune \\
                 19: Cruise \\
                 20: Last light \\
                 Part 3. Beyond the utmost bond: journey to the stars
                 \\
                 Beyond bow shock \\
                 21: Voyager Interstellar Mission \\
                 22: Far travelers \\
                 23: New worlds, new laws \\
                 Beyond narrative \\
                 24: Voyager's voice \\
                 25: Voyager's record \\
                 26: Voyager's returns \\
                 Beyond tomorrow \\
                 Afterword \\
                 Appendix: Chronology of major lunar and planetary
                 missions \\
                 Status of Voyagers (August 2009) \\
                 The grand tour and its encounters \\
                 The coldest war \\
                 Notes \\
                 Sources \\
                 Index",
}


bibtype: book
filename: master.bib
label: Pyster:1980:CDC
author: Arthur B. Pyster
title: Compiler Design and Construction
publisher: pub-VAN-NOSTRAND-REINHOLD
address: pub-VAN-NOSTRAND-REINHOLD:adr
pages: xvi + 357
year: 1980
ISBN: 0-442-24394-4 OR 0442243944
ISBN13: 978-0-442-24394-4 OR 9780442243944
LCCN: QA76.6 .P9
bibdate: Wed Dec 15 10:40:54 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:40:54 ???
acknowledgement: ack-nhfb
rawauthor: Arthur B. Pyster
rawtitle: Compiler Design and Construction
entry:
@Book{Pyster:1980:CDC,
  author =       "Arthur B. Pyster",
  title =        "Compiler Design and Construction",
  publisher =    pub-VAN-NOSTRAND-REINHOLD,
  address =      pub-VAN-NOSTRAND-REINHOLD:adr,
  pages =        "xvi + 357",
  year =         "1980",
  ISBN =         "0-442-24394-4",
  ISBN-13 =      "978-0-442-24394-4",
  LCCN =         "QA76.6 .P9",
  bibdate =      "Wed Dec 15 10:40:54 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Quammen:2018:TTR
author: David Quammen
title: The Tangled Tree: a Radical New History of Life
publisher: pub-SIMON-SCHUSTER
address: pub-SIMON-SCHUSTER:adr
pages: xvi + 461 + 8
year: 2018
ISBN: 1-4767-7662-8 OR 1476776628
LCCN: QH367.5 .Q36 2018
bibdate: Sat Jan 5 11:55:45 MST 2019
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2019.01.05 11:55:45 MST
subject: Phylogeny; Molecular aspects
acknowledgement: ack-nhfb
authordates: 1948--
rawauthor: David Quammen
rawtitle: The Tangled Tree: a Radical New History of Life
ISBN13:
978-1-4767-7662-0 (hardcover), 978-1-4767-7664-4 (e-book) OR 9781476776620 (hardcover), 9781476776644 (ebook)

abstract:
In the mid-1970s, scientists began using DNA sequences to reexamine the history of all life. Perhaps the most startling discovery to come out of this new field --- the study of life's diversity and relatedness at the molecular level --- is horizontal gene transfer (HGT), or the movement of genes across species lines. It turns out that HGT has been widespread and important. For instance, we now know that roughly eight percent of the human genome arrived not through traditional inheritance from directly ancestral forms, but sideways by viral infection --- a type of HGT. In booktitle The Tangled Tree, David Quammen, ``one of that rare breed of science journalists who blends exploration with a talent for synthesis and storytelling'' (Nature), chronicles these discoveries through the lives of the researchers who made them --- such as Carl Woese, the most important little-known biologist of the twentieth century; Lynn Margulis, the notorious maverick whose wild ideas about ``mosaic'' creatures proved to be true; and Tsutomu Wantanabe, who discovered that the scourge of antibiotic-resistant bacteria is a direct result of horizontal gene transfer, bringing the deep study of genome histories to bear on a global crisis in public health. ``Quammen is no ordinary writer. He is simply astonishing, one of that rare class of writer gifted with verve, ingenuity, humor, guts, and great heart'' (Elle). Now, in booktitle The Tangled Tree, he explains how molecular studies of evolution have brought startling recognitions about the tangled tree of life --- including where we humans fit upon it. Thanks to new technologies such as CRISPR, we now have the ability to alter even our genetic composition through sideways insertions, as nature has long been doing. booktitle The Tangled Tree is a brilliant guide to our transformed understanding of evolution, of life's history, and of our own human nature.

TOC:
Three surprises: an introduction Darwin's little sketch A separate form of life Mergers and acquisitions Big tree Infective heredity Topiary E pluribus human

rawabstract:
In the mid-1970s, scientists began using DNA sequences to reexamine the history of all life. Perhaps the most startling discovery to come out of this new field --- the study of life's diversity and relatedness at the molecular level --- is horizontal gene transfer (HGT), or the movement of genes across species lines. It turns out that HGT has been widespread and important. For instance, we now know that roughly eight percent of the human genome arrived not through traditional inheritance from directly ancestral forms, but sideways by viral infection --- a type of HGT. In \booktitle{The Tangled Tree}, David Quammen, ``one of that rare breed of science journalists who blends exploration with a talent for synthesis and storytelling'' (Nature), chronicles these discoveries through the lives of the researchers who made them --- such as Carl Woese, the most important little-known biologist of the twentieth century; Lynn Margulis, the notorious maverick whose wild ideas about ``mosaic'' creatures proved to be true; and Tsutomu Wantanabe, who discovered that the scourge of antibiotic-resistant bacteria is a direct result of horizontal gene transfer, bringing the deep study of genome histories to bear on a global crisis in public health. ``Quammen is no ordinary writer. He is simply astonishing, one of that rare class of writer gifted with verve, ingenuity, humor, guts, and great heart'' (Elle). Now, in \booktitle{The Tangled Tree}, he explains how molecular studies of evolution have brought startling recognitions about the tangled tree of life --- including where we humans fit upon it. Thanks to new technologies such as CRISPR, we now have the ability to alter even our genetic composition through sideways insertions, as nature has long been doing. \booktitle{The Tangled Tree} is a brilliant guide to our transformed understanding of evolution, of life's history, and of our own human nature.

rawTOC:
Three surprises: an introduction \\ Darwin's little sketch \\ A separate form of life \\ Mergers and acquisitions \\ Big tree \\ Infective heredity \\ Topiary \\ E pluribus human

entry:
@Book{Quammen:2018:TTR,
  author =       "David Quammen",
  title =        "The Tangled Tree: a Radical New History of Life",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "xvi + 461 + 8",
  year =         "2018",
  ISBN =         "1-4767-7662-8",
  ISBN-13 =      "978-1-4767-7662-0 (hardcover), 978-1-4767-7664-4
                 (e-book)",
  LCCN =         "QH367.5 .Q36 2018",
  bibdate =      "Sat Jan 5 11:55:45 MST 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "In the mid-1970s, scientists began using DNA sequences
                 to reexamine the history of all life. Perhaps the most
                 startling discovery to come out of this new field ---
                 the study of life's diversity and relatedness at the
                 molecular level --- is horizontal gene transfer (HGT),
                 or the movement of genes across species lines. It turns
                 out that HGT has been widespread and important. For
                 instance, we now know that roughly eight percent of the
                 human genome arrived not through traditional
                 inheritance from directly ancestral forms, but sideways
                 by viral infection --- a type of HGT. In \booktitle{The
                 Tangled Tree}, David Quammen, ``one of that rare breed
                 of science journalists who blends exploration with a
                 talent for synthesis and storytelling'' (Nature),
                 chronicles these discoveries through the lives of the
                 researchers who made them --- such as Carl Woese, the
                 most important little-known biologist of the twentieth
                 century; Lynn Margulis, the notorious maverick whose
                 wild ideas about ``mosaic'' creatures proved to be
                 true; and Tsutomu Wantanabe, who discovered that the
                 scourge of antibiotic-resistant bacteria is a direct
                 result of horizontal gene transfer, bringing the deep
                 study of genome histories to bear on a global crisis in
                 public health. ``Quammen is no ordinary writer. He is
                 simply astonishing, one of that rare class of writer
                 gifted with verve, ingenuity, humor, guts, and great
                 heart'' (Elle). Now, in \booktitle{The Tangled Tree},
                 he explains how molecular studies of evolution have
                 brought startling recognitions about the tangled tree
                 of life --- including where we humans fit upon it.
                 Thanks to new technologies such as CRISPR, we now have
                 the ability to alter even our genetic composition
                 through sideways insertions, as nature has long been
                 doing. \booktitle{The Tangled Tree} is a brilliant
                 guide to our transformed understanding of evolution, of
                 life's history, and of our own human nature.",
  acknowledgement = ack-nhfb,
  author-dates = "1948--",
  subject =      "Phylogeny; Molecular aspects",
  tableofcontents = "Three surprises: an introduction \\
                 Darwin's little sketch \\
                 A separate form of life \\
                 Mergers and acquisitions \\
                 Big tree \\
                 Infective heredity \\
                 Topiary \\
                 E pluribus human",
}


bibtype: book
filename: master.bib
label: Quarterman:1989:M
author: John S. Quarterman
title: The Matrix
publisher: pub-DP
address: pub-DP:adr
pages: xxvii + 719
year: 1989
ISBN: 1-55558-033-5 OR 1555580335
ISBN13: 978-1-55558-033-9 OR 9781555580339
LCCN: TK5105.5 .Q37 1990
bibdate: Wed Dec 15 10:40:55 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:40:55 ???
acknowledgement: ack-nhfb
rawauthor: John S. Quarterman
rawtitle: The Matrix
entry:
@Book{Quarterman:1989:M,
  author =       "John S. Quarterman",
  title =        "The Matrix",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  pages =        "xxvii + 719",
  year =         "1989",
  ISBN =         "1-55558-033-5",
  ISBN-13 =      "978-1-55558-033-9",
  LCCN =         "TK5105.5 .Q37 1990",
  bibdate =      "Wed Dec 15 10:40:55 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Quercia:1990:XWS
author: Valerie Quercia and Tim O'Reilly
title: X Window System User's Guide
volume: 3
publisher: pub-ORA
address: pub-ORA:adr
edition: Third
pages: xxvi + 723
year: 1990
ISBN: 0-937175-14-5 OR 0937175145
ISBN13: 978-0-937175-14-9 OR 9780937175149
LCCN: QA76.76.W56 Q83 1990
bibdate: Wed Dec 15 10:41:05 1993
bibtimestamp: 1993.12.15 10:41:05 ???
acknowledgement: ack-nhfb
rawauthor: Valerie Quercia and Tim O'Reilly
rawtitle: {X} Window System User's Guide
URL:
http://proquestcombo.safaribooksonline.com/9780937175149; http://www.oreilly.com/catalog/9780937175149

entry:
@Book{Quercia:1990:XWS,
  author =       "Valerie Quercia and Tim O'Reilly",
  title =        "{X} Window System User's Guide",
  volume =       "3",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  edition =      "Third",
  pages =        "xxvi + 723",
  year =         "1990",
  ISBN =         "0-937175-14-5",
  ISBN-13 =      "978-0-937175-14-9",
  LCCN =         "QA76.76.W56 Q83 1990",
  bibdate =      "Wed Dec 15 10:41:05 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "http://proquestcombo.safaribooksonline.com/9780937175149;
                 http://www.oreilly.com/catalog/9780937175149",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Quercia:1993:XWSa
author: Valerie Quercia and Tim O'Reilly
title: X Window System User's Guide: Standard Edition
volume: 3
publisher: pub-ORA
address: pub-ORA:adr
edition: Fourth
pages: xxx + 835
month: may
monthnumber: 5
year: 1993
ISBN: 1-56592-014-7 OR 1565920147
ISBN13: 978-1-56592-014-9 OR 9781565920149
LCCN: QA76.76.W56D43 1993
bibdate: Mon Jan 3 17:27:25 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/ora.bib
bibtimestamp: 1994.01.03 17:27:25 ???
URL: http://www.oreilly.com/catalog/9781565920149
acknowledgement: ack-nhfb
rawauthor: Valerie Quercia and Tim O'Reilly
rawtitle: {X Window System} User's Guide: Standard Edition
TOC:
Using X An introduction to the X Windows System Getting started Working in the X environment More about the twm window manager The xterm terminal emulator Font specification Graphics utilities Other clients Customizing X Command-line options Setting resources Specifying color Customizing twm Setup clients Client reference pages Client reference pages Appendixes Glossary Index

rawTOC:
Using X \\ An introduction to the X Windows System \\ Getting started \\ Working in the X environment \\ More about the twm window manager \\ The xterm terminal emulator \\ Font specification \\ Graphics utilities \\ Other clients \\ Customizing X \\ Command-line options \\ Setting resources \\ Specifying color \\ Customizing twm \\ Setup clients \\ Client reference pages \\ Client reference pages \\ Appendixes \\ Glossary \\ Index

entry:
@Book{Quercia:1993:XWSa,
  author =       "Valerie Quercia and Tim O'Reilly",
  title =        "{X Window System} User's Guide: Standard Edition",
  volume =       "3",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  edition =      "Fourth",
  pages =        "xxx + 835",
  month =        may,
  year =         "1993",
  ISBN =         "1-56592-014-7",
  ISBN-13 =      "978-1-56592-014-9",
  LCCN =         "QA76.76.W56D43 1993",
  bibdate =      "Mon Jan 3 17:27:25 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib",
  price =        "US\$34.95",
  URL =          "http://www.oreilly.com/catalog/9781565920149",
  acknowledgement = ack-nhfb,
  tableofcontents = "Using X \\
                 An introduction to the X Windows System \\
                 Getting started \\
                 Working in the X environment \\
                 More about the twm window manager \\
                 The xterm terminal emulator \\
                 Font specification \\
                 Graphics utilities \\
                 Other clients \\
                 Customizing X \\
                 Command-line options \\
                 Setting resources \\
                 Specifying color \\
                 Customizing twm \\
                 Setup clients \\
                 Client reference pages \\
                 Client reference pages \\
                 Appendixes \\
                 Glossary \\
                 Index",
}


bibtype: book
filename: master.bib
label: Quercia:1993:XWSb
author: Valerie Quercia and Tim O'Reilly
title: X Window System User's Guide: OSF / Motif 1.2 Edition
volume: 3M
publisher: pub-ORA
address: pub-ORA:adr
edition: Fourth
pages: xxx + 835
month: may
monthnumber: 5
year: 1993
ISBN: 1-56592-015-5 OR 1565920155
ISBN13: 978-1-56592-015-6 OR 9781565920156
LCCN: QA76.76 W56Q4 1993
bibdate: Mon Jan 3 17:27:25 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/ora.bib
bibtimestamp: 1994.01.03 17:27:25 ???
acknowledgement: ack-nhfb
rawauthor: Valerie Quercia and Tim O'Reilly
rawtitle: {X Window System} User's Guide: {OSF\slash Motif 1.2} Edition
TOC:
Preface Part One: Using X 1: An Introduction to the X Window System 2: Getting Started 3: Working in the X Environment 4: More About the mwm Window Manager 5: The xterm Terminal Emulator 6: Font Specification 7: Graphics Utilities 8: Other Clients Part Two: Customizing X 9: Working with Motif Applications 10: Command-line Options 11: Setting Resources 12: Specifying Color 13: Customizing mwm 14: Setup Clients Part Three: Client Reference Pages Part Four: Appendices Appendix A: Managing Your Environment Appendix B: Release 5 Standard Fonts Appendix C: Standard Bitmaps Appendix D: Standard Cursors Appendix E: xterm Control Sequences Appendix F: Translation Table Syntax Appendix G: Widget Resources Appendix H: Obtaining Example Programs Glossary Index

rawTOC:
Preface \\ Part One: Using X \\ 1: An Introduction to the X Window System \\ 2: Getting Started \\ 3: Working in the X Environment \\ 4: More About the mwm Window Manager \\ 5: The xterm Terminal Emulator \\ 6: Font Specification \\ 7: Graphics Utilities \\ 8: Other Clients \\ Part Two: Customizing X \\ 9: Working with Motif Applications \\ 10: Command-line Options \\ 11: Setting Resources \\ 12: Specifying Color \\ 13: Customizing mwm \\ 14: Setup Clients \\ Part Three: Client Reference Pages \\ Part Four: Appendices \\ Appendix A: Managing Your Environment \\ Appendix B: Release 5 Standard Fonts \\ Appendix C: Standard Bitmaps \\ Appendix D: Standard Cursors \\ Appendix E: xterm Control Sequences \\ Appendix F: Translation Table Syntax \\ Appendix G: Widget Resources \\ Appendix H: Obtaining Example Programs \\ Glossary \\ Index

entry:
@Book{Quercia:1993:XWSb,
  author =       "Valerie Quercia and Tim O'Reilly",
  title =        "{X Window System} User's Guide: {OSF\slash Motif 1.2}
                 Edition",
  volume =       "3M",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  edition =      "Fourth",
  pages =        "xxx + 835",
  month =        may,
  year =         "1993",
  ISBN =         "1-56592-015-5",
  ISBN-13 =      "978-1-56592-015-6",
  LCCN =         "QA76.76 W56Q4 1993",
  bibdate =      "Mon Jan 3 17:27:25 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface \\
                 Part One: Using X \\
                 1: An Introduction to the X Window System \\
                 2: Getting Started \\
                 3: Working in the X Environment \\
                 4: More About the mwm Window Manager \\
                 5: The xterm Terminal Emulator \\
                 6: Font Specification \\
                 7: Graphics Utilities \\
                 8: Other Clients \\
                 Part Two: Customizing X \\
                 9: Working with Motif Applications \\
                 10: Command-line Options \\
                 11: Setting Resources \\
                 12: Specifying Color \\
                 13: Customizing mwm \\
                 14: Setup Clients \\
                 Part Three: Client Reference Pages \\
                 Part Four: Appendices \\
                 Appendix A: Managing Your Environment \\
                 Appendix B: Release 5 Standard Fonts \\
                 Appendix C: Standard Bitmaps \\
                 Appendix D: Standard Cursors \\
                 Appendix E: xterm Control Sequences \\
                 Appendix F: Translation Table Syntax \\
                 Appendix G: Widget Resources \\
                 Appendix H: Obtaining Example Programs \\
                 Glossary \\
                 Index",
}


bibtype: book
filename: master.bib
label: Quigley:2002:USE
author: Ellie Quigley
title: UNIX Shells by Example
publisher: pub-PHPTR
address: pub-PHPTR:adr
edition: Third
pages: xix + 1015
year: 2002
ISBN: 0-13-066538-X (paperback) OR 013066538X (paperback)
ISBN13: 978-0-13-066538-6 (paperback) OR 9780130665386 (paperback)
LCCN: QA76.76.O63 Q54 2002
bibdate: Tue Sep 17 05:57:21 MDT 2002
bibtimestamp: 2002.09.17 05:57:21 MDT
keywords: UNIX (computer file); UNIX shells
acknowledgement: ack-nhfb
rawauthor: Ellie Quigley
rawtitle: {UNIX} Shells by Example
bibsource:
https://www.math.utah.edu/pub/tex/bib/linux.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

abstract:
Learn shell programming hands-on, with the new Third Edition of the world's #1 UNIX shells tutorial and reference! --- Comprehensive coverage of all five leading UNIX shells --- including extensive new coverage of bash and tcsh! --- Teaches by examples proven in Ellie Quigley's legendary Silicon Valley shell programming courses! --- CD-ROM contains all source code and data files used in the book --- an extraordinary resource for every UNIX shell programmer. booktitle UNIX Shells by Example, Third Edition is your complete, step-by-step guide to all five essential UNIX shells --- bash, tcsh, C, Bourne, and Korn --- and all three essential UNIX shell programming utilities, awk, sed and grep. This new Third Edition is better than ever, with hundreds of completely updated, classroom-proven examples from Silicon Valley's top UNIX and Linux instructor, Ellie Quigley. Starting with the basics, Quigley gets you all the way to expert-level techniques. Along the way, you'll learn what UNIX shells are, what they do, and how they integrate with other UNIX utilities and processes. You'll master creating, running, and debugging shell scripts; using grep, egrep and ggrep; working with sed, and much more. This edition contains extensive new coverage of bash and tcsh, as well as hundreds of updated and classroom-tested examples for all five leading shells. It contains hands-on exercises for every topic, an appendix with detailed syntax listings, comparison charts, and much more. For all.

TOC:
1: Introduction to UNIX Shells 2: The UNIX Toolbox 3: The grep Family 4: sed, the Streamlined Editor 5: The awk Utility: awk as a UNIX Tool 6: The awk Utility: awk Programming Constructs 7: The awk Utility: awk Programming 8: The Interactive Bourne Shell 9: The C Shell 10: The Korn Shell 11: The Interactive bash Shell 12: Programming with the bash Shell 13: The Interactive TC Shell A: Useful UNIX Utilities for Shell Programmers B: Comparison of the Shells C: Steps for Using Quoting Correctly

rawabstract:
Learn shell programming hands-on, with the new Third Edition of the world's \#1 UNIX shells tutorial and reference! --- Comprehensive coverage of all five leading UNIX shells --- including extensive new coverage of bash and tcsh! --- Teaches by examples proven in Ellie Quigley's legendary Silicon Valley shell programming courses! --- CD-ROM contains all source code and data files used in the book --- an extraordinary resource for every UNIX shell programmer. \booktitle{UNIX Shells by Example}, Third Edition is your complete, step-by-step guide to all five essential UNIX shells --- bash, tcsh, C, Bourne, and Korn --- and all three essential UNIX shell programming utilities, awk, sed and grep. This new Third Edition is better than ever, with hundreds of completely updated, classroom-proven examples from Silicon Valley's top UNIX and Linux instructor, Ellie Quigley. Starting with the basics, Quigley gets you all the way to expert-level techniques. Along the way, you'll learn what UNIX shells are, what they do, and how they integrate with other UNIX utilities and processes. You'll master creating, running, and debugging shell scripts; using grep, egrep and ggrep; working with sed, and much more. This edition contains extensive new coverage of bash and tcsh, as well as hundreds of updated and classroom-tested examples for all five leading shells. It contains hands-on exercises for every topic, an appendix with detailed syntax listings, comparison charts, and much more. For all.

rawTOC:
1: Introduction to UNIX Shells \\ 2: The UNIX Toolbox \\ 3: The grep Family \\ 4: sed, the Streamlined Editor \\ 5: The awk Utility: awk as a UNIX Tool \\ 6: The awk Utility: awk Programming Constructs \\ 7: The awk Utility: awk Programming \\ 8: The Interactive Bourne Shell \\ 9: The C Shell \\ 10: The Korn Shell \\ 11: The Interactive bash Shell \\ 12: Programming with the bash Shell \\ 13: The Interactive TC Shell \\ A: Useful UNIX Utilities for Shell Programmers \\ B: Comparison of the Shells \\ C: Steps for Using Quoting Correctly

entry:
@Book{Quigley:2002:USE,
  author =       "Ellie Quigley",
  title =        "{UNIX} Shells by Example",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  edition =      "Third",
  pages =        "xix + 1015",
  year =         "2002",
  ISBN =         "0-13-066538-X (paperback)",
  ISBN-13 =      "978-0-13-066538-6 (paperback)",
  LCCN =         "QA76.76.O63 Q54 2002",
  bibdate =      "Tue Sep 17 05:57:21 MDT 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/linux.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "Learn shell programming hands-on, with the new Third
                 Edition of the world's \#1 UNIX shells tutorial and
                 reference! --- Comprehensive coverage of all five
                 leading UNIX shells --- including extensive new
                 coverage of bash and tcsh! --- Teaches by examples
                 proven in Ellie Quigley's legendary Silicon Valley
                 shell programming courses! --- CD-ROM contains all
                 source code and data files used in the book --- an
                 extraordinary resource for every UNIX shell programmer.
                 \booktitle{UNIX Shells by Example}, Third Edition is
                 your complete, step-by-step guide to all five essential
                 UNIX shells --- bash, tcsh, C, Bourne, and Korn --- and
                 all three essential UNIX shell programming utilities,
                 awk, sed and grep. This new Third Edition is better
                 than ever, with hundreds of completely updated,
                 classroom-proven examples from Silicon Valley's top
                 UNIX and Linux instructor, Ellie Quigley. Starting with
                 the basics, Quigley gets you all the way to
                 expert-level techniques. Along the way, you'll learn
                 what UNIX shells are, what they do, and how they
                 integrate with other UNIX utilities and processes.
                 You'll master creating, running, and debugging shell
                 scripts; using grep, egrep and ggrep; working with sed,
                 and much more. This edition contains extensive new
                 coverage of bash and tcsh, as well as hundreds of
                 updated and classroom-tested examples for all five
                 leading shells. It contains hands-on exercises for
                 every topic, an appendix with detailed syntax listings,
                 comparison charts, and much more. For all.",
  acknowledgement = ack-nhfb,
  keywords =     "UNIX (computer file); UNIX shells",
  tableofcontents = "1: Introduction to UNIX Shells \\
                 2: The UNIX Toolbox \\
                 3: The grep Family \\
                 4: sed, the Streamlined Editor \\
                 5: The awk Utility: awk as a UNIX Tool \\
                 6: The awk Utility: awk Programming Constructs \\
                 7: The awk Utility: awk Programming \\
                 8: The Interactive Bourne Shell \\
                 9: The C Shell \\
                 10: The Korn Shell \\
                 11: The Interactive bash Shell \\
                 12: Programming with the bash Shell \\
                 13: The Interactive TC Shell \\
                 A: Useful UNIX Utilities for Shell Programmers \\
                 B: Comparison of the Shells \\
                 C: Steps for Using Quoting Correctly",
}


bibtype: book
filename: master.bib
label: Quinn:2008:MMA
author: Helen R. Quinn and Yossi Nir
title: The Mystery of the Missing Antimatter
publisher: pub-PRINCETON
address: pub-PRINCETON:adr
pages: xii + 278
year: 2008
ISBN: 0-691-13309-3 OR 0691133093
ISBN13: 978-0-691-13309-6 OR 9780691133096
LCCN: QC173.3 .Q856 2008
bibdate: Thu Aug 21 17:34:20 MDT 2008
bibtimestamp: 2008.08.21 17:34:20 MDT
series: Science essentials
subject: antimatter; popular works; particles (nuclear physics); cosmology
acknowledgement: ack-nhfb
rawauthor: Helen R. Quinn and Yossi Nir
rawtitle: The Mystery of the Missing Antimatter
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/fy0835/2007934402-b.html; http://www.loc.gov/catdir/enhancements/fy0835/2007934402-d.html; http://www.loc.gov/catdir/enhancements/fy0835/2007934402-t.html

abstract:
Helen Quinn and Yossi Nir explain both the history of antimatter and recent advances in particle physics and cosmology. And they discuss the enormous, high-precision experiments that particle physicists are undertaking to test the laws of physics at their most fundamental levels --- and how their results reveal tantalizing new possibilities for solving this puzzle at the heart of the cosmos.par booktitle The Mystery of the Missing Antimatter is at once a history of ideas and an exploration of modern science and the frontiers of human knowledge. This book reveals how the interplay of theory and experimentation advances our understanding and redefines the questions we ask about our universe.

TOC:
Constant physics in an evolving universe As the universe expands What is antimatter? Enter neutrinos Mesons Through the looking glass Through the looking antiglass The survival of matter Enter quarks Energy rules Symmetry rules Standard model gauge symmetries A missing piece It still doesn't work! Tools of the trade Searching for clues Speculations Neutrino surprises Following the new clue.

rawabstract:
Helen Quinn and Yossi Nir explain both the history of antimatter and recent advances in particle physics and cosmology. And they discuss the enormous, high-precision experiments that particle physicists are undertaking to test the laws of physics at their most fundamental levels --- and how their results reveal tantalizing new possibilities for solving this puzzle at the heart of the cosmos.\par \booktitle{The Mystery of the Missing Antimatter} is at once a history of ideas and an exploration of modern science and the frontiers of human knowledge. This book reveals how the interplay of theory and experimentation advances our understanding and redefines the questions we ask about our universe.

rawTOC:
Constant physics in an evolving universe \\ As the universe expands \\ What is antimatter? \\ Enter neutrinos \\ Mesons \\ Through the looking glass \\ Through the looking antiglass \\ The survival of matter \\ Enter quarks \\ Energy rules \\ Symmetry rules \\ Standard model gauge symmetries \\ A missing piece \\ It still doesn't work! \\ Tools of the trade \\ Searching for clues \\ Speculations \\ Neutrino surprises \\ Following the new clue.

entry:
@Book{Quinn:2008:MMA,
  author =       "Helen R. Quinn and Yossi Nir",
  title =        "The Mystery of the Missing Antimatter",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xii + 278",
  year =         "2008",
  ISBN =         "0-691-13309-3",
  ISBN-13 =      "978-0-691-13309-6",
  LCCN =         "QC173.3 .Q856 2008",
  bibdate =      "Thu Aug 21 17:34:20 MDT 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",
  series =       "Science essentials",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0835/2007934402-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0835/2007934402-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0835/2007934402-t.html",
  abstract =     "Helen Quinn and Yossi Nir explain both the history of
                 antimatter and recent advances in particle physics and
                 cosmology. And they discuss the enormous,
                 high-precision experiments that particle physicists are
                 undertaking to test the laws of physics at their most
                 fundamental levels --- and how their results reveal
                 tantalizing new possibilities for solving this puzzle
                 at the heart of the cosmos.\par

                 \booktitle{The Mystery of the Missing Antimatter} is at
                 once a history of ideas and an exploration of modern
                 science and the frontiers of human knowledge. This book
                 reveals how the interplay of theory and experimentation
                 advances our understanding and redefines the questions
                 we ask about our universe.",
  acknowledgement = ack-nhfb,
  subject =      "antimatter; popular works; particles (nuclear
                 physics); cosmology",
  tableofcontents = "Constant physics in an evolving universe \\
                 As the universe expands \\
                 What is antimatter? \\
                 Enter neutrinos \\
                 Mesons \\
                 Through the looking glass \\
                 Through the looking antiglass \\
                 The survival of matter \\
                 Enter quarks \\
                 Energy rules \\
                 Symmetry rules \\
                 Standard model gauge symmetries \\
                 A missing piece \\
                 It still doesn't work! \\
                 Tools of the trade \\
                 Searching for clues \\
                 Speculations \\
                 Neutrino surprises \\
                 Following the new clue.",
}


bibtype: book
filename: master.bib
label: Raade:2004:MHS
author: Lennart Raa de and Bertil Westergren
title: Mathematics Handbook for Science and Engineering
publisher: pub-SV
address: pub-SV:adr
edition: Fifth
pages: 562
year: 2004
ISBN: 3-540-21141-1 (hardcover) OR 3540211411 (hardcover)
ISBN13: 978-3-540-21141-9 (hardcover) OR 9783540211419 (hardcover)
LCCN: QA41 .R34 2004
bibdate: Sat May 15 09:15:39 MDT 2010
bibtimestamp: 2010.05.15 09:15:39 MDT
subject: mathematics; formulae; tables; handbooks, manuals, etc.
acknowledgement: ack-nhfb
rawauthor: Lennart R{\aa}de and Bertil Westergren
rawtitle: Mathematics Handbook for Science and Engineering
URL:
http://www.loc.gov/catdir/enhancements/fy0818/2006286513-d.html; http://www.loc.gov/catdir/toc/fy0704/2006286513.html

TOC:
1. Fundamentals Discrete Mathematics / 9 1.1 Logic / 9 1.2 Set Theory / 14 1.3 Binary Relations and Functions / 17 1.4 Algebraic Structures / 21 1.5 Graph Theory / 33 1.6 Codes / 37 2: Algebra / 43 2.1 Basic Algebra of Real Numbers / 43 2.2 Number Theory / 49 2.3 Complex Numbers / 61 2.4 Algebraic Equations / 63 3: Geometry and Trigonometry / 66 3.1 Plane Figures / 66 3.2 Solids / 71 3.3 Spherical Trigonometry / 75 3.4 Geometrical Vectors / 77 3.5 Plane Analytic Geometry / 79 3.6 Analytic Geometry in Space / 83 3.7 Fractals / 87 4: Linear Algebra / 90 4.1 Matrices / 90 4.2 Determinants / 93 4.3 Systems of Linear Equations / 95 4.4 Linear Coordinate Transformations / 97 4.5 Eigenvalues. Diagonalization / 98 4.6 Quadratic Forms / 103 4.7 Linear Spaces / 106 4.8 Linear Mappings / 108 4.9 Tensors / 114 4.10 Complex matrices / 114 5: The Elementary Functions / 118 5.1 A Survey of the Elementary Functions / 118 5.2 Polynomials and Rational Functions / 119 5.3 Logarithmic, Exponential, Power and Hyperbolic Functions / 121 5.4 Trigonometric and Inverse Trigonometric Functions / 125 6: Differential Calculus (one variable) / 132 6.1 Some Basic Concepts / 132 6.2 Limits and Continuity / 133 6.3 Derivatives / 136 6.4 Monotonicity. Extremes of Functions / 139 7: Integral Calculus / 141 7.1 Indefinite Integrals / 141 7.2 Definite Integrals / 146 7.3 Applications of Differential and Integral Calculus / 148 7.4 Table of Indefinite Integral / 153 7.5 Tables of Definite Integrals / 178 8: Sequences and Series / 183 8.1 Sequences of Numbers / 183 8.2 Sequences of Functions / 184 8.3 Series of Constant Terms / 185 8.4 Series of Functions / 187 8.5 Taylor Series / 189 8.6 Special Sums and Series / 192 9: Ordinary Differential Equations (ODE) / 200 9.1 Differential Equations of the First Order / 200 9.2 Differential Equations of the Second Order / 202 9.3 Linear Differential Equations / 205 9.4 Autonomous systems / 2313 9.5 General Concepts and Results / 216 9.6 Linear Difference Equations / 218 10: Multidimensional Calculus / 221 10.1 The Space Rn / 221 10.2 Surfaces. Tangent Planes / 222 10.3 Limits and Continuity / 223 10.4 Partial Derivatives / 224 10.5 Extremes of Functions / 227 10.6 Functions $f: R^n to R^m (R^n to R^n)$ / 229 10.7 Double Integrals / 231 10.8 Triple Integrals / 234 10.9 Partial Differential Equations / 239 11: Vector Analysis / 246 11.1 Curves / 246 11.2 Vector Fields / 248 11.3 Line Integrals / 253 11.4 Surface Integrals / 256 12: Orthogonal Series and Special Functions / 259 12.1 Orthogonal Systems / 259 12.2 Orthogonal Polynomials / 263 12.3 Bernoulli and Euler Polynomials / 269 12.4 Bessel Functions / 270 12.5 Functions Defined by Transcendental Integrals / 287 12.6 Step and Impulse Functions / 297 12.7 Functional Analysis / 298 12.8 Lebesgue Integrals / 303 12.9 Generalized functions (Distributions) / 308 13: Transforms / 310 13.1 Trigonometric Fourier Series / 310 13.2 Fourier Transforms / 315 13.3 Discrete Fourier Transforms / 325 13.4 The $z$-transform / 327 13.5 Laplace Transforms / 330 13.6 Dynamical Systems (Filters) / 338 13.7 Hankel and Hilbert transforms / 341 13.8 Wavelets / 344 14: Complex Analysis / 349 14.1 Functions of a Complex Variable / 349 14.2 Complex Integration / 352 14.3 Power Series Expansions / 354 14.4 Zeros and Singularities / 355 14.5 Conformal Mappings / 356 15: Optimization / 365 15.1 Calculus of Variations / 365 15.2 Linear Optimization / 371 15.3 Integer and Combinatorial Optimization / 379 15.4 Nonlinear Optimization / 383 15.5 Dynamic Optimization / 389 16: Numerical Analysis / 391 16.1 Approximations and Errors / 391 16.2 Numerical Solution of Equations / 392 16.3 Perturbation analysis / 397 16.4 Interpolation / 398 16.5 Numerical Integration and Differentiation / 404 16.6 Numerical Solutions of Differential Equations / 412 16.7 Numerical summation / 421 17: Probability Theory / 424 17.1 Basic Probability Theory / 424 17.2 Probability Distributions / 434 17.3 Stochastic Processes / 439 17.4 Algorithms for Calculation of Probability Distributions / 443 17.5 Simulation / 445 17.6 Queueing Systems / 449 17.7 Reliability / 452 17.8 Tables / 459 18: Statistics / 479 18.1 Descriptive Statistics / 479 18.2 Point Estimation / 488 18.3 Confidence Intervals / 491 18.4 Tables for Confidence Intervals / 495 18.5 Tests of Significance / 501 18.6 Linear Models / 507 18.7 Distribution-free Methods / 512 18.8 Statistical Quality Control / 518 18.9 Factorial Experiments / 522 18.10 Analysis of life time (failure time) data / 525 18.11 Statistical glossary / 526 19: Miscellaneous / 530

rawTOC:
1. Fundamentals \\ Discrete Mathematics / 9 \\ 1.1 Logic / 9 \\ 1.2 Set Theory / 14 \\ 1.3 Binary Relations and Functions / 17 \\ 1.4 Algebraic Structures / 21 \\ 1.5 Graph Theory / 33 \\ 1.6 Codes / 37 \\ 2: Algebra / 43 \\ 2.1 Basic Algebra of Real Numbers / 43 \\ 2.2 Number Theory / 49 \\ 2.3 Complex Numbers / 61 \\ 2.4 Algebraic Equations / 63 \\ 3: Geometry and Trigonometry / 66 \\ 3.1 Plane Figures / 66 \\ 3.2 Solids / 71 \\ 3.3 Spherical Trigonometry / 75 \\ 3.4 Geometrical Vectors / 77 \\ 3.5 Plane Analytic Geometry / 79 \\ 3.6 Analytic Geometry in Space / 83 \\ 3.7 Fractals / 87 \\ 4: Linear Algebra / 90 \\ 4.1 Matrices / 90 \\ 4.2 Determinants / 93 \\ 4.3 Systems of Linear Equations / 95 \\ 4.4 Linear Coordinate Transformations / 97 \\ 4.5 Eigenvalues. Diagonalization / 98 \\ 4.6 Quadratic Forms / 103 \\ 4.7 Linear Spaces / 106 \\ 4.8 Linear Mappings / 108 \\ 4.9 Tensors / 114 \\ 4.10 Complex matrices / 114 \\ 5: The Elementary Functions / 118 \\ 5.1 A Survey of the Elementary Functions / 118 \\ 5.2 Polynomials and Rational Functions / 119 \\ 5.3 Logarithmic, Exponential, Power and Hyperbolic Functions / 121 \\ 5.4 Trigonometric and Inverse Trigonometric Functions / 125 \\ 6: Differential Calculus (one variable) / 132 \\ 6.1 Some Basic Concepts / 132 \\ 6.2 Limits and Continuity / 133 \\ 6.3 Derivatives / 136 \\ 6.4 Monotonicity. Extremes of Functions / 139 \\ 7: Integral Calculus / 141 \\ 7.1 Indefinite Integrals / 141 \\ 7.2 Definite Integrals / 146 \\ 7.3 Applications of Differential and Integral Calculus / 148 \\ 7.4 Table of Indefinite Integral / 153 \\ 7.5 Tables of Definite Integrals / 178 \\ 8: Sequences and Series / 183 \\ 8.1 Sequences of Numbers / 183 \\ 8.2 Sequences of Functions / 184 \\ 8.3 Series of Constant Terms / 185 \\ 8.4 Series of Functions / 187 \\ 8.5 Taylor Series / 189 \\ 8.6 Special Sums and Series / 192 \\ 9: Ordinary Differential Equations (ODE) / 200 \\ 9.1 Differential Equations of the First Order / 200 \\ 9.2 Differential Equations of the Second Order / 202 \\ 9.3 Linear Differential Equations / 205 \\ 9.4 Autonomous systems / 2313 \\ 9.5 General Concepts and Results / 216 \\ 9.6 Linear Difference Equations / 218 \\ 10: Multidimensional Calculus / 221 \\ 10.1 The Space Rn / 221 \\ 10.2 Surfaces. Tangent Planes / 222 \\ 10.3 Limits and Continuity / 223 \\ 10.4 Partial Derivatives / 224 \\ 10.5 Extremes of Functions / 227 \\ 10.6 Functions $f: R^n \to R^m (R^n \to R^n)$ / 229 \\ 10.7 Double Integrals / 231 \\ 10.8 Triple Integrals / 234 \\ 10.9 Partial Differential Equations / 239 \\ 11: Vector Analysis / 246 \\ 11.1 Curves / 246 \\ 11.2 Vector Fields / 248 \\ 11.3 Line Integrals / 253 \\ 11.4 Surface Integrals / 256 \\ 12: Orthogonal Series and Special Functions / 259 \\ 12.1 Orthogonal Systems / 259 \\ 12.2 Orthogonal Polynomials / 263 \\ 12.3 Bernoulli and Euler Polynomials / 269 \\ 12.4 Bessel Functions / 270 \\ 12.5 Functions Defined by Transcendental Integrals / 287 \\ 12.6 Step and Impulse Functions / 297 \\ 12.7 Functional Analysis / 298 \\ 12.8 Lebesgue Integrals / 303 \\ 12.9 Generalized functions (Distributions) / 308 \\ 13: Transforms / 310 \\ 13.1 Trigonometric Fourier Series / 310 \\ 13.2 Fourier Transforms / 315 \\ 13.3 Discrete Fourier Transforms / 325 \\ 13.4 The $z$-transform / 327 \\ 13.5 Laplace Transforms / 330 \\ 13.6 Dynamical Systems (Filters) / 338 \\ 13.7 Hankel and Hilbert transforms / 341 \\ 13.8 Wavelets / 344 \\ 14: Complex Analysis / 349 \\ 14.1 Functions of a Complex Variable / 349 \\ 14.2 Complex Integration / 352 \\ 14.3 Power Series Expansions / 354 \\ 14.4 Zeros and Singularities / 355 \\ 14.5 Conformal Mappings / 356 \\ 15: Optimization / 365 \\ 15.1 Calculus of Variations / 365 \\ 15.2 Linear Optimization / 371 \\ 15.3 Integer and Combinatorial Optimization / 379 \\ 15.4 Nonlinear Optimization / 383 \\ 15.5 Dynamic Optimization / 389 \\ 16: Numerical Analysis / 391 \\ 16.1 Approximations and Errors / 391 \\ 16.2 Numerical Solution of Equations / 392 \\ 16.3 Perturbation analysis / 397 \\ 16.4 Interpolation / 398 \\ 16.5 Numerical Integration and Differentiation / 404 \\ 16.6 Numerical Solutions of Differential Equations / 412 \\ 16.7 Numerical summation / 421 \\ 17: Probability Theory / 424 \\ 17.1 Basic Probability Theory / 424 \\ 17.2 Probability Distributions / 434 \\ 17.3 Stochastic Processes / 439 \\ 17.4 Algorithms for Calculation of Probability Distributions / 443 \\ 17.5 Simulation / 445 \\ 17.6 Queueing Systems / 449 \\ 17.7 Reliability / 452 \\ 17.8 Tables / 459 \\ 18: Statistics / 479 \\ 18.1 Descriptive Statistics / 479 \\ 18.2 Point Estimation / 488 \\ 18.3 Confidence Intervals / 491 \\ 18.4 Tables for Confidence Intervals / 495 \\ 18.5 Tests of Significance / 501 \\ 18.6 Linear Models / 507 \\ 18.7 Distribution-free Methods / 512 \\ 18.8 Statistical Quality Control / 518 \\ 18.9 Factorial Experiments / 522 \\ 18.10 Analysis of life time (failure time) data / 525 \\ 18.11 Statistical glossary / 526 \\ 19: Miscellaneous / 530

entry:
@Book{Raade:2004:MHS,
  author =       "Lennart R{\aa}de and Bertil Westergren",
  title =        "Mathematics Handbook for Science and Engineering",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Fifth",
  pages =        "562",
  year =         "2004",
  ISBN =         "3-540-21141-1 (hardcover)",
  ISBN-13 =      "978-3-540-21141-9 (hardcover)",
  LCCN =         "QA41 .R34 2004",
  bibdate =      "Sat May 15 09:15:39 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0818/2006286513-d.html;
                 http://www.loc.gov/catdir/toc/fy0704/2006286513.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "mathematics; formulae; tables; handbooks, manuals,
                 etc.",
  tableofcontents = "1. Fundamentals \\
                 Discrete Mathematics / 9 \\
                 1.1 Logic / 9 \\
                 1.2 Set Theory / 14 \\
                 1.3 Binary Relations and Functions / 17 \\
                 1.4 Algebraic Structures / 21 \\
                 1.5 Graph Theory / 33 \\
                 1.6 Codes / 37 \\
                 2: Algebra / 43 \\
                 2.1 Basic Algebra of Real Numbers / 43 \\
                 2.2 Number Theory / 49 \\
                 2.3 Complex Numbers / 61 \\
                 2.4 Algebraic Equations / 63 \\
                 3: Geometry and Trigonometry / 66 \\
                 3.1 Plane Figures / 66 \\
                 3.2 Solids / 71 \\
                 3.3 Spherical Trigonometry / 75 \\
                 3.4 Geometrical Vectors / 77 \\
                 3.5 Plane Analytic Geometry / 79 \\
                 3.6 Analytic Geometry in Space / 83 \\
                 3.7 Fractals / 87 \\
                 4: Linear Algebra / 90 \\
                 4.1 Matrices / 90 \\
                 4.2 Determinants / 93 \\
                 4.3 Systems of Linear Equations / 95 \\
                 4.4 Linear Coordinate Transformations / 97 \\
                 4.5 Eigenvalues. Diagonalization / 98 \\
                 4.6 Quadratic Forms / 103 \\
                 4.7 Linear Spaces / 106 \\
                 4.8 Linear Mappings / 108 \\
                 4.9 Tensors / 114 \\
                 4.10 Complex matrices / 114 \\
                 5: The Elementary Functions / 118 \\
                 5.1 A Survey of the Elementary Functions / 118 \\
                 5.2 Polynomials and Rational Functions / 119 \\
                 5.3 Logarithmic, Exponential, Power and Hyperbolic
                 Functions / 121 \\
                 5.4 Trigonometric and Inverse Trigonometric Functions /
                 125 \\
                 6: Differential Calculus (one variable) / 132 \\
                 6.1 Some Basic Concepts / 132 \\
                 6.2 Limits and Continuity / 133 \\
                 6.3 Derivatives / 136 \\
                 6.4 Monotonicity. Extremes of Functions / 139 \\
                 7: Integral Calculus / 141 \\
                 7.1 Indefinite Integrals / 141 \\
                 7.2 Definite Integrals / 146 \\
                 7.3 Applications of Differential and Integral Calculus
                 / 148 \\
                 7.4 Table of Indefinite Integral / 153 \\
                 7.5 Tables of Definite Integrals / 178 \\
                 8: Sequences and Series / 183 \\
                 8.1 Sequences of Numbers / 183 \\
                 8.2 Sequences of Functions / 184 \\
                 8.3 Series of Constant Terms / 185 \\
                 8.4 Series of Functions / 187 \\
                 8.5 Taylor Series / 189 \\
                 8.6 Special Sums and Series / 192 \\
                 9: Ordinary Differential Equations (ODE) / 200 \\
                 9.1 Differential Equations of the First Order / 200 \\
                 9.2 Differential Equations of the Second Order / 202
                 \\
                 9.3 Linear Differential Equations / 205 \\
                 9.4 Autonomous systems / 2313 \\
                 9.5 General Concepts and Results / 216 \\
                 9.6 Linear Difference Equations / 218 \\
                 10: Multidimensional Calculus / 221 \\
                 10.1 The Space Rn / 221 \\
                 10.2 Surfaces. Tangent Planes / 222 \\
                 10.3 Limits and Continuity / 223 \\
                 10.4 Partial Derivatives / 224 \\
                 10.5 Extremes of Functions / 227 \\
                 10.6 Functions $f: R^n \to R^m (R^n \to R^n)$ / 229 \\
                 10.7 Double Integrals / 231 \\
                 10.8 Triple Integrals / 234 \\
                 10.9 Partial Differential Equations / 239 \\
                 11: Vector Analysis / 246 \\
                 11.1 Curves / 246 \\
                 11.2 Vector Fields / 248 \\
                 11.3 Line Integrals / 253 \\
                 11.4 Surface Integrals / 256 \\
                 12: Orthogonal Series and Special Functions / 259 \\
                 12.1 Orthogonal Systems / 259 \\
                 12.2 Orthogonal Polynomials / 263 \\
                 12.3 Bernoulli and Euler Polynomials / 269 \\
                 12.4 Bessel Functions / 270 \\
                 12.5 Functions Defined by Transcendental Integrals /
                 287 \\
                 12.6 Step and Impulse Functions / 297 \\
                 12.7 Functional Analysis / 298 \\
                 12.8 Lebesgue Integrals / 303 \\
                 12.9 Generalized functions (Distributions) / 308 \\
                 13: Transforms / 310 \\
                 13.1 Trigonometric Fourier Series / 310 \\
                 13.2 Fourier Transforms / 315 \\
                 13.3 Discrete Fourier Transforms / 325 \\
                 13.4 The $z$-transform / 327 \\
                 13.5 Laplace Transforms / 330 \\
                 13.6 Dynamical Systems (Filters) / 338 \\
                 13.7 Hankel and Hilbert transforms / 341 \\
                 13.8 Wavelets / 344 \\
                 14: Complex Analysis / 349 \\
                 14.1 Functions of a Complex Variable / 349 \\
                 14.2 Complex Integration / 352 \\
                 14.3 Power Series Expansions / 354 \\
                 14.4 Zeros and Singularities / 355 \\
                 14.5 Conformal Mappings / 356 \\
                 15: Optimization / 365 \\
                 15.1 Calculus of Variations / 365 \\
                 15.2 Linear Optimization / 371 \\
                 15.3 Integer and Combinatorial Optimization / 379 \\
                 15.4 Nonlinear Optimization / 383 \\
                 15.5 Dynamic Optimization / 389 \\
                 16: Numerical Analysis / 391 \\
                 16.1 Approximations and Errors / 391 \\
                 16.2 Numerical Solution of Equations / 392 \\
                 16.3 Perturbation analysis / 397 \\
                 16.4 Interpolation / 398 \\
                 16.5 Numerical Integration and Differentiation / 404
                 \\
                 16.6 Numerical Solutions of Differential Equations /
                 412 \\
                 16.7 Numerical summation / 421 \\
                 17: Probability Theory / 424 \\
                 17.1 Basic Probability Theory / 424 \\
                 17.2 Probability Distributions / 434 \\
                 17.3 Stochastic Processes / 439 \\
                 17.4 Algorithms for Calculation of Probability
                 Distributions / 443 \\
                 17.5 Simulation / 445 \\
                 17.6 Queueing Systems / 449 \\
                 17.7 Reliability / 452 \\
                 17.8 Tables / 459 \\
                 18: Statistics / 479 \\
                 18.1 Descriptive Statistics / 479 \\
                 18.2 Point Estimation / 488 \\
                 18.3 Confidence Intervals / 491 \\
                 18.4 Tables for Confidence Intervals / 495 \\
                 18.5 Tests of Significance / 501 \\
                 18.6 Linear Models / 507 \\
                 18.7 Distribution-free Methods / 512 \\
                 18.8 Statistical Quality Control / 518 \\
                 18.9 Factorial Experiments / 522 \\
                 18.10 Analysis of life time (failure time) data / 525
                 \\
                 18.11 Statistical glossary / 526 \\
                 19: Miscellaneous / 530",
}


