# bibtab

bibtype: book
filename: master.bib
label: Forbes:2014:FME
author: Nancy Forbes and Basil Mahon
title: Faraday, Maxwell, and the electromagnetic field: how two men revolutionized physics
publisher: pub-PROMETHEUS-BOOKS
address: pub-PROMETHEUS-BOOKS:adr
pages: 320
year: 2014
ISBN: 1-61614-942-6 (hardcover), 1-61614-943-4 (e-book) OR 1616149426 (hardcover), 1616149434 (ebook)
LCCN: QC16.F2 F67 2014
bibdate: Wed Jun 3 09:10:17 MDT 2015
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2015.06.03 09:10:17 MDT
subject: Faraday, Michael; Maxwell, James Clerk; Electromagnetic fields; Physics
acknowledgement: ack-nhfb
subjectdates: 1791--1867; 1831--1879
rawauthor: Nancy Forbes and Basil Mahon
rawtitle: {Faraday}, {Maxwell}, and the electromagnetic field: how two men revolutionized physics
ISBN13:
978-1-61614-942-0 (hardcover), 978-1-61614-943-7 (e-book) OR 9781616149420 (hardcover), 9781616149437 (ebook)

TOC:
Acknowledgements / 9 Chronology: Principal Events in the Story of the Electromagnetic Field / 11 Introduction / 15 1: The apprentice: 1791--1813 / 19 2: Chemistry: 1813--1820 / 31 3: History: 1600--1820 / 41 4: A circular force: 1820--1831 / 41 5: Induction: 1831--1840 / 69 6: A shadow of a speculation: 1840--1857 / 95 7: Faraday's last years: 1857--1867 / 119 8: What's the go o' that? 1831--1850 / 127 9: Society and drill: 1850--1854 / 143 10: An imaginary fluid: 1854--1856 / 153 11: No jokes are understood here: 1856--1860 / 169 12: The speed of light: 1860--1863 / 181 13: Great guns: 1863--1865 / 203 14: Country life: 1865--1871 / 215 15: The Cavendish: 1871--1879 / 227 16: The Maxwellians: 1850--1890 / 241 17: A new epoch: 1890 Onward / 259 Notes / 273 Bibliography / 293 Index / 299

rawTOC:
Acknowledgements / 9 \\ Chronology: Principal Events in the Story of the Electromagnetic Field / 11 \\ Introduction / 15 \\ 1: The apprentice: 1791--1813 / 19 \\ 2: Chemistry: 1813--1820 / 31 \\ 3: History: 1600--1820 / 41 \\ 4: A circular force: 1820--1831 / 41 \\ 5: Induction: 1831--1840 / 69 \\ 6: A shadow of a speculation: 1840--1857 / 95 \\ 7: Faraday's last years: 1857--1867 / 119 \\ 8: What's the go o' that? 1831--1850 / 127 \\ 9: Society and drill: 1850--1854 / 143 \\ 10: An imaginary fluid: 1854--1856 / 153 \\ 11: No jokes are understood here: 1856--1860 / 169 \\ 12: The speed of light: 1860--1863 / 181 \\ 13: Great guns: 1863--1865 / 203 \\ 14: Country life: 1865--1871 / 215 \\ 15: The Cavendish: 1871--1879 / 227 \\ 16: The Maxwellians: 1850--1890 / 241 \\ 17: A new epoch: 1890 Onward / 259 \\ Notes / 273 \\ Bibliography / 293 \\ Index / 299

entry:
@Book{Forbes:2014:FME,
  author =       "Nancy Forbes and Basil Mahon",
  title =        "{Faraday}, {Maxwell}, and the electromagnetic field:
                 how two men revolutionized physics",
  publisher =    pub-PROMETHEUS-BOOKS,
  address =      pub-PROMETHEUS-BOOKS:adr,
  pages =        "320",
  year =         "2014",
  ISBN =         "1-61614-942-6 (hardcover), 1-61614-943-4 (e-book)",
  ISBN-13 =      "978-1-61614-942-0 (hardcover), 978-1-61614-943-7
                 (e-book)",
  LCCN =         "QC16.F2 F67 2014",
  bibdate =      "Wed Jun 3 09:10:17 MDT 2015",
  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 =      "Faraday, Michael; Maxwell, James Clerk;
                 Electromagnetic fields; Physics",
  subject-dates = "1791--1867; 1831--1879",
  tableofcontents = "Acknowledgements / 9 \\
                 Chronology: Principal Events in the Story of the
                 Electromagnetic Field / 11 \\
                 Introduction / 15 \\
                 1: The apprentice: 1791--1813 / 19 \\
                 2: Chemistry: 1813--1820 / 31 \\
                 3: History: 1600--1820 / 41 \\
                 4: A circular force: 1820--1831 / 41 \\
                 5: Induction: 1831--1840 / 69 \\
                 6: A shadow of a speculation: 1840--1857 / 95 \\
                 7: Faraday's last years: 1857--1867 / 119 \\
                 8: What's the go o' that? 1831--1850 / 127 \\
                 9: Society and drill: 1850--1854 / 143 \\
                 10: An imaginary fluid: 1854--1856 / 153 \\
                 11: No jokes are understood here: 1856--1860 / 169 \\
                 12: The speed of light: 1860--1863 / 181 \\
                 13: Great guns: 1863--1865 / 203 \\
                 14: Country life: 1865--1871 / 215 \\
                 15: The Cavendish: 1871--1879 / 227 \\
                 16: The Maxwellians: 1850--1890 / 241 \\
                 17: A new epoch: 1890 Onward / 259 \\
                 Notes / 273 \\
                 Bibliography / 293 \\
                 Index / 299",
}


bibtype: techreport
filename: master.bib
label: Ford:sftran
author: William F. Ford and Theodore E. Fessler
title: User's Guide for SFTRAN / 1100
number: NASA Technical Paper 1200
institution: NASA Lewis Research Center
pages: 320
month: apr
monthnumber: 4
year: 1978
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: William F. Ford and Theodore E. Fessler
rawtitle: User's Guide for {SFTRAN\slash 1100}
entry:
@TechReport{Ford:sftran,
  author =       "William F. Ford and Theodore E. Fessler",
  title =        "User's Guide for {SFTRAN\slash 1100}",
  number =       "NASA Technical Paper 1200",
  institution =  "NASA Lewis Research Center",
  month =        apr,
  year =         "1978",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Fornberg:1996:PGP
author: Bengt Fornberg
title: A Practical Guide to Pseudospectral Methods
publisher: pub-CAMBRIDGE
address: pub-CAMBRIDGE:adr
pages: x + 231
year: 1996
DOI: https://doi.org/10.1017/CBO9780511626357
ISBN: 0-521-49582-2 OR 0521495822
ISBN13: 978-0-521-49582-0 OR 9780521495820
LCCN: QA320 F65 1996
MRclass: 65-01 (00A06 65-00 65M70), 65N35, 35J65, 35L65, 65-02, 65M06, 65M70, 65N06
MRnumber: 1386891 (97g:65001)
MRreviewer: Lawrence Mulholland
bibdate: Sat Dec 24 11:53:05 MST 2005
bibtimestamp: 2005.12.24 11:53:05 MST
series: Cambridge Monographs on Applied and Computational Mathematics
keywords: Spectral theory (Mathematics), Finite differences
acknowledgement: ack-nhfb
rawauthor: Bengt Fornberg
rawtitle: A Practical Guide to Pseudospectral Methods
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/numana1990.bib

URL:
http://www.loc.gov/catdir/description/cam027/95031986.html; http://www.loc.gov/catdir/toc/cam024/95031986.html

abstract:
Partial differential equations arise in almost all areas of science, engineering, modeling, and forecasting. During the last two decades pseudospectral methods have emerged as successful alternatives to better known computational procedures, (e.g. finite difference and finite element methods of numerical solution), in several key application areas. These areas include computational fluid dynamics, wave motion, and weather forecasting. This book explains how, when and why this pseudospectral approach works. In order to make the subject accessible to students as well as researchers and engineers, the subject is presented using illustrations, examples, heuristic explanations, and algorithms rather than rigorous theoretical arguments. This book will be of interest to graduate students, scientists and engineers interested in applying pseudospectral methods to real problems.

TOC:
1: Introduction 2: Introduction to spectral methods via orthogonal functions 3: Introduction to PS methods via finite differences 4: Key properties of PS approximations 5: PS variations and enhancements 6: PS methods in polar and spherical geometries 7: Comparisons of computational cost for FD and PS methods 8: Applications for spectral methods Appendix A: Jacobi polynomials Appendix B: Tau, Galerkin, and collocation (PS) implementations Appendix C: Codes for algorithm to find FD weights Appendix D: Lebesgue constants Appendix E: Potential function estimate for polynomial interpolation error Appendix F: FFT-based implementation of PS methods Appendix G: Stability domains for some ODE solvers Appendix H: Energy estimates

rawabstract:
Partial differential equations arise in almost all areas of science, engineering, modeling, and forecasting. During the last two decades pseudospectral methods have emerged as successful alternatives to better known computational procedures, (e.g. finite difference and finite element methods of numerical solution), in several key application areas. These areas include computational fluid dynamics, wave motion, and weather forecasting. This book explains how, when and why this pseudospectral approach works. In order to make the subject accessible to students as well as researchers and engineers, the subject is presented using illustrations, examples, heuristic explanations, and algorithms rather than rigorous theoretical arguments. This book will be of interest to graduate students, scientists and engineers interested in applying pseudospectral methods to real problems.

rawTOC:
1: Introduction \\ 2: Introduction to spectral methods via orthogonal functions \\ 3: Introduction to PS methods via finite differences \\ 4: Key properties of PS approximations \\ 5: PS variations and enhancements \\ 6: PS methods in polar and spherical geometries \\ 7: Comparisons of computational cost for FD and PS methods \\ 8: Applications for spectral methods \\ Appendix A: Jacobi polynomials \\ Appendix B: Tau, Galerkin, and collocation (PS) implementations \\ Appendix C: Codes for algorithm to find FD weights \\ Appendix D: Lebesgue constants \\ Appendix E: Potential function estimate for polynomial interpolation error \\ Appendix F: FFT-based implementation of PS methods \\ Appendix G: Stability domains for some ODE solvers \\ Appendix H: Energy estimates

entry:
@Book{Fornberg:1996:PGP,
  author =       "Bengt Fornberg",
  title =        "A Practical Guide to Pseudospectral Methods",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "x + 231",
  year =         "1996",
  DOI =          "https://doi.org/10.1017/CBO9780511626357",
  ISBN =         "0-521-49582-2",
  ISBN-13 =      "978-0-521-49582-0",
  LCCN =         "QA320 F65 1996",
  MRclass =      "65-01 (00A06 65-00 65M70), 65N35, 35J65, 35L65, 65-02,
                 65M06, 65M70, 65N06",
  MRnumber =     "1386891 (97g:65001)",
  MRreviewer =   "Lawrence Mulholland",
  bibdate =      "Sat Dec 24 11:53:05 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana1990.bib",
  series =       "Cambridge Monographs on Applied and Computational
                 Mathematics",
  URL =          "http://www.loc.gov/catdir/description/cam027/95031986.html;
                 http://www.loc.gov/catdir/toc/cam024/95031986.html",
  abstract =     "Partial differential equations arise in almost all
                 areas of science, engineering, modeling, and
                 forecasting. During the last two decades pseudospectral
                 methods have emerged as successful alternatives to
                 better known computational procedures, (e.g. finite
                 difference and finite element methods of numerical
                 solution), in several key application areas. These
                 areas include computational fluid dynamics, wave
                 motion, and weather forecasting. This book explains
                 how, when and why this pseudospectral approach works.
                 In order to make the subject accessible to students as
                 well as researchers and engineers, the subject is
                 presented using illustrations, examples, heuristic
                 explanations, and algorithms rather than rigorous
                 theoretical arguments. This book will be of interest to
                 graduate students, scientists and engineers interested
                 in applying pseudospectral methods to real problems.",
  acknowledgement = ack-nhfb,
  bookformat =   "Hardcover",
  category =     "Engineering; Mechanical; Fluid Mechanics",
  DEWEY =        "515/.7242 20",
  keywords =     "Spectral theory (Mathematics), Finite differences",
  libnote =      "Not in my library.",
  tableofcontents = "1: Introduction \\
                 2: Introduction to spectral methods via orthogonal
                 functions \\
                 3: Introduction to PS methods via finite differences
                 \\
                 4: Key properties of PS approximations \\
                 5: PS variations and enhancements \\
                 6: PS methods in polar and spherical geometries \\
                 7: Comparisons of computational cost for FD and PS
                 methods \\
                 8: Applications for spectral methods \\
                 Appendix A: Jacobi polynomials \\
                 Appendix B: Tau, Galerkin, and collocation (PS)
                 implementations \\
                 Appendix C: Codes for algorithm to find FD weights \\
                 Appendix D: Lebesgue constants \\
                 Appendix E: Potential function estimate for polynomial
                 interpolation error \\
                 Appendix F: FFT-based implementation of PS methods \\
                 Appendix G: Stability domains for some ODE solvers \\
                 Appendix H: Energy estimates",
}


bibtype: book
filename: master.bib
label: Forsythe:1977:CMM
author: George E. (George Elmer) Forsythe and Michael A. Malcolm and Cleve B. Moler
title: Computer Methods for Mathematical Computations
publisher: pub-PH
address: pub-PH:adr
pages: xi + 259
year: 1977
ISBN: 0-13-165332-6 OR 0131653326
ISBN13: 978-0-13-165332-0 OR 9780131653320
LCCN: QA297 .F5681
MRclass: 65-01
MRnumber: MR0458783 (56 \#16983)
MRreviewer: Sven-{\AA}ke Gustafson
bibdate: Tue May 25 09:01:08 2010
bibtimestamp: 2010.05.25 09:01:08 ???
series: Prentice-Hall series in automatic computation
keywords: Fortran (computer program language); numerical analysis -- data processing
ZMnumber: 0361.65002
acknowledgement: ack-nhfb
authordates: George Elmer Forsythe (8 January 1917--9 April 1972)
rawauthor: George E. (George Elmer) Forsythe and Michael A. Malcolm and Cleve B. Moler
rawtitle: Computer Methods for Mathematical Computations
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib; https://www.math.utah.edu/pub/bibnet/authors/m/moler-cleve-b.bib; https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib; https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; https://www.math.utah.edu/pub/tex/bib/fortran1.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib

note:
Cited in AA ke Bjorck's bibliography on least squares, which is available by anonymous ftp from path =math.liu.se= in path =pub/references=

remark:
Subroutines and exercises for the computer solution of problems involving matrices, integrals, differential equations, spline functions, zeros and extrema of functions, least squares, and Monte Carlo techniques.

subject:
Numerical analysis; Data processing; Computer programs; Problems, exercises, etc; FORTRAN (Computer program language)

TOC:
Preface / x Introduction / 1 1.1 Bibliography / 2 1.2 About the programs in this book / 7 Problems / 8 2 Floating-Point Computation / 10 2.1 Floating-point numbers JO 2.2 Calculation of machine epsilon / 13 2.3 An example of round-off error / 14 2.4 Instability of certain algorithms / 16 2.5 Sensitivity of certain problems / 17 2.6 Solving quadratic equations / 20 Problems / 23 3 Linear Systems of Equations 3.1 Linear systems for stored matrices / 32 3.2 Condition of a matrix / 41 3.3 Subroutines DECOMP and SOLVE / 48 3.4 Large, sparse systems / 56 Problems / 58 4 Interpolation / 63 4.1 Polynomial interpolation / 64 4.2 Evaluation of polynomials / 68 4.3 An example, Runge's function / 69 4.4 Spline interpolation / 70 4.5 Subroutines SPLINE and SEYAL / 76 Problems / 80 5 Numerical Integration / 84 5.1 The rectangle and trapezoid rules / 85 5.2 Spline quadrature / 89 5.3 Simpson's rule / 91 5.4 Adaptive quadrature routines / 92 5.5 Subroutine QUANC8 / 97 Problems / 106 6 Initial Value Problems in Ordinary Differential Equations / 110 6.1 The problem to be solved JJO 6.2 Numerical solutions / 112 6.3 Errors / 114 6.4 Methods / 119 6.5 Stiff equations / 123 6.6 Boundary value problems / 126 6.7 Choice of a subroutine / 127 6.8 Subroutine RKF45 / 129 Problems / 148 7 Solution of Nonlinear Equations / 156 7.1 Transcendental equations --- real roots / 156 7.2 Subroutine ZEROIN / 161 7.3 Transcendental equations --- complex roots / 167 7.4 Zeros of polynomials / 168 7.5 Nonlinear systems of equations / 169 Problems / 171 8 Optimization / 178 8.1 One-dimensional optimization / 179 8.2 Subroutine FMIN / 182 8.3 Optimization in many dimensions / 188 Problems / 190 9 Least Squares and the Singular Value Decomposition / 192 9.1 Least squares data fitting / 192 9.2 Orthogonality and the SYD / 201 9.3 Applications / 207 9.4 Computing the decomposition / 218 9.5 Subroutine SYD / 227 Problems / 236 10 Random Number Generation and Monte Carlo Methods / 240 1O.1 Generation of uniformly distributed numbers / 241 10.2 Subroutine URAND / 245 10.3 Sampling from other distributions / 247 Problems / 248 References / 250 Index / 255

rawnote:
Cited in {\AA}ke Bj{\"o}rck's bibliography on least squares, which is available by anonymous ftp from \path=math.liu.se= in \path=pub/references=

shortTOC:
Preface / x 1: Introduction / 1 2: Floating-point computation / 10 3: Linear systems of equations / 30 4: Interpolation / 63 5: Numerical integration / 84 6: Initial value problems in ordinary differential equations / 110 7: Solution of nonlinear equations / 156 8: Optimization / 178 9: Least squares and the singular value decomposition / 192 10: Random number generation and Monte Carlo methods / 240 References / 250 Index / 255

rawshortTOC:
Preface / x \\ 1: Introduction / 1 \\ 2: Floating-point computation / 10 \\ 3: Linear systems of equations / 30 \\ 4: Interpolation / 63 \\ 5: Numerical integration / 84 \\ 6: Initial value problems in ordinary differential equations / 110 \\ 7: Solution of nonlinear equations / 156 \\ 8: Optimization / 178 \\ 9: Least squares and the singular value decomposition / 192 \\ 10: Random number generation and Monte Carlo methods / 240 \\ References / 250 \\ Index / 255

rawTOC:
Preface / x \\ \\ \\ Introduction / 1 \\ 1.1 Bibliography / 2 \\ 1.2 About the programs in this book / 7 \\ Problems / 8 \\ \\ 2 Floating-Point Computation / 10 \\ 2.1 Floating-point numbers JO \\ 2.2 Calculation of machine epsilon / 13 \\ 2.3 An example of round-off error / 14 \\ 2.4 Instability of certain algorithms / 16 \\ 2.5 Sensitivity of certain problems / 17 \\ 2.6 Solving quadratic equations / 20 \\ Problems / 23 \\ \\ 3 Linear Systems of Equations \\ 3.1 Linear systems for stored matrices / 32 \\ 3.2 Condition of a matrix / 41 \\ 3.3 Subroutines DECOMP and SOLVE / 48 \\ 3.4 Large, sparse systems / 56 \\ Problems / 58 \\ \\ 4 Interpolation / 63 \\ 4.1 Polynomial interpolation / 64 \\ 4.2 Evaluation of polynomials / 68 \\ 4.3 An example, Runge's function / 69 \\ 4.4 Spline interpolation / 70 \\ 4.5 Subroutines SPLINE and SEYAL / 76 \\ Problems / 80 \\ \\ 5 Numerical Integration / 84 \\ 5.1 The rectangle and trapezoid rules / 85 \\ 5.2 Spline quadrature / 89 \\ 5.3 Simpson's rule / 91 \\ 5.4 Adaptive quadrature routines / 92 \\ 5.5 Subroutine QUANC8 / 97 \\ Problems / 106 \\ \\ 6 Initial Value Problems in Ordinary Differential Equations / 110 \\ 6.1 The problem to be solved JJO \\ 6.2 Numerical solutions / 112 \\ 6.3 Errors / 114 \\ 6.4 Methods / 119 \\ 6.5 Stiff equations / 123 \\ 6.6 Boundary value problems / 126 \\ 6.7 Choice of a subroutine / 127 \\ 6.8 Subroutine RKF45 / 129 \\ Problems / 148 \\ \\ 7 Solution of Nonlinear Equations / 156 \\ 7.1 Transcendental equations --- real roots / 156 \\ 7.2 Subroutine ZEROIN / 161 \\ 7.3 Transcendental equations --- complex roots / 167 \\ 7.4 Zeros of polynomials / 168 \\ 7.5 Nonlinear systems of equations / 169 \\ Problems / 171 \\ \\ 8 Optimization / 178 \\ 8.1 One-dimensional optimization / 179 \\ 8.2 Subroutine FMIN / 182 \\ 8.3 Optimization in many dimensions / 188 \\ Problems / 190 \\ \\ 9 Least Squares and the Singular Value Decomposition / 192 \\ 9.1 Least squares data fitting / 192 \\ 9.2 Orthogonality and the SYD / 201 \\ 9.3 Applications / 207 \\ 9.4 Computing the decomposition / 218 \\ 9.5 Subroutine SYD / 227 \\ Problems / 236 \\ \\ 10 Random Number Generation and Monte Carlo Methods / 240 \\ 1O.1 Generation of uniformly distributed numbers / 241 \\ 10.2 Subroutine URAND / 245 \\ 10.3 Sampling from other distributions / 247 \\ Problems / 248 \\ \\ References / 250 \\ \\ Index / 255

entry:
@Book{Forsythe:1977:CMM,
  author =       "George E. (George Elmer) Forsythe and Michael A.
                 Malcolm and Cleve B. Moler",
  title =        "Computer Methods for Mathematical Computations",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xi + 259",
  year =         "1977",
  ISBN =         "0-13-165332-6",
  ISBN-13 =      "978-0-13-165332-0",
  LCCN =         "QA297 .F5681",
  MRclass =      "65-01",
  MRnumber =     "MR0458783 (56 \#16983)",
  MRreviewer =   "Sven-{\AA}ke Gustafson",
  bibdate =      "Tue May 25 09:01:08 2010",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/moler-cleve-b.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  note =         "Cited in {\AA}ke Bj{\"o}rck's bibliography on least
                 squares, which is available by anonymous ftp from
                 \path=math.liu.se= in \path=pub/references=",
  price =        "US\$16.95",
  series =       "Prentice-Hall series in automatic computation",
  ZMnumber =     "0361.65002",
  acknowledgement = ack-nhfb,
  author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
  classmath =    "*65-01 Textbooks (numerical analysis) 68-01 Textbooks
                 (computer science)",
  keywords =     "Fortran (computer program language); numerical
                 analysis -- data processing",
  remark =       "Subroutines and exercises for the computer solution of
                 problems involving matrices, integrals, differential
                 equations, spline functions, zeros and extrema of
                 functions, least squares, and Monte Carlo techniques.",
  shorttableofcontents = "Preface / x \\
                 1: Introduction / 1 \\
                 2: Floating-point computation / 10 \\
                 3: Linear systems of equations / 30 \\
                 4: Interpolation / 63 \\
                 5: Numerical integration / 84 \\
                 6: Initial value problems in ordinary differential
                 equations / 110 \\
                 7: Solution of nonlinear equations / 156 \\
                 8: Optimization / 178 \\
                 9: Least squares and the singular value decomposition /
                 192 \\
                 10: Random number generation and Monte Carlo methods /
                 240 \\
                 References / 250 \\
                 Index / 255",
  subject =      "Numerical analysis; Data processing; Computer
                 programs; Problems, exercises, etc; FORTRAN (Computer
                 program language)",
  tableofcontents = "Preface / x \\ \\
                 \\
                 Introduction / 1 \\
                 1.1 Bibliography / 2 \\
                 1.2 About the programs in this book / 7 \\
                 Problems / 8 \\
                 \\
                 2 Floating-Point Computation / 10 \\
                 2.1 Floating-point numbers JO \\
                 2.2 Calculation of machine epsilon / 13 \\
                 2.3 An example of round-off error / 14 \\
                 2.4 Instability of certain algorithms / 16 \\
                 2.5 Sensitivity of certain problems / 17 \\
                 2.6 Solving quadratic equations / 20 \\
                 Problems / 23 \\
                 \\
                 3 Linear Systems of Equations \\
                 3.1 Linear systems for stored matrices / 32 \\
                 3.2 Condition of a matrix / 41 \\
                 3.3 Subroutines DECOMP and SOLVE / 48 \\
                 3.4 Large, sparse systems / 56 \\
                 Problems / 58 \\
                 \\
                 4 Interpolation / 63 \\
                 4.1 Polynomial interpolation / 64 \\
                 4.2 Evaluation of polynomials / 68 \\
                 4.3 An example, Runge's function / 69 \\
                 4.4 Spline interpolation / 70 \\
                 4.5 Subroutines SPLINE and SEYAL / 76 \\
                 Problems / 80 \\
                 \\
                 5 Numerical Integration / 84 \\
                 5.1 The rectangle and trapezoid rules / 85 \\
                 5.2 Spline quadrature / 89 \\
                 5.3 Simpson's rule / 91 \\
                 5.4 Adaptive quadrature routines / 92 \\
                 5.5 Subroutine QUANC8 / 97 \\
                 Problems / 106 \\
                 \\
                 6 Initial Value Problems in Ordinary Differential
                 Equations / 110 \\
                 6.1 The problem to be solved JJO \\
                 6.2 Numerical solutions / 112 \\
                 6.3 Errors / 114 \\
                 6.4 Methods / 119 \\
                 6.5 Stiff equations / 123 \\
                 6.6 Boundary value problems / 126 \\
                 6.7 Choice of a subroutine / 127 \\
                 6.8 Subroutine RKF45 / 129 \\
                 Problems / 148 \\
                 \\
                 7 Solution of Nonlinear Equations / 156 \\
                 7.1 Transcendental equations --- real roots / 156 \\
                 7.2 Subroutine ZEROIN / 161 \\
                 7.3 Transcendental equations --- complex roots / 167
                 \\
                 7.4 Zeros of polynomials / 168 \\
                 7.5 Nonlinear systems of equations / 169 \\
                 Problems / 171 \\
                 \\
                 8 Optimization / 178 \\
                 8.1 One-dimensional optimization / 179 \\
                 8.2 Subroutine FMIN / 182 \\
                 8.3 Optimization in many dimensions / 188 \\
                 Problems / 190 \\
                 \\
                 9 Least Squares and the Singular Value Decomposition /
                 192 \\
                 9.1 Least squares data fitting / 192 \\
                 9.2 Orthogonality and the SYD / 201 \\
                 9.3 Applications / 207 \\
                 9.4 Computing the decomposition / 218 \\
                 9.5 Subroutine SYD / 227 \\
                 Problems / 236 \\
                 \\
                 10 Random Number Generation and Monte Carlo Methods /
                 240 \\
                 1O.1 Generation of uniformly distributed numbers / 241
                 \\
                 10.2 Subroutine URAND / 245 \\
                 10.3 Sampling from other distributions / 247 \\
                 Problems / 248 \\
                 \\
                 References / 250 \\
                 \\
                 Index / 255",
}


bibtype: book
filename: master.bib
label: Forsyth:2012:ECS
author: Mark Forsyth
title: The Etymologicon: a Circular Stroll Through the Hidden Connections of the English Language
publisher: pub-BERKLEY-BOOKS
address: pub-BERKLEY-BOOKS:adr
pages: xvii + 279
year: 2012
ISBN: 0-425-26079-8 (paperback) OR 0425260798 (paperback)
ISBN13: 978-0-425-26079-1 (paperback) OR 9780425260791 (paperback)
LCCN: PE1574 .F67 2012
bibdate: Tue Feb 13 15:04:21 MST 2018
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2018.02.13 15:04:21 MST
abstract: Unauthorized guide to the underpinnings of the English language.
subject: English language; Etymology
acknowledgement: ack-nhfb
rawabstract: Unauthorized guide to the underpinnings of the English language.
rawauthor: Mark Forsyth
rawtitle: The Etymologicon: a Circular Stroll Through the Hidden Connections of the {English} Language
TOC:
A Turn-up for the Books A Game of Chicken Hydrogentlemanly The Old and New Testicle Parenthetical Codpieces Suffering for my Underwear Pans Miltonic Meanders Bloody Typical Semantic Shifts The Proof of the Pudding Sausage Poison in Your Face Bows and Arrows and Cats Black and White Hat Cheque Point Charlie Sex and Bread Concealed Farts Wool Turkey Insulting Foods Folk Etymology Butterflies of the World Psychoanalysis and the Release of the Butterfly The Villains of the Language Two Executioners and a Doctor Thomas Crapper Mythical Acronyms John the Baptist and The Sound of Music Organic, Organised, Organs Clipping Buffalo Antanaclasis China Coincidences and Patterns Frankly, My Dear Frankfurter Beastly Foreigners Pejoratives Ciao, Slave Driver Robots Terminators and Prejudice Terminators and Equators Equality In Ecuador Bogeys Bugbears and Bedbugs Von Munchausen's Computer SPAM (not spam) Heroin Morphing De Quincey and Shelley Star-Spangled Drinking Songs Torpedoes and Turtles From Mount Vernon to Portobello Road with a Hangover A Punch of Drinks The Scampering Champion of the Champagne Campaign Insulting Names Peter Pan Herbaceous Communication Papa Was a Saxum Volutum Flying Peters Venezuela and Venus and Venice What News on the Rialto? Magazines Dick Snary Autopeotomy Water Closets for Russia Fat Gunhilda Queen Gunhilda and the Gadgets Shell In a Nutshell The Iliad The Human Body The Five Fingers Hoax Bodies Bunking and Debunking The Anglo-Saxon Mystery The Sedge-Strewn Stream and Globalisation Coffee Cappuccino Monks Called to the Bar Ignorami Fossil-less The Frequentative Suffix Pending Worms and their Turnings Mathematics Stellafied and Oily Beavers Beards Islands Sandwich Islands The French Revolution in English Words Romance Languages Peripatetic Peoples From Bohemia to California (via Primrose Hill) California The Hash Guys Drugs Pleasing Psalms Biblical Errors Salt Halcyon Days Dog Days Cynical Dogs Greek Education and Fastchild Cybermen Turning Trix Amateur Lovers Dirty Money Death Pledges Wagering War Strapped for Cash Fast Bucks and Dead Ones The Buck Stops Here Back to Howth Castle and Environs

rawTOC:
A Turn-up for the Books \\ A Game of Chicken \\ Hydrogentlemanly \\ The Old and New Testicle \\ Parenthetical Codpieces \\ Suffering for my Underwear \\ Pans \\ Miltonic Meanders \\ Bloody Typical Semantic Shifts \\ The Proof of the Pudding \\ Sausage Poison in Your Face \\ Bows and Arrows and Cats \\ Black and White \\ Hat Cheque Point Charlie \\ Sex and Bread \\ Concealed Farts \\ Wool \\ Turkey \\ Insulting Foods \\ Folk Etymology \\ Butterflies of the World \\ Psychoanalysis and the Release of the Butterfly \\ The Villains of the Language \\ Two Executioners and a Doctor \\ Thomas Crapper \\ Mythical Acronyms \\ John the Baptist and The Sound of Music \\ Organic, Organised, Organs \\ Clipping \\ Buffalo \\ Antanaclasis \\ China \\ Coincidences and Patterns \\ Frankly, My Dear Frankfurter \\ Beastly Foreigners \\ Pejoratives \\ Ciao, Slave Driver \\ Robots \\ Terminators and Prejudice \\ Terminators and Equators \\ Equality In Ecuador \\ Bogeys \\ Bugbears and Bedbugs \\ Von Munchausen's Computer \\ SPAM (not spam) \\ Heroin \\ Morphing De Quincey and Shelley \\ Star-Spangled Drinking Songs \\ Torpedoes and Turtles \\ From Mount Vernon to Portobello Road with a Hangover \\ A Punch of Drinks \\ The Scampering Champion of the Champagne Campaign \\ Insulting Names \\ Peter Pan \\ Herbaceous Communication \\ Papa Was a Saxum Volutum \\ Flying Peters \\ Venezuela and Venus and Venice \\ What News on the Rialto? \\ Magazines \\ Dick Snary \\ Autopeotomy \\ Water Closets for Russia \\ Fat Gunhilda \\ Queen Gunhilda and the Gadgets \\ Shell \\ In a Nutshell \\ The Iliad \\ The Human Body \\ The Five Fingers \\ Hoax Bodies \\ Bunking and Debunking \\ The Anglo-Saxon Mystery \\ The Sedge-Strewn Stream and Globalisation \\ Coffee \\ Cappuccino Monks \\ Called to the Bar \\ Ignorami \\ Fossil-less \\ The Frequentative Suffix \\ Pending \\ Worms and their Turnings \\ Mathematics \\ Stellafied and Oily Beavers \\ Beards \\ Islands \\ Sandwich Islands \\ The French Revolution in English Words \\ Romance Languages \\ Peripatetic Peoples \\ From Bohemia to California (via Primrose Hill) \\ California \\ The Hash Guys \\ Drugs \\ Pleasing Psalms \\ Biblical Errors \\ Salt \\ Halcyon Days \\ Dog Days \\ Cynical Dogs \\ Greek Education and Fastchild \\ Cybermen \\ Turning Trix \\ Amateur Lovers \\ Dirty Money \\ Death Pledges \\ Wagering War \\ Strapped for Cash \\ Fast Bucks and Dead Ones \\ The Buck Stops Here \\ Back to Howth Castle and Environs

entry:
@Book{Forsyth:2012:ECS,
  author =       "Mark Forsyth",
  title =        "The Etymologicon: a Circular Stroll Through the Hidden
                 Connections of the {English} Language",
  publisher =    pub-BERKLEY-BOOKS,
  address =      pub-BERKLEY-BOOKS:adr,
  pages =        "xvii + 279",
  year =         "2012",
  ISBN =         "0-425-26079-8 (paperback)",
  ISBN-13 =      "978-0-425-26079-1 (paperback)",
  LCCN =         "PE1574 .F67 2012",
  bibdate =      "Tue Feb 13 15:04:21 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Unauthorized guide to the underpinnings of the English
                 language.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "English language; Etymology",
  tableofcontents = "A Turn-up for the Books \\
                 A Game of Chicken \\
                 Hydrogentlemanly \\
                 The Old and New Testicle \\
                 Parenthetical Codpieces \\
                 Suffering for my Underwear \\
                 Pans \\
                 Miltonic Meanders \\
                 Bloody Typical Semantic Shifts \\
                 The Proof of the Pudding \\
                 Sausage Poison in Your Face \\
                 Bows and Arrows and Cats \\
                 Black and White \\
                 Hat Cheque Point Charlie \\
                 Sex and Bread \\
                 Concealed Farts \\
                 Wool \\
                 Turkey \\
                 Insulting Foods \\
                 Folk Etymology \\
                 Butterflies of the World \\
                 Psychoanalysis and the Release of the Butterfly \\
                 The Villains of the Language \\
                 Two Executioners and a Doctor \\
                 Thomas Crapper \\
                 Mythical Acronyms \\
                 John the Baptist and The Sound of Music \\
                 Organic, Organised, Organs \\
                 Clipping \\
                 Buffalo \\
                 Antanaclasis \\
                 China \\
                 Coincidences and Patterns \\
                 Frankly, My Dear Frankfurter \\
                 Beastly Foreigners \\
                 Pejoratives \\
                 Ciao, Slave Driver \\
                 Robots \\
                 Terminators and Prejudice \\
                 Terminators and Equators \\
                 Equality In Ecuador \\
                 Bogeys \\
                 Bugbears and Bedbugs \\
                 Von Munchausen's Computer \\
                 SPAM (not spam) \\
                 Heroin \\
                 Morphing De Quincey and Shelley \\
                 Star-Spangled Drinking Songs \\
                 Torpedoes and Turtles \\
                 From Mount Vernon to Portobello Road with a Hangover
                 \\
                 A Punch of Drinks \\
                 The Scampering Champion of the Champagne Campaign \\
                 Insulting Names \\
                 Peter Pan \\
                 Herbaceous Communication \\
                 Papa Was a Saxum Volutum \\
                 Flying Peters \\
                 Venezuela and Venus and Venice \\
                 What News on the Rialto? \\
                 Magazines \\
                 Dick Snary \\
                 Autopeotomy \\
                 Water Closets for Russia \\
                 Fat Gunhilda \\
                 Queen Gunhilda and the Gadgets \\
                 Shell \\
                 In a Nutshell \\
                 The Iliad \\
                 The Human Body \\
                 The Five Fingers \\
                 Hoax Bodies \\
                 Bunking and Debunking \\
                 The Anglo-Saxon Mystery \\
                 The Sedge-Strewn Stream and Globalisation \\
                 Coffee \\
                 Cappuccino Monks \\
                 Called to the Bar \\
                 Ignorami \\
                 Fossil-less \\
                 The Frequentative Suffix \\
                 Pending \\
                 Worms and their Turnings \\
                 Mathematics \\
                 Stellafied and Oily Beavers \\
                 Beards \\
                 Islands \\
                 Sandwich Islands \\
                 The French Revolution in English Words \\
                 Romance Languages \\
                 Peripatetic Peoples \\
                 From Bohemia to California (via Primrose Hill) \\
                 California \\
                 The Hash Guys \\
                 Drugs \\
                 Pleasing Psalms \\
                 Biblical Errors \\
                 Salt \\
                 Halcyon Days \\
                 Dog Days \\
                 Cynical Dogs \\
                 Greek Education and Fastchild \\
                 Cybermen \\
                 Turning Trix \\
                 Amateur Lovers \\
                 Dirty Money \\
                 Death Pledges \\ Wagering War \\
                 Strapped for Cash \\
                 Fast Bucks and Dead Ones \\
                 The Buck Stops Here \\
                 Back to Howth Castle and Environs",
}


bibtype: book
filename: master.bib
label: Fosdick:1996:IHP
author: Lloyd D. Fosdick and Elizabeth R. Jessup and Carolyn J. C. Schauble and Gitta Domik
title: An Introduction to High-Performance Scientific Computing
publisher: pub-MIT
address: pub-MIT:adr
pages: xxiii + 760
year: 1996
ISBN: 0-262-06181-3 (hardcover) OR 0262061813 (hardcover)
ISBN13: 978-0-262-06181-0 (hardcover) OR 9780262061810 (hardcover)
LCCN: QA76 .A594 1996
bibdate: Sat Jun 15 09:38:02 1996
bibtimestamp: 1996.06.15 09:38:02 ???
remark: Covers IEEE arithmetic, UNIX, Fortran, MATLAB, IDL, and AVS.
acknowledgement: ack-nhfb
rawauthor: Lloyd D. Fosdick and Elizabeth R. Jessup and Carolyn J. C. Schauble and Gitta Domik
rawtitle: An Introduction to High-Performance Scientific Computing
bibsource:
https://www.math.utah.edu/pub/tex/bib/fortran3.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/matlab.bib

TOC:
An overview of scientific computing 1. Background A review of selected topics from numerical analysis IEEE arithmetic short reference UNIX, vi, and ftp: a quick review Elements of UNIX make Elements of Fortran 2. Tools Elements of Matlab Elements of IDL and AVS 3. Scientific visualization 4. Architectures Computer performance Vector computing Distributed-memory MIMD computing SIMD computing 5. Applications Molecular dynamics Advection Computerized tomography

rawTOC:
An overview of scientific computing \\ 1. Background \\ A review of selected topics from numerical analysis \\ IEEE arithmetic short reference \\ UNIX, vi, and ftp: a quick review \\ Elements of UNIX make \\ Elements of Fortran \\ 2. Tools \\ Elements of Matlab \\ Elements of IDL and AVS \\ 3. Scientific visualization \\ 4. Architectures \\ Computer performance \\ Vector computing \\ Distributed-memory MIMD computing \\ SIMD computing \\ 5. Applications \\ Molecular dynamics \\ Advection \\ Computerized tomography

entry:
@Book{Fosdick:1996:IHP,
  author =       "Lloyd D. Fosdick and Elizabeth R. Jessup and Carolyn
                 J. C. Schauble and Gitta Domik",
  title =        "An Introduction to High-Performance Scientific
                 Computing",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xxiii + 760",
  year =         "1996",
  ISBN =         "0-262-06181-3 (hardcover)",
  ISBN-13 =      "978-0-262-06181-0 (hardcover)",
  LCCN =         "QA76 .A594 1996",
  bibdate =      "Sat Jun 15 09:38:02 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran3.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/matlab.bib",
  price =        "US\$70.00",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  remark =       "Covers IEEE arithmetic, UNIX, Fortran, MATLAB, IDL,
                 and AVS.",
  tableofcontents = "An overview of scientific computing \\
                 1. Background \\
                 A review of selected topics from numerical analysis \\
                 IEEE arithmetic short reference \\
                 UNIX, vi, and ftp: a quick review \\
                 Elements of UNIX make \\
                 Elements of Fortran \\
                 2. Tools \\
                 Elements of Matlab \\
                 Elements of IDL and AVS \\
                 3. Scientific visualization \\
                 4. Architectures \\
                 Computer performance \\
                 Vector computing \\
                 Distributed-memory MIMD computing \\
                 SIMD computing \\
                 5. Applications \\
                 Molecular dynamics \\
                 Advection \\
                 Computerized tomography",
}


bibtype: book
filename: master.bib
label: Fosdick:2005:RPR
author: Howard Fosdick
title: Rexx programmer's reference
publisher: pub-WILEY
address: pub-WILEY:adr
pages: xxxiv + 686
year: 2005
ISBN: 0-7645-7996-7 (paperback), 0-7645-9695-0 (e-book) OR 0764579967 (paperback), 0764596950 (ebook)
LCCN: QA76.73.R24 F67 2005
bibdate: Tue Jun 28 15:47:52 MDT 2005
bibtimestamp: 2005.06.28 15:47:52 MDT
keywords: REXX (Restructured Extended Executor)
subject: REXX (Computer program language)
acknowledgement: ack-nhfb
rawauthor: Howard Fosdick
rawtitle: {Rexx} programmer's reference
ISBN13:
978-0-7645-7996-7 (paperback), 978-0-7645-9695-7 (e-book) OR 9780764579967 (paperback), 9780764596957 (ebook)

bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/rexx.bib; z3950.loc.gov:7090/Voyager

URL:
ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/; http://media.wiley.com/product_ancillary/67/07645799/DOWNLOAD/579967_appm.pdf; http://media.wiley.com/product_ancillary/67/07645799/DOWNLOAD/Rexx_Prgrs_Reference_scripts.zip; http://www.loc.gov/catdir/toc/ecip055/2004030560.html; http://www.wrox.com/WileyCDA/WroxTitle/productCd-0764579967,descCd-download_code.html

abstract:
Whether you're new to Rexx or are an experienced Rexx programmer, this comprehensive reference offers you what you need to know in order to work with this easy yet powerful scripting language on any level. After a quick overview of the basics of Rexx, you'll move on to more advanced scripting topics such as portable code and optimal coding style. This book is for programmers on any platform who are either looking to learn Rexx or already use it and want to expand their knowledge of Rexx. A basic knowledge of programming is assumed.

TOC:
Introduction to scripting and Rexx Language basics Control structures Arrays Input and output String manipulation Numbers, calculations and conversions Subroutines, functions, and modularity Debugging and the trace facility Errors and condition trapping The external data queue or ``stack'' Rexx with style Writing portable Rexx Issuing system commands Interfacing to relational databases Graphical user interfaces Web programming with CGI and Apache XML and other interfaces Evolution and implementations Regina Rexx/imc BRexx Reginald Handhelds and embedded programming Rexx for Palm OS r4 and object-oriented roo! Object Rexx Object Rexx tutorial IBM mainframe Rexx NetRexx

rawabstract:
Whether you're new to Rexx or are an experienced Rexx programmer, this comprehensive reference offers you what you need to know in order to work with this easy yet powerful scripting language on any level. After a quick overview of the basics of Rexx, you'll move on to more advanced scripting topics such as portable code and optimal coding style. This book is for programmers on any platform who are either looking to learn Rexx or already use it and want to expand their knowledge of Rexx. A basic knowledge of programming is assumed.

rawTOC:
Introduction to scripting and Rexx \\ Language basics \\ Control structures \\ Arrays \\ Input and output \\ String manipulation \\ Numbers, calculations and conversions \\ Subroutines, functions, and modularity \\ Debugging and the trace facility \\ Errors and condition trapping \\ The external data queue or ``stack'' \\ Rexx with style \\ Writing portable Rexx \\ Issuing system commands \\ Interfacing to relational databases \\ Graphical user interfaces \\ Web programming with CGI and Apache \\ XML and other interfaces \\ Evolution and implementations \\ Regina \\ Rexx/imc \\ BRexx \\ Reginald \\ Handhelds and embedded programming \\ Rexx for Palm OS \\ r4 and object-oriented roo! \\ Object Rexx \\ Object Rexx tutorial \\ IBM mainframe Rexx \\ NetRexx

entry:
@Book{Fosdick:2005:RPR,
  author =       "Howard Fosdick",
  title =        "{Rexx} programmer's reference",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xxxiv + 686",
  year =         "2005",
  ISBN =         "0-7645-7996-7 (paperback), 0-7645-9695-0 (e-book)",
  ISBN-13 =      "978-0-7645-7996-7 (paperback), 978-0-7645-9695-7
                 (e-book)",
  LCCN =         "QA76.73.R24 F67 2005",
  bibdate =      "Tue Jun 28 15:47:52 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/rexx.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/;
                 http://media.wiley.com/product_ancillary/67/07645799/DOWNLOAD/579967_appm.pdf;
                 http://media.wiley.com/product_ancillary/67/07645799/DOWNLOAD/Rexx_Prgrs_Reference_scripts.zip;
                 http://www.loc.gov/catdir/toc/ecip055/2004030560.html;
                 http://www.wrox.com/WileyCDA/WroxTitle/productCd-0764579967,descCd-download_code.html",
  abstract =     "Whether you're new to Rexx or are an experienced Rexx
                 programmer, this comprehensive reference offers you
                 what you need to know in order to work with this easy
                 yet powerful scripting language on any level. After a
                 quick overview of the basics of Rexx, you'll move on to
                 more advanced scripting topics such as portable code
                 and optimal coding style. This book is for programmers
                 on any platform who are either looking to learn Rexx or
                 already use it and want to expand their knowledge of
                 Rexx. A basic knowledge of programming is assumed.",
  acknowledgement = ack-nhfb,
  keywords =     "REXX (Restructured Extended Executor)",
  subject =      "REXX (Computer program language)",
  tableofcontents = "Introduction to scripting and Rexx \\
                 Language basics \\
                 Control structures \\
                 Arrays \\
                 Input and output \\
                 String manipulation \\
                 Numbers, calculations and conversions \\
                 Subroutines, functions, and modularity \\
                 Debugging and the trace facility \\
                 Errors and condition trapping \\
                 The external data queue or ``stack'' \\
                 Rexx with style \\
                 Writing portable Rexx \\
                 Issuing system commands \\
                 Interfacing to relational databases \\
                 Graphical user interfaces \\
                 Web programming with CGI and Apache \\
                 XML and other interfaces \\
                 Evolution and implementations \\
                 Regina \\
                 Rexx/imc \\
                 BRexx \\
                 Reginald \\
                 Handhelds and embedded programming \\
                 Rexx for Palm OS \\
                 r4 and object-oriented roo! \\
                 Object Rexx \\
                 Object Rexx tutorial \\
                 IBM mainframe Rexx \\
                 NetRexx",
}


bibtype: book
filename: master.bib
label: Fowler:1997:MMA
author: A. C. Fowler
title: Mathematical Models in the Applied Sciences
publisher: pub-CAMBRIDGE
address: pub-CAMBRIDGE:adr
pages: xiv + 402
year: 1997
LCCN: QA401 .F685 1997
bibdate: Sat Dec 24 11:53:05 MST 2005
bibsource: Amazon; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2005.12.24 11:53:05 MST
series: Cambridge Texts in Applied Mathematics
keywords: Mathematical models
acknowledgement: ack-nhfb
rawauthor: A. C. Fowler
rawtitle: Mathematical Models in the Applied Sciences
ISBN:
0-521-46140-5 (hardcover), 0-521-46703-9 (paperback) OR 0521461405 (hardcover), 0521467039 (paperback)

ISBN13:
978-0-521-46140-5 (hardcover), 978-0-521-46703-2 (paperback) OR 9780521461405 (hardcover), 9780521467032 (paperback)

URL:
http://www.loc.gov/catdir/description/cam028/97010390.html; http://www.loc.gov/catdir/toc/cam024/97010390.html

abstract:
Mathematical modelling is the basis of almost all applied mathematics. A `real-world' problem is dissected and phrased in a mathematical setting, allowing it to be simplified and ultimately solved. This book presents a thorough grounding in the techniques of modelling, and proceeds to explore a range of classical and continuum models from an impressive array of disciplines, including: biology, chemical engineering, fluid and solid mechanics, geophysics, medicine, and physics. It assumes only a basic mathematical grounding in calculus and analysis and will provide a wealth of examples for students of mathematics, engineering, and the range of applied sciences

TOC:
Mathematical modeling Nondimensionalization Asymptotics Perturbation methods Heat transfer Viscous flow Solid mechanics Electromagnetism Enzyme kinetics Belousov--Zhabotinskii reaction Spruce budworm infestations Chemical reactors Groundwater flow Convection in a porous medium River flow One-dimensional two-phase flow Alloy solidification Ice sheet dynamics Chemosensory respiratory control Frost heave in freezing soils

rawabstract:
Mathematical modelling is the basis of almost all applied mathematics. A `real-world' problem is dissected and phrased in a mathematical setting, allowing it to be simplified and ultimately solved. This book presents a thorough grounding in the techniques of modelling, and proceeds to explore a range of classical and continuum models from an impressive array of disciplines, including: biology, chemical engineering, fluid and solid mechanics, geophysics, medicine, and physics. It assumes only a basic mathematical grounding in calculus and analysis and will provide a wealth of examples for students of mathematics, engineering, and the range of applied sciences

rawTOC:
Mathematical modeling \\ Nondimensionalization \\ Asymptotics \\ Perturbation methods \\ Heat transfer \\ Viscous flow \\ Solid mechanics \\ Electromagnetism \\ Enzyme kinetics \\ Belousov--Zhabotinskii reaction \\ Spruce budworm infestations \\ Chemical reactors \\ Groundwater flow \\ Convection in a porous medium \\ River flow \\ One-dimensional two-phase flow \\ Alloy solidification \\ Ice sheet dynamics \\ Chemosensory respiratory control \\ Frost heave in freezing soils

entry:
@Book{Fowler:1997:MMA,
  author =       "A. C. Fowler",
  title =        "Mathematical Models in the Applied Sciences",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xiv + 402",
  year =         "1997",
  ISBN =         "0-521-46140-5 (hardcover), 0-521-46703-9 (paperback)",
  ISBN-13 =      "978-0-521-46140-5 (hardcover), 978-0-521-46703-2
                 (paperback)",
  LCCN =         "QA401 .F685 1997",
  bibdate =      "Sat Dec 24 11:53:05 MST 2005",
  bibsource =    "Amazon;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Cambridge Texts in Applied Mathematics",
  URL =          "http://www.loc.gov/catdir/description/cam028/97010390.html;
                 http://www.loc.gov/catdir/toc/cam024/97010390.html",
  abstract =     "Mathematical modelling is the basis of almost all
                 applied mathematics. A `real-world' problem is
                 dissected and phrased in a mathematical setting,
                 allowing it to be simplified and ultimately solved.
                 This book presents a thorough grounding in the
                 techniques of modelling, and proceeds to explore a
                 range of classical and continuum models from an
                 impressive array of disciplines, including: biology,
                 chemical engineering, fluid and solid mechanics,
                 geophysics, medicine, and physics. It assumes only a
                 basic mathematical grounding in calculus and analysis
                 and will provide a wealth of examples for students of
                 mathematics, engineering, and the range of applied
                 sciences",
  acknowledgement = ack-nhfb,
  bookformat =   "Paperback",
  category =     "Professional \& Technical; Professional Science;
                 Mathematics; Applied; General",
  DEWEY =        "511/.8 21",
  idnumber =     "533",
  keywords =     "Mathematical models",
  tableofcontents = "Mathematical modeling \\
                 Nondimensionalization \\
                 Asymptotics \\
                 Perturbation methods \\
                 Heat transfer \\
                 Viscous flow \\
                 Solid mechanics \\
                 Electromagnetism \\
                 Enzyme kinetics \\
                 Belousov--Zhabotinskii reaction \\
                 Spruce budworm infestations \\
                 Chemical reactors \\
                 Groundwater flow \\
                 Convection in a porous medium \\
                 River flow \\
                 One-dimensional two-phase flow \\
                 Alloy solidification \\
                 Ice sheet dynamics \\
                 Chemosensory respiratory control \\
                 Frost heave in freezing soils",
}


bibtype: article
filename: master.bib
label: Fox:1992:MPH
author: Edward A. Fox and Lenwood S. Heath and Qi Fan Chen and Amjad M. Daoud
title: Minimal Perfect Hash Functions for Large Databases
journal: j-CACM
volume: 35
number: 1
pages: 105--121
month: jan
monthnumber: 1
year: 1992
bibdate: Thu May 20 17:19:08 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.05.20 17:19:08 ???
acknowledgement: ack-nhfb
rawauthor: Edward A. Fox and Lenwood S. Heath and Qi Fan Chen and Amjad M. Daoud
rawtitle: Minimal Perfect Hash Functions for Large Databases
note:
This is the first published algorithm for computing minimal perfect hash functions for lists of millions of words; previous algorithms were computationally infeasible for more than a few hundred words.

rawnote:
This is the first published algorithm for computing minimal perfect hash functions for lists of millions of words; previous algorithms were computationally infeasible for more than a few hundred words.

entry:
@Article{Fox:1992:MPH,
  author =       "Edward A. Fox and Lenwood S. Heath and Qi Fan Chen and
                 Amjad M. Daoud",
  title =        "Minimal Perfect Hash Functions for Large Databases",
  journal =      j-CACM,
  volume =       "35",
  number =       "1",
  pages =        "105--121",
  month =        jan,
  year =         "1992",
  bibdate =      "Thu May 20 17:19:08 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "This is the first published algorithm for computing
                 minimal perfect hash functions for lists of millions of
                 words; previous algorithms were computationally
                 infeasible for more than a few hundred words.",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: master.bib
label: Foxley:music
author: Eric Foxley
title: Music: A Language for Typesetting Music Scores
journal: j-SPE
volume: 17
number: 8
pages: 485--502
month: aug
monthnumber: 8
year: 1987
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: Eric Foxley
rawtitle: Music: {A} Language for Typesetting Music Scores
entry:
@Article{Foxley:music,
  author =       "Eric Foxley",
  title =        "Music: {A} Language for Typesetting Music Scores",
  journal =      j-SPE,
  volume =       "17",
  number =       "8",
  pages =        "485--502",
  month =        aug,
  year =         "1987",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Frakes:1992:IRD
editor: William B. Frakes and Ricardo Baeza-Yates
title: Information Retrieval: Data Structures and Algorithms
publisher: pub-PH
address: pub-PH:adr
pages: viii + 504
year: 1992
ISBN: 0-13-463837-9 OR 0134638379
ISBN13: 978-0-13-463837-9 OR 9780134638379
LCCN: QA76.9.D351543 1992
bibdate: Wed May 18 19:05:15 1994
bibtimestamp: 1994.05.18 19:05:15 ???
acknowledgement: ack-nhfb
raweditor: William B. Frakes and Ricardo Baeza-Yates
rawtitle: Information Retrieval: Data Structures and Algorithms
bibsource:
https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib

TOC:
Introduction to information storage and retrieval systems / W. B. Frakes Introduction to data structures and algorithms related to information retrieval / R. S. Baeza-Yates Inverted files / D. Harman [and others] Signature files / C. Faloutsos New indices for text: PAT trees and PAT arrays / G. H. Gonnet, R. A. Baeza-Yates, T. Snider File organizations for optical disks / D. A. Ford, S. Christodoulakis Lexical analysis and stoplists / C. Fox Stemming algorithms / W. B. Frakes Thesaurus construction / P. Srinivasan String searching algorithms / R. A. Baeza-Yates Relevance feedback and other query modification techniques / D. Harman Boolean operations / S. Wartik Hashing algorithms / S. Wartik [and others] Ranking algorithms / D. Harman Extended Boolean models / E. Fox [and others] Clustering algorithms / E. Rasmussen Special-purpose hardware for information retrieval / L. Hollaar Parallel information retrieval algorithms / C. Stanfill

rawTOC:
Introduction to information storage and retrieval systems / W. B. Frakes \\ Introduction to data structures and algorithms related to information retrieval / R. S. Baeza-Yates \\ Inverted files / D. Harman [and others] \\ Signature files / C. Faloutsos \\ New indices for text: PAT trees and PAT arrays / G. H. Gonnet, R. A. Baeza-Yates, T. Snider \\ File organizations for optical disks / D. A. Ford, S. Christodoulakis \\ Lexical analysis and stoplists / C. Fox \\ Stemming algorithms / W. B. Frakes \\ Thesaurus construction / P. Srinivasan \\ String searching algorithms / R. A. Baeza-Yates \\ Relevance feedback and other query modification techniques / D. Harman \\ Boolean operations / S. Wartik \\ Hashing algorithms / S. Wartik [and others] \\ Ranking algorithms / D. Harman \\ Extended Boolean models / E. Fox [and others] \\ Clustering algorithms / E. Rasmussen \\ Special-purpose hardware for information retrieval / L. Hollaar \\ Parallel information retrieval algorithms / C. Stanfill

entry:
@Book{Frakes:1992:IRD,
  editor =       "William B. Frakes and Ricardo Baeza-Yates",
  title =        "Information Retrieval: Data Structures and
                 Algorithms",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "viii + 504",
  year =         "1992",
  ISBN =         "0-13-463837-9",
  ISBN-13 =      "978-0-13-463837-9",
  LCCN =         "QA76.9.D351543 1992",
  bibdate =      "Wed May 18 19:05:15 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  price =        "US\$56.00",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "Introduction to information storage and retrieval
                 systems / W. B. Frakes \\
                 Introduction to data structures and algorithms related
                 to information retrieval / R. S. Baeza-Yates \\
                 Inverted files / D. Harman [and others] \\
                 Signature files / C. Faloutsos \\
                 New indices for text: PAT trees and PAT arrays / G. H.
                 Gonnet, R. A. Baeza-Yates, T. Snider \\
                 File organizations for optical disks / D. A. Ford, S.
                 Christodoulakis \\
                 Lexical analysis and stoplists / C. Fox \\
                 Stemming algorithms / W. B. Frakes \\
                 Thesaurus construction / P. Srinivasan \\
                 String searching algorithms / R. A. Baeza-Yates \\
                 Relevance feedback and other query modification
                 techniques / D. Harman \\
                 Boolean operations / S. Wartik \\
                 Hashing algorithms / S. Wartik [and others] \\
                 Ranking algorithms / D. Harman \\
                 Extended Boolean models / E. Fox [and others] \\
                 Clustering algorithms / E. Rasmussen \\
                 Special-purpose hardware for information retrieval / L.
                 Hollaar \\
                 Parallel information retrieval algorithms / C.
                 Stanfill",
}


bibtype: book
filename: master.bib
label: Francis:1993:GSS
editor: Brian Francis and Mick Green and Clive Payne
title: The GLIM system: The Statistical System for Generalized Linear Interactive Modelling
publisher: pub-CLARENDON
address: pub-CLARENDON:adr
pages: xiv + 821
year: 1993
ISBN: 0-19-852231-2 OR 0198522312
ISBN13: 978-0-19-852231-7 OR 9780198522317
LCCN: QA279.G64 1993
bibdate: Tue Apr 11 10:59:14 2000
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2000.04.11 10:59:14 ???
note: Release 4 manual. Corrected reprint in 1994.
acknowledgement: ack-nhfb
raweditor: Brian Francis and Mick Green and Clive Payne
rawnote: Release 4 manual. Corrected reprint in 1994.
rawtitle: The {GLIM} system: The Statistical System for Generalized Linear Interactive Modelling
TOC:
The User Guide Introduction to GLIM The GLIM Language Data Definition and Input File Handling and Utilities Data Examination and Display Calculations on Data Macros Model Fitting and Assessment User-defined Models The Macro Library Differences between GLIM377 and GlIM4 The Modelling Guide Guide to Statistical Modelling with GLIM The Theory of Generalized Linear Models Applications of GLIM The Reference Guide The Language Data Structures The Directives Faults and Error Handling The PASS Facility Bibliography References Index

rawTOC:
The User Guide \\ Introduction to GLIM \\ The GLIM Language \\ Data Definition and Input \\ File Handling and Utilities \\ Data Examination and Display \\ Calculations on Data \\ Macros \\ Model Fitting and Assessment \\ User-defined Models \\ The Macro Library \\ Differences between GLIM377 and GlIM4 \\ The Modelling Guide \\ Guide to Statistical Modelling with GLIM \\ The Theory of Generalized Linear Models \\ Applications of GLIM \\ The Reference Guide \\ The Language \\ Data Structures \\ The Directives \\ Faults and Error Handling \\ The PASS Facility \\ Bibliography \\ References \\ Index

entry:
@Book{Francis:1993:GSS,
  editor =       "Brian Francis and Mick Green and Clive Payne",
  title =        "The {GLIM} system: The Statistical System for
                 Generalized Linear Interactive Modelling",
  publisher =    pub-CLARENDON,
  address =      pub-CLARENDON:adr,
  pages =        "xiv + 821",
  year =         "1993",
  ISBN =         "0-19-852231-2",
  ISBN-13 =      "978-0-19-852231-7",
  LCCN =         "QA279.G64 1993",
  bibdate =      "Tue Apr 11 10:59:14 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Release 4 manual. Corrected reprint in 1994.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "The User Guide \\
                 Introduction to GLIM \\
                 The GLIM Language \\
                 Data Definition and Input \\
                 File Handling and Utilities \\
                 Data Examination and Display \\
                 Calculations on Data \\
                 Macros \\
                 Model Fitting and Assessment \\
                 User-defined Models \\
                 The Macro Library \\
                 Differences between GLIM377 and GlIM4 \\
                 The Modelling Guide \\
                 Guide to Statistical Modelling with GLIM \\
                 The Theory of Generalized Linear Models \\
                 Applications of GLIM \\
                 The Reference Guide \\
                 The Language \\
                 Data Structures \\
                 The Directives \\
                 Faults and Error Handling \\
                 The PASS Facility \\
                 Bibliography \\
                 References \\
                 Index",
}


bibtype: book
filename: master.bib
label: Francois:1964:PCO
author: E. Francois
title: Precis de Chimie Organique
publisher: Editions de l'Enseignement, Editions Universitaires
address: Bruxelles, Belgique
pages: 94
year: 1964
bibdate: Sat Jul 25 13:55:27 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.07.25 13:55:27 ???
acknowledgement: ack-nhfb
rawauthor: E. Fran{\c{c}}ois
rawtitle: Pr{\'e}cis de Chimie Organique
entry:
@Book{Francois:1964:PCO,
  author =       "E. Fran{\c{c}}ois",
  title =        "Pr{\'e}cis de Chimie Organique",
  publisher =    "{\'E}ditions de l'Enseignement, {\'E}ditions
                 Universitaires",
  address =      "Bruxelles, Belgique",
  pages =        "94",
  year =         "1964",
  LCCN =         "????",
  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: Frankel:1964:TIO
author: Max Frankel and Saul Patai and Albert Zhilkha and Zvi Rappoport and Robert Farkas-Kadmon
title: Tables for Identification of Organic Compounds
publisher: pub-CRC
address: pub-CRC:adr
pages: x + 299
year: 1964
LCCN: QD291 .T3 1964
bibdate: Sat Jul 25 13:55:27 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.07.25 13:55:27 ???
acknowledgement: ack-nhfb
rawauthor: Max Frankel and Saul Patai and Albert Zhilkha and Zvi Rappoport and Robert Farkas-Kadmon
rawtitle: Tables for Identification of Organic Compounds
entry:
@Book{Frankel:1964:TIO,
  author =       "Max Frankel and Saul Patai and Albert Zhilkha and Zvi
                 Rappoport and Robert Farkas-Kadmon",
  title =        "Tables for Identification of Organic Compounds",
  publisher =    pub-CRC,
  address =      pub-CRC:adr,
  pages =        "x + 299",
  year =         "1964",
  LCCN =         "QD291 .T3 1964",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Fraser:1995:RCC
author: Chris W. Fraser and David R. Hanson
title: A Retargetable C Compiler: Design and Implementation
publisher: pub-BENCUM
address: pub-BENCUM:adr
pages: xv + 564
year: 1995
ISBN: 0-8053-1670-1 OR 0805316701
ISBN13: 978-0-8053-1670-4 OR 9780805316704
LCCN: QA76.73.C15F75 1995
bibdate: Wed Feb 08 10:55:34 1995
bibtimestamp: 1995.02.08 10:55:34 ???
acknowledgement: ack-nhfb
rawauthor: Chris W. Fraser and David R. Hanson
rawtitle: A Retargetable {C} Compiler: Design and Implementation
bibsource:
https://www.math.utah.edu/pub/tex/bib/lcc.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/texbook2.bib

note:
From the authors' announcement: ``ldots this book is an example of a `literate program.' Like em TeX : The Program by D. E. Knuth (Addison-Wesley, 1986), this book is lcc's source code and the prose that describes it. The code is presented in the order that best suits understanding, not in the order dictated by the C programming language. The source code that appears on the diskette is extracted automatically from the book's text files. ldots The distribution is available via `anonymous' ftp from path =ftp.cs.princeton.edu= path =(128.112.152.13)= in the directory path =pub/lcc=. ldots Additional information about lcc and about our book is available on the WWW at URL path =http://www.cs.princeton.edu/software/lcc=.''

URL:
https://www.pearson.com/us/higher-education/program/Hanson-Retargetable-C-Compiler-A-Design-and-Implementation/PGM166351.html

abstract:
This new text examines the design and implementation of lcc, a production-quality, retargetable compiler, designed at AT&T Bell Laboratories and Princeton University for the ANSI C programming language. The authors' innovative approach --- a ``literate program'' that intermingles the text with the source code --- gives a detailed tour of the code that explains the implementation and design decisions reflected in the software. And while most books describe toy compilers or focus on isolated pieces of code, the authors have made available the entire source code for a real compiler. Structured as a self-study guide that describes the real-world tradeoffs encountered in building a production-quality compiler, A Retargetable C Compiler is also useful to individuals who work in application areas using or creating language-based tools and techniques. Features: discusses the implementation and design tradeoffs made while constructing a real ANSI C compiler, illustrating the interaction between theory and practice; covers compiler theory only as needed to understand the implementation of lcc, focusing instead on practical, applied issues; encourages a deeper understanding of programming in C, by providing C programmers with a tour of the language from the perspective of compiler authors; includes coverage of code generators for the MIPS R3000, SPARC, and Intel 386 and its successors; and provides access to the full source code for the lcc compiler, the three back ends, and the code-generator generator, either on disk or via FTP.

TOC:
1. Introduction: Literate Programs How to Read This Book Overview Design Common Declarations Syntax Specifications Errors 2. Storage Management: Memory Management Interface Arena Representation Allocating Space Deallocating Space Strings 3. Types: Representing Symbols Representing Symbol Tables Changing Scope Finding and Installing Identifiers Labels Constants Generated Variables 4. Code Generation Interface: Representing Types Type Management Type Predicates Type Constructors Function Types Structure and Enumeration Types Type-Checking Functions Type Mapping 5. Lexical Analysis: Type Metrics Interface Records Symbols Types Dag Operators Interface Flags Initialization Definitions Constants Functions Interface Binding Upcalls 6. Parsing: Input Recognizing Tokens Recognizing Keywords Recognizing Identifiers Recognizing Numbers Recognizing Character Constants and Strings 7. Expressions Languages and Grammars Ambiguity and Parse Trees Top-Down Parsing FIRST and FOLLOW Sets Writing Parsing Functions Handling Syntax Errors 8. Expressions: Representing Expressions Parsing Expressions Parsing C Expressions Assignment Expressions Conditional Expressions Binary Expressions Unary and Postfix Expressions Primary Expressions 9. Expression Semantics: Conversions Unary and Postfix Operators Function Calls Binary Operators Assignments Conditionals Constant Folding 10. Statements: Representing Code Execution Points Recognizing Statements If Statements Labels and Gotos Loops Switch Statements Return Statements Managing Labels and Jumps 11. Declarations: Translation Units Declarations Declarators Function Declarators Structure Specifiers Function Definitions Compound Statements Finalization The Main Program 12. Generating Immediate Code: Eliminating Common Subexpressions Building Nodes Flow of Control Assignments Function Calls Enforcing Evaluation Order Driving Code Generation Eliminating Multiply Referenced Nodes 13. Structuring the Code Generator: Organization of the Code Generator Interface Extensions Upcalls Node Extensions Symbol Extensions Frame Layout Generating Code to Copy Blocks Initialization 14. Selecting and Emitting instructions: Specifications Labelling the Tree Reducing the Tree Cost Functions Debugging The Emitter Register Targeting Coordinating Instruction Selection Shared Rules Writing Specifications 15. Register Allocation: Organization Tracking the Register State Allocating Registers Spilling 16. Generating MIPS R3000 Code: Registers Selecting Instructions Implementing Functions Defining Data Segments Copying Blocks 17. Generating SPARC Code: Registers Selecting Instructions Implementing Functions Defining Data Copying Blocks, 18. Generating X86 Code: Registers Selecting Instructions Implementing Functions Defining Data 19. Retrospective: Data Structures Interface Syntactic and Semantic Analyses Code Generation and Optimization Testing and Validation

rawabstract:
This new text examines the design and implementation of lcc, a production-quality, retargetable compiler, designed at AT\&T Bell Laboratories and Princeton University for the ANSI C programming language. The authors' innovative approach --- a ``literate program'' that intermingles the text with the source code --- gives a detailed tour of the code that explains the implementation and design decisions reflected in the software. And while most books describe toy compilers or focus on isolated pieces of code, the authors have made available the entire source code for a real compiler. Structured as a self-study guide that describes the real-world tradeoffs encountered in building a production-quality compiler, A Retargetable C Compiler is also useful to individuals who work in application areas using or creating language-based tools and techniques. Features: discusses the implementation and design tradeoffs made while constructing a real ANSI C compiler, illustrating the interaction between theory and practice; covers compiler theory only as needed to understand the implementation of lcc, focusing instead on practical, applied issues; encourages a deeper understanding of programming in C, by providing C programmers with a tour of the language from the perspective of compiler authors; includes coverage of code generators for the MIPS R3000, SPARC, and Intel 386 and its successors; and provides access to the full source code for the lcc compiler, the three back ends, and the code-generator generator, either on disk or via FTP.

rawnote:
From the authors' announcement: ``\ldots this book is an example of a `literate program.' Like {\em {\TeX}: The Program\/} by D. E. Knuth (Addison-Wesley, 1986), this book is lcc's source code and the prose that describes it. The code is presented in the order that best suits understanding, not in the order dictated by the C programming language. The source code that appears on the diskette is extracted automatically from the book's text files. \ldots{} The distribution is available via `anonymous' ftp from \path=ftp.cs.princeton.edu= \path=(128.112.152.13)= in the directory \path=pub/lcc=. \ldots{} Additional information about lcc and about our book is available on the WWW at URL \path=http://www.cs.princeton.edu/software/lcc=.''

rawTOC:
1. Introduction: Literate Programs \\ How to Read This Book \\ Overview \\ Design \\ Common Declarations \\ Syntax Specifications \\ Errors \\ 2. Storage Management: Memory Management Interface \\ Arena Representation \\ Allocating Space \\ Deallocating Space \\ Strings \\ 3. Types: Representing Symbols \\ Representing Symbol Tables \\ Changing Scope \\ Finding and Installing Identifiers \\ Labels \\ Constants \\ Generated Variables \\ 4. Code Generation Interface: Representing Types \\ Type Management \\ Type Predicates \\ Type Constructors \\ Function Types \\ Structure and Enumeration Types \\ Type-Checking Functions \\ Type Mapping \\ 5. Lexical Analysis: Type Metrics \\ Interface Records \\ Symbols \\ Types \\ Dag Operators \\ Interface Flags \\ Initialization \\ Definitions \\ Constants \\ Functions \\ Interface Binding \\ Upcalls \\ 6. Parsing: Input \\ Recognizing Tokens \\ Recognizing Keywords \\ Recognizing Identifiers \\ Recognizing Numbers \\ Recognizing Character Constants and Strings \\ 7. Expressions \\ Languages and Grammars \\ Ambiguity and Parse Trees \\ Top-Down Parsing \\ FIRST and FOLLOW Sets \\ Writing Parsing Functions \\ Handling Syntax Errors \\ 8. Expressions: Representing Expressions \\ Parsing Expressions \\ Parsing C Expressions \\ Assignment Expressions \\ Conditional Expressions \\ Binary Expressions \\ Unary and Postfix Expressions \\ Primary Expressions \\ 9. Expression Semantics: Conversions \\ Unary and Postfix Operators \\ Function Calls \\ Binary Operators \\ Assignments \\ Conditionals \\ Constant Folding \\ 10. Statements: Representing Code \\ Execution Points \\ Recognizing Statements \\ If Statements \\ Labels and Gotos \\ Loops \\ Switch Statements \\ Return Statements \\ Managing Labels and Jumps \\ 11. Declarations: Translation Units \\ Declarations \\ Declarators \\ Function Declarators \\ Structure Specifiers \\ Function Definitions \\ Compound Statements \\ Finalization \\ The Main Program \\ 12. Generating Immediate Code: Eliminating Common Subexpressions \\ Building Nodes \\ Flow of Control \\ Assignments \\ Function Calls \\ Enforcing Evaluation Order \\ Driving Code Generation \\ Eliminating Multiply Referenced Nodes \\ 13. Structuring the Code Generator: Organization of the Code Generator \\ Interface Extensions \\ Upcalls \\ Node Extensions \\ Symbol Extensions \\ Frame Layout \\ Generating Code to Copy Blocks \\ Initialization \\ 14. Selecting and Emitting instructions: Specifications \\ Labelling the Tree \\ Reducing the Tree \\ Cost Functions \\ Debugging \\ The Emitter \\ Register Targeting \\ Coordinating Instruction Selection \\ Shared Rules \\ Writing Specifications \\ 15. Register Allocation: Organization \\ Tracking the Register State \\ Allocating Registers \\ Spilling \\ 16. Generating MIPS R3000 Code: Registers \\ Selecting Instructions \\ Implementing Functions \\ Defining Data \\ Segments \\ Copying Blocks \\ 17. Generating SPARC Code: Registers \\ Selecting Instructions \\ Implementing Functions \\ Defining Data \\ Copying Blocks, 18. Generating X86 Code: Registers \\ Selecting Instructions \\ Implementing Functions \\ Defining Data \\ 19. Retrospective: Data Structures \\ Interface \\ Syntactic and Semantic Analyses \\ Code Generation and Optimization \\ Testing and Validation

entry:
@Book{Fraser:1995:RCC,
  author =       "Chris W. Fraser and David R. Hanson",
  title =        "A Retargetable {C} Compiler: Design and
                 Implementation",
  publisher =    pub-BENCUM,
  address =      pub-BENCUM:adr,
  pages =        "xv + 564",
  year =         "1995",
  ISBN =         "0-8053-1670-1",
  ISBN-13 =      "978-0-8053-1670-4",
  LCCN =         "QA76.73.C15F75 1995",
  bibdate =      "Wed Feb 08 10:55:34 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/lcc.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/texbook2.bib",
  note =         "From the authors' announcement: ``\ldots this book is
                 an example of a `literate program.' Like {\em {\TeX}:
                 The Program\/} by D. E. Knuth (Addison-Wesley, 1986),
                 this book is lcc's source code and the prose that
                 describes it. The code is presented in the order that
                 best suits understanding, not in the order dictated by
                 the C programming language. The source code that
                 appears on the diskette is extracted automatically from
                 the book's text files. \ldots{} The distribution is
                 available via `anonymous' ftp from
                 \path=ftp.cs.princeton.edu= \path=(128.112.152.13)= in
                 the directory \path=pub/lcc=. \ldots{} Additional
                 information about lcc and about our book is available
                 on the WWW at URL
                 \path=http://www.cs.princeton.edu/software/lcc=.''",
  price =        "US\$55.95",
  URL =          "https://www.pearson.com/us/higher-education/program/Hanson-Retargetable-C-Compiler-A-Design-and-Implementation/PGM166351.html",
  abstract =     "This new text examines the design and implementation
                 of lcc, a production-quality, retargetable compiler,
                 designed at AT\&T Bell Laboratories and Princeton
                 University for the ANSI C programming language. The
                 authors' innovative approach --- a ``literate program''
                 that intermingles the text with the source code ---
                 gives a detailed tour of the code that explains the
                 implementation and design decisions reflected in the
                 software. And while most books describe toy compilers
                 or focus on isolated pieces of code, the authors have
                 made available the entire source code for a real
                 compiler. Structured as a self-study guide that
                 describes the real-world tradeoffs encountered in
                 building a production-quality compiler, A Retargetable
                 C Compiler is also useful to individuals who work in
                 application areas using or creating language-based
                 tools and techniques. Features: discusses the
                 implementation and design tradeoffs made while
                 constructing a real ANSI C compiler, illustrating the
                 interaction between theory and practice; covers
                 compiler theory only as needed to understand the
                 implementation of lcc, focusing instead on practical,
                 applied issues; encourages a deeper understanding of
                 programming in C, by providing C programmers with a
                 tour of the language from the perspective of compiler
                 authors; includes coverage of code generators for the
                 MIPS R3000, SPARC, and Intel 386 and its successors;
                 and provides access to the full source code for the lcc
                 compiler, the three back ends, and the code-generator
                 generator, either on disk or via FTP.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1. Introduction: Literate Programs \\
                 How to Read This Book \\
                 Overview \\
                 Design \\
                 Common Declarations \\
                 Syntax Specifications \\
                 Errors \\
                 2. Storage Management: Memory Management Interface \\
                 Arena Representation \\
                 Allocating Space \\
                 Deallocating Space \\
                 Strings \\
                 3. Types: Representing Symbols \\
                 Representing Symbol Tables \\
                 Changing Scope \\
                 Finding and Installing Identifiers \\
                 Labels \\
                 Constants \\
                 Generated Variables \\
                 4. Code Generation Interface: Representing Types \\
                 Type Management \\
                 Type Predicates \\
                 Type Constructors \\
                 Function Types \\
                 Structure and Enumeration Types \\
                 Type-Checking Functions \\
                 Type Mapping \\
                 5. Lexical Analysis: Type Metrics \\
                 Interface Records \\
                 Symbols \\
                 Types \\
                 Dag Operators \\
                 Interface Flags \\
                 Initialization \\
                 Definitions \\
                 Constants \\
                 Functions \\
                 Interface Binding \\
                 Upcalls \\
                 6. Parsing: Input \\
                 Recognizing Tokens \\
                 Recognizing Keywords \\
                 Recognizing Identifiers \\
                 Recognizing Numbers \\
                 Recognizing Character Constants and Strings \\
                 7. Expressions \\
                 Languages and Grammars \\
                 Ambiguity and Parse Trees \\
                 Top-Down Parsing \\
                 FIRST and FOLLOW Sets \\
                 Writing Parsing Functions \\
                 Handling Syntax Errors \\
                 8. Expressions: Representing Expressions \\
                 Parsing Expressions \\
                 Parsing C Expressions \\
                 Assignment Expressions \\
                 Conditional Expressions \\
                 Binary Expressions \\
                 Unary and Postfix Expressions \\
                 Primary Expressions \\
                 9. Expression Semantics: Conversions \\
                 Unary and Postfix Operators \\
                 Function Calls \\
                 Binary Operators \\
                 Assignments \\
                 Conditionals \\
                 Constant Folding \\
                 10. Statements: Representing Code \\
                 Execution Points \\
                 Recognizing Statements \\
                 If Statements \\
                 Labels and Gotos \\
                 Loops \\
                 Switch Statements \\
                 Return Statements \\
                 Managing Labels and Jumps \\
                 11. Declarations: Translation Units \\
                 Declarations \\
                 Declarators \\
                 Function Declarators \\
                 Structure Specifiers \\
                 Function Definitions \\
                 Compound Statements \\
                 Finalization \\
                 The Main Program \\
                 12. Generating Immediate Code: Eliminating Common
                 Subexpressions \\
                 Building Nodes \\
                 Flow of Control \\
                 Assignments \\
                 Function Calls \\
                 Enforcing Evaluation Order \\
                 Driving Code Generation \\
                 Eliminating Multiply Referenced Nodes \\
                 13. Structuring the Code Generator: Organization of the
                 Code Generator \\
                 Interface Extensions \\
                 Upcalls \\
                 Node Extensions \\
                 Symbol Extensions \\
                 Frame Layout \\
                 Generating Code to Copy Blocks \\
                 Initialization \\
                 14. Selecting and Emitting instructions: Specifications
                 \\
                 Labelling the Tree \\
                 Reducing the Tree \\
                 Cost Functions \\
                 Debugging \\
                 The Emitter \\
                 Register Targeting \\
                 Coordinating Instruction Selection \\
                 Shared Rules \\
                 Writing Specifications \\
                 15. Register Allocation: Organization \\
                 Tracking the Register State \\
                 Allocating Registers \\
                 Spilling \\
                 16. Generating MIPS R3000 Code: Registers \\
                 Selecting Instructions \\
                 Implementing Functions \\
                 Defining Data \\
                 Segments \\
                 Copying Blocks \\
                 17. Generating SPARC Code: Registers \\
                 Selecting Instructions \\
                 Implementing Functions \\
                 Defining Data \\
                 Copying Blocks, 18. Generating X86 Code: Registers \\
                 Selecting Instructions \\
                 Implementing Functions \\
                 Defining Data \\
                 19. Retrospective: Data Structures \\
                 Interface \\
                 Syntactic and Semantic Analyses \\
                 Code Generation and Optimization \\
                 Testing and Validation",
}


bibtype: book
filename: master.bib
label: French:1968:SR
author: A. P. French
title: Special Relativity
publisher: pub-NORTON
address: pub-NORTON:adr
pages: x + 286
year: 1968
LCCN: QC6 .F68
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 ???
series: The M.I.T. Introductory Physics Series
acknowledgement: ack-nhfb
rawauthor: A. P. French
rawtitle: Special Relativity
entry:
@Book{French:1968:SR,
  author =       "A. P. French",
  title =        "Special Relativity",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "x + 286",
  year =         "1968",
  LCCN =         "QC6 .F68",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "The M.I.T. Introductory Physics Series",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: French:1971:NM
author: A. P. French
title: Newtonian Mechanics
publisher: pub-NORTON
address: pub-NORTON:adr
pages: xiii + 743
year: 1971
LCCN: QC125.2 .F74
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 ???
series: The M.I.T. Introductory Physics Series
acknowledgement: ack-nhfb
rawauthor: A. P. French
rawtitle: {Newtonian} Mechanics
ISBN:
0-393-09958-X (hardcover), 0-393-09970-9 (paperback) OR 039309958X (hardcover), 0393099709 (paperback)

ISBN13:
978-0-393-09958-4 (hardcover), 978-0-393-09970-6 (paperback) OR 9780393099584 (hardcover), 9780393099706 (paperback)

abstract:
A rough guide to the possible use of the book is suggested by its division into three parts. Part I, The Approach to Newtonian Dynamics, is intended to serve two purposes. First, it does discuss the basic concepts of kinematics and dynamics, more or less from scratch. Second, it seeks to place the study of mechanics squarely in the context of the world of physical phenomena and of necessarily imperfect physical theories. Part II, Classical Mechanics at Work, is undoubtedly the heart of the book. The initial emphasis is on Newton's second law applied to individual objects. Later, the emphasis shifts to systems of two or more particles, and to the conservation laws for momentum and energy. A fairly lengthy chapter is devoted to the subject that deserves pride of place in the whole Newtonian scheme-the theory of universal gravitation and its successes, which can still be appreciated as a pinnacle in man's attempts to discover order in the vast universe in which he finds himself. Part III, Some Special Topics, concerns itself with the problems of noninertial frames, central-force motions, and rotational dynamics.

TOC:
Part One: The approach to Newtonian Dynamics A universe of particles Space, time, and motion Accelerated motions Forces and equilibrium The various forces of nature Force, inertia, and motion Part Two: Classical mechanics at work Using Newton's law Universal gravitation Collisions and conservation laws Energy conservation in dynamics; vibrational motions Conservative forces and motion in space Part Three: Some special topics Inertial forces and non-inertial frames Motion under central forces Extended systems and rotational dynamics

rawabstract:
A rough guide to the possible use of the book is suggested by its division into three parts. Part I, The Approach to Newtonian Dynamics, is intended to serve two purposes. First, it does discuss the basic concepts of kinematics and dynamics, more or less from scratch. Second, it seeks to place the study of mechanics squarely in the context of the world of physical phenomena and of necessarily imperfect physical theories. Part II, Classical Mechanics at Work, is undoubtedly the heart of the book. The initial emphasis is on Newton's second law applied to individual objects. Later, the emphasis shifts to systems of two or more particles, and to the conservation laws for momentum and energy. A fairly lengthy chapter is devoted to the subject that deserves pride of place in the whole Newtonian scheme-the theory of universal gravitation and its successes, which can still be appreciated as a pinnacle in man's attempts to discover order in the vast universe in which he finds himself. Part III, Some Special Topics, concerns itself with the problems of noninertial frames, central-force motions, and rotational dynamics.

rawTOC:
Part One: The approach to Newtonian Dynamics \\ A universe of particles \\ Space, time, and motion \\ Accelerated motions \\ Forces and equilibrium \\ The various forces of nature \\ Force, inertia, and motion \\ Part Two: Classical mechanics at work \\ Using Newton's law \\ Universal gravitation \\ Collisions and conservation laws \\ Energy conservation in dynamics; vibrational motions \\ Conservative forces and motion in space \\ Part Three: Some special topics \\ Inertial forces and non-inertial frames \\ Motion under central forces \\ Extended systems and rotational dynamics

entry:
@Book{French:1971:NM,
  author =       "A. P. French",
  title =        "{Newtonian} Mechanics",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "xiii + 743",
  year =         "1971",
  ISBN =         "0-393-09958-X (hardcover), 0-393-09970-9 (paperback)",
  ISBN-13 =      "978-0-393-09958-4 (hardcover), 978-0-393-09970-6
                 (paperback)",
  LCCN =         "QC125.2 .F74",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "The M.I.T. Introductory Physics Series",
  abstract =     "A rough guide to the possible use of the book is
                 suggested by its division into three parts. Part I, The
                 Approach to Newtonian Dynamics, is intended to serve
                 two purposes. First, it does discuss the basic concepts
                 of kinematics and dynamics, more or less from scratch.
                 Second, it seeks to place the study of mechanics
                 squarely in the context of the world of physical
                 phenomena and of necessarily imperfect physical
                 theories. Part II, Classical Mechanics at Work, is
                 undoubtedly the heart of the book. The initial emphasis
                 is on Newton's second law applied to individual
                 objects. Later, the emphasis shifts to systems of two
                 or more particles, and to the conservation laws for
                 momentum and energy. A fairly lengthy chapter is
                 devoted to the subject that deserves pride of place in
                 the whole Newtonian scheme-the theory of universal
                 gravitation and its successes, which can still be
                 appreciated as a pinnacle in man's attempts to discover
                 order in the vast universe in which he finds himself.
                 Part III, Some Special Topics, concerns itself with the
                 problems of noninertial frames, central-force motions,
                 and rotational dynamics.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Part One: The approach to Newtonian Dynamics \\
                 A universe of particles \\
                 Space, time, and motion \\
                 Accelerated motions \\
                 Forces and equilibrium \\
                 The various forces of nature \\
                 Force, inertia, and motion \\
                 Part Two: Classical mechanics at work \\
                 Using Newton's law \\
                 Universal gravitation \\
                 Collisions and conservation laws \\
                 Energy conservation in dynamics; vibrational motions
                 \\
                 Conservative forces and motion in space \\
                 Part Three: Some special topics \\
                 Inertial forces and non-inertial frames \\
                 Motion under central forces \\
                 Extended systems and rotational dynamics",
}


bibtype: book
filename: master.bib
label: Frey:1989:VDE
author: Donnalyn Frey and Rick Adams
title: verb |!%@|:: a Directory of Electronic Mail Addressing and Networks
publisher: pub-ORA
address: pub-ORA:adr
pages: xv + 284
year: 1989
ISBN: 0-937175-39-0 OR 0937175390
ISBN13: 978-0-937175-39-2 OR 9780937175392
LCCN: HE6239.E54 F73 1989
bibdate: Tue Dec 14 22:52:54 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:52:54 ???
acknowledgement: ack-nhfb
rawauthor: Donnalyn Frey and Rick Adams
rawtitle: \verb|!%@|:: a Directory of Electronic Mail Addressing and Networks
entry:
@Book{Frey:1989:VDE,
  author =       "Donnalyn Frey and Rick Adams",
  title =        "\verb|!%@|:: a Directory of Electronic Mail Addressing
                 and Networks",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xv + 284",
  year =         "1989",
  ISBN =         "0-937175-39-0",
  ISBN-13 =      "978-0-937175-39-2",
  LCCN =         "HE6239.E54 F73 1989",
  bibdate =      "Tue Dec 14 22:52:54 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Friedlander:1964:NR
author: Gerhart Friedlander and Joseph W. Kennedy and Julian Malcolm Miller
title: Nuclear and Radiochemistry
publisher: pub-WILEY
address: pub-WILEY:adr
edition: Second
pages: xi + 585
year: 1964
LCCN: QD601 .F71 1964
bibdate: Sat Jul 25 13:55:27 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.07.25 13:55:27 ???
acknowledgement: ack-nhfb
rawauthor: Gerhart Friedlander and Joseph W. Kennedy and Julian Malcolm Miller
rawtitle: Nuclear and Radiochemistry
entry:
@Book{Friedlander:1964:NR,
  author =       "Gerhart Friedlander and Joseph W. Kennedy and Julian
                 Malcolm Miller",
  title =        "Nuclear and Radiochemistry",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  edition =      "Second",
  pages =        "xi + 585",
  year =         "1964",
  LCCN =         "QD601 .F71 1964",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Friedman:1965:CA
author: Francis L. Friedman and Leo Sartori
title: The Classical Atom
volume: 1
publisher: pub-AW
address: pub-AW:adr
pages: ix + 118
year: 1965
LCCN: QC 173 F914c
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 ???
series: Origins of Quantum Physics
acknowledgement: ack-nhfb
rawauthor: Francis L. Friedman and Leo Sartori
rawtitle: The Classical Atom
entry:
@Book{Friedman:1965:CA,
  author =       "Francis L. Friedman and Leo Sartori",
  title =        "The Classical Atom",
  volume =       "1",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "ix + 118",
  year =         "1965",
  LCCN =         "QC 173 F914c",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Origins of Quantum Physics",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Friedman:1987:LL
author: Daniel Friedman and Matthias Felleisen
title: The Little LISPer
publisher: pub-MIT
address: pub-MIT:adr
pages: xiv + 186
year: 1987
ISBN: 0-262-56038-0 OR 0262560380
ISBN13: 978-0-262-56038-2 OR 9780262560382
LCCN: QA76.73.L23 F74 1987
bibdate: Tue Dec 14 22:52:59 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:52:59 ???
acknowledgement: ack-nhfb
rawauthor: Daniel Friedman and Matthias Felleisen
rawtitle: The Little {LISPer}
entry:
@Book{Friedman:1987:LL,
  author =       "Daniel Friedman and Matthias Felleisen",
  title =        "The Little {LISPer}",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xiv + 186",
  year =         "1987",
  ISBN =         "0-262-56038-0",
  ISBN-13 =      "978-0-262-56038-2",
  LCCN =         "QA76.73.L23 F74 1987",
  bibdate =      "Tue Dec 14 22:52:59 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Frisch:1991:ESA
author: AE leen Frisch
title: Essential System Administration
publisher: pub-ORA
address: pub-ORA:adr
pages: xxiii + 440
year: 1991
LCCN: QA76.76.O63 F78 1992
bibdate: Tue Dec 14 22:53:05 1993
bibtimestamp: 1993.12.14 22:53:05 ???
URL: http://www.oreilly.com/catalog/9780937175804
acknowledgement: ack-nhfb
rawauthor: {\AE}leen Frisch
rawtitle: Essential System Administration
ISBN:
0-937175-74-9 (paperback), 0-937175-80-3 (paperback) OR 0937175749 (paperback), 0937175803 (paperback)

ISBN13:
978-0-937175-74-3 (paperback), 978-0-937175-80-4 (paperback) OR 9780937175743 (paperback), 9780937175804 (paperback)

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

TOC:
Introduction to System Administration Thinking About System Administration Becoming Superuser Communicating with Users About Menus and GUIs Where Does the Time Go? The Unix Way Files Processes Devices Essential Administrative Tools and Techniques Getting the Most from Common Commands Essential Administrative Techniques Startup and Shutdown About the Unix Boot Process Initialization Files and Boot Scripts Shutting Down a Unix System Troubleshooting: Handling Crashes and Boot Failures TCP/IP Networking Understanding TCP/IP Networking Adding a New Network Host Network Testing and Troubleshooting Managing Users and Groups Unix Users and Groups Managing User Accounts Administrative Tools for Managing User Accounts Administering User Passwords User Authentication with PAM LDAP: Using a Directory Service for User Authentication Security Prelude: What's Wrong with This Picture? Thinking About Security User Authentication Revisited Protecting Files and the Filesystem Role-Based Access Control Network Security Hardening Unix Systems Detecting Problems Managing Network Services Managing DNS Servers Routing Daemons Configuring a DHCP Server Time Synchronization with NTP Managing Network Daemons under AIX Monitoring the Network Electronic Mail About Electronic Mail Configuring User Mail Programs Configuring Access Agents Configuring the Transport Agent Retrieving Mail Messages Mail Filtering with procmail A Few Final Tools Filesystems and Disks Filesystem Types Managing Filesystems From Disks to Filesystems Sharing Filesystems Backup and Restore Planning for Disasters and Everyday Needs Backup Media Backing Up Files and Filesystems Restoring Files from Backups Making Table of Contents Files Network Backup Systems Backing Up and Restoring the System Filesystems Serial Lines and Devices About Serial Lines Specifying Terminal Characteristics Adding a New Serial Device Troubleshooting Terminal Problems Controlling Access to Serial Lines HP-UX and Tru64 Terminal Line Attributes The HylaFAX Fax Service USB Devices Printers and the Spooling Subsystem The BSD Spooling Facility System V Printing The AIX Spooling Facility Troubleshooting Printers Sharing Printers with Windows Systems LPRng CUPS Font Management Under X Automating Administrative Tasks Creating Effective Shell Scripts Perl: An Alternate Administrative Language Expect: Automating Interactive Programs When Only C Will Do Automating Complex Configuration Tasks with Cfengine Stem: Simplified Creation of Client-Server Applications Adding Local man Pages Managing System Resources Thinking About System Performance

shortTOC:
1: Introduction to system administration 2: The UNIX way 3: Startup and shutdown 4: User accounts 5: Security 6: Automating routine tasks 7: Managing system resources 8: Filesystems and disks 9: Backup and restore 10: Terminals and modems 11: Printers and the spooling subsystem 12: TCP/IP network management 13: Accounting Bourne shell programming appendix Bibliography Index

rawshortTOC:
1: Introduction to system administration \\ 2: The UNIX way \\ 3: Startup and shutdown \\ 4: User accounts \\ 5: Security \\ 6: Automating routine tasks \\ 7: Managing system resources \\ 8: Filesystems and disks \\ 9: Backup and restore \\ 10: Terminals and modems \\ 11: Printers and the spooling subsystem \\ 12: TCP/IP network management \\ 13: Accounting \\ Bourne shell programming appendix \\ Bibliography \\ Index

rawTOC:
Introduction to System Administration \\ Thinking About System Administration \\ Becoming Superuser \\ Communicating with Users \\ About Menus and GUIs \\ Where Does the Time Go? \\ The Unix Way \\ Files \\ Processes \\ Devices \\ Essential Administrative Tools and Techniques \\ Getting the Most from Common Commands \\ Essential Administrative Techniques \\ Startup and Shutdown \\ About the Unix Boot Process \\ Initialization Files and Boot Scripts \\ Shutting Down a Unix System \\ Troubleshooting: Handling Crashes and Boot Failures \\ TCP/IP Networking \\ Understanding TCP/IP Networking \\ Adding a New Network Host \\ Network Testing and Troubleshooting \\ Managing Users and Groups \\ Unix Users and Groups \\ Managing User Accounts \\ Administrative Tools for Managing User Accounts \\ Administering User Passwords \\ User Authentication with PAM \\ LDAP: Using a Directory Service for User Authentication \\ Security \\ Prelude: What's Wrong with This Picture? \\ Thinking About Security \\ User Authentication Revisited \\ Protecting Files and the Filesystem \\ Role-Based Access Control \\ Network Security \\ Hardening Unix Systems \\ Detecting Problems \\ Managing Network Services \\ Managing DNS Servers \\ Routing Daemons \\ Configuring a DHCP Server \\ Time Synchronization with NTP \\ Managing Network Daemons under AIX \\ Monitoring the Network \\ Electronic Mail \\ About Electronic Mail \\ Configuring User Mail Programs \\ Configuring Access Agents \\ Configuring the Transport Agent \\ Retrieving Mail Messages \\ Mail Filtering with procmail \\ A Few Final Tools \\ Filesystems and Disks \\ Filesystem Types \\ Managing Filesystems \\ From Disks to Filesystems \\ Sharing Filesystems \\ Backup and Restore \\ Planning for Disasters and Everyday Needs \\ Backup Media \\ Backing Up Files and Filesystems \\ Restoring Files from Backups \\ Making Table of Contents Files \\ Network Backup Systems \\ Backing Up and Restoring the System Filesystems \\ Serial Lines and Devices \\ About Serial Lines \\ Specifying Terminal Characteristics \\ Adding a New Serial Device \\ Troubleshooting Terminal Problems \\ Controlling Access to Serial Lines \\ HP-UX and Tru64 Terminal Line Attributes \\ The HylaFAX Fax Service \\ USB Devices \\ Printers and the Spooling Subsystem \\ The BSD Spooling Facility \\ System V Printing \\ The AIX Spooling Facility \\ Troubleshooting Printers \\ Sharing Printers with Windows Systems \\ LPRng \\ CUPS \\ Font Management Under X \\ Automating Administrative Tasks \\ Creating Effective Shell Scripts \\ Perl: An Alternate Administrative Language \\ Expect: Automating Interactive Programs \\ When Only C Will Do \\ Automating Complex Configuration Tasks with Cfengine \\ Stem: Simplified Creation of Client-Server Applications \\ Adding Local man Pages \\ Managing System Resources \\ Thinking About System Performance

entry:
@Book{Frisch:1991:ESA,
  author =       "{\AE}leen Frisch",
  title =        "Essential System Administration",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxiii + 440",
  year =         "1991",
  ISBN =         "0-937175-74-9 (paperback), 0-937175-80-3 (paperback)",
  ISBN-13 =      "978-0-937175-74-3 (paperback), 978-0-937175-80-4
                 (paperback)",
  LCCN =         "QA76.76.O63 F78 1992",
  bibdate =      "Tue Dec 14 22:53: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://www.oreilly.com/catalog/9780937175804",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1: Introduction to system administration \\
                 2: The UNIX way \\
                 3: Startup and shutdown \\
                 4: User accounts \\
                 5: Security \\
                 6: Automating routine tasks \\
                 7: Managing system resources \\
                 8: Filesystems and disks \\
                 9: Backup and restore \\
                 10: Terminals and modems \\
                 11: Printers and the spooling subsystem \\
                 12: TCP/IP network management \\
                 13: Accounting \\
                 Bourne shell programming appendix \\
                 Bibliography \\
                 Index",
  tableofcontents = "Introduction to System Administration \\
                 Thinking About System Administration \\
                 Becoming Superuser \\
                 Communicating with Users \\
                 About Menus and GUIs \\
                 Where Does the Time Go? \\
                 The Unix Way \\
                 Files \\
                 Processes \\
                 Devices \\
                 Essential Administrative Tools and Techniques \\
                 Getting the Most from Common Commands \\
                 Essential Administrative Techniques \\
                 Startup and Shutdown \\
                 About the Unix Boot Process \\
                 Initialization Files and Boot Scripts \\
                 Shutting Down a Unix System \\
                 Troubleshooting: Handling Crashes and Boot Failures \\
                 TCP/IP Networking \\
                 Understanding TCP/IP Networking \\
                 Adding a New Network Host \\
                 Network Testing and Troubleshooting \\
                 Managing Users and Groups \\
                 Unix Users and Groups \\
                 Managing User Accounts \\
                 Administrative Tools for Managing User Accounts \\
                 Administering User Passwords \\
                 User Authentication with PAM \\
                 LDAP: Using a Directory Service for User Authentication
                 \\
                 Security \\
                 Prelude: What's Wrong with This Picture? \\
                 Thinking About Security \\
                 User Authentication Revisited \\
                 Protecting Files and the Filesystem \\
                 Role-Based Access Control \\
                 Network Security \\
                 Hardening Unix Systems \\
                 Detecting Problems \\
                 Managing Network Services \\
                 Managing DNS Servers \\
                 Routing Daemons \\
                 Configuring a DHCP Server \\
                 Time Synchronization with NTP \\
                 Managing Network Daemons under AIX \\
                 Monitoring the Network \\
                 Electronic Mail \\
                 About Electronic Mail \\
                 Configuring User Mail Programs \\
                 Configuring Access Agents \\
                 Configuring the Transport Agent \\
                 Retrieving Mail Messages \\
                 Mail Filtering with procmail \\
                 A Few Final Tools \\
                 Filesystems and Disks \\
                 Filesystem Types \\
                 Managing Filesystems \\
                 From Disks to Filesystems \\
                 Sharing Filesystems \\
                 Backup and Restore \\
                 Planning for Disasters and Everyday Needs \\
                 Backup Media \\
                 Backing Up Files and Filesystems \\
                 Restoring Files from Backups \\
                 Making Table of Contents Files \\
                 Network Backup Systems \\
                 Backing Up and Restoring the System Filesystems \\
                 Serial Lines and Devices \\
                 About Serial Lines \\
                 Specifying Terminal Characteristics \\
                 Adding a New Serial Device \\
                 Troubleshooting Terminal Problems \\
                 Controlling Access to Serial Lines \\
                 HP-UX and Tru64 Terminal Line Attributes \\
                 The HylaFAX Fax Service \\
                 USB Devices \\
                 Printers and the Spooling Subsystem \\
                 The BSD Spooling Facility \\
                 System V Printing \\
                 The AIX Spooling Facility \\
                 Troubleshooting Printers \\
                 Sharing Printers with Windows Systems \\
                 LPRng \\
                 CUPS \\
                 Font Management Under X \\
                 Automating Administrative Tasks \\
                 Creating Effective Shell Scripts \\
                 Perl: An Alternate Administrative Language \\
                 Expect: Automating Interactive Programs \\
                 When Only C Will Do \\
                 Automating Complex Configuration Tasks with Cfengine
                 \\
                 Stem: Simplified Creation of Client-Server Applications
                 \\
                 Adding Local man Pages \\
                 Managing System Resources \\
                 Thinking About System Performance",
}


bibtype: book
filename: master.bib
label: FroeseFischer:1977:HFM
author: Charlotte Froese Fischer
title: The Hartree--Fock Method for Atoms: A Numerical Approach
publisher: pub-WILEY
address: pub-WILEY:adr
pages: xi + 308
year: 1977
ISBN: 0-471-25990-X OR 047125990X
ISBN13: 978-0-471-25990-9 OR 9780471259909
LCCN: QC173.F527
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: Charlotte {Froese Fischer}
rawtitle: The {Hartree--Fock} Method for Atoms: A Numerical Approach
TOC:
Part A: Theory and Results / 1 1: The Hartree--Fock Approach / 3 1-1 Introduction / 3 1-2 The Variational Principle / 7 1-3 The Hartree--Fock Approximation / 8 1-4 Various Hartree--Fock Approximations / 13 2: The Single-Configuration Hartree--Fock Approximation / 17 2-1 The Hartree--Fock Equations / 17 2-1.1 Energy Expression / 17 2-1.2 Derivation of Hartree--Fock Equations / 20 2-1.3 Unique Solutions of Hartree--Fock Equations / 26 2-2 Hartree--Fock Results for Ground-State or Near Ground-State Configurations of the Atoms He to Rn / 27 2-3 The Energy Parameters $epsilon _nl,nl$ / 94 2-4 The Asymptotic Form of the Radial Functions / 102 2-5 Brillouin's Theory / 104 2-5.1 The Importance of Brillouin's Theorem / 104 2-5.2 The Intermediate State Function $Phi _gamma ^ast $ / 105 2-5.3 Derivation of Brillouin's Theorem / 108 2-6 The Nonorthogonal and Extended Hartree--Fock Approximation / 111 2-7 The Fixed-Core Approximation / 114 3: Correlation in Many-Electron Systems / 117 3-1 Electron Correlation / 117 3-2 The $Z$-Dependent Perturbation Expansion / 118 3-3 The Structure of $|1>$ / 119 3-4 $Z$-Dependent Expansion of $Phi ^rm NHF(gamma L S)$ / 126 3-5 $Z$-Dependent Expansion of $Phi ^rm HF(gamma L S)$ / 128 3-6 An MCHF Approximation with $E^rm MCHF = E_1$ / 130 3-7 The Separated-Pair Approximation / 136 3-8 The Reduced Form of a Pair-Correlation Function / 141 3-9 The Separated-Pair MCHF Procedure / 146 3-10 Some Practical Considerations / 146 3-11 Related Theories / 148 4: The MCHF Equations and Results / 150 4-1 The Energy Expression / 150 4-2 The MCHF Equations / 153 4-3 The Diagonal Energy Parameter / 159 4-4 MCHF Results for Two-Electron Systems / 163 4-4.1 The $1s^2$ $^1S$ state / 163 4-4.2 The $1s2s$ $^1S$ state / 168 4-4.3 The $1s2s$ $^3S$ state / 172 4-4.4 The $1s2p$ $^1P$ and $^3P$ states / 173 4-4.5 The $1s3d$ $^1D$ and $^3D$ states / 176 4-4.6 Accuracy of Atomic Properties for Two-Electron Systems / 176 4-5 A Separated-Pair Correlation Study of Li / 180 4-6 A Separated-Pair Correlation Study of Be / 186 4-7 Splitting of Orbitals / 190 5: Ab Initio Determination of Atomic Properties / 196 5-1 Introduction / 196 5-2 Ionization Potentials / 197 5-3 Electron Affinities / 199 5-4 Transition Probabilities / 202 5-5 Hyperfine Structure Constants / 208 5-6 Isomer Shift Calibration Constant / 213 5-7 General Remarks / 214 References / 215 Part B: Numerical Solution of Hartree--Fock Equations / 219 6: General Numerical Procedures / 221 6-1 Introduction / 221 6-2 The Logarithmic Variable / 223 6-3 Finite Differences and Interpolating Polynomials / 226 6-4 Numerical Integration and Differentiation / 228 6-5 The Functions $Y^k(i, i'; r)$ / 231 6-6 Solution of the Radial Equation $y'' = F(x) y + G(x)$ / 237 6-6.1 The Discretized Approximation / 240 6-6.2 Methods for Solving the Discretized Boundary Value Problem / 242 6-6.2.1 Direct Method of Solution / 242 6-6.2.2 The Shooting Method / 245 6-6.2.3 A Combined ``Shooting-Direct'' Method / 249 6-6.3 The Boundary Condition of Infinity / 251 6-6.4 Other Methods of Solution / 254 6-7 Solution of the Integrodifferential Equation / 258 6-8 The Generalized Eigenvalue Problem / 261 6-8.1 Eigenvalue Problems in Quantum Mechanics / 261 6-8.2 Methods of Solution / 263 6-8.2.1 Zero-Finding Methods / 263 6-8.2.2 Inverse Iteration / 268 6-9 Accuracy of Numerical Procedures for Hydrogen / 270 7: Numerical Solution of the MCHF Problem / 274 7-1 Introduction / 274 7-2 Initial Estimates / 276 7-3 Off-Diagonal Energy Parameters / 280 7-4 Improvement of the Radial Functions / 283 7-4.1 Method 1 (M1) / 284 7-4.2 Method 2 (M2) / 286 7-4.3 Search for an Acceptable Solution / 290 7-4.4 Comparison of M1 and M2 / 292 7-4.5 The Order of Improvement / 296 7-5 Orthogonalization / 296 7-6 Solution of the Secular Equation / 297 7-7 Test for Convergence / 297 References / 302 Appendix: Atomic Structure Programs / 299 Index / 305

rawTOC:
Part A: Theory and Results / 1 \\ 1: The Hartree--Fock Approach / 3 \\ 1-1 Introduction / 3 \\ 1-2 The Variational Principle / 7 \\ 1-3 The Hartree--Fock Approximation / 8 \\ 1-4 Various Hartree--Fock Approximations / 13 \\ 2: The Single-Configuration Hartree--Fock Approximation / 17 \\ 2-1 The Hartree--Fock Equations / 17 \\ 2-1.1 Energy Expression / 17 \\ 2-1.2 Derivation of Hartree--Fock Equations / 20 \\ 2-1.3 Unique Solutions of Hartree--Fock Equations / 26 \\ 2-2 Hartree--Fock Results for Ground-State or Near Ground-State Configurations of the Atoms He to Rn / 27 \\ 2-3 The Energy Parameters $\epsilon_{nl,nl}$ / 94 \\ 2-4 The Asymptotic Form of the Radial Functions / 102 \\ 2-5 Brillouin's Theory / 104 \\ 2-5.1 The Importance of Brillouin's Theorem / 104 \\ 2-5.2 The Intermediate State Function $\Phi_{\gamma^\ast}$ / 105 \\ 2-5.3 Derivation of Brillouin's Theorem / 108 \\ 2-6 The Nonorthogonal and Extended Hartree--Fock Approximation / 111 \\ 2-7 The Fixed-Core Approximation / 114 \\ 3: Correlation in Many-Electron Systems / 117 \\ 3-1 Electron Correlation / 117 \\ 3-2 The $Z$-Dependent Perturbation Expansion / 118 \\ 3-3 The Structure of $|1>$ / 119 \\ 3-4 $Z$-Dependent Expansion of $\Phi^{\rm NHF}(\gamma L S)$ / 126 \\ 3-5 $Z$-Dependent Expansion of $\Phi^{\rm HF}(\gamma L S)$ / 128 \\ 3-6 An MCHF Approximation with $E^{\rm MCHF} = E_1$ / 130 \\ 3-7 The Separated-Pair Approximation / 136 \\ 3-8 The Reduced Form of a Pair-Correlation Function / 141 \\ 3-9 The Separated-Pair MCHF Procedure / 146 \\ 3-10 Some Practical Considerations / 146 \\ 3-11 Related Theories / 148 \\ 4: The MCHF Equations and Results / 150 \\ 4-1 The Energy Expression / 150 \\ 4-2 The MCHF Equations / 153 \\ 4-3 The Diagonal Energy Parameter / 159 \\ 4-4 MCHF Results for Two-Electron Systems / 163 \\ 4-4.1 The $1s^2$ $^1S$ state / 163 \\ 4-4.2 The $1s2s$ $^1S$ state / 168 \\ 4-4.3 The $1s2s$ $^3S$ state / 172 \\ 4-4.4 The $1s2p$ $^1P$ and $^3P$ states / 173 \\ 4-4.5 The $1s3d$ $^1D$ and $^3D$ states / 176 \\ 4-4.6 Accuracy of Atomic Properties for Two-Electron Systems / 176 \\ 4-5 A Separated-Pair Correlation Study of Li / 180 \\ 4-6 A Separated-Pair Correlation Study of Be / 186 \\ 4-7 Splitting of Orbitals / 190 \\ 5: Ab Initio Determination of Atomic Properties / 196 \\ 5-1 Introduction / 196 \\ 5-2 Ionization Potentials / 197 \\ 5-3 Electron Affinities / 199 \\ 5-4 Transition Probabilities / 202 \\ 5-5 Hyperfine Structure Constants / 208 \\ 5-6 Isomer Shift Calibration Constant / 213 \\ 5-7 General Remarks / 214 \\ References / 215 \\ Part B: Numerical Solution of Hartree--Fock Equations / 219 \\ 6: General Numerical Procedures / 221 \\ 6-1 Introduction / 221 \\ 6-2 The Logarithmic Variable / 223 \\ 6-3 Finite Differences and Interpolating Polynomials / 226 \\ 6-4 Numerical Integration and Differentiation / 228 \\ 6-5 The Functions $Y^k(i, i'; r)$ / 231 \\ 6-6 Solution of the Radial Equation $y'' = F(x) y + G(x)$ / 237 \\ 6-6.1 The Discretized Approximation / 240 \\ 6-6.2 Methods for Solving the Discretized Boundary Value Problem / 242 \\ 6-6.2.1 Direct Method of Solution / 242 \\ 6-6.2.2 The Shooting Method / 245 \\ 6-6.2.3 A Combined ``Shooting-Direct'' Method / 249 \\ 6-6.3 The Boundary Condition of Infinity / 251 \\ 6-6.4 Other Methods of Solution / 254 \\ 6-7 Solution of the Integrodifferential Equation / 258 \\ 6-8 The Generalized Eigenvalue Problem / 261 \\ 6-8.1 Eigenvalue Problems in Quantum Mechanics / 261 \\ 6-8.2 Methods of Solution / 263 \\ 6-8.2.1 Zero-Finding Methods / 263 \\ 6-8.2.2 Inverse Iteration / 268 \\ 6-9 Accuracy of Numerical Procedures for Hydrogen / 270 \\ 7: Numerical Solution of the MCHF Problem / 274 \\ 7-1 Introduction / 274 \\ 7-2 Initial Estimates / 276 \\ 7-3 Off-Diagonal Energy Parameters / 280 \\ 7-4 Improvement of the Radial Functions / 283 \\ 7-4.1 Method 1 (M1) / 284 \\ 7-4.2 Method 2 (M2) / 286 \\ 7-4.3 Search for an Acceptable Solution / 290 \\ 7-4.4 Comparison of M1 and M2 / 292 \\ 7-4.5 The Order of Improvement / 296 \\ 7-5 Orthogonalization / 296 \\ 7-6 Solution of the Secular Equation / 297 \\ 7-7 Test for Convergence / 297 \\ References / 302 \\ Appendix: Atomic Structure Programs / 299 \\ Index / 305

entry:
@Book{FroeseFischer:1977:HFM,
  author =       "Charlotte {Froese Fischer}",
  title =        "The {Hartree--Fock} Method for Atoms: A Numerical
                 Approach",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xi + 308",
  year =         "1977",
  ISBN =         "0-471-25990-X",
  ISBN-13 =      "978-0-471-25990-9",
  LCCN =         "QC173.F527",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Part A: Theory and Results / 1 \\
                 1: The Hartree--Fock Approach / 3 \\
                 1-1 Introduction / 3 \\
                 1-2 The Variational Principle / 7 \\
                 1-3 The Hartree--Fock Approximation / 8 \\
                 1-4 Various Hartree--Fock Approximations / 13 \\
                 2: The Single-Configuration Hartree--Fock Approximation
                 / 17 \\
                 2-1 The Hartree--Fock Equations / 17 \\
                 2-1.1 Energy Expression / 17 \\
                 2-1.2 Derivation of Hartree--Fock Equations / 20 \\
                 2-1.3 Unique Solutions of Hartree--Fock Equations / 26
                 \\
                 2-2 Hartree--Fock Results for Ground-State or Near
                 Ground-State Configurations of the Atoms He to Rn / 27
                 \\
                 2-3 The Energy Parameters $\epsilon_{nl,nl}$ / 94 \\
                 2-4 The Asymptotic Form of the Radial Functions / 102
                 \\
                 2-5 Brillouin's Theory / 104 \\
                 2-5.1 The Importance of Brillouin's Theorem / 104 \\
                 2-5.2 The Intermediate State Function
                 $\Phi_{\gamma^\ast}$ / 105 \\
                 2-5.3 Derivation of Brillouin's Theorem / 108 \\
                 2-6 The Nonorthogonal and Extended Hartree--Fock
                 Approximation / 111 \\
                 2-7 The Fixed-Core Approximation / 114 \\
                 3: Correlation in Many-Electron Systems / 117 \\
                 3-1 Electron Correlation / 117 \\
                 3-2 The $Z$-Dependent Perturbation Expansion / 118 \\
                 3-3 The Structure of $|1>$ / 119 \\
                 3-4 $Z$-Dependent Expansion of $\Phi^{\rm NHF}(\gamma L
                 S)$ / 126 \\
                 3-5 $Z$-Dependent Expansion of $\Phi^{\rm HF}(\gamma L
                 S)$ / 128 \\
                 3-6 An MCHF Approximation with $E^{\rm MCHF} = E_1$ /
                 130 \\
                 3-7 The Separated-Pair Approximation / 136 \\
                 3-8 The Reduced Form of a Pair-Correlation Function /
                 141 \\
                 3-9 The Separated-Pair MCHF Procedure / 146 \\
                 3-10 Some Practical Considerations / 146 \\
                 3-11 Related Theories / 148 \\
                 4: The MCHF Equations and Results / 150 \\
                 4-1 The Energy Expression / 150 \\
                 4-2 The MCHF Equations / 153 \\
                 4-3 The Diagonal Energy Parameter / 159 \\
                 4-4 MCHF Results for Two-Electron Systems / 163 \\
                 4-4.1 The $1s^2$ $^1S$ state / 163 \\
                 4-4.2 The $1s2s$ $^1S$ state / 168 \\
                 4-4.3 The $1s2s$ $^3S$ state / 172 \\
                 4-4.4 The $1s2p$ $^1P$ and $^3P$ states / 173 \\
                 4-4.5 The $1s3d$ $^1D$ and $^3D$ states / 176 \\
                 4-4.6 Accuracy of Atomic Properties for Two-Electron
                 Systems / 176 \\
                 4-5 A Separated-Pair Correlation Study of Li / 180 \\
                 4-6 A Separated-Pair Correlation Study of Be / 186 \\
                 4-7 Splitting of Orbitals / 190 \\
                 5: Ab Initio Determination of Atomic Properties / 196
                 \\
                 5-1 Introduction / 196 \\
                 5-2 Ionization Potentials / 197 \\
                 5-3 Electron Affinities / 199 \\
                 5-4 Transition Probabilities / 202 \\
                 5-5 Hyperfine Structure Constants / 208 \\
                 5-6 Isomer Shift Calibration Constant / 213 \\
                 5-7 General Remarks / 214 \\
                 References / 215 \\
                 Part B: Numerical Solution of Hartree--Fock Equations /
                 219 \\
                 6: General Numerical Procedures / 221 \\
                 6-1 Introduction / 221 \\
                 6-2 The Logarithmic Variable / 223 \\
                 6-3 Finite Differences and Interpolating Polynomials /
                 226 \\
                 6-4 Numerical Integration and Differentiation / 228 \\
                 6-5 The Functions $Y^k(i, i'; r)$ / 231 \\
                 6-6 Solution of the Radial Equation $y'' = F(x) y +
                 G(x)$ / 237 \\
                 6-6.1 The Discretized Approximation / 240 \\
                 6-6.2 Methods for Solving the Discretized Boundary
                 Value Problem / 242 \\
                 6-6.2.1 Direct Method of Solution / 242 \\
                 6-6.2.2 The Shooting Method / 245 \\
                 6-6.2.3 A Combined ``Shooting-Direct'' Method / 249 \\
                 6-6.3 The Boundary Condition of Infinity / 251 \\
                 6-6.4 Other Methods of Solution / 254 \\
                 6-7 Solution of the Integrodifferential Equation / 258
                 \\
                 6-8 The Generalized Eigenvalue Problem / 261 \\
                 6-8.1 Eigenvalue Problems in Quantum Mechanics / 261
                 \\
                 6-8.2 Methods of Solution / 263 \\
                 6-8.2.1 Zero-Finding Methods / 263 \\
                 6-8.2.2 Inverse Iteration / 268 \\
                 6-9 Accuracy of Numerical Procedures for Hydrogen / 270
                 \\
                 7: Numerical Solution of the MCHF Problem / 274 \\
                 7-1 Introduction / 274 \\
                 7-2 Initial Estimates / 276 \\
                 7-3 Off-Diagonal Energy Parameters / 280 \\
                 7-4 Improvement of the Radial Functions / 283 \\
                 7-4.1 Method 1 (M1) / 284 \\
                 7-4.2 Method 2 (M2) / 286 \\
                 7-4.3 Search for an Acceptable Solution / 290 \\
                 7-4.4 Comparison of M1 and M2 / 292 \\
                 7-4.5 The Order of Improvement / 296 \\
                 7-5 Orthogonalization / 296 \\
                 7-6 Solution of the Secular Equation / 297 \\
                 7-7 Test for Convergence / 297 \\
                 References / 302 \\
                 Appendix: Atomic Structure Programs / 299 \\
                 Index / 305",
}


bibtype: book
filename: master.bib
label: FroeseFischer:2003:DRH
author: Charlotte Froese Fischer
title: Douglas Rayner Hartree: his life in science and computing
publisher: pub-WORLD-SCI
address: pub-WORLD-SCI:adr
pages: xviii + 250
year: 2003
ISBN: 981-238-577-0 OR 9812385770
ISBN13: 978-981-238-577-2 OR 9789812385772
LCCN: Q143.H37
bibdate: Tue Jun 14 17:17:19 MDT 2011
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2011.06.14 17:17:19 MDT
URL: http://ebooks.worldscinet.com/ISBN/9789812795014/9789812795014.html
subject: Hartree, Douglas Rayner; Hartree, Douglas R. Quantenchemie; Geschichte; Quelle; Quantenphysik
acknowledgement: ack-nhfb
rawauthor: Charlotte {Froese Fischer}
rawtitle: {Douglas Rayner Hartree}: his life in science and computing
TOC:
Front Matter i The Hartree family 1 Education, World War I, and marriage 9 Early research at Cambridge University 23 The new quantum mechanics 33 Advances in atomic theory 47 Radio waves in the atmosphere 65 Professor at the University of Manchester 73 The differential analyzer 85 Control theory and industrial applications 103 Laminar boundary layer theory 109 Arrangements for war 115 Wartime service 123 Dawn of the computer era 145 Returning to Cambridge 161 Summers in North America 171 Mathematical Laboratory, numerical analysis, and teaching 177 A trip to Australia 181 Atomic structure research using EDSAC 187 The final years 195 His legacy 201 Back Matter 213

rawTOC:
Front Matter i \\ The Hartree family 1 \\ Education, World War I, and marriage 9 \\ Early research at Cambridge University 23 \\ The new quantum mechanics 33 \\ Advances in atomic theory 47 \\ Radio waves in the atmosphere 65 \\ Professor at the University of Manchester 73 \\ The differential analyzer 85 \\ Control theory and industrial applications 103 \\ Laminar boundary layer theory 109 \\ Arrangements for war 115 \\ Wartime service 123 \\ Dawn of the computer era 145 \\ Returning to Cambridge 161 \\ Summers in North America 171 \\ Mathematical Laboratory, numerical analysis, and teaching 177 \\ A trip to Australia 181 \\ Atomic structure research using EDSAC 187 \\ The final years 195 \\ His legacy 201 \\ Back Matter 213

entry:
@Book{FroeseFischer:2003:DRH,
  author =       "Charlotte {Froese Fischer}",
  title =        "{Douglas Rayner Hartree}: his life in science and
                 computing",
  publisher =    pub-WORLD-SCI,
  address =      pub-WORLD-SCI:adr,
  pages =        "xviii + 250",
  year =         "2003",
  ISBN =         "981-238-577-0",
  ISBN-13 =      "978-981-238-577-2",
  LCCN =         "Q143.H37",
  bibdate =      "Tue Jun 14 17:17:19 MDT 2011",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://ebooks.worldscinet.com/ISBN/9789812795014/9789812795014.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Hartree, Douglas Rayner; Hartree, Douglas R.
                 Quantenchemie; Geschichte; Quelle; Quantenphysik",
  tableofcontents = "Front Matter i \\
                 The Hartree family 1 \\
                 Education, World War I, and marriage 9 \\
                 Early research at Cambridge University 23 \\
                 The new quantum mechanics 33 \\
                 Advances in atomic theory 47 \\
                 Radio waves in the atmosphere 65 \\
                 Professor at the University of Manchester 73 \\
                 The differential analyzer 85 \\
                 Control theory and industrial applications 103 \\
                 Laminar boundary layer theory 109 \\
                 Arrangements for war 115 \\
                 Wartime service 123 \\
                 Dawn of the computer era 145 \\
                 Returning to Cambridge 161 \\
                 Summers in North America 171 \\
                 Mathematical Laboratory, numerical analysis, and
                 teaching 177 \\
                 A trip to Australia 181 \\
                 Atomic structure research using EDSAC 187 \\
                 The final years 195 \\
                 His legacy 201 \\
                 Back Matter 213",
}


bibtype: book
filename: master.bib
label: Frommer:2004:FRA
author: Frommer
title: Frommer's Road Atlas Europe
publisher: Frommer's
address: Windsor, Berkshire, UK
pages: 240
year: 2004
ISBN: 0-7645-5782-3 OR 0764557823
ISBN13: 978-0-7645-5782-8 OR 9780764557828
LCCN: G1797.21.P2 A87 2003
bibdate: Sat Dec 24 15:53:15 MST 2005
bibsource: Amazon; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2005.12.24 15:53:15 MST
series: Frommer's Road Atlas Series
keywords: Roads --- Europe --- Maps
acknowledgement: ack-nhfb
rawauthor: {Frommer}
rawtitle: {Frommer}'s Road Atlas {Europe}
entry:
@Book{Frommer:2004:FRA,
  author =       "{Frommer}",
  title =        "{Frommer}'s Road Atlas {Europe}",
  publisher =    "Frommer's",
  address =      "Windsor, Berkshire, UK",
  pages =        "240",
  year =         "2004",
  ISBN =         "0-7645-5782-3",
  ISBN-13 =      "978-0-7645-5782-8",
  LCCN =         "G1797.21.P2 A87 2003",
  bibdate =      "Sat Dec 24 15:53:15 MST 2005",
  bibsource =    "Amazon;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Frommer's Road Atlas Series",
  acknowledgement = ack-nhfb,
  bookformat =   "Spiral-bound",
  category =     "Reference; Atlases \& Maps; Atlases",
  DEWEY =        "912.4 22",
  dimensions =   "11.7 x 9.0 x 0.6 inches",
  idnumber =     "551",
  keywords =     "Roads --- Europe --- Maps",
}


bibtype: book
filename: master.bib
label: Fry:2022:SMW
author: Helen Fry
title: Spymaster: the man who saved MI6
publisher: pub-YALE
address: pub-YALE:adr
pages: 240
year: 2022
ISBN: 0-300-26697-9 OR 0300266979
ISBN13: 978-0-300-26697-9 OR 9780300266979
bibdate: Mon Nov 21 06:00:41 MST 2022
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2022.11.21 06:00:41 MST
acknowledgement: ack-nhfb
subjectdates: 1881--1972
rawauthor: Helen Fry
rawtitle: {Spymaster}: the man who saved {MI6}
subject:
Kendrick, Thomas Joseph; Spies; Great Britain; Espionage, British; History; 20th century; World War, 1939--1945; Secret service; Espionage, British; Secret service; Spies

TOC:
List of Plates / iv Acknowledgements / xii Abbreviations and glossary / xiv Author's note / xvi Map of Europe in 1925/ xviii Prologue: Cocktails / 1 Introduction: Soldier, spy / 4 Part I: Europe / 17 1: The slow war / 25 2: Red Vienna / 46 3: Tangled web game / 69 4: A dangerous game / 87 5: Finis Austria / 116 6: The spy who saved a generation / 141 7: At the mercy of the Gestapo / Part II: Britain 8: Secrets of the Tower / 159 9: Eavesdropping on the enemy / 168 10: The Hess affair / 180 11: The madness of Hess / 194 12: A very secret place / 210 13: Special intelligence / 232 14: D-Day and its aftermath / 247 15: Still listening / 261 Epilogue: A life of secrets / 280 Afterword: Secrets to the grave / 289 Endnotes / 296 Bibliography and further reading / 327 Index / 332

rawTOC:
List of Plates / iv \\ Acknowledgements / xii \\ Abbreviations and glossary / xiv \\ Author's note / xvi \\ Map of Europe in 1925/ xviii \\ Prologue: Cocktails / 1 \\ Introduction: Soldier, spy / 4 \\ Part I: Europe / 17 \\ 1: The slow war / 25 \\ 2: Red Vienna / 46 \\ 3: Tangled web game / 69 \\ 4: A dangerous game / 87 \\ 5: Finis Austria / 116 \\ 6: The spy who saved a generation / 141 \\ 7: At the mercy of the Gestapo / \\ Part II: Britain \\ 8: Secrets of the Tower / 159 \\ 9: Eavesdropping on the enemy / 168 \\ 10: The Hess affair / 180 \\ 11: The madness of Hess / 194 \\ 12: A very secret place / 210 \\ 13: Special intelligence / 232 \\ 14: D-Day and its aftermath / 247 \\ 15: Still listening / 261 \\ Epilogue: A life of secrets / 280 \\ Afterword: Secrets to the grave / 289 \\ Endnotes / 296 \\ Bibliography and further reading / 327 \\ Index / 332

entry:
@Book{Fry:2022:SMW,
  author =       "Helen Fry",
  title =        "{Spymaster}: the man who saved {MI6}",
  publisher =    pub-YALE,
  address =      pub-YALE:adr,
  year =         "2022",
  ISBN =         "0-300-26697-9",
  ISBN-13 =      "978-0-300-26697-9",
  LCCN =         "????",
  bibdate =      "Mon Nov 21 06:00:41 MST 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  subject =      "Kendrick, Thomas Joseph; Spies; Great Britain;
                 Espionage, British; History; 20th century; World War,
                 1939--1945; Secret service; Espionage, British; Secret
                 service; Spies",
  subject-dates = "1881--1972",
  tableofcontents = "List of Plates / iv \\
                 Acknowledgements / xii \\
                 Abbreviations and glossary / xiv \\
                 Author's note / xvi \\
                 Map of Europe in 1925/ xviii \\
                 Prologue: Cocktails / 1 \\
                 Introduction: Soldier, spy / 4 \\
                 Part I: Europe / 17 \\
                 1: The slow war / 25 \\
                 2: Red Vienna / 46 \\
                 3: Tangled web game / 69 \\
                 4: A dangerous game / 87 \\
                 5: Finis Austria / 116 \\
                 6: The spy who saved a generation / 141 \\
                 7: At the mercy of the Gestapo / \\
                 Part II: Britain \\
                 8: Secrets of the Tower / 159 \\
                 9: Eavesdropping on the enemy / 168 \\
                 10: The Hess affair / 180 \\
                 11: The madness of Hess / 194 \\
                 12: A very secret place / 210 \\
                 13: Special intelligence / 232 \\
                 14: D-Day and its aftermath / 247 \\
                 15: Still listening / 261 \\
                 Epilogue: A life of secrets / 280 \\
                 Afterword: Secrets to the grave / 289 \\
                 Endnotes / 296 \\
                 Bibliography and further reading / 327 \\
                 Index / 332",
}


bibtype: misc
filename: master.bib
label: FSF:gawk
title: The GAWK Manual
pages: 240
year: 1987
bibsource: https://www.math.utah.edu/pub/tex/bib/gnu.bib; https://www.math.utah.edu/pub/tex/bib/master.bib
note: Also available via ANONYMOUS FTP to path |prep.ai.mit.edu|. See also cite Aho:1988:APL.
acknowledgement: ack-nhfb
howpublished: pub-FSF
key: GAWK
rawnote: Also available via ANONYMOUS FTP to \path|prep.ai.mit.edu|. See also \cite{Aho:1988:APL}.
rawtitle: The {GAWK} Manual
entry:
@Misc{FSF:gawk,
  key =          "GAWK",
  title =        "The {GAWK} Manual",
  howpublished = pub-FSF # " " # pub-FSF:adr,
  year =         "1987",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/gnu.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Also available via ANONYMOUS FTP to
                 \path|prep.ai.mit.edu|. See also \cite{Aho:1988:APL}.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Gabriel:1985:PEL
author: Richard P. Gabriel
title: Performance and Evaluation of Lisp Systems
publisher: pub-MIT
address: pub-MIT:adr
pages: xiv + 285
year: 1985
ISBN: 0-262-07093-6, 0-262-25619-3 (e-book) OR 0262070936, 0262256193 (ebook)
ISBN13: 978-0-262-07093-5, 978-0-262-25619-3 (e-book) OR 9780262070935, 9780262256193 (ebook)
LCCN: QA76.73.L23 G321 1985
bibdate: Tue Dec 14 22:53:07 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:53:07 ???
series: MIT Press Series in Computer Systems, Editor: Herb Schwetman
acknowledgement: ack-nhfb
rawauthor: Richard P. Gabriel
rawtitle: Performance and Evaluation of {Lisp} Systems
abstract:
This final report of the Stanford Lisp Performance Study, conducted over a three year period by the author, describes implementation techniques, performance tradeoffs, benchmarking techniques, and performance results for all of the major Lisp dialects in use today. A popular high-level programming language used predominantly in artificial intelligence, Lisp was the first language to concentrate on working with symbols instead of numbers. Lisp was introduced by John McCarthy in the early 1960s (McCarthy's LISP 1.5 Programmer's Manual published in 1962 is available in paperback from The MIT Press) and its continuous development has enabled it to remain dominant in artificial intelligence. Performance and Evaluation of Lisp Systems is the first book to present descriptions on the Lisp implementation techniques actually in use and can serve as a handbook to the implementation details of all of the various current Lisp expressions. It provides detailed performance information using the tools of benchmarking (the process of utilizing standardized computer programs to test the processing power of different computer systems) to measure the various Lisp systems, and provides an understanding of the technical tradeoffs made during the implementation of a Lisp system. The study is divided into three major parts. The first provides the theoretical background, outlining the factors that go into evaluating the performance of a Lisp system. The second part presents the Lisp implementations: MacLisp, MIT CADR, LMI Lambda, S-I Lisp, Franz Lisp, MIL, Spice Lisp, Vax Common Lisp, Portable Standard Lisp, and Xerox D-Machine. A final part describes the benchmark suite that was used during the major portion of the study and the results themselves. Richard P. Gabriel is President and Chief Technical Officer, Lucid, Inc., and Consulting Associate Professor, Stanford University. Performance and Evaluation of Lisp Systems is included in the Computer Systems series, Research Reports and Notes, edited by Herb Schwetman.

TOC:
Series Foreword / vii Preface / ix Acknowledgments / xiii Introduction / 1 The Implementations / 31 The Benchmarks / 81 References / 277 Index / 281

rawabstract:
This final report of the Stanford Lisp Performance Study, conducted over a three year period by the author, describes implementation techniques, performance tradeoffs, benchmarking techniques, and performance results for all of the major Lisp dialects in use today. A popular high-level programming language used predominantly in artificial intelligence, Lisp was the first language to concentrate on working with symbols instead of numbers. Lisp was introduced by John McCarthy in the early 1960s (McCarthy's LISP 1.5 Programmer's Manual published in 1962 is available in paperback from The MIT Press) and its continuous development has enabled it to remain dominant in artificial intelligence. Performance and Evaluation of Lisp Systems is the first book to present descriptions on the Lisp implementation techniques actually in use and can serve as a handbook to the implementation details of all of the various current Lisp expressions. It provides detailed performance information using the tools of benchmarking (the process of utilizing standardized computer programs to test the processing power of different computer systems) to measure the various Lisp systems, and provides an understanding of the technical tradeoffs made during the implementation of a Lisp system. The study is divided into three major parts. The first provides the theoretical background, outlining the factors that go into evaluating the performance of a Lisp system. The second part presents the Lisp implementations: MacLisp, MIT CADR, LMI Lambda, S-I Lisp, Franz Lisp, MIL, Spice Lisp, Vax Common Lisp, Portable Standard Lisp, and Xerox D-Machine. A final part describes the benchmark suite that was used during the major portion of the study and the results themselves. Richard P. Gabriel is President and Chief Technical Officer, Lucid, Inc., and Consulting Associate Professor, Stanford University. Performance and Evaluation of Lisp Systems is included in the Computer Systems series, Research Reports and Notes, edited by Herb Schwetman.

rawTOC:
Series Foreword / vii \\ Preface / ix \\ Acknowledgments / xiii \\ Introduction / 1 \\ The Implementations / 31 \\ The Benchmarks / 81 \\ References / 277 \\ Index / 281

entry:
@Book{Gabriel:1985:PEL,
  author =       "Richard P. Gabriel",
  title =        "Performance and Evaluation of {Lisp} Systems",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xiv + 285",
  year =         "1985",
  ISBN =         "0-262-07093-6, 0-262-25619-3 (e-book)",
  ISBN-13 =      "978-0-262-07093-5, 978-0-262-25619-3 (e-book)",
  LCCN =         "QA76.73.L23 G321 1985",
  bibdate =      "Tue Dec 14 22:53:07 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "MIT Press Series in Computer Systems, Editor: Herb
                 Schwetman",
  abstract =     "This final report of the Stanford Lisp Performance
                 Study, conducted over a three year period by the
                 author, describes implementation techniques,
                 performance tradeoffs, benchmarking techniques, and
                 performance results for all of the major Lisp dialects
                 in use today. A popular high-level programming language
                 used predominantly in artificial intelligence, Lisp was
                 the first language to concentrate on working with
                 symbols instead of numbers. Lisp was introduced by John
                 McCarthy in the early 1960s (McCarthy's LISP 1.5
                 Programmer's Manual published in 1962 is available in
                 paperback from The MIT Press) and its continuous
                 development has enabled it to remain dominant in
                 artificial intelligence. Performance and Evaluation of
                 Lisp Systems is the first book to present descriptions
                 on the Lisp implementation techniques actually in use
                 and can serve as a handbook to the implementation
                 details of all of the various current Lisp expressions.
                 It provides detailed performance information using the
                 tools of benchmarking (the process of utilizing
                 standardized computer programs to test the processing
                 power of different computer systems) to measure the
                 various Lisp systems, and provides an understanding of
                 the technical tradeoffs made during the implementation
                 of a Lisp system. The study is divided into three major
                 parts. The first provides the theoretical background,
                 outlining the factors that go into evaluating the
                 performance of a Lisp system. The second part presents
                 the Lisp implementations: MacLisp, MIT CADR, LMI
                 Lambda, S-I Lisp, Franz Lisp, MIL, Spice Lisp, Vax
                 Common Lisp, Portable Standard Lisp, and Xerox
                 D-Machine. A final part describes the benchmark suite
                 that was used during the major portion of the study and
                 the results themselves. Richard P. Gabriel is President
                 and Chief Technical Officer, Lucid, Inc., and
                 Consulting Associate Professor, Stanford University.
                 Performance and Evaluation of Lisp Systems is included
                 in the Computer Systems series, Research Reports and
                 Notes, edited by Herb Schwetman.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Series Foreword / vii \\
                 Preface / ix \\
                 Acknowledgments / xiii \\
                 Introduction / 1 \\
                 The Implementations / 31 \\
                 The Benchmarks / 81 \\
                 References / 277 \\
                 Index / 281",
}


bibtype: book
filename: master.bib
label: Gal:2008:SPA
author: Sorin G. Gal
title: Shape-Preserving Approximation by Real and Complex Polynomials
publisher: pub-BIRKHAUSER-BOSTON
address: pub-BIRKHAUSER-BOSTON:adr
pages: xiii + 352
year: 2008
ISBN: 0-8176-4702-3, 0-8176-4703-1 OR 0817647023, 0817647031
ISBN13: 978-0-8176-4702-5, 978-0-8176-4703-2 OR 9780817647025, 9780817647032
LCCN: QA221 .G34 2008
bibdate: Tue May 6 13:03:37 MDT 2008
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2008.05.06 13:03:37 MDT
URL: http://www.springer.com/birkhauser/mathematics/book/978-0-8176-4702-5
acknowledgement: ack-nhfb
rawauthor: Sorin G. Gal
rawtitle: Shape-Preserving Approximation by Real and Complex Polynomials
abstract:
First comprehensive treatment in book form of shape-preserving approximation by real or complex polynomials in one or several variables. Of interest to grad students and researchers in approximation theory, mathematical analysis, numerical analysis, Computer Aided Geometric Design, robotics, data fitting, chemistry, fluid mechanics, and engineering. Contains many open problems to spur future research. Rich and updated bibliography.

TOC:
1: Shape-Preserving Approximation by Real Univariate Polynomials / 1 1.2: Shape-Preserving Interpolation by Polynomials / 7 1.3: Bernstein-Type Polynomials Preserving Shapes / 19 1.4: Shisha-Type Results / 35 1.5: Positive and Copositive Polynomial Approximation / 38 1.5.1: Pointwise Positive Approximation / 38 1.5.2: $L^p$-Positive Approximation, $0 < p < infty $ / 39 1.5.3: Uniform and Pointwise Copositive Approximation / 41 1.5.4: $L^p$-Copositive Approximation, $0 < p infty $/ 47 1.5.5: Copositive Approximation with Modified Weighted Moduli of Smoothness / 48 1.5.6: Generalizations / 50 1.6: Monotone and Comonotone Polynomial Approximation / 54 1.6.1: $L^p$-Monotone Approximation, $0 < p leq infty $ / 57 1.6.2: Pointwise Monotone Approximation / 62 1.6.3: $L^p$-Comonotone Approximation, $0 < p leq infty $ / 64 1.6.4: Comonotone Approximation with Modified Weighted Moduli of Smoothness / 68 1.6.5: Nearly Comonotone Approximation / 70 1.7: Convex and Coconvex Polynomial Approximation / 73 1.7.1: Linear Methods in Convex Approximation / 74 1.7.2: Nonlinear Methods in Convex Approximation / 80 1.7.3: Pointwise Convex Approximation / 81 1.7.4: Convex Approximation with Modified Weighted Moduli of Smoothness / 82 1.7.5: Uniform Coconvex Approximation / 83 1.7.6: Coconvex Approximation with Modified Weighted Moduli of Smoothness / 85 1.7.7: Pointwise Coconvex Approximation / 86 1.7.8: Nearly Coconvex Approximation / 87 1.8: Shape-Preserving Approximation by Convolution Polynomials / 90 1.9: Positive Linear Polynomial Operators Preserving Shape / 94 2: Shape-Preserving Approximation by Real Multivariate Polynomials / 99 2.2: Bernstein-Type Polynomials Preserving Shapes / 114 2.3: Shisha-Type Methods and Generalizations / 126 2.3.1: Shisha-Type Approximation / 126 2.3.2: L-Positive Approximation / 129 2.4: Approximation Preserving Three Classical Shapes / 133 2.4.1: Harmonic Polynomial Approximation / 133 2.4.2: Subharmonic Polynomial Approximation / 136 2.4.3: Convex Polynomial Approximation / 138 2.5: Bivariate Monotone Approximation by Convolution Polynomials / 154 2.6: Tensor Product Polynomials Preserving Popoviciu's Convexities / 160 2.6.1: Bivariate/Multivariate Monotone and Convex Approximation / 160 2.6.2: Concepts in Bivariate Coshape Approximation / 178 2.6.3: Bivariate Copositive Approximation / 186 2.6.4: Bivariate Comonotone Approximation / 194 2.6.5: Bivariate Shape-Preserving Interpolation / 207 2.7: Bibliographical Notes and Open Problems / 209 3: Shape-Preserving Approximation by Complex Univariate Polynomials / 215 3.2: Shisha-Type Methods and Generalizations / 224 3.2.1: Shisha-Type Approximation / 230 3.2.2: Re[L]-Positive Approximation / 235 3.3: Shape-Preserving Approximation by Convolution Polynomials / 239 3.3.1: Bell-Shaped Kernels and Complex Convolutions / 240 3.3.2: Geometric and Approximation Properties of Various Complex Convolutions / 247 3.4: Approximation and Geometric Properties of Bernstein Polynomials / 263 3.5: Bibliographical Notes and Open Problems / 280 4: Shape-Preserving Approximation by Complex Multivariate Polynomials / 283 4.2: Bernstein-Type Polynomials Preserving Univalence / 286 4.3: Shape-Preserving Approximation by Other Types of Polynomials / 290 4.4: Bibliographical Notes and Open Problems / 302 5: Appendix: Some Related Topics / 305 5.1: Shape-Preserving Approximation by General Linear Operators on $C[a, b]$ / 305 5.2: Some Real and Complex Nonpolynomial Operators Preserving Shape / 309 5.3: Shape-Preserving Polynomial Approximation in Ordered Vector Spaces / 312 5.4: Complex Nonpolynomial Convolutions Preserving Shape / 316 5.5: Bibliographical Notes and Open Problems / 323

rawabstract:
First comprehensive treatment in book form of shape-preserving approximation by real or complex polynomials in one or several variables. Of interest to grad students and researchers in approximation theory, mathematical analysis, numerical analysis, Computer Aided Geometric Design, robotics, data fitting, chemistry, fluid mechanics, and engineering. Contains many open problems to spur future research. Rich and updated bibliography.

rawTOC:
1: Shape-Preserving Approximation by Real Univariate Polynomials / 1 \\ 1.2: Shape-Preserving Interpolation by Polynomials / 7 \\ 1.3: Bernstein-Type Polynomials Preserving Shapes / 19 \\ 1.4: Shisha-Type Results / 35 \\ 1.5: Positive and Copositive Polynomial Approximation / 38 \\ 1.5.1: Pointwise Positive Approximation / 38 \\ 1.5.2: $L^p$-Positive Approximation, $0 < p < \infty$ / 39 \\ 1.5.3: Uniform and Pointwise Copositive Approximation / 41 \\ 1.5.4: $L^p$-Copositive Approximation, $0 < p \infty$/ 47 \\ 1.5.5: Copositive Approximation with Modified Weighted Moduli of Smoothness / 48 \\ 1.5.6: Generalizations / 50 \\ 1.6: Monotone and Comonotone Polynomial Approximation / 54 \\ 1.6.1: $L^p$-Monotone Approximation, $0 < p \leq \infty$ / 57 \\ 1.6.2: Pointwise Monotone Approximation / 62 \\ 1.6.3: $L^p$-Comonotone Approximation, $0 < p \leq \infty$ / 64 \\ 1.6.4: Comonotone Approximation with Modified Weighted Moduli of Smoothness / 68 \\ 1.6.5: Nearly Comonotone Approximation / 70 \\ 1.7: Convex and Coconvex Polynomial Approximation / 73 \\ 1.7.1: Linear Methods in Convex Approximation / 74 \\ 1.7.2: Nonlinear Methods in Convex Approximation / 80 \\ 1.7.3: Pointwise Convex Approximation / 81 \\ 1.7.4: Convex Approximation with Modified Weighted Moduli of Smoothness / 82 \\ 1.7.5: Uniform Coconvex Approximation / 83 \\ 1.7.6: Coconvex Approximation with Modified Weighted Moduli of Smoothness / 85 \\ 1.7.7: Pointwise Coconvex Approximation / 86 \\ 1.7.8: Nearly Coconvex Approximation / 87 \\ 1.8: Shape-Preserving Approximation by Convolution Polynomials / 90 \\ 1.9: Positive Linear Polynomial Operators Preserving Shape / 94 \\ 2: Shape-Preserving Approximation by Real Multivariate Polynomials / 99 \\ 2.2: Bernstein-Type Polynomials Preserving Shapes / 114 \\ 2.3: Shisha-Type Methods and Generalizations / 126 \\ 2.3.1: Shisha-Type Approximation / 126 \\ 2.3.2: L-Positive Approximation / 129 \\ 2.4: Approximation Preserving Three Classical Shapes / 133 \\ 2.4.1: Harmonic Polynomial Approximation / 133 \\ 2.4.2: Subharmonic Polynomial Approximation / 136 \\ 2.4.3: Convex Polynomial Approximation / 138 \\ 2.5: Bivariate Monotone Approximation by Convolution Polynomials / 154 \\ 2.6: Tensor Product Polynomials Preserving Popoviciu's Convexities / 160 \\ 2.6.1: Bivariate/Multivariate Monotone and Convex Approximation / 160 \\ 2.6.2: Concepts in Bivariate Coshape Approximation / 178 \\ 2.6.3: Bivariate Copositive Approximation / 186 \\ 2.6.4: Bivariate Comonotone Approximation / 194 \\ 2.6.5: Bivariate Shape-Preserving Interpolation / 207 \\ 2.7: Bibliographical Notes and Open Problems / 209 \\ 3: Shape-Preserving Approximation by Complex Univariate Polynomials / 215 \\ 3.2: Shisha-Type Methods and Generalizations / 224 \\ 3.2.1: Shisha-Type Approximation / 230 \\ 3.2.2: Re[L]-Positive Approximation / 235 \\ 3.3: Shape-Preserving Approximation by Convolution Polynomials / 239 \\ 3.3.1: Bell-Shaped Kernels and Complex Convolutions / 240 \\ 3.3.2: Geometric and Approximation Properties of Various Complex Convolutions / 247 \\ 3.4: Approximation and Geometric Properties of Bernstein Polynomials / 263 \\ 3.5: Bibliographical Notes and Open Problems / 280 \\ 4: Shape-Preserving Approximation by Complex Multivariate Polynomials / 283 \\ 4.2: Bernstein-Type Polynomials Preserving Univalence / 286 \\ 4.3: Shape-Preserving Approximation by Other Types of Polynomials / 290 \\ 4.4: Bibliographical Notes and Open Problems / 302 \\ 5: Appendix: Some Related Topics / 305 \\ 5.1: Shape-Preserving Approximation by General Linear Operators on $C[a, b]$ / 305 \\ 5.2: Some Real and Complex Nonpolynomial Operators Preserving Shape / 309 \\ 5.3: Shape-Preserving Polynomial Approximation in Ordered Vector Spaces / 312 \\ 5.4: Complex Nonpolynomial Convolutions Preserving Shape / 316 \\ 5.5: Bibliographical Notes and Open Problems / 323

entry:
@Book{Gal:2008:SPA,
  author =       "Sorin G. Gal",
  title =        "Shape-Preserving Approximation by Real and Complex
                 Polynomials",
  publisher =    pub-BIRKHAUSER-BOSTON,
  address =      pub-BIRKHAUSER-BOSTON:adr,
  pages =        "xiii + 352",
  year =         "2008",
  ISBN =         "0-8176-4702-3, 0-8176-4703-1",
  ISBN-13 =      "978-0-8176-4702-5, 978-0-8176-4703-2",
  LCCN =         "QA221 .G34 2008",
  bibdate =      "Tue May 6 13:03:37 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.springer.com/birkhauser/mathematics/book/978-0-8176-4702-5",
  abstract =     "First comprehensive treatment in book form of
                 shape-preserving approximation by real or complex
                 polynomials in one or several variables. Of interest to
                 grad students and researchers in approximation theory,
                 mathematical analysis, numerical analysis, Computer
                 Aided Geometric Design, robotics, data fitting,
                 chemistry, fluid mechanics, and engineering. Contains
                 many open problems to spur future research. Rich and
                 updated bibliography.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "1: Shape-Preserving Approximation by Real
                 Univariate Polynomials / 1 \\
                 1.2: Shape-Preserving Interpolation by Polynomials / 7
                 \\
                 1.3: Bernstein-Type Polynomials Preserving Shapes / 19
                 \\
                 1.4: Shisha-Type Results / 35 \\
                 1.5: Positive and Copositive Polynomial Approximation /
                 38 \\
                 1.5.1: Pointwise Positive Approximation / 38 \\
                 1.5.2: $L^p$-Positive Approximation, $0 < p < \infty$ /
                 39 \\
                 1.5.3: Uniform and Pointwise Copositive Approximation /
                 41 \\
                 1.5.4: $L^p$-Copositive Approximation, $0 < p \infty$/
                 47 \\
                 1.5.5: Copositive Approximation with Modified Weighted
                 Moduli of Smoothness / 48 \\
                 1.5.6: Generalizations / 50 \\
                 1.6: Monotone and Comonotone Polynomial Approximation /
                 54 \\
                 1.6.1: $L^p$-Monotone Approximation, $0 < p \leq
                 \infty$ / 57 \\
                 1.6.2: Pointwise Monotone Approximation / 62 \\
                 1.6.3: $L^p$-Comonotone Approximation, $0 < p \leq
                 \infty$ / 64 \\
                 1.6.4: Comonotone Approximation with Modified Weighted
                 Moduli of Smoothness / 68 \\
                 1.6.5: Nearly Comonotone Approximation / 70 \\
                 1.7: Convex and Coconvex Polynomial Approximation / 73
                 \\
                 1.7.1: Linear Methods in Convex Approximation / 74 \\
                 1.7.2: Nonlinear Methods in Convex Approximation / 80
                 \\
                 1.7.3: Pointwise Convex Approximation / 81 \\
                 1.7.4: Convex Approximation with Modified Weighted
                 Moduli of Smoothness / 82 \\
                 1.7.5: Uniform Coconvex Approximation / 83 \\
                 1.7.6: Coconvex Approximation with Modified Weighted
                 Moduli of Smoothness / 85 \\
                 1.7.7: Pointwise Coconvex Approximation / 86 \\
                 1.7.8: Nearly Coconvex Approximation / 87 \\
                 1.8: Shape-Preserving Approximation by Convolution
                 Polynomials / 90 \\
                 1.9: Positive Linear Polynomial Operators Preserving
                 Shape / 94 \\
                 2: Shape-Preserving Approximation by Real Multivariate
                 Polynomials / 99 \\
                 2.2: Bernstein-Type Polynomials Preserving Shapes / 114
                 \\
                 2.3: Shisha-Type Methods and Generalizations / 126 \\
                 2.3.1: Shisha-Type Approximation / 126 \\
                 2.3.2: L-Positive Approximation / 129 \\
                 2.4: Approximation Preserving Three Classical Shapes /
                 133 \\
                 2.4.1: Harmonic Polynomial Approximation / 133 \\
                 2.4.2: Subharmonic Polynomial Approximation / 136 \\
                 2.4.3: Convex Polynomial Approximation / 138 \\
                 2.5: Bivariate Monotone Approximation by Convolution
                 Polynomials / 154 \\
                 2.6: Tensor Product Polynomials Preserving Popoviciu's
                 Convexities / 160 \\
                 2.6.1: Bivariate/Multivariate Monotone and Convex
                 Approximation / 160 \\
                 2.6.2: Concepts in Bivariate Coshape Approximation /
                 178 \\
                 2.6.3: Bivariate Copositive Approximation / 186 \\
                 2.6.4: Bivariate Comonotone Approximation / 194 \\
                 2.6.5: Bivariate Shape-Preserving Interpolation / 207
                 \\
                 2.7: Bibliographical Notes and Open Problems / 209 \\
                 3: Shape-Preserving Approximation by Complex Univariate
                 Polynomials / 215 \\
                 3.2: Shisha-Type Methods and Generalizations / 224 \\
                 3.2.1: Shisha-Type Approximation / 230 \\
                 3.2.2: Re[L]-Positive Approximation / 235 \\
                 3.3: Shape-Preserving Approximation by Convolution
                 Polynomials / 239 \\
                 3.3.1: Bell-Shaped Kernels and Complex Convolutions /
                 240 \\
                 3.3.2: Geometric and Approximation Properties of
                 Various Complex Convolutions / 247 \\
                 3.4: Approximation and Geometric Properties of
                 Bernstein Polynomials / 263 \\
                 3.5: Bibliographical Notes and Open Problems / 280 \\
                 4: Shape-Preserving Approximation by Complex
                 Multivariate Polynomials / 283 \\
                 4.2: Bernstein-Type Polynomials Preserving Univalence /
                 286 \\
                 4.3: Shape-Preserving Approximation by Other Types of
                 Polynomials / 290 \\
                 4.4: Bibliographical Notes and Open Problems / 302 \\
                 5: Appendix: Some Related Topics / 305 \\
                 5.1: Shape-Preserving Approximation by General Linear
                 Operators on $C[a, b]$ / 305 \\
                 5.2: Some Real and Complex Nonpolynomial Operators
                 Preserving Shape / 309 \\
                 5.3: Shape-Preserving Polynomial Approximation in
                 Ordered Vector Spaces / 312 \\
                 5.4: Complex Nonpolynomial Convolutions Preserving
                 Shape / 316 \\
                 5.5: Bibliographical Notes and Open Problems / 323",
}


bibtype: book
filename: master.bib
label: Galison:2003:ECP
author: Peter Galison
title: Einstein's Clocks and Poincare's Maps: Empires of Time
publisher: pub-NORTON
address: pub-NORTON:adr
pages: 389
year: 2003
LCCN: QB209 .G35 2003
bibdate: Tue Jun 01 19:13:18 2004
bibtimestamp: 2004.06.01 19:13:18 ???
acknowledgement: ack-nhfb
rawauthor: Peter Galison
rawtitle: {Einstein}'s Clocks and {Poincar{\'e}}'s Maps: Empires of Time
ISBN:
0-393-02001-0 (hardcover), 0-393-32604-7 (paperback) OR 0393020010 (hardcover), 0393326047 (paperback)

ISBN13:
978-0-393-02001-4 (hardcover), 978-0-393-32604-8 (paperback) OR 9780393020014 (hardcover), 9780393326048 (paperback)

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/shps-b.bib

abstract:
Clocks and trains, telegraphs and colonial conquest: the challenges of the late nineteenth century were an indispensable real-world background to the enormous theoretical breakthrough of relativity. And two giants at the foundations of modern science were converging, step by step, on the answer: Albert Einstein, a young, obscure German physicist experimenting with measuring time using telegraph networks and with the coordination of clocks at train stations; and the renowned mathematician Henri Poincare, president of the French Bureau of Longitude, mapping time coordinates across continents. Each found that to understand the newly global world, he had to determine whether there existed a pure time was relative. The esteemed historian of science Peter Galison has culled new information from rarely seen photographs, forgotten patents, and unexplored archives to tell the fascinating story of two scientists whose concrete, professional preoccupations engaged them in a silent race toward a theory that would conquer the empire of time.

TOC:
Acknowledgments 1: Synchrony Einstein's times A critical opalescence Order of argument 2: Coal, chaos and convention Coal Chaos Convention 3: The electric worldmap Standards of space and time Times, trains, and telegraphs Marketing time Measuring society Time into space Battle over neutrality 4: Poincare's maps Time, reason, nation Decimalizing time Of time and maps Mission to Quito Etherial time A triple conjunction 5: Einstein's clocks Materializing time Theory-machines Patent truths Clocks first Radio Eiffel 6: The place of time Without mechanics Two modernisms Looking up, looking down Notes Bibliography Index

rawabstract:
Clocks and trains, telegraphs and colonial conquest: the challenges of the late nineteenth century were an indispensable real-world background to the enormous theoretical breakthrough of relativity. And two giants at the foundations of modern science were converging, step by step, on the answer: Albert Einstein, a young, obscure German physicist experimenting with measuring time using telegraph networks and with the coordination of clocks at train stations; and the renowned mathematician Henri Poincar{\'e}, president of the French Bureau of Longitude, mapping time coordinates across continents. Each found that to understand the newly global world, he had to determine whether there existed a pure time was relative. The esteemed historian of science Peter Galison has culled new information from rarely seen photographs, forgotten patents, and unexplored archives to tell the fascinating story of two scientists whose concrete, professional preoccupations engaged them in a silent race toward a theory that would conquer the empire of time.

shortTOC:
1: Synchrony 2: Coal and chaos 3: The electric worldmap 4: Poincare's maps 5: Einstein's clocks 6: The place of time

rawshortTOC:
1: Synchrony \\ 2: Coal and chaos \\ 3: The electric worldmap \\ 4: Poincar{\'e}'s maps \\ 5: Einstein's clocks \\ 6: The place of time

rawTOC:
Acknowledgments \\ 1: Synchrony \\ Einstein's times \\ A critical opalescence \\ Order of argument \\ 2: Coal, chaos and convention \\ Coal \\ Chaos \\ Convention \\ 3: The electric worldmap \\ Standards of space and time \\ Times, trains, and telegraphs \\ Marketing time \\ Measuring society \\ Time into space \\ Battle over neutrality \\ 4: Poincar{\'e}'s maps \\ Time, reason, nation \\ Decimalizing time \\ Of time and maps \\ Mission to Quito \\ Etherial time \\ A triple conjunction \\ 5: Einstein's clocks \\ Materializing time \\ Theory-machines \\ Patent truths \\ Clocks first \\ Radio Eiffel \\ 6: The place of time \\ Without mechanics \\ Two modernisms \\ Looking up, looking down \\ Notes \\ Bibliography \\ Index

entry:
@Book{Galison:2003:ECP,
  author =       "Peter Galison",
  title =        "{Einstein}'s Clocks and {Poincar{\'e}}'s Maps: Empires
                 of Time",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "389",
  year =         "2003",
  ISBN =         "0-393-02001-0 (hardcover), 0-393-32604-7 (paperback)",
  ISBN-13 =      "978-0-393-02001-4 (hardcover), 978-0-393-32604-8
                 (paperback)",
  LCCN =         "QB209 .G35 2003",
  bibdate =      "Tue Jun 01 19:13:18 2004",
  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/shps-b.bib",
  price =        "US\$23.95",
  abstract =     "Clocks and trains, telegraphs and colonial conquest:
                 the challenges of the late nineteenth century were an
                 indispensable real-world background to the enormous
                 theoretical breakthrough of relativity. And two giants
                 at the foundations of modern science were converging,
                 step by step, on the answer: Albert Einstein, a young,
                 obscure German physicist experimenting with measuring
                 time using telegraph networks and with the coordination
                 of clocks at train stations; and the renowned
                 mathematician Henri Poincar{\'e}, president of the
                 French Bureau of Longitude, mapping time coordinates
                 across continents. Each found that to understand the
                 newly global world, he had to determine whether there
                 existed a pure time was relative. The esteemed
                 historian of science Peter Galison has culled new
                 information from rarely seen photographs, forgotten
                 patents, and unexplored archives to tell the
                 fascinating story of two scientists whose concrete,
                 professional preoccupations engaged them in a silent
                 race toward a theory that would conquer the empire of
                 time.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1: Synchrony \\
                 2: Coal and chaos \\
                 3: The electric worldmap \\
                 4: Poincar{\'e}'s maps \\
                 5: Einstein's clocks \\
                 6: The place of time",
  tableofcontents = "Acknowledgments \\
                 1: Synchrony \\
                 Einstein's times \\
                 A critical opalescence \\
                 Order of argument \\
                 2: Coal, chaos and convention \\
                 Coal \\
                 Chaos \\
                 Convention \\
                 3: The electric worldmap \\
                 Standards of space and time \\
                 Times, trains, and telegraphs \\
                 Marketing time \\
                 Measuring society \\
                 Time into space \\
                 Battle over neutrality \\
                 4: Poincar{\'e}'s maps \\
                 Time, reason, nation \\
                 Decimalizing time \\
                 Of time and maps \\
                 Mission to Quito \\
                 Etherial time \\
                 A triple conjunction \\
                 5: Einstein's clocks \\
                 Materializing time \\
                 Theory-machines \\
                 Patent truths \\
                 Clocks first \\
                 Radio Eiffel \\
                 6: The place of time \\
                 Without mechanics \\
                 Two modernisms \\
                 Looking up, looking down \\
                 Notes \\
                 Bibliography \\
                 Index",
}


bibtype: book
filename: master.bib
label: Gallivan:1990:PAM
title: Parallel Algorithms for Matrix Computations
publisher: pub-SIAM
address: pub-SIAM:adr
pages: ix + 197
year: 1990
ISBN: 0-89871-260-2 (paperback), 1-61197-170-5 (e-book) OR 0898712602 (paperback), 1611971705 (ebook)
LCCN: QA188 .P367 1990
bibdate: Tue Dec 14 22:53:09 1993
bibtimestamp: 1993.12.14 22:53:09 ???
ZMnumber: 0711.00021
acknowledgement: ack-nhfb
rawtitle: Parallel Algorithms for Matrix Computations
author:
K. A. Gallivan and Michael T. Heath and Esmond Ng and James M. Ortega and Barry W. Peyton and R. J. Plemmons and Charles H. Romine and A. H. Sameh and Robert G. Voigt

ISBN13:
978-0-89871-260-5 (paperback), 978-1-61197-170-5 (e-book) OR 9780898712605 (paperback), 9781611971705 (ebook)

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

abstract:
Describes a selection of important parallel algorithms for matrix computations. Reviews the current status and provides an overall perspective of parallel algorithms for solving problems arising in the major areas of numerical linear algebra, including (1) direct solution of dense, structured, or sparse linear systems, (2) dense or structured least squares computations, (3) dense or structured eigenvalue and singular value computations, and (4) rapid elliptic solvers. The book emphasizes computational primitives whose efficient execution on parallel and vector computers is essential to obtain high performance algorithms. Consists of two comprehensive survey papers on important parallel algorithms for solving problems arising in the major areas of numerical linear algebra--direct solution of linear systems, least squares computations, eigenvalue and singular value computations, and rapid elliptic solvers, plus an extensive up-to-date bibliography (2,000 items) on related research.

TOC:
Parallel algorithms for dense linear algebra computations / K. A. Gallivan, R. J. Plemmons, and A. H. Sameh (Reprinted from SIAM Review, March 1990, 82 pp.) / 1 Parallel algorithms for sparse linear systems / M. T. Heath, E. G. Y. Ng, and B. W. Peyton / 83 A bibliography on parallel and vector numerical algorithms / J. M. Ortega, R. G. Voigt, and C. H. Romine / 125

rawabstract:
Describes a selection of important parallel algorithms for matrix computations. Reviews the current status and provides an overall perspective of parallel algorithms for solving problems arising in the major areas of numerical linear algebra, including (1) direct solution of dense, structured, or sparse linear systems, (2) dense or structured least squares computations, (3) dense or structured eigenvalue and singular value computations, and (4) rapid elliptic solvers. The book emphasizes computational primitives whose efficient execution on parallel and vector computers is essential to obtain high performance algorithms. Consists of two comprehensive survey papers on important parallel algorithms for solving problems arising in the major areas of numerical linear algebra--direct solution of linear systems, least squares computations, eigenvalue and singular value computations, and rapid elliptic solvers, plus an extensive up-to-date bibliography (2,000 items) on related research.

rawauthor:
K. A. Gallivan and Michael T. Heath and Esmond Ng and James M. Ortega and Barry W. Peyton and R. J. Plemmons and Charles H. Romine and A. H. Sameh and Robert G. Voigt

rawTOC:
Parallel algorithms for dense linear algebra computations / K. A. Gallivan, R. J. Plemmons, and A. H. Sameh (Reprinted from SIAM Review, March 1990, 82 pp.) / 1 \\ Parallel algorithms for sparse linear systems / M. T. Heath, E. G. Y. Ng, and B. W. Peyton / 83 \\ A bibliography on parallel and vector numerical algorithms / J. M. Ortega, R. G. Voigt, and C. H. Romine / 125

entry:
@Book{Gallivan:1990:PAM,
  author =       "K. A. Gallivan and Michael T. Heath and Esmond Ng and
                 James M. Ortega and Barry W. Peyton and R. J. Plemmons
                 and Charles H. Romine and A. H. Sameh and Robert G.
                 Voigt",
  title =        "Parallel Algorithms for Matrix Computations",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "ix + 197",
  year =         "1990",
  ISBN =         "0-89871-260-2 (paperback), 1-61197-170-5 (e-book)",
  ISBN-13 =      "978-0-89871-260-5 (paperback), 978-1-61197-170-5
                 (e-book)",
  LCCN =         "QA188 .P367 1990",
  bibdate =      "Tue Dec 14 22:53:09 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana1990.bib",
  ZMnumber =     "0711.00021",
  abstract =     "Describes a selection of important parallel algorithms
                 for matrix computations. Reviews the current status and
                 provides an overall perspective of parallel algorithms
                 for solving problems arising in the major areas of
                 numerical linear algebra, including (1) direct solution
                 of dense, structured, or sparse linear systems, (2)
                 dense or structured least squares computations, (3)
                 dense or structured eigenvalue and singular value
                 computations, and (4) rapid elliptic solvers. The book
                 emphasizes computational primitives whose efficient
                 execution on parallel and vector computers is essential
                 to obtain high performance algorithms. Consists of two
                 comprehensive survey papers on important parallel
                 algorithms for solving problems arising in the major
                 areas of numerical linear algebra--direct solution of
                 linear systems, least squares computations, eigenvalue
                 and singular value computations, and rapid elliptic
                 solvers, plus an extensive up-to-date bibliography
                 (2,000 items) on related research.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Parallel algorithms for dense linear algebra
                 computations / K. A. Gallivan, R. J. Plemmons, and A.
                 H. Sameh (Reprinted from SIAM Review, March 1990, 82
                 pp.) / 1 \\
                 Parallel algorithms for sparse linear systems / M. T.
                 Heath, E. G. Y. Ng, and B. W. Peyton / 83 \\
                 A bibliography on parallel and vector numerical
                 algorithms / J. M. Ortega, R. G. Voigt, and C. H.
                 Romine / 125",
}


bibtype: book
filename: master.bib
label: Gallmeister:1995:PPR
author: Bill O. Gallmeister
title: POSIX.4: Programming for the Real World
publisher: pub-ORA
address: pub-ORA:adr
pages: xviii + 548
month: jan
monthnumber: 1
year: 1995
ISBN: 1-56592-074-0 OR 1565920740
ISBN13: 978-1-56592-074-3 OR 9781565920743
LCCN: QA76.54 .G34 1995; QA76.76.O63 G34 1995
bibdate: Mon Apr 18 14:50:51 MDT 2005
bibtimestamp: 2005.04.18 14:50:51 MDT
URL: http://www.oreilly.com/catalog/9781565920743; http://www.oreilly.com/catalog/posix4
subject: Real-time programming; POSIX (Computer software standard)
acknowledgement: ack-nhfb
rawauthor: Bill O. Gallmeister
rawtitle: {POSIX.4}: Programming for the Real World
bibsource:
ftp://ftp.ora.com/pub/book.catalog; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/ora.bib; z3950.loc.gov:7090/Voyager

TOC:
1: Introduction 2: The POSIX Way 3: The Basics of Real-Time: Multiple Tasks 4: Better Coordination: Messages, Shared Memory, and Synchronization 5: On Time: Scheduling, Time, and Memory Locking 6: I/O for the Real World 7: Performance, or How to Choose an Operating System Manpages Appendix: Exercise Code

rawTOC:
1: Introduction \\ 2: The POSIX Way \\ 3: The Basics of Real-Time: Multiple Tasks \\ 4: Better Coordination: Messages, Shared Memory, and Synchronization \\ 5: On Time: Scheduling, Time, and Memory Locking \\ 6: I/O for the Real World \\ 7: Performance, or How to Choose an Operating System \\ Manpages \\ Appendix: Exercise Code

entry:
@Book{Gallmeister:1995:PPR,
  author =       "Bill O. Gallmeister",
  title =        "{POSIX.4}: Programming for the Real World",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xviii + 548",
  month =        jan,
  year =         "1995",
  ISBN =         "1-56592-074-0",
  ISBN-13 =      "978-1-56592-074-3",
  LCCN =         "QA76.54 .G34 1995; QA76.76.O63 G34 1995",
  bibdate =      "Mon Apr 18 14:50:51 MDT 2005",
  bibsource =    "ftp://ftp.ora.com/pub/book.catalog;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$29.95",
  URL =          "http://www.oreilly.com/catalog/9781565920743;
                 http://www.oreilly.com/catalog/posix4",
  acknowledgement = ack-nhfb,
  subject =      "Real-time programming; POSIX (Computer software
                 standard)",
  tableofcontents = "1: Introduction \\
                 2: The POSIX Way \\
                 3: The Basics of Real-Time: Multiple Tasks \\
                 4: Better Coordination: Messages, Shared Memory, and
                 Synchronization \\
                 5: On Time: Scheduling, Time, and Memory Locking \\
                 6: I/O for the Real World \\
                 7: Performance, or How to Choose an Operating System
                 \\
                 Manpages \\
                 Appendix: Exercise Code",
}


bibtype: book
filename: master.bib
label: Gancarz:1995:UP
author: Mike Gancarz
title: The UNIX philosophy
publisher: pub-DP
address: pub-DP:adr
pages: xix + 151
year: 1995
ISBN: 1-55558-123-4 OR 1555581234
ISBN13: 978-1-55558-123-7 OR 9781555581237
LCCN: QA76.76.O63G365 1995
bibdate: Tue May 25 06:45:28 1999
bibtimestamp: 1999.05.25 06:45:28 ???
acknowledgement: ack-nhfb
rawauthor: Mike Gancarz
rawtitle: The {UNIX} philosophy
bibsource:
https://www.math.utah.edu/pub/tex/bib/gnu.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

abstract:
``Why use UNIX in the first place?''. Readers will discover the rationale and reasons for such concepts as file system organization, user interface and other system characteristics. In an informative, non-technical fashion, booktitle The UNIX Philosophy explores the general principles for applying the UNIX philosophy to software development. This book describes complex software design principles and addresses the importance of small programs, code and data portability, early prototyping, and open user interfaces.

TOC:
1: The UNIX Philosophy: a Cost of Thousands The UNIX philosophy in a nutshell 2: One Small Step for Humankind Tenet 1: small is beautiful Software engineering made easy Tenet 2: make each program do one thing well 3: Rapid Prototyping for Fun and Profit Tenet 3: build a prototype as soon as possible The three systems of man The first system of man The second system of man The third system of man Building the third system 4: The Probability Priority Tenet 4: choose portability over efficiency Case study: the Atari 2600 Tenet 5: store numerical data in flat ASCII files Case study: one UNIX philosopher's bag of tricks 5: Now That's Leverage! Tenet 6: use software leverage to your advantage Tenet 7: use shell scripts to increase leverage and portability 6: The Perils of Interactive Programs Tenet 8: avoid captive user interfaces Tenet 9: make every program a filter The UNIX environment: using programs as filters 7: More UNIX Philosophy: Ten Lesser Tenets 1. Allow the user to tailor the environment 2. Make operating system kernels small and lightweight 3. Use lower case and keep it short 4. Save trees 5. Silence is golden 6. Think parallel 7. The sum of the parts is greater than the whole 8. Look for the 90 percent solution 9. Worse is better 10. Think hierarchically 8: Making UNIX Do One Thing Well The UNIX philosophy: putting it all together 9: UNIX and Other Operating System Philosophies The Atari home computer: human engineering as art MS-DOS: over 70 million users can't be wrong Open VMS: the antithesis of UNIX?

rawabstract:
``Why use UNIX in the first place?''. Readers will discover the rationale and reasons for such concepts as file system organization, user interface and other system characteristics. In an informative, non-technical fashion, \booktitle{The UNIX Philosophy} explores the general principles for applying the UNIX philosophy to software development. This book describes complex software design principles and addresses the importance of small programs, code and data portability, early prototyping, and open user interfaces.

rawTOC:
1: The UNIX Philosophy: a Cost of Thousands \\ The UNIX philosophy in a nutshell \\ 2: One Small Step for Humankind \\ Tenet 1: small is beautiful \\ Software engineering made easy \\ Tenet 2: make each program do one thing well \\ 3: Rapid Prototyping for Fun and Profit \\ Tenet 3: build a prototype as soon as possible \\ The three systems of man \\ The first system of man \\ The second system of man \\ The third system of man \\ Building the third system \\ 4: The Probability Priority \\ Tenet 4: choose portability over efficiency \\ Case study: the Atari 2600 \\ Tenet 5: store numerical data in flat ASCII files \\ Case study: one UNIX philosopher's bag of tricks \\ 5: Now That's Leverage! \\ Tenet 6: use software leverage to your advantage \\ Tenet 7: use shell scripts to increase leverage and portability \\ 6: The Perils of Interactive Programs \\ Tenet 8: avoid captive user interfaces \\ Tenet 9: make every program a filter \\ The UNIX environment: using programs as filters \\ 7: More UNIX Philosophy: Ten Lesser Tenets \\ 1. Allow the user to tailor the environment \\ 2. Make operating system kernels small and lightweight \\ 3. Use lower case and keep it short \\ 4. Save trees \\ 5. Silence is golden \\ 6. Think parallel \\ 7. The sum of the parts is greater than the whole \\ 8. Look for the 90 percent solution \\ 9. Worse is better \\ 10. Think hierarchically \\ 8: Making UNIX Do One Thing Well \\ The UNIX philosophy: putting it all together \\ 9: UNIX and Other Operating System Philosophies \\ The Atari home computer: human engineering as art \\ MS-DOS: over 70 million users can't be wrong \\ Open VMS: the antithesis of UNIX?

entry:
@Book{Gancarz:1995:UP,
  author =       "Mike Gancarz",
  title =        "The {UNIX} philosophy",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  pages =        "xix + 151",
  year =         "1995",
  ISBN =         "1-55558-123-4",
  ISBN-13 =      "978-1-55558-123-7",
  LCCN =         "QA76.76.O63G365 1995",
  bibdate =      "Tue May 25 06:45:28 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/gnu.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "``Why use UNIX in the first place?''. Readers will
                 discover the rationale and reasons for such concepts as
                 file system organization, user interface and other
                 system characteristics. In an informative,
                 non-technical fashion, \booktitle{The UNIX Philosophy}
                 explores the general principles for applying the UNIX
                 philosophy to software development. This book describes
                 complex software design principles and addresses the
                 importance of small programs, code and data
                 portability, early prototyping, and open user
                 interfaces.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: The UNIX Philosophy: a Cost of Thousands \\
                 The UNIX philosophy in a nutshell \\
                 2: One Small Step for Humankind \\
                 Tenet 1: small is beautiful \\
                 Software engineering made easy \\
                 Tenet 2: make each program do one thing well \\
                 3: Rapid Prototyping for Fun and Profit \\
                 Tenet 3: build a prototype as soon as possible \\
                 The three systems of man \\
                 The first system of man \\
                 The second system of man \\
                 The third system of man \\
                 Building the third system \\
                 4: The Probability Priority \\
                 Tenet 4: choose portability over efficiency \\
                 Case study: the Atari 2600 \\
                 Tenet 5: store numerical data in flat ASCII files \\
                 Case study: one UNIX philosopher's bag of tricks \\
                 5: Now That's Leverage! \\
                 Tenet 6: use software leverage to your advantage \\
                 Tenet 7: use shell scripts to increase leverage and
                 portability \\
                 6: The Perils of Interactive Programs \\
                 Tenet 8: avoid captive user interfaces \\
                 Tenet 9: make every program a filter \\
                 The UNIX environment: using programs as filters \\
                 7: More UNIX Philosophy: Ten Lesser Tenets \\
                 1. Allow the user to tailor the environment \\
                 2. Make operating system kernels small and lightweight
                 \\
                 3. Use lower case and keep it short \\
                 4. Save trees \\
                 5. Silence is golden \\
                 6. Think parallel \\
                 7. The sum of the parts is greater than the whole \\
                 8. Look for the 90 percent solution \\
                 9. Worse is better \\
                 10. Think hierarchically \\
                 8: Making UNIX Do One Thing Well \\
                 The UNIX philosophy: putting it all together \\
                 9: UNIX and Other Operating System Philosophies \\
                 The Atari home computer: human engineering as art \\
                 MS-DOS: over 70 million users can't be wrong \\
                 Open VMS: the antithesis of UNIX?",
}


bibtype: book
filename: master.bib
label: Garbow:1977:MER
author: B. S. Garbow and J. M. Boyle and J. J. Dongarra and C. B. Moler
title: Matrix Eigensystem Routines: EISPACK Guide Extension
volume: 51
publisher: pub-SV
address: pub-SV:adr
pages: viii + 343
year: 1977
ISBN: 0-387-08254-9 (New York), 3-540-08254-9 (Berlin) OR 0387082549 (New York), 3540082549 (Berlin)
LCCN: QA193 .M381, QA267.A1,L43 no. 51
bibdate: Mon Dec 13 15:14:28 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.13 15:14:28 ???
series: Lecture Notes in Computer Science, Editors: G. Goos and J. Hartmanis
acknowledgement: ack-nhfb
rawauthor: B. S. Garbow and J. M. Boyle and J. J. Dongarra and C. B. Moler
rawtitle: Matrix Eigensystem Routines: {EISPACK} Guide Extension
ISBN13:
978-0-387-08254-7 (New York), 978-3-540-08254-5 (Berlin) OR 9780387082547 (New York), 9783540082545 (Berlin)

TOC:
How to use EISPACK Validation of EISPACK Execution times for EISPACK Certification and availability of EISPACK Differences between the EISPACK subroutines and the handbook Algol procedures Documentation and source listings

rawTOC:
How to use EISPACK \\ Validation of EISPACK \\ Execution times for EISPACK \\ Certification and availability of EISPACK \\ Differences between the EISPACK subroutines and the handbook Algol procedures \\ Documentation and source listings

entry:
@Book{Garbow:1977:MER,
  author =       "B. S. Garbow and J. M. Boyle and J. J. Dongarra and C.
                 B. Moler",
  title =        "Matrix Eigensystem Routines: {EISPACK} Guide
                 Extension",
  volume =       "51",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "viii + 343",
  year =         "1977",
  ISBN =         "0-387-08254-9 (New York), 3-540-08254-9 (Berlin)",
  ISBN-13 =      "978-0-387-08254-7 (New York), 978-3-540-08254-5
                 (Berlin)",
  LCCN =         "QA193 .M381, QA267.A1,L43 no. 51",
  bibdate =      "Mon Dec 13 15:14:28 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Lecture Notes in Computer Science, Editors: G. Goos
                 and J. Hartmanis",
  acknowledgement = ack-nhfb,
  tableofcontents = "How to use EISPACK \\
                 Validation of EISPACK \\
                 Execution times for EISPACK \\
                 Certification and availability of EISPACK \\
                 Differences between the EISPACK subroutines and the
                 handbook Algol procedures \\
                 Documentation and source listings",
}


bibtype: book
filename: master.bib
label: Garfinkel:1995:PPG
author: Simson Garfinkel
title: PGP: Pretty Good Privacy
publisher: pub-ORA
address: pub-ORA:adr
pages: xxxiii + 393
year: 1995
ISBN: 1-56592-098-8 OR 1565920988
ISBN13: 978-1-56592-098-9 OR 9781565920989
LCCN: QA76.9.A25G36 1995
bibdate: Sat Jun 13 08:23:01 1998
bibtimestamp: 1998.06.13 08:23:01 ???
keywords: Computers --- Access control; Data encryption (Computer science); PGP (Computer file)
acknowledgement: ack-nhfb
rawauthor: Simson Garfinkel
rawtitle: {PGP}: Pretty Good Privacy
bibsource:
ftp://ftp.ora.com/pub/products/catalogs/book.catalog; https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib; https://www.math.utah.edu/pub/tex/bib/css.bib; https://www.math.utah.edu/pub/tex/bib/internet.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/ora.bib

TOC:
Foreword Preface I: PGP overview 1. Introduction to PGP 2. Cryptography basics II: Cryptography history and policy 3. Cryptography before PGP 4. A pretty good history of PGP 5. Privacy and public policy 6. Cryptography patents and export III: Using PGP 7. Protecting your files 8. Creating PGP keys 9. Managing PGP keys 10. Encrypting email 11. Using digital signatures 12. Certifying and distributing keys 13. Revoking, disabling, and escrowing keys 14. PGP configuration file 15. PGP internet key servers IV: Appendices A: Getting PGP B: Installing PGP on a PC C: Installing PGP on a UNIX system D: Installing PGP on a Macintosh E: Versions of PGP F: The mathematics of cryptography Glossary Bibliography Index

rawTOC:
Foreword \\ Preface \\ I: PGP overview \\ 1. Introduction to PGP \\ 2. Cryptography basics \\ II: Cryptography history and policy \\ 3. Cryptography before PGP \\ 4. A pretty good history of PGP \\ 5. Privacy and public policy \\ 6. Cryptography patents and export \\ III: Using PGP \\ 7. Protecting your files \\ 8. Creating PGP keys \\ 9. Managing PGP keys \\ 10. Encrypting email \\ 11. Using digital signatures \\ 12. Certifying and distributing keys \\ 13. Revoking, disabling, and escrowing keys \\ 14. PGP configuration file \\ 15. PGP internet key servers \\ IV: Appendices \\ A: Getting PGP \\ B: Installing PGP on a PC \\ C: Installing PGP on a UNIX system \\ D: Installing PGP on a Macintosh \\ E: Versions of PGP \\ F: The mathematics of cryptography \\ Glossary \\ Bibliography \\ Index

entry:
@Book{Garfinkel:1995:PPG,
  author =       "Simson Garfinkel",
  title =        "{PGP}: Pretty Good Privacy",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxxiii + 393",
  year =         "1995",
  ISBN =         "1-56592-098-8",
  ISBN-13 =      "978-1-56592-098-9",
  LCCN =         "QA76.9.A25G36 1995",
  bibdate =      "Sat Jun 13 08:23:01 1998",
  bibsource =    "ftp://ftp.ora.com/pub/products/catalogs/book.catalog;
                 https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/css.bib;
                 https://www.math.utah.edu/pub/tex/bib/internet.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib",
  price =        "US\$24.95",
  acknowledgement = ack-nhfb,
  keywords =     "Computers --- Access control; Data encryption
                 (Computer science); PGP (Computer file)",
  tableofcontents = "Foreword \\
                 Preface \\
                 I: PGP overview \\
                 1. Introduction to PGP \\
                 2. Cryptography basics \\
                 II: Cryptography history and policy \\
                 3. Cryptography before PGP \\
                 4. A pretty good history of PGP \\
                 5. Privacy and public policy \\
                 6. Cryptography patents and export \\
                 III: Using PGP \\
                 7. Protecting your files \\
                 8. Creating PGP keys \\
                 9. Managing PGP keys \\
                 10. Encrypting email \\
                 11. Using digital signatures \\
                 12. Certifying and distributing keys \\
                 13. Revoking, disabling, and escrowing keys \\
                 14. PGP configuration file \\
                 15. PGP internet key servers \\
                 IV: Appendices \\
                 A: Getting PGP \\
                 B: Installing PGP on a PC \\
                 C: Installing PGP on a UNIX system \\
                 D: Installing PGP on a Macintosh \\
                 E: Versions of PGP \\
                 F: The mathematics of cryptography \\
                 Glossary \\
                 Bibliography \\
                 Index",
}


bibtype: book
filename: master.bib
label: Garfinkel:1996:PUI
author: Simson Garfinkel and Gene Spafford
title: Practical UNIX & Internet Security
publisher: pub-ORA
address: pub-ORA:adr
edition: Second
pages: xxix + 971
year: 1996
ISBN: 1-56592-148-8 OR 1565921488
ISBN13: 978-1-56592-148-1 OR 9781565921481
LCCN: QA76.76.O63 G38 1996
bibdate: Mon Apr 18 14:51:47 MDT 2005
bibtimestamp: 2005.04.18 14:51:47 MDT
series: Computer security
URL: http://www.ora.com/gnn/bus/ora/item/pus2.html; http://www.oreilly.com/catalog/puis
remark: Revised edition of Practical UNIX security (1991).
subject: Operating systems (Computers); UNIX (Computer file); Computer security; Internet; Congresses
acknowledgement: ack-nhfb
rawauthor: Simson Garfinkel and Gene Spafford
rawtitle: Practical {UNIX} \& {Internet} Security
bibsource:
ftp://ftp.ora.com/pub/products/catalogs/book.catalog; https://www.math.utah.edu/pub/tex/bib/internet.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/ora.bib; z3950.loc.gov:7090/Voyager

abstract:
When booktitle Practical UNIX Security was first published in 1991, it became an instant classic. Crammed with information about host security, it saved many a UNIX system administrator and user from disaster. This second edition is a complete rewrite of the original book. It's packed with twice the pages and offers even more practical information for UNIX users and administrators. You'll find coverage of features of many types of UNIX systems, including SunOS, Solaris, BSDI, AIX, HP-UX, Digital UNIX, and Linux. Practical UNIX and Internet Security includes detailed coverage of Internet security and networking issues, including World Wide Web security, wrapper and proxy programs, integrity management tools, secure programming, and how to secure TCP/IP services (e.g., FTP, SMTP, DNS). Chapters on host security contain up-to-date details on passwords, the UNIX filesystem, cryptography, backups, logging, physical security, telephone security, UUCP, firewalls, and dealing with breakins. You'll also find extensive summary appendixes on freely available security tools, references, and security-related organizations.

keywords:
computer security; Internet (computer network) -- congresses; operating systems (computers); UNIX (computer file)

TOC:
I: Computer security basics 1: Introduction 2: Policies and guidelines II: User responsibilities 3: Users and passwords 4: Users, groups, and the superuser 5: The UNIX filesystem 6: Cryptography III: System security 7: Backups 8: Defending your accounts 9: Integrity management 10: Auditing and logging 11: Protecting against programmed threats 12: Physical security 13: Personnel security IV: Network and Internet security 14: Telephone security 15: UUCP 16: TCP/IP networks 17: TCP/IP services 18: WWW security 19: RPC, NIS, NIS+, and Kerberos 20: NFS V: Advanced topics 21: Firewalls 22: Wrappers and proxies 23: Writing secure SUID and network programs VI: Handling security incidents 24: Discovering a break-in 25: Denial of service attacks and solutions 26: Computer security and U.S. law 27: Who do you trust? VII: Appendixes A: UNIX security checklist B: Important files C: UNIX processes D: Paper sources E: Electronic resources F: Organizations G: Table of IP services

rawabstract:
When \booktitle{Practical UNIX Security} was first published in 1991, it became an instant classic. Crammed with information about host security, it saved many a UNIX system administrator and user from disaster. This second edition is a complete rewrite of the original book. It's packed with twice the pages and offers even more practical information for UNIX users and administrators. You'll find coverage of features of many types of UNIX systems, including SunOS, Solaris, BSDI, AIX, HP-UX, Digital UNIX, and Linux. Practical UNIX and Internet Security includes detailed coverage of Internet security and networking issues, including World Wide Web security, wrapper and proxy programs, integrity management tools, secure programming, and how to secure TCP/IP services (e.g., FTP, SMTP, DNS). Chapters on host security contain up-to-date details on passwords, the UNIX filesystem, cryptography, backups, logging, physical security, telephone security, UUCP, firewalls, and dealing with breakins. You'll also find extensive summary appendixes on freely available security tools, references, and security-related organizations.

rawTOC:
I: Computer security basics \\ 1: Introduction \\ 2: Policies and guidelines \\ II: User responsibilities \\ 3: Users and passwords \\ 4: Users, groups, and the superuser \\ 5: The UNIX filesystem \\ 6: Cryptography \\ III: System security \\ 7: Backups \\ 8: Defending your accounts \\ 9: Integrity management \\ 10: Auditing and logging \\ 11: Protecting against programmed threats \\ 12: Physical security \\ 13: Personnel security \\ IV: Network and Internet security \\ 14: Telephone security \\ 15: UUCP \\ 16: TCP/IP networks \\ 17: TCP/IP services \\ 18: WWW security \\ 19: RPC, NIS, NIS+, and Kerberos \\ 20: NFS \\ V: Advanced topics \\ 21: Firewalls \\ 22: Wrappers and proxies \\ 23: Writing secure SUID and network programs \\ VI: Handling security incidents \\ 24: Discovering a break-in \\ 25: Denial of service attacks and solutions \\ 26: Computer security and U.S. law \\ 27: Who do you trust? \\ VII: Appendixes \\ A: UNIX security checklist \\ B: Important files \\ C: UNIX processes \\ D: Paper sources \\ E: Electronic resources \\ F: Organizations \\ G: Table of IP services

entry:
@Book{Garfinkel:1996:PUI,
  author =       "Simson Garfinkel and Gene Spafford",
  title =        "Practical {UNIX} \& {Internet} Security",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  edition =      "Second",
  pages =        "xxix + 971",
  year =         "1996",
  ISBN =         "1-56592-148-8",
  ISBN-13 =      "978-1-56592-148-1",
  LCCN =         "QA76.76.O63 G38 1996",
  bibdate =      "Mon Apr 18 14:51:47 MDT 2005",
  bibsource =    "ftp://ftp.ora.com/pub/products/catalogs/book.catalog;
                 https://www.math.utah.edu/pub/tex/bib/internet.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$39.95",
  series =       "Computer security",
  URL =          "http://www.ora.com/gnn/bus/ora/item/pus2.html;
                 http://www.oreilly.com/catalog/puis",
  abstract =     "When \booktitle{Practical UNIX Security} was first
                 published in 1991, it became an instant classic.
                 Crammed with information about host security, it saved
                 many a UNIX system administrator and user from
                 disaster. This second edition is a complete rewrite of
                 the original book. It's packed with twice the pages and
                 offers even more practical information for UNIX users
                 and administrators. You'll find coverage of features of
                 many types of UNIX systems, including SunOS, Solaris,
                 BSDI, AIX, HP-UX, Digital UNIX, and Linux. Practical
                 UNIX and Internet Security includes detailed coverage
                 of Internet security and networking issues, including
                 World Wide Web security, wrapper and proxy programs,
                 integrity management tools, secure programming, and how
                 to secure TCP/IP services (e.g., FTP, SMTP, DNS).
                 Chapters on host security contain up-to-date details on
                 passwords, the UNIX filesystem, cryptography, backups,
                 logging, physical security, telephone security, UUCP,
                 firewalls, and dealing with breakins. You'll also find
                 extensive summary appendixes on freely available
                 security tools, references, and security-related
                 organizations.",
  acknowledgement = ack-nhfb,
  keywords =     "computer security; Internet (computer network) --
                 congresses; operating systems (computers); UNIX
                 (computer file)",
  remark =       "Revised edition of Practical UNIX security (1991).",
  subject =      "Operating systems (Computers); UNIX (Computer file);
                 Computer security; Internet; Congresses",
  tableofcontents = "I: Computer security basics \\
                 1: Introduction \\
                 2: Policies and guidelines \\
                 II: User responsibilities \\
                 3: Users and passwords \\
                 4: Users, groups, and the superuser \\
                 5: The UNIX filesystem \\
                 6: Cryptography \\
                 III: System security \\
                 7: Backups \\
                 8: Defending your accounts \\
                 9: Integrity management \\
                 10: Auditing and logging \\
                 11: Protecting against programmed threats \\
                 12: Physical security \\
                 13: Personnel security \\
                 IV: Network and Internet security \\
                 14: Telephone security \\
                 15: UUCP \\
                 16: TCP/IP networks \\
                 17: TCP/IP services \\
                 18: WWW security \\
                 19: RPC, NIS, NIS+, and Kerberos \\
                 20: NFS \\
                 V: Advanced topics \\
                 21: Firewalls \\
                 22: Wrappers and proxies \\
                 23: Writing secure SUID and network programs \\
                 VI: Handling security incidents \\
                 24: Discovering a break-in \\
                 25: Denial of service attacks and solutions \\
                 26: Computer security and U.S. law \\
                 27: Who do you trust? \\
                 VII: Appendixes \\
                 A: UNIX security checklist \\
                 B: Important files \\
                 C: UNIX processes \\
                 D: Paper sources \\
                 E: Electronic resources \\
                 F: Organizations \\
                 G: Table of IP services",
}


bibtype: book
filename: master.bib
label: Garwin:2002:MMF
author: Richard L. Garwin and Georges Charpak
title: Megawatts and megatons: the future of nuclear power and nuclear weapons
publisher: pub-U-CHICAGO
address: pub-U-CHICAGO:adr
pages: xvii + 412
year: 2002
ISBN: 0-226-28427-1 (paperback) OR 0226284271 (paperback)
ISBN13: 978-0-226-28427-9 (paperback) OR 9780226284279 (paperback)
LCCN: QC792 .C4713 2002
bibdate: Sat Mar 14 10:46:27 MDT 2015
bibtimestamp: 2015.03.14 10:46:27 MDT
remark: Originally published: New York: Alfred A. Knopf, 2001.
acknowledgement: ack-nhfb
rawauthor: Richard L. Garwin and Georges Charpak
rawtitle: Megawatts and megatons: the future of nuclear power and nuclear weapons
URL:
http://catdir.loc.gov/catdir/bios/uchi051/2002027143.html; http://catdir.loc.gov/catdir/description/uchi051/2002027143.html; http://catdir.loc.gov/catdir/toc/uchi051/2002027143.html

subject:
Nuclear energy; Nuclear industry; Nuclear arms control; Nuclear arms control; Nuclear energy; Nuclear industry; Atomare Abrustung; Einfuhrung; Kernenergie; Kernwaffe; Rustungspolitik

TOC:
1: All energy stems from the same source 2: The nuclear chain reaction 3: Nuclear weapons 4: Natural radiation and living things 5: The civilian use of nuclear energy 6: A glimpse of the future of nuclear power 7: Safety, nuclear accidents, and industrial hazards 8: Reducing greenhouse gas emissions 9: Comparing hazards of nuclear power and other energy 10: Making best use of scientists 11: From arms race ot arms control 12: Current nuclear threats to security 13: Can we rid the world of nuclear weapons? 14: A turning point in the nuclear age?

rawTOC:
1: All energy stems from the same source \\ 2: The nuclear chain reaction \\ 3: Nuclear weapons \\ 4: Natural radiation and living things \\ 5: The civilian use of nuclear energy \\ 6: A glimpse of the future of nuclear power \\ 7: Safety, nuclear accidents, and industrial hazards \\ 8: Reducing greenhouse gas emissions \\ 9: Comparing hazards of nuclear power and other energy \\ 10: Making best use of scientists \\ 11: From arms race ot arms control \\ 12: Current nuclear threats to security \\ 13: Can we rid the world of nuclear weapons? \\ 14: A turning point in the nuclear age?

entry:
@Book{Garwin:2002:MMF,
  author =       "Richard L. Garwin and Georges Charpak",
  title =        "Megawatts and megatons: the future of nuclear power
                 and nuclear weapons",
  publisher =    pub-U-CHICAGO,
  address =      pub-U-CHICAGO:adr,
  pages =        "xvii + 412",
  year =         "2002",
  ISBN =         "0-226-28427-1 (paperback)",
  ISBN-13 =      "978-0-226-28427-9 (paperback)",
  LCCN =         "QC792 .C4713 2002",
  bibdate =      "Sat Mar 14 10:46:27 MDT 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://catdir.loc.gov/catdir/bios/uchi051/2002027143.html;
                 http://catdir.loc.gov/catdir/description/uchi051/2002027143.html;
                 http://catdir.loc.gov/catdir/toc/uchi051/2002027143.html",
  acknowledgement = ack-nhfb,
  remark =       "Originally published: New York: Alfred A. Knopf,
                 2001.",
  subject =      "Nuclear energy; Nuclear industry; Nuclear arms
                 control; Nuclear arms control; Nuclear energy; Nuclear
                 industry; Atomare Abr{\"u}stung; Einf{\"u}hrung;
                 Kernenergie; Kernwaffe; R{\"u}stungspolitik",
  tableofcontents = "1: All energy stems from the same source \\
                 2: The nuclear chain reaction \\
                 3: Nuclear weapons \\
                 4: Natural radiation and living things \\
                 5: The civilian use of nuclear energy \\
                 6: A glimpse of the future of nuclear power \\
                 7: Safety, nuclear accidents, and industrial hazards
                 \\
                 8: Reducing greenhouse gas emissions \\
                 9: Comparing hazards of nuclear power and other energy
                 \\
                 10: Making best use of scientists \\
                 11: From arms race ot arms control \\
                 12: Current nuclear threats to security \\
                 13: Can we rid the world of nuclear weapons? \\
                 14: A turning point in the nuclear age?",
}


bibtype: book
filename: master.bib
label: Gaskins:1992:PPMa
author: Tom Gaskins
title: PHIGS Programming Manual
publisher: pub-ORA
address: pub-ORA:adr
pages: xxxix + 908
year: 1992
LCCN: QA76.76.W56 G37 1992
bibdate: Tue Dec 7 09:56:13 1993
bibtimestamp: 1993.12.07 09:56:13 ???
URL: http://www.oreilly.com/catalog/9780937175859
acknowledgement: ack-nhfb
rawauthor: Tom Gaskins
rawtitle: {PHIGS} Programming Manual
ISBN:
0-937175-85-4 (paperback), 0-937175-92-7 (hardcover) OR 0937175854 (paperback), 0937175927 (hardcover)

ISBN13:
978-0-937175-85-9 (paperback), 978-0-937175-92-7 (hardcover) OR 9780937175859 (paperback), 9780937175927 (hardcover)

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

abstract:
A complete and authoritative guide to PHIGS and PHIGS PLUS programming, this book documents the PHIGS and PHIGS PLUS graphics standards and provides full guidance regarding the use of PHIGS within the X environment. The discussions of PHIGS and PHIGS PLUS are fully integrated in this text, which takes as its starting point the PEX Sample Implementation (or PEX-SI) --- the publicly available and most widely established base for commercial PHIGS products. In addition, the booktitle PHIGS Programming Manual explains, at both elementary and advanced levels, how to integrate your PHIGS applications with standard X (Xlib) functions. Window management, event handling, input-output, even lower-level drawing functions --- all of these can be made part of your PHIGS programs. Besides Xlib itself, there are detailed examples and explanations based on the Motif, OLIT, and XView toolkits.

rawabstract:
A complete and authoritative guide to PHIGS and PHIGS PLUS programming, this book documents the PHIGS and PHIGS PLUS graphics standards and provides full guidance regarding the use of PHIGS within the X environment. The discussions of PHIGS and PHIGS PLUS are fully integrated in this text, which takes as its starting point the PEX Sample Implementation (or PEX-SI) --- the publicly available and most widely established base for commercial PHIGS products. In addition, the \booktitle{PHIGS Programming Manual} explains, at both elementary and advanced levels, how to integrate your PHIGS applications with standard X (Xlib) functions. Window management, event handling, input-output, even lower-level drawing functions --- all of these can be made part of your PHIGS programs. Besides Xlib itself, there are detailed examples and explanations based on the Motif, OLIT, and XView toolkits.

entry:
@Book{Gaskins:1992:PPMa,
  author =       "Tom Gaskins",
  title =        "{PHIGS} Programming Manual",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxxix + 908",
  year =         "1992",
  ISBN =         "0-937175-85-4 (paperback), 0-937175-92-7 (hardcover)",
  ISBN-13 =      "978-0-937175-85-9 (paperback), 978-0-937175-92-7
                 (hardcover)",
  LCCN =         "QA76.76.W56 G37 1992",
  bibdate =      "Tue Dec 7 09:56:13 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",
  price =        "US\$42.95 (softcover), US\$52.95 (hardcover)",
  URL =          "http://www.oreilly.com/catalog/9780937175859",
  abstract =     "A complete and authoritative guide to PHIGS and PHIGS
                 PLUS programming, this book documents the PHIGS and
                 PHIGS PLUS graphics standards and provides full
                 guidance regarding the use of PHIGS within the X
                 environment. The discussions of PHIGS and PHIGS PLUS
                 are fully integrated in this text, which takes as its
                 starting point the PEX Sample Implementation (or
                 PEX-SI) --- the publicly available and most widely
                 established base for commercial PHIGS products. In
                 addition, the \booktitle{PHIGS Programming Manual}
                 explains, at both elementary and advanced levels, how
                 to integrate your PHIGS applications with standard X
                 (Xlib) functions. Window management, event handling,
                 input-output, even lower-level drawing functions ---
                 all of these can be made part of your PHIGS programs.
                 Besides Xlib itself, there are detailed examples and
                 explanations based on the Motif, OLIT, and XView
                 toolkits.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Gaskins:1992:PPMb
author: Tom Gaskins
title: PEXlib Programming Manual
publisher: pub-ORA
address: pub-ORA:adr
pages: xlv + 1105
year: 1992
ISBN: 1-56592-028-7 OR 1565920287
ISBN13: 978-1-56592-028-6 OR 9781565920286
LCCN: QA76.76.W56 G37 1992
bibdate: Tue Dec 7 09:54:08 1993
bibtimestamp: 1993.12.07 09:54:08 ???
acknowledgement: ack-nhfb
rawauthor: Tom Gaskins
rawtitle: {PEXlib} Programming Manual
abstract:
The world of workstations changed dramatically with the release of the X Window System. Users could finally count on a consistent interface across almost all makes and models of computers. At the same time, graphics applications became easily portable. Until recently, X supported only 2D graphics. Now, however, by means of the PEX extensions to X, together with the PEXlib applications programming interface, native, 3D graphics have come to the X Window System. PEXlib allows the programmer to create graphics programs of any complexity, and also provides the basis for higher-level graphics systems and toolkits. The booktitle PEXlib Programming Manual is the definitive programmer's guide to PEXlib, covering PEX versions 5.0 and 5.1. Containing over 200 illustrations and 19 color plates, it combines a thorough and gentle tutorial approach with valuable reference features. Along the way, it presents the reader with numerous programming examples, as well as a library of helpful utility routines--all of which are available online. You do not any need prior graphics programming experience to use this manual.

rawabstract:
The world of workstations changed dramatically with the release of the X Window System. Users could finally count on a consistent interface across almost all makes and models of computers. At the same time, graphics applications became easily portable. Until recently, X supported only 2D graphics. Now, however, by means of the PEX extensions to X, together with the PEXlib applications programming interface, native, 3D graphics have come to the X Window System. PEXlib allows the programmer to create graphics programs of any complexity, and also provides the basis for higher-level graphics systems and toolkits. The \booktitle{PEXlib Programming Manual} is the definitive programmer's guide to PEXlib, covering PEX versions 5.0 and 5.1. Containing over 200 illustrations and 19 color plates, it combines a thorough and gentle tutorial approach with valuable reference features. Along the way, it presents the reader with numerous programming examples, as well as a library of helpful utility routines--all of which are available online. You do not any need prior graphics programming experience to use this manual.

entry:
@Book{Gaskins:1992:PPMb,
  author =       "Tom Gaskins",
  title =        "{PEXlib} Programming Manual",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xlv + 1105",
  year =         "1992",
  ISBN =         "1-56592-028-7",
  ISBN-13 =      "978-1-56592-028-6",
  LCCN =         "QA76.76.W56 G37 1992",
  bibdate =      "Tue Dec 7 09:54:08 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",
  price =        "US\$44.95",
  abstract =     "The world of workstations changed dramatically with
                 the release of the X Window System. Users could finally
                 count on a consistent interface across almost all makes
                 and models of computers. At the same time, graphics
                 applications became easily portable. Until recently, X
                 supported only 2D graphics. Now, however, by means of
                 the PEX extensions to X, together with the PEXlib
                 applications programming interface, native, 3D graphics
                 have come to the X Window System. PEXlib allows the
                 programmer to create graphics programs of any
                 complexity, and also provides the basis for
                 higher-level graphics systems and toolkits. The
                 \booktitle{PEXlib Programming Manual} is the definitive
                 programmer's guide to PEXlib, covering PEX versions 5.0
                 and 5.1. Containing over 200 illustrations and 19 color
                 plates, it combines a thorough and gentle tutorial
                 approach with valuable reference features. Along the
                 way, it presents the reader with numerous programming
                 examples, as well as a library of helpful utility
                 routines--all of which are available online. You do not
                 any need prior graphics programming experience to use
                 this manual.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Gates:2009:ETH
author: Evalyn Gates
title: Einstein's telescope: the hunt for dark matter and dark energy in the universe
publisher: pub-NORTON
address: pub-NORTON:adr
pages: xiv + 305
year: 2009
ISBN: 0-393-06238-4 OR 0393062384
ISBN13: 978-0-393-06238-0 OR 9780393062380
LCCN: QB791.3 .G38 2009
bibdate: Fri Jun 12 07:26:40 MDT 2009
bibtimestamp: 2009.06.12 07:26:40 MDT
acknowledgement: ack-nhfb
subjectdates: 1879--1955; 1879--1955
rawauthor: Evalyn Gates
rawtitle: {Einstein}'s telescope: the hunt for dark matter and dark energy in the universe
abstract:
Evalyn Gates transports us to the edge of science to explore the tool that unlocks the secrets of dark matter and dark energy. Based on the theory of general relativity, gravitational lensing, or `Einstein's Telescope', is enabling discoveries that are taking us towards the next revolution in scientific thinking --- one that may change our understanding of where the Universe came from and where it is going.

subject:
Einstein, Albert; Influence; Einstein, Albert,; Dark matter (Astronomy); Dark energy (Astronomy); Gravitational waves; Relativity (Physics); Dark energy (Astronomy); Dark matter (Astronomy); gravitational Lensing; Gravitational waves; Influence (Literary, artistic, etc.); Relativity (Physics)

TOC:
What is the universe made of? A revolution in space and time A cosmic expansion Einstein's telescope MACHOs and WIMPs Black holes and planets Weighing the universe Cold dark matter Tracing the invisible --- and finding dark matter An accelerating universe The imprint of dark energy on the cosmic web Gravity waves Epilogue: Dark matter and dark energy: keys to the next revolution

rawabstract:
Evalyn Gates transports us to the edge of science to explore the tool that unlocks the secrets of dark matter and dark energy. Based on the theory of general relativity, gravitational lensing, or `Einstein's Telescope', is enabling discoveries that are taking us towards the next revolution in scientific thinking --- one that may change our understanding of where the Universe came from and where it is going.

rawTOC:
What is the universe made of? \\ A revolution in space and time \\ A cosmic expansion \\ Einstein's telescope \\ MACHOs and WIMPs \\ Black holes and planets \\ Weighing the universe \\ Cold dark matter \\ Tracing the invisible --- and finding dark matter \\ An accelerating universe \\ The imprint of dark energy on the cosmic web \\ Gravity waves \\ Epilogue: Dark matter and dark energy: keys to the next revolution

entry:
@Book{Gates:2009:ETH,
  author =       "Evalyn Gates",
  title =        "{Einstein}'s telescope: the hunt for dark matter and
                 dark energy in the universe",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "xiv + 305",
  year =         "2009",
  ISBN =         "0-393-06238-4",
  ISBN-13 =      "978-0-393-06238-0",
  LCCN =         "QB791.3 .G38 2009",
  bibdate =      "Fri Jun 12 07:26:40 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Evalyn Gates transports us to the edge of science to
                 explore the tool that unlocks the secrets of dark
                 matter and dark energy. Based on the theory of general
                 relativity, gravitational lensing, or `Einstein's
                 Telescope', is enabling discoveries that are taking us
                 towards the next revolution in scientific thinking ---
                 one that may change our understanding of where the
                 Universe came from and where it is going.",
  acknowledgement = ack-nhfb,
  subject =      "dark matter (astronomy); dark energy (astronomy)",
  subject =      "Einstein, Albert; Influence; Einstein, Albert,; Dark
                 matter (Astronomy); Dark energy (Astronomy);
                 Gravitational waves; Relativity (Physics); Dark energy
                 (Astronomy); Dark matter (Astronomy); gravitational
                 Lensing; Gravitational waves; Influence (Literary,
                 artistic, etc.); Relativity (Physics)",
  subject-dates = "1879--1955; 1879--1955",
  tableofcontents = "What is the universe made of? \\
                 A revolution in space and time \\
                 A cosmic expansion \\
                 Einstein's telescope \\
                 MACHOs and WIMPs \\
                 Black holes and planets \\
                 Weighing the universe \\
                 Cold dark matter \\
                 Tracing the invisible --- and finding dark matter \\
                 An accelerating universe \\
                 The imprint of dark energy on the cosmic web \\
                 Gravity waves \\
                 Epilogue: Dark matter and dark energy: keys to the next
                 revolution",
}


bibtype: book
filename: master.bib
label: Gates:2019:PER
author: S. James Gates, Jr. and Cathie Pelletier
title: Proving Einstein Right: the Daring Expeditions That Changed How We Look at the Universe
publisher: PublicAffairs
address: New York, NY, USA
pages: viii + 356 + 16
year: 2019
ISBN: 1-5417-6223-1 (e-book), 1-5417-6225-8 (hardcover) OR 1541762231 (ebook), 1541762258 (hardcover)
LCCN: QB544.19 .G38 2019
bibdate: Mon Dec 9 05:59:53 MST 2019
bibtimestamp: 2019.12.09 05:59:53 MST
URL: https://historynewsnetwork.org/article/173408
acknowledgement: ack-nhfb
rawauthor: S. James {Gates, Jr.} and Cathie Pelletier
rawtitle: Proving {Einstein} Right: the Daring Expeditions That Changed How We Look at the Universe
ISBN13:
978-1-5417-6223-7 (e-book), 978-1-5417-6225-1 (hardcover) OR 9781541762237 (ebook), 9781541762251 (hardcover)

abstract:
In 1916, a nearly unknown German-born theoretical physicist named Albert Einstein had developed his theory of relativity, but hadn't yet been able to prove it. The only way to do that was through the clear view and measurement of a solar eclipse. In May of 1919, one of the longest total solar eclipses of the 20th century was visible for almost seven minutes in the Southern Hemisphere.

subject:
Solar eclipses; 1919; Total solar eclipses; Relativity (Physics); Relativity (Physics); Solar eclipses.; Total solar eclipses.

TOC:
Map of A World of Eclipses: The Paths of Totality / ix Prologue / 1 1: A Path Made of Magic: The First Expeditions / 7 2: Einstein's Visionary Years: Thought Experiments and a Streetcar Ride / 21 3: The Two Eclipses of 1912: The First Attempt: Is Einstein Right? / 33 4: Einstein's Entreaty: Astronomers to the Challenge / 53 5: The 1914 Eclipse: The Second Attempt: A Path of Fire / 77 6: A Magic Carpet Made of Space-Time: The British Take Interest: Science Goes to War / 103 7: Unriddling the Universe: The British Get Ready: The Americans Persevere / 127 8: The RMS Anselm Sets Sail: A Cocoa Plantation and a Horse Jockey Club / 157 9: Principe and Sobral: In Colonialism's Shadow: The Teams Prepare / 181 10: ``Through Cloud, Hopeful'': May 29, 1919: Does Light Have Weight? / 205 11: Greek Drama: Searching the Stars: An Answer in the Hyades / 233 12: The Search for Accuracy: A New Universe: The Press Juggernaut / 247 Epilogue: Men Made on Dreams / 265 Acknowledgments / 292 Notes / 297 Bibliography / 326 Illustration Credits / 339 Index / 342

rawabstract:
In 1916, a nearly unknown German-born theoretical physicist named Albert Einstein had developed his theory of relativity, but hadn't yet been able to prove it. The only way to do that was through the clear view and measurement of a solar eclipse. In May of 1919, one of the longest total solar eclipses of the 20th century was visible for almost seven minutes in the Southern Hemisphere.

rawTOC:
Map of A World of Eclipses: The Paths of Totality / ix \\ Prologue / 1 \\ 1: A Path Made of Magic: The First Expeditions / 7 \\ 2: Einstein's Visionary Years: Thought Experiments and a Streetcar Ride / 21 \\ 3: The Two Eclipses of 1912: The First Attempt: Is Einstein Right? / 33 \\ 4: Einstein's Entreaty: Astronomers to the Challenge / 53 \\ 5: The 1914 Eclipse: The Second Attempt: A Path of Fire / 77 \\ 6: A Magic Carpet Made of Space-Time: The British Take Interest: Science Goes to War / 103 \\ 7: Unriddling the Universe: The British Get Ready: The Americans Persevere / 127 \\ 8: The RMS Anselm Sets Sail: A Cocoa Plantation and a Horse Jockey Club / 157 \\ 9: Pr{\'\i}ncipe and Sobral: In Colonialism's Shadow: The Teams Prepare / 181 \\ 10: ``Through Cloud, Hopeful'': May 29, 1919: Does Light Have Weight? / 205 \\ 11: Greek Drama: Searching the Stars: An Answer in the Hyades / 233 \\ 12: The Search for Accuracy: A New Universe: The Press Juggernaut / 247 \\ Epilogue: Men Made on Dreams / 265 \\ Acknowledgments / 292 \\ Notes / 297 \\ Bibliography / 326 \\ Illustration Credits / 339 \\ Index / 342

entry:
@Book{Gates:2019:PER,
  author =       "S. James {Gates, Jr.} and Cathie Pelletier",
  title =        "Proving {Einstein} Right: the Daring Expeditions That
                 Changed How We Look at the Universe",
  publisher =    "PublicAffairs",
  address =      "New York, NY, USA",
  pages =        "viii + 356 + 16",
  year =         "2019",
  ISBN =         "1-5417-6223-1 (e-book), 1-5417-6225-8 (hardcover)",
  ISBN-13 =      "978-1-5417-6223-7 (e-book), 978-1-5417-6225-1
                 (hardcover)",
  LCCN =         "QB544.19 .G38 2019",
  bibdate =      "Mon Dec 9 05:59:53 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "https://historynewsnetwork.org/article/173408",
  abstract =     "In 1916, a nearly unknown German-born theoretical
                 physicist named Albert Einstein had developed his
                 theory of relativity, but hadn't yet been able to prove
                 it. The only way to do that was through the clear view
                 and measurement of a solar eclipse. In May of 1919, one
                 of the longest total solar eclipses of the 20th century
                 was visible for almost seven minutes in the Southern
                 Hemisphere.",
  acknowledgement = ack-nhfb,
  subject =      "Solar eclipses; 1919; Total solar eclipses; Relativity
                 (Physics); Relativity (Physics); Solar eclipses.; Total
                 solar eclipses.",
  tableofcontents = "Map of A World of Eclipses: The Paths of Totality /
                 ix \\
                 Prologue / 1 \\
                 1: A Path Made of Magic: The First Expeditions / 7 \\
                 2: Einstein's Visionary Years: Thought Experiments and
                 a Streetcar Ride / 21 \\
                 3: The Two Eclipses of 1912: The First Attempt: Is
                 Einstein Right? / 33 \\
                 4: Einstein's Entreaty: Astronomers to the Challenge /
                 53 \\
                 5: The 1914 Eclipse: The Second Attempt: A Path of Fire
                 / 77 \\
                 6: A Magic Carpet Made of Space-Time: The British Take
                 Interest: Science Goes to War / 103 \\
                 7: Unriddling the Universe: The British Get Ready: The
                 Americans Persevere / 127 \\
                 8: The RMS Anselm Sets Sail: A Cocoa Plantation and a
                 Horse Jockey Club / 157 \\
                 9: Pr{\'\i}ncipe and Sobral: In Colonialism's Shadow:
                 The Teams Prepare / 181 \\
                 10: ``Through Cloud, Hopeful'': May 29, 1919: Does
                 Light Have Weight? / 205 \\
                 11: Greek Drama: Searching the Stars: An Answer in the
                 Hyades / 233 \\
                 12: The Search for Accuracy: A New Universe: The Press
                 Juggernaut / 247 \\
                 Epilogue: Men Made on Dreams / 265 \\
                 Acknowledgments / 292 \\
                 Notes / 297 \\
                 Bibliography / 326 \\
                 Illustration Credits / 339 \\
                 Index / 342",
}


bibtype: book
filename: master.bib
label: Gautier:2003:OOE
author: Sophie Gautier and Christian Hardy and Frederic Labbe and Michel Pinquier
title: OpenOffice.org 1.1: efficace: Writer, Calc, Impress, Draw, BDs
publisher: Eyrolles
address: Paris, France
pages: xvi + 319
year: 2003
ISBN: 2-212-11348-X (paperback) OR 221211348X (paperback)
ISBN13: 978-2-212-11348-8 (paperback) OR 9782212113488 (paperback)
LCCN: HF5548.4 O57O63 2004
bibdate: Sat Dec 24 15:41:57 MST 2005
bibsource: carmin.sudoc.abes.fr:210/ABES-Z39-PUBLIC; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2005.12.24 15:41:57 MST
acknowledgement: ack-nhfb
rawauthor: Sophie Gautier and Christian Hardy and Fr{\'e}d{\'e}ric Labb{\'e} and Michel Pinquier
rawtitle: {OpenOffice.org 1.1}: efficace: {Writer}, {Calc}, {Impress}, {Draw}, {BDs}
entry:
@Book{Gautier:2003:OOE,
  author =       "Sophie Gautier and Christian Hardy and
                 Fr{\'e}d{\'e}ric Labb{\'e} and Michel Pinquier",
  title =        "{OpenOffice.org 1.1}: efficace: {Writer}, {Calc},
                 {Impress}, {Draw}, {BDs}",
  publisher =    "Eyrolles",
  address =      "Paris, France",
  pages =        "xvi + 319",
  year =         "2003",
  ISBN =         "2-212-11348-X (paperback)",
  ISBN-13 =      "978-2-212-11348-8 (paperback)",
  LCCN =         "HF5548.4 O57O63 2004",
  bibdate =      "Sat Dec 24 15:41:57 MST 2005",
  bibsource =    "carmin.sudoc.abes.fr:210/ABES-Z39-PUBLIC;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Gavroglou:2012:NPN
author: Kostas Gavroglou and Ana Simoes
title: Neither physics nor chemistry: a history of quantum chemistry
publisher: pub-MIT
address: pub-MIT:adr
pages: xiv + 351
year: 2012
ISBN: 0-262-01618-4 (hardcover) OR 0262016184 (hardcover)
ISBN13: 978-0-262-01618-6 (hardcover) OR 9780262016186 (hardcover)
LCCN: QD462 .G38 2012
bibdate: Thu Mar 5 09:57:09 MST 2015
bibtimestamp: 2015.03.05 09:57:09 MST
series: Transformations: studies in the history of science and technology
subject: Quantum chemistry; History
acknowledgement: ack-nhfb
rawauthor: Kostas Gavroglou and Ana Sim{\~o}es
rawtitle: Neither physics nor chemistry: a history of quantum chemistry
bibsource:
https://www.math.utah.edu/pub/tex/bib/bullhistchem.bib; https://www.math.utah.edu/pub/tex/bib/foundchem.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager

TOC:
Introduction Contents Preface Introduction 1. Quantum Chemistry qua Physics: The Promises and Deadlocks of Using First Principles 2. Quantum Chemistry qua Chemistry: Rules and More Rules 3. Quantum Chemistry qua Applied Mathematics: Approximation Methods and Crunching Numbers 4. Quantum Chemistry qua Programming: Computers and the Cultures of Quantum Chemistry 5. The Emergence of a Subdiscipline: Historiographical Considerations Bibliography Index

rawTOC:
Introduction \\ Contents \\ Preface \\ Introduction \\ 1. Quantum Chemistry qua Physics: The Promises and Deadlocks of Using First Principles \\ 2. Quantum Chemistry qua Chemistry: Rules and More Rules \\ 3. Quantum Chemistry qua Applied Mathematics: Approximation Methods and Crunching Numbers \\ 4. Quantum Chemistry qua Programming: Computers and the Cultures of Quantum Chemistry \\ 5. The Emergence of a Subdiscipline: Historiographical Considerations \\ Bibliography \\ Index

entry:
@Book{Gavroglou:2012:NPN,
  author =       "Kostas Gavroglou and Ana Sim{\~o}es",
  title =        "Neither physics nor chemistry: a history of quantum
                 chemistry",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xiv + 351",
  year =         "2012",
  ISBN =         "0-262-01618-4 (hardcover)",
  ISBN-13 =      "978-0-262-01618-6 (hardcover)",
  LCCN =         "QD462 .G38 2012",
  bibdate =      "Thu Mar 5 09:57:09 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bullhistchem.bib;
                 https://www.math.utah.edu/pub/tex/bib/foundchem.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Transformations: studies in the history of science and
                 technology",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Quantum chemistry; History",
  tableofcontents = "Introduction \\
                 Contents \\
                 Preface \\
                 Introduction \\
                 1. Quantum Chemistry qua Physics: The Promises and
                 Deadlocks of Using First Principles \\
                 2. Quantum Chemistry qua Chemistry: Rules and More
                 Rules \\
                 3. Quantum Chemistry qua Applied Mathematics:
                 Approximation Methods and Crunching Numbers \\
                 4. Quantum Chemistry qua Programming: Computers and the
                 Cultures of Quantum Chemistry \\
                 5. The Emergence of a Subdiscipline: Historiographical
                 Considerations \\
                 Bibliography \\
                 Index",
}


bibtype: book
filename: master.bib
label: GCA:1983:GSD
author: Graphic Communications Association
publisher: pub-GRAPHICCOMM
address: pub-GRAPHICCOMM:adr
pages: xxiv + 264
year: 1983
ISBN: 0-89740-244-8 OR 0897402448
ISBN13: 978-0-89740-244-6 OR 9780897402446
LCCN: QA76.9.T48 G33 1983
bibdate: Thu Jul 7 16:16:46 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.07.07 16:16:46 ???
note: Adopted by Department of Defense, 10 August 1983.
acknowledgement: ack-nhfb
rawauthor: {Graphic Communications Association}
rawnote: Adopted by Department of Defense, 10 August 1983.
title:
GCA Standard 101-1983, Document Markup Metalanguage: GenCode and the Standard Generalized Markup Language (SGML)

rawtitle:
{GCA} Standard 101-1983, Document Markup Metalanguage: {GenCode} and the Standard Generalized Markup Language ({SGML})

entry:
@Book{GCA:1983:GSD,
  author =       "{Graphic Communications Association}",
  title =        "{GCA} Standard 101-1983, Document Markup Metalanguage:
                 {GenCode} and the Standard Generalized Markup Language
                 ({SGML})",
  publisher =    pub-GRAPHICCOMM,
  address =      pub-GRAPHICCOMM:adr,
  pages =        "xxiv + 264",
  year =         "1983",
  ISBN =         "0-89740-244-8",
  ISBN-13 =      "978-0-89740-244-6",
  LCCN =         "QA76.9.T48 G33 1983",
  bibdate =      "Thu Jul 7 16:16:46 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Adopted by Department of Defense, 10 August 1983.",
  price =        "US\$48.00",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}


bibtype: book
filename: master.bib
label: Gehani:1986:DFT
author: Narain Gehani
title: Document Formatting and Typesetting on the UNIX System
publisher: pub-SILICON
address: pub-SILICON:adr
pages: xv + 364
year: 1986
ISBN: 0-9615336-0-9 OR 0961533609
ISBN13: 978-0-9615336-0-1 OR 9780961533601
LCCN: Z52.5.U54 G43 198
bibdate: Thu Aug 30 07:30:17 2001
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2001.08.30 07:30:17 ???
acknowledgement: ack-nhfb
rawauthor: Narain Gehani
rawtitle: Document Formatting and Typesetting on the {UNIX} System
entry:
@Book{Gehani:1986:DFT,
  author =       "Narain Gehani",
  title =        "Document Formatting and Typesetting on the {UNIX}
                 System",
  publisher =    pub-SILICON,
  address =      pub-SILICON:adr,
  pages =        "xv + 364",
  year =         "1986",
  ISBN =         "0-9615336-0-9",
  ISBN-13 =      "978-0-9615336-0-1",
  LCCN =         "Z52.5.U54 G43 198",
  bibdate =      "Thu Aug 30 07:30:17 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$32.00",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Gehani:1987:DFT
author: Narain Gehani
title: Document Formatting and Typesetting on the UNIX System
publisher: pub-SILICON
address: pub-SILICON:adr
edition: Second
pages: xv + 377
year: 1987
ISBN: 0-13-938325-5, 0-9615336-2-5 OR 0139383255, 0961533625
ISBN13: 978-0-13-938325-0, 978-0-9615336-2-5 OR 9780139383250, 9780961533625
LCCN: Z52.5.U54G43 1987
bibdate: Mon May 20 09:54:58 1996
bibtimestamp: 1996.05.20 09:54:58 ???
acknowledgement: ack-nhfb
rawauthor: Narain Gehani
rawtitle: Document Formatting and Typesetting on the {UNIX} System
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/texbook3.bib; https://www.math.utah.edu/pub/tex/bib/typeset.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

subject:
I.7.2 Computing Methodologies, TEXT PROCESSING, Document Preparation, Format and notation I.7.2 Computing Methodologies, TEXT PROCESSING, Document Preparation, Languages D.4.0 Software, OPERATING SYSTEMS, General, UNIX

TOC:
Preface / xi Acknowledgement / xv 1: Introduction / 1 1. Document Format / 2 2. The UNIX Document Formatting and Writing Tools / 7 3. Using tt mm in Preference to tt troff / 9 4. Using the Document Formatting and Writing Tools / 12 5. The Typesetting Commands / 13 2: Specifying The Document Format / 15 1. An Example of Document Formatting / 15 2. Basics / 20 3. Fonts / 27 4. Point Size and Vertical Spacing / 32 5. Document Structure / 35 6. Document Definitions, Style and Appearance Parameters / 36 7. Document Prelude / 38 8. Document Body / 45 9. Document Postlude / 71 10. Business Letters / 76 11. Advanced Aspects of tt mm / 87 12. Interfacing with tt troff Preprocessors / 95 13. Interaction of tt troff with tt mm / 95 14. tt mm Command-Line Options / 100 15. Hints for Managing Large Documents / 102 16. Checking for Errors: tt checkmm / 103 17. A Final Example / 103 18. Exercises / 111 3: Specifying Tables J / 13 1. An Example tt tbl Specification / 113 2. Format of a Table Specification / 116 3. Specification of the Global Table Format / 116 4. Data Format Specification / 117 5. Table Data / 127 6. Tables with Groups of Repeated Rows / 134 7. tt troff Instructions / 140 8. Interface with tt mm / 142 9. Checking for Errors: tt tbl / 145 10. Restrictions on Table Specifications / 146 11. Examples / 147 12. Exercises / 153 4: Specifying Figures / 157 1. An Example tt pic Specification / 158 2. Format of a Figure Specification / 160 3. Primitive Objects-Basics / 160 4. Moves / 171 5. Lines and Arrows / 173 6. Boxes / 179 7. Circles / 185 8. Ellipses / 189 9. Arcs / 192 10. Splines / 197 11. Text / 200 12. Invisible Objects / 203 13. Control Instructions / 203 14. Macros / 205 15. Blocks / 208 16. Including Files / 210 17. Figure Size / 213 18. Interface with tt mm and tt eqn / 215 19. Checking for Errors: tt pic / 218 20. Recent Changes to tt pic / 218 21. Exercises / 219 5: Specifying Formulas (Equations) / 225 1. An Example tt eqn Specification / 226 2. Specifying Equations / 227 3. Basics / 229 4. Subscripts/Superscripts / 233 5. Fractions / 234 6. Square Roots / 235 7. Associating Limits With Items / 235 8. Large Brackets for Grouping / 237 9. tt eqn Definitions / 240 I 0. Aligning Equations / 243 11. Piles / 244 12. Matrices / 246 13. Diacritics / 247 14. Local Motions / 248 15. Labeling Equations / 248 16. tt eqn Environment / 249 17. Operator Precedence and Association / 252 18. Special Characters and Symbols / 254 19. tt eqn Interface With tt tbl, tt pic and tt mm / 257 20. tt eqn Restrictions / 259 21. Checking for Errors: tt eqn and tt checkmm / 260 22. Recent Changes to tt eqn / 260 23. Examples / 261 24. Exercises / 265 6: tt troff/nroff-The Formatters / 269 1. Stand-Alone tt troff Instructions / 270 2. Escape Sequences for Characters, Indicators and Functions / 280 3. Naming Conventions for Non-ASCII Characters / 283 4. Recent Changes to tt troff / 286 7: Writer's Workbench Software / 287 1. Overview / 287 2. tt proofr / 288 3. tt prose / 290 4. Example / 291 5. Conclusions / 297 8: Example Document Templates / 299 1. Letters / 299 2. Papers / 306 3. Books / 310 4. Exercises / 319 Appendix A: More Document Formatting Tools / 321 1. tt ideal / 321 2. tt grap / 321 3. tt ms Page-Layout Macros / 322 4. tt mv Viewgraph Macros / 324 5. tt refer / 325 Appendix B: Document Formatting Commands / 327 1. tt checkmm (tt mm and tt eqn Error Checker) / 327 2. tt double (Double Word Finder) / 328 3. tt eqn and neqn (Format Mathematical Text) / 328 4. tt mm (Print Documents Formatted Using tt mm) / 329 5. tt mmt and tt mvt (Format Documents, Viewgraphs and Slides) / 330 6. nroff (Format Text) / 331 7. tt pic (Draw Figures) / 332 8. tt spell (Find Spelling Errors) / 333 9. tt tbl (Format Tables) / 333 10. tt tc (tt troff Output Interpreter) / 334 11. tt troff (Text Formatting and Typesetting) / 335 12. tt wwb (Writer's Workbench Software) / 336 Appendix C: Some Font Samples / 339 Glossary / 349 Annotated Bibliography / 353 Index / 359--377

rawTOC:
Preface / xi \\ Acknowledgement / xv \\ 1: Introduction / 1 \\ 1. Document Format / 2 \\ 2. The UNIX Document Formatting and Writing Tools / 7 \\ 3. Using {\tt mm} in Preference to {\tt troff} / 9 \\ 4. Using the Document Formatting and Writing Tools / 12 \\ 5. The Typesetting Commands / 13 \\ 2: Specifying The Document Format / 15 \\ 1. An Example of Document Formatting / 15 \\ 2. Basics / 20 \\ 3. Fonts / 27 \\ 4. Point Size and Vertical Spacing / 32 \\ 5. Document Structure / 35 \\ 6. Document Definitions, Style and Appearance Parameters / 36 \\ 7. Document Prelude / 38 \\ 8. Document Body / 45 \\ 9. Document Postlude / 71 \\ 10. Business Letters / 76 \\ 11. Advanced Aspects of {\tt mm} / 87 \\ 12. Interfacing with {\tt troff} Preprocessors / 95 \\ 13. Interaction of {\tt troff} with {\tt mm} / 95 \\ 14. {\tt mm} Command-Line Options / 100 \\ 15. Hints for Managing Large Documents / 102 \\ 16. Checking for Errors: {\tt checkmm} / 103 \\ 17. A Final Example / 103 \\ 18. Exercises / 111 \\ 3: Specifying Tables J / 13 \\ 1. An Example {\tt tbl} Specification / 113 \\ 2. Format of a Table Specification / 116 \\ 3. Specification of the Global Table Format / 116 \\ 4. Data Format Specification / 117 \\ 5. Table Data / 127 \\ 6. Tables with Groups of Repeated Rows / 134 \\ 7. {\tt troff} Instructions / 140 \\ 8. Interface with {\tt mm} / 142 \\ 9. Checking for Errors: {\tt tbl} / 145 \\ 10. Restrictions on Table Specifications / 146 \\ 11. Examples / 147 \\ 12. Exercises / 153 \\ 4: Specifying Figures / 157 \\ 1. An Example {\tt pic} Specification / 158 \\ 2. Format of a Figure Specification / 160 \\ 3. Primitive Objects-Basics / 160 \\ 4. Moves / 171 \\ 5. Lines and Arrows / 173 \\ 6. Boxes / 179 \\ 7. Circles / 185 \\ 8. Ellipses / 189 \\ 9. Arcs / 192 \\ 10. Splines / 197 \\ 11. Text / 200 \\ 12. Invisible Objects / 203 \\ 13. Control Instructions / 203 \\ 14. Macros / 205 \\ 15. Blocks / 208 \\ 16. Including Files / 210 \\ 17. Figure Size / 213 \\ 18. Interface with {\tt mm} and {\tt eqn} / 215 \\ 19. Checking for Errors: {\tt pic} / 218 \\ 20. Recent Changes to {\tt pic} / 218 \\ 21. Exercises / 219 \\ 5: Specifying Formulas (Equations) / 225 \\ 1. An Example {\tt eqn} Specification / 226 \\ 2. Specifying Equations / 227 \\ 3. Basics / 229 \\ 4. Subscripts/Superscripts / 233 \\ 5. Fractions / 234 \\ 6. Square Roots / 235 \\ 7. Associating Limits With Items / 235 \\ 8. Large Brackets for Grouping / 237 \\ 9. {\tt eqn} Definitions / 240 \\ I 0. Aligning Equations / 243 \\ 11. Piles / 244 \\ 12. Matrices / 246 \\ 13. Diacritics / 247 \\ 14. Local Motions / 248 \\ 15. Labeling Equations / 248 \\ 16. {\tt eqn} Environment / 249 \\ 17. Operator Precedence and Association / 252 \\ 18. Special Characters and Symbols / 254 \\ 19. {\tt eqn} Interface With {\tt tbl}, {\tt pic} and {\tt mm} / 257 \\ 20. {\tt eqn} Restrictions / 259 \\ 21. Checking for Errors: {\tt eqn} and {\tt checkmm} / 260 \\ 22. Recent Changes to {\tt eqn} / 260 \\ 23. Examples / 261 \\ 24. Exercises / 265 \\ 6: {\tt troff}/nroff-The Formatters / 269 \\ 1. Stand-Alone {\tt troff} Instructions / 270 \\ 2. Escape Sequences for Characters, Indicators and Functions / 280 \\ 3. Naming Conventions for Non-ASCII Characters / 283 \\ 4. Recent Changes to {\tt troff} / 286 \\ 7: Writer's Workbench Software / 287 \\ 1. Overview / 287 \\ 2. {\tt proofr} / 288 \\ 3. {\tt prose} / 290 \\ 4. Example / 291 \\ 5. Conclusions / 297 \\ 8: Example Document Templates / 299 \\ 1. Letters / 299 \\ 2. Papers / 306 \\ 3. Books / 310 \\ 4. Exercises / 319 \\ Appendix A: More Document Formatting Tools / 321 \\ 1. {\tt ideal} / 321 \\ 2. {\tt grap} / 321 \\ 3. {\tt ms} Page-Layout Macros / 322 \\ 4. {\tt mv} Viewgraph Macros / 324 \\ 5. {\tt refer} / 325 \\ Appendix B: Document Formatting Commands / 327 \\ 1. {\tt checkmm} ({\tt mm} and {\tt eqn} Error Checker) / 327 \\ 2. {\tt double} (Double Word Finder) / 328 \\ 3. {\tt eqn} and neqn (Format Mathematical Text) / 328 \\ 4. {\tt mm} (Print Documents Formatted Using {\tt mm}) / 329 \\ 5. {\tt mmt} and {\tt mvt} (Format Documents, Viewgraphs and Slides) / 330 \\ 6. nroff (Format Text) / 331 \\ 7. {\tt pic} (Draw Figures) / 332 \\ 8. {\tt spell} (Find Spelling Errors) / 333 \\ 9. {\tt tbl} (Format Tables) / 333 \\ 10. {\tt tc} ({\tt troff} Output Interpreter) / 334 \\ 11. {\tt troff} (Text Formatting and Typesetting) / 335 \\ 12. {\tt wwb} (Writer's Workbench Software) / 336 \\ Appendix C: Some Font Samples / 339 \\ Glossary / 349 \\ Annotated Bibliography / 353 \\ Index / 359--377

entry:
@Book{Gehani:1987:DFT,
  author =       "Narain Gehani",
  title =        "Document Formatting and Typesetting on the {UNIX}
                 System",
  publisher =    pub-SILICON,
  address =      pub-SILICON:adr,
  edition =      "Second",
  pages =        "xv + 377",
  year =         "1987",
  ISBN =         "0-13-938325-5, 0-9615336-2-5",
  ISBN-13 =      "978-0-13-938325-0, 978-0-9615336-2-5",
  LCCN =         "Z52.5.U54G43 1987",
  bibdate =      "Mon May 20 09:54:58 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  price =        "US\$40.90",
  acknowledgement = ack-nhfb,
  keyword =      "documentation; languages",
  subject =      "I.7.2 Computing Methodologies, TEXT PROCESSING,
                 Document Preparation, Format and notation \\ I.7.2
                 Computing Methodologies, TEXT PROCESSING, Document
                 Preparation, Languages \\ D.4.0 Software, OPERATING
                 SYSTEMS, General, UNIX",
  tableofcontents = "Preface / xi \\
                 Acknowledgement / xv \\
                 1: Introduction / 1 \\
                 1. Document Format / 2 \\
                 2. The UNIX Document Formatting and Writing Tools / 7
                 \\
                 3. Using {\tt mm} in Preference to {\tt troff} / 9 \\
                 4. Using the Document Formatting and Writing Tools / 12
                 \\
                 5. The Typesetting Commands / 13 \\
                 2: Specifying The Document Format / 15 \\
                 1. An Example of Document Formatting / 15 \\
                 2. Basics / 20 \\
                 3. Fonts / 27 \\
                 4. Point Size and Vertical Spacing / 32 \\
                 5. Document Structure / 35 \\
                 6. Document Definitions, Style and Appearance
                 Parameters / 36 \\
                 7. Document Prelude / 38 \\
                 8. Document Body / 45 \\
                 9. Document Postlude / 71 \\
                 10. Business Letters / 76 \\
                 11. Advanced Aspects of {\tt mm} / 87 \\
                 12. Interfacing with {\tt troff} Preprocessors / 95 \\
                 13. Interaction of {\tt troff} with {\tt mm} / 95 \\
                 14. {\tt mm} Command-Line Options / 100 \\
                 15. Hints for Managing Large Documents / 102 \\
                 16. Checking for Errors: {\tt checkmm} / 103 \\
                 17. A Final Example / 103 \\
                 18. Exercises / 111 \\
                 3: Specifying Tables J / 13 \\
                 1. An Example {\tt tbl} Specification / 113 \\
                 2. Format of a Table Specification / 116 \\
                 3. Specification of the Global Table Format / 116 \\
                 4. Data Format Specification / 117 \\
                 5. Table Data / 127 \\
                 6. Tables with Groups of Repeated Rows / 134 \\
                 7. {\tt troff} Instructions / 140 \\
                 8. Interface with {\tt mm} / 142 \\
                 9. Checking for Errors: {\tt tbl} / 145 \\
                 10. Restrictions on Table Specifications / 146 \\
                 11. Examples / 147 \\
                 12. Exercises / 153 \\
                 4: Specifying Figures / 157 \\
                 1. An Example {\tt pic} Specification / 158 \\
                 2. Format of a Figure Specification / 160 \\
                 3. Primitive Objects-Basics / 160 \\
                 4. Moves / 171 \\
                 5. Lines and Arrows / 173 \\
                 6. Boxes / 179 \\
                 7. Circles / 185 \\
                 8. Ellipses / 189 \\
                 9. Arcs / 192 \\
                 10. Splines / 197 \\
                 11. Text / 200 \\
                 12. Invisible Objects / 203 \\
                 13. Control Instructions / 203 \\
                 14. Macros / 205 \\
                 15. Blocks / 208 \\
                 16. Including Files / 210 \\
                 17. Figure Size / 213 \\
                 18. Interface with {\tt mm} and {\tt eqn} / 215 \\
                 19. Checking for Errors: {\tt pic} / 218 \\
                 20. Recent Changes to {\tt pic} / 218 \\
                 21. Exercises / 219 \\
                 5: Specifying Formulas (Equations) / 225 \\
                 1. An Example {\tt eqn} Specification / 226 \\
                 2. Specifying Equations / 227 \\
                 3. Basics / 229 \\
                 4. Subscripts/Superscripts / 233 \\
                 5. Fractions / 234 \\
                 6. Square Roots / 235 \\
                 7. Associating Limits With Items / 235 \\
                 8. Large Brackets for Grouping / 237 \\
                 9. {\tt eqn} Definitions / 240 \\
                 I 0. Aligning Equations / 243 \\
                 11. Piles / 244 \\
                 12. Matrices / 246 \\
                 13. Diacritics / 247 \\
                 14. Local Motions / 248 \\
                 15. Labeling Equations / 248 \\
                 16. {\tt eqn} Environment / 249 \\
                 17. Operator Precedence and Association / 252 \\
                 18. Special Characters and Symbols / 254 \\
                 19. {\tt eqn} Interface With {\tt tbl}, {\tt pic} and
                 {\tt mm} / 257 \\
                 20. {\tt eqn} Restrictions / 259 \\
                 21. Checking for Errors: {\tt eqn} and {\tt checkmm} /
                 260 \\
                 22. Recent Changes to {\tt eqn} / 260 \\
                 23. Examples / 261 \\
                 24. Exercises / 265 \\
                 6: {\tt troff}/nroff-The Formatters / 269 \\
                 1. Stand-Alone {\tt troff} Instructions / 270 \\
                 2. Escape Sequences for Characters, Indicators and
                 Functions / 280 \\
                 3. Naming Conventions for Non-ASCII Characters / 283
                 \\
                 4. Recent Changes to {\tt troff} / 286 \\
                 7: Writer's Workbench Software / 287 \\
                 1. Overview / 287 \\
                 2. {\tt proofr} / 288 \\
                 3. {\tt prose} / 290 \\
                 4. Example / 291 \\
                 5. Conclusions / 297 \\
                 8: Example Document Templates / 299 \\
                 1. Letters / 299 \\
                 2. Papers / 306 \\
                 3. Books / 310 \\
                 4. Exercises / 319 \\
                 Appendix A: More Document Formatting Tools / 321 \\
                 1. {\tt ideal} / 321 \\
                 2. {\tt grap} / 321 \\
                 3. {\tt ms} Page-Layout Macros / 322 \\
                 4. {\tt mv} Viewgraph Macros / 324 \\
                 5. {\tt refer} / 325 \\
                 Appendix B: Document Formatting Commands / 327 \\
                 1. {\tt checkmm} ({\tt mm} and {\tt eqn} Error Checker)
                 / 327 \\
                 2. {\tt double} (Double Word Finder) / 328 \\
                 3. {\tt eqn} and neqn (Format Mathematical Text) / 328
                 \\
                 4. {\tt mm} (Print Documents Formatted Using {\tt mm})
                 / 329 \\
                 5. {\tt mmt} and {\tt mvt} (Format Documents,
                 Viewgraphs and Slides) / 330 \\
                 6. nroff (Format Text) / 331 \\
                 7. {\tt pic} (Draw Figures) / 332 \\
                 8. {\tt spell} (Find Spelling Errors) / 333 \\
                 9. {\tt tbl} (Format Tables) / 333 \\
                 10. {\tt tc} ({\tt troff} Output Interpreter) / 334 \\
                 11. {\tt troff} (Text Formatting and Typesetting) / 335
                 \\
                 12. {\tt wwb} (Writer's Workbench Software) / 336 \\
                 Appendix C: Some Font Samples / 339 \\
                 Glossary / 349 \\
                 Annotated Bibliography / 353 \\
                 Index / 359--377",
}


bibtype: book
filename: master.bib
label: Gehani:1988:DFT
author: Narain Gehani and Steven Lally
title: Document formatting and typesetting on the UNIX system. Vol. 2: grap, mv, ms, and troff
publisher: pub-SILICON
address: pub-SILICON:adr
pages: xiii + 304
year: 1988
ISBN: 0-9615336-3-3 OR 0961533633
ISBN13: 978-0-9615336-3-2 OR 9780961533632
LCCN: Z52.5.U54 G431 1988
bibdate: Mon Jul 25 08:37:04 MDT 1994
bibtimestamp: 1994.07.25 08:37:04 MDT
acknowledgement: ack-nhfb
rawauthor: Narain Gehani and Steven Lally
rawtitle: Document formatting and typesetting on the {UNIX} system. Vol. 2: grap, mv, ms, and troff
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/texbook3.bib; https://www.math.utah.edu/pub/tex/bib/typeset.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

subject:
I.7.2 Computing Methodologies, TEXT PROCESSING, Document Preparation D.4.0 Software, OPERATING SYSTEMS, General, UNIX I.7.2 Computing Methodologies, TEXT PROCESSING, Document Preparation, troff

TOC:
Preface / xi Acknowledgment / xiii 1: Specifying Graphs / 1 1. An Example of a tt grap Specification / 2 2. Format of a Graph Specification / 4 3. Basics / 4 4. Frame / 10 5. Graph Data / 27 6. Multiple Graphs / 32 7. Printing Strings and other Objects in a Graph / 34 8. Control Instructions / 38 9. Macros / 41 10. Including and Reading Data from Files / 44 11. Graph Size / 44 12. How to be a Graphic Liar / 45 13. Interface with tt mm/tt ms, tt pic, tt tbl, tt eqn and tt troff / 48 14. Checking for Errors: tt grap / 51 15. Executing UNIX Commands / 51 16. Examples / 53 17. Final Comments / 65 18. Exercises / 65 2: Specifying Viewgraphs and Slides / 69 1. Examples of Foils / 69 2. Foil Specification Format / 73 3. Foil-Start Instructions / 73 4. Default Parameters / 75 5. Titles and Centered Lines / 76 6. Specifying Lists / 76 7. Point Size and Line Length / 81 8. Font Changes / 82 9. Miscellaneous / 82 10. Useful tt troff Instructions / 82 11. Hints for Making and Managing Foils / 83 12. Interaction with Other Doc. Prep. Facilities / 84 13. Using tt mv / 85 14. Notes / 85 15. Exercises / 86 3: Specifying the Document Format with tt ms / 89 1. An Example of Document Formatting / 89 2. Basics / 95 3. Variables / 97 4. Fonts / 100 5. Point Size / 102 6. Vertical Spacing / 103 7. Document Structure / 104 8. Document Definitions, Style and Appearance Parameters / 104 9. Document Prelude / 105 10. Document Body / 110 11. Document Postlude / 121 12. Page Headers and Footers / 121 13. Multi-Column Format / 122 14. Miscellaneous Instructions / 123 15. tt ms Extensions / 125 16. tt troff Instructions and Macros / 128 17. tt ms and Other Document Preparation Tools / 133 18. Using tt ms / 134 19. A Final Example / 135 20. Exercises / 143 4: Typesetting Documents with tt troff / 145 1. An Example of a tt troff Specification / 147 2. Simple Typesetting Instructions / 151 3. Comments / 153 4. Specifying Sizes and Distances / 153 5. Specifying Fonts / 154 6. Specifying Point Size / 159 7. Specifying Vertical Spacing / 160 8. Filling and Adjusting of Text / 162 9. Line and Page Breaks / 163 10. Spaces, Tabs and Leaders / 165 11. Automatic Hyphenation / 171 12. Summary of Basic Page Characteristic Instructions / 172 13. Titles / 173 14. Local Motions / 174 15. Manipulating Files / 177 16. String Variables / 180 17. Numeric Variables / 183 18. Arithmetic Expressions / 191 19. Input Interpretation / 192 20. Macros / 193 21. Conditional Statements / 198 22. Diversions / 200 23. Traps / 204 24. Environments / 207 25. Character Manipulation Features / 210 26 Underlining Words / 215 27. Two-dimensional Graphics / 216 28. The UNIX Environment / 225 29. Special Characters / 231 30. List of Predefined Variables / 235 31. Miscellaneous / 237 32. Examples / 240 33. Exercises / 255 5: Example tt ms Document Templates / 257 1. Letters / 257 2. Papers / 263 3. Books / 266 4. Exercise / 276 Appendix A: Document Formatting Commands and Macros / 277 1. tt grap (Preprocessor for Drawing Graphs) / 277 2. tt ms (Page-Layout Macros) / 278 3. mvt (Format Viewgraphs and Slides) / 278 4. nroff (Format Text) / 279 5. tt troff (Format Text) / 280 Bibliography / 283 Index / 289

shortTOC:
Preface / xi Acknowledgment / xiii 1: Specifying Graphs / 1 2: Specifying Viewgraphs and Slides / 69 3: Specifying the Document Format with tt ms / 89 4: Typesetting Documents with tt troff / 145 5: Example tt ms Document Templates / 257 Appendix A: Document Formatting Commands and Macros / 277 Bibliography / 283 Index / 289

rawshortTOC:
Preface / xi \\ Acknowledgment / xiii \\ 1: Specifying Graphs / 1 \\ 2: Specifying Viewgraphs and Slides / 69 \\ 3: Specifying the Document Format with {\tt ms} / 89 \\ 4: Typesetting Documents with {\tt troff} / 145 \\ 5: Example {\tt ms} Document Templates / 257 \\ Appendix A: Document Formatting Commands and Macros / 277 \\ Bibliography / 283 \\ Index / 289

rawTOC:
Preface / xi \\ Acknowledgment / xiii \\ 1: Specifying Graphs / 1 \\ 1. An Example of a {\tt grap} Specification / 2 \\ 2. Format of a Graph Specification / 4 \\ 3. Basics / 4 \\ 4. Frame / 10 \\ 5. Graph Data / 27 \\ 6. Multiple Graphs / 32 \\ 7. Printing Strings and other Objects in a Graph / 34 \\ 8. Control Instructions / 38 \\ 9. Macros / 41 \\ 10. Including and Reading Data from Files / 44 \\ 11. Graph Size / 44 \\ 12. How to be a Graphic Liar / 45 \\ 13. Interface with {\tt mm}/{\tt ms}, {\tt pic}, {\tt tbl}, {\tt eqn} and {\tt troff} / 48 \\ 14. Checking for Errors: {\tt grap} / 51 \\ 15. Executing UNIX Commands / 51 \\ 16. Examples / 53 \\ 17. Final Comments / 65 \\ 18. Exercises / 65 \\ 2: Specifying Viewgraphs and Slides / 69 \\ 1. Examples of Foils / 69 \\ 2. Foil Specification Format / 73 \\ 3. Foil-Start Instructions / 73 \\ 4. Default Parameters / 75 \\ 5. Titles and Centered Lines / 76 \\ 6. Specifying Lists / 76 \\ 7. Point Size and Line Length / 81 \\ 8. Font Changes / 82 \\ 9. Miscellaneous / 82 \\ 10. Useful {\tt troff} Instructions / 82 \\ 11. Hints for Making and Managing Foils / 83 \\ 12. Interaction with Other Doc. Prep. Facilities / 84 \\ 13. Using {\tt mv} / 85 \\ 14. Notes / 85 \\ 15. Exercises / 86 \\ 3: Specifying the Document Format with {\tt ms} / 89 \\ 1. An Example of Document Formatting / 89 \\ 2. Basics / 95 \\ 3. Variables / 97 \\ 4. Fonts / 100 \\ 5. Point Size / 102 \\ 6. Vertical Spacing / 103 \\ 7. Document Structure / 104 \\ 8. Document Definitions, Style and Appearance Parameters / 104 \\ 9. Document Prelude / 105 \\ 10. Document Body / 110 \\ 11. Document Postlude / 121 \\ 12. Page Headers and Footers / 121 \\ 13. Multi-Column Format / 122 \\ 14. Miscellaneous Instructions / 123 \\ 15. {\tt ms} Extensions / 125 \\ 16. {\tt troff} Instructions and Macros / 128 \\ 17. {\tt ms} and Other Document Preparation Tools / 133 \\ 18. Using {\tt ms} / 134 \\ 19. A Final Example / 135 \\ 20. Exercises / 143 \\ 4: Typesetting Documents with {\tt troff} / 145 \\ 1. An Example of a {\tt troff} Specification / 147 \\ 2. Simple Typesetting Instructions / 151 \\ 3. Comments / 153 \\ 4. Specifying Sizes and Distances / 153 \\ 5. Specifying Fonts / 154 \\ 6. Specifying Point Size / 159 \\ 7. Specifying Vertical Spacing / 160 \\ 8. Filling and Adjusting of Text / 162 \\ 9. Line and Page Breaks / 163 \\ 10. Spaces, Tabs and Leaders / 165 \\ 11. Automatic Hyphenation / 171 \\ 12. Summary of Basic Page Characteristic Instructions / 172 \\ 13. Titles / 173 \\ 14. Local Motions / 174 \\ 15. Manipulating Files / 177 \\ 16. String Variables / 180 \\ 17. Numeric Variables / 183 \\ 18. Arithmetic Expressions / 191 \\ 19. Input Interpretation / 192 \\ 20. Macros / 193 \\ 21. Conditional Statements / 198 \\ 22. Diversions / 200 \\ 23. Traps / 204 \\ 24. Environments / 207 \\ 25. Character Manipulation Features / 210 \\ 26 Underlining Words / 215 \\ 27. Two-dimensional Graphics / 216 \\ 28. The UNIX Environment / 225 \\ 29. Special Characters / 231 \\ 30. List of Predefined Variables / 235 \\ 31. Miscellaneous / 237 \\ 32. Examples / 240 \\ 33. Exercises / 255 \\ 5: Example {\tt ms} Document Templates / 257 \\ 1. Letters / 257 \\ 2. Papers / 263 \\ 3. Books / 266 \\ 4. Exercise / 276 \\ Appendix A: Document Formatting Commands and Macros / 277 \\ 1. {\tt grap} (Preprocessor for Drawing Graphs) / 277 \\ 2. {\tt ms} (Page-Layout Macros) / 278 \\ 3. mvt (Format Viewgraphs and Slides) / 278 \\ 4. nroff (Format Text) / 279 \\ 5. {\tt troff} (Format Text) / 280 \\ Bibliography / 283 \\ Index / 289

entry:
@Book{Gehani:1988:DFT,
  author =       "Narain Gehani and Steven Lally",
  title =        "Document formatting and typesetting on the {UNIX}
                 system. Vol. 2: grap, mv, ms, and troff",
  publisher =    pub-SILICON,
  address =      pub-SILICON:adr,
  pages =        "xiii + 304",
  year =         "1988",
  ISBN =         "0-9615336-3-3",
  ISBN-13 =      "978-0-9615336-3-2",
  LCCN =         "Z52.5.U54 G431 1988",
  bibdate =      "Mon Jul 25 08:37:04 MDT 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  price =        "US\$30.95",
  acknowledgement = ack-nhfb,
  keyword =      "languages; documentation",
  review =       "ACM CR 8907-0444",
  shorttableofcontents = "Preface / xi \\
                 Acknowledgment / xiii \\
                 1: Specifying Graphs / 1 \\
                 2: Specifying Viewgraphs and Slides / 69 \\
                 3: Specifying the Document Format with {\tt ms} / 89
                 \\
                 4: Typesetting Documents with {\tt troff} / 145 \\
                 5: Example {\tt ms} Document Templates / 257 \\
                 Appendix A: Document Formatting Commands and Macros /
                 277 \\
                 Bibliography / 283 \\
                 Index / 289",
  subject =      "I.7.2 Computing Methodologies, TEXT PROCESSING,
                 Document Preparation \\ D.4.0 Software, OPERATING
                 SYSTEMS, General, UNIX \\ I.7.2 Computing
                 Methodologies, TEXT PROCESSING, Document Preparation,
                 troff",
  tableofcontents = "Preface / xi \\
                 Acknowledgment / xiii \\
                 1: Specifying Graphs / 1 \\
                 1. An Example of a {\tt grap} Specification / 2 \\
                 2. Format of a Graph Specification / 4 \\
                 3. Basics / 4 \\
                 4. Frame / 10 \\
                 5. Graph Data / 27 \\
                 6. Multiple Graphs / 32 \\
                 7. Printing Strings and other Objects in a Graph / 34
                 \\
                 8. Control Instructions / 38 \\
                 9. Macros / 41 \\
                 10. Including and Reading Data from Files / 44 \\
                 11. Graph Size / 44 \\
                 12. How to be a Graphic Liar / 45 \\
                 13. Interface with {\tt mm}/{\tt ms}, {\tt pic}, {\tt
                 tbl}, {\tt eqn} and {\tt troff} / 48 \\
                 14. Checking for Errors: {\tt grap} / 51 \\
                 15. Executing UNIX Commands / 51 \\
                 16. Examples / 53 \\
                 17. Final Comments / 65 \\
                 18. Exercises / 65 \\
                 2: Specifying Viewgraphs and Slides / 69 \\
                 1. Examples of Foils / 69 \\
                 2. Foil Specification Format / 73 \\
                 3. Foil-Start Instructions / 73 \\
                 4. Default Parameters / 75 \\
                 5. Titles and Centered Lines / 76 \\
                 6. Specifying Lists / 76 \\
                 7. Point Size and Line Length / 81 \\
                 8. Font Changes / 82 \\
                 9. Miscellaneous / 82 \\
                 10. Useful {\tt troff} Instructions / 82 \\
                 11. Hints for Making and Managing Foils / 83 \\
                 12. Interaction with Other Doc. Prep. Facilities / 84
                 \\
                 13. Using {\tt mv} / 85 \\
                 14. Notes / 85 \\
                 15. Exercises / 86 \\
                 3: Specifying the Document Format with {\tt ms} / 89
                 \\
                 1. An Example of Document Formatting / 89 \\
                 2. Basics / 95 \\
                 3. Variables / 97 \\
                 4. Fonts / 100 \\
                 5. Point Size / 102 \\
                 6. Vertical Spacing / 103 \\
                 7. Document Structure / 104 \\
                 8. Document Definitions, Style and Appearance
                 Parameters / 104 \\
                 9. Document Prelude / 105 \\
                 10. Document Body / 110 \\
                 11. Document Postlude / 121 \\
                 12. Page Headers and Footers / 121 \\
                 13. Multi-Column Format / 122 \\
                 14. Miscellaneous Instructions / 123 \\
                 15. {\tt ms} Extensions / 125 \\
                 16. {\tt troff} Instructions and Macros / 128 \\
                 17. {\tt ms} and Other Document Preparation Tools / 133
                 \\
                 18. Using {\tt ms} / 134 \\
                 19. A Final Example / 135 \\
                 20. Exercises / 143 \\
                 4: Typesetting Documents with {\tt troff} / 145 \\
                 1. An Example of a {\tt troff} Specification / 147 \\
                 2. Simple Typesetting Instructions / 151 \\
                 3. Comments / 153 \\
                 4. Specifying Sizes and Distances / 153 \\
                 5. Specifying Fonts / 154 \\
                 6. Specifying Point Size / 159 \\
                 7. Specifying Vertical Spacing / 160 \\
                 8. Filling and Adjusting of Text / 162 \\
                 9. Line and Page Breaks / 163 \\
                 10. Spaces, Tabs and Leaders / 165 \\
                 11. Automatic Hyphenation / 171 \\
                 12. Summary of Basic Page Characteristic Instructions /
                 172 \\
                 13. Titles / 173 \\
                 14. Local Motions / 174 \\
                 15. Manipulating Files / 177 \\
                 16. String Variables / 180 \\
                 17. Numeric Variables / 183 \\
                 18. Arithmetic Expressions / 191 \\
                 19. Input Interpretation / 192 \\
                 20. Macros / 193 \\
                 21. Conditional Statements / 198 \\
                 22. Diversions / 200 \\
                 23. Traps / 204 \\
                 24. Environments / 207 \\
                 25. Character Manipulation Features / 210 \\
                 26 Underlining Words / 215 \\
                 27. Two-dimensional Graphics / 216 \\
                 28. The UNIX Environment / 225 \\
                 29. Special Characters / 231 \\
                 30. List of Predefined Variables / 235 \\
                 31. Miscellaneous / 237 \\
                 32. Examples / 240 \\
                 33. Exercises / 255 \\
                 5: Example {\tt ms} Document Templates / 257 \\
                 1. Letters / 257 \\
                 2. Papers / 263 \\
                 3. Books / 266 \\
                 4. Exercise / 276 \\
                 Appendix A: Document Formatting Commands and Macros /
                 277 \\
                 1. {\tt grap} (Preprocessor for Drawing Graphs) / 277
                 \\
                 2. {\tt ms} (Page-Layout Macros) / 278 \\
                 3. mvt (Format Viewgraphs and Slides) / 278 \\
                 4. nroff (Format Text) / 279 \\
                 5. {\tt troff} (Format Text) / 280 \\
                 Bibliography / 283 \\
                 Index / 289",
}


bibtype: book
filename: master.bib
label: Gehani:2003:BLL
author: Narain Gehani
title: Bell Labs: life in the crown jewel
publisher: pub-SILICON
address: pub-SILICON:adr
pages: xi + 258
year: 2003
ISBN: 0-929306-27-9 OR 0929306279
ISBN13: 978-0-929306-27-8 OR 9780929306278
LCCN: TK415.B45 G44 2003
bibdate: Sat May 12 06:43:17 MDT 2012
bibtimestamp: 2012.05.12 06:43:17 MDT
URL: http://www.loc.gov/catdir/toc/fy043/2002012730.html
subject: Electrical engineering; Research; United States; Corporate culture
acknowledgement: ack-nhfb
rawauthor: Narain Gehani
rawtitle: {Bell Labs}: life in the crown jewel
bibsource:
https://www.math.utah.edu/pub/tex/bib/bstj2000.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib; z3950.loc.gov:7090/Voyager

TOC:
Preface / vii Acknowledgments / xi 1 I have a job for life! / 1 2 The Crown Jewel / 12 3 Life at Murray Hill / 47 4 Looking for dung but finding gold / 93 5 Do we work for the same company? / 117 6 What are you doing for us? / 139 7 Bell Labs goes West / 163 8 Maps on us / 177 9 Most Fantastic Place! / 221 Notes / 236 Index / 252

rawTOC:
Preface / vii \\ Acknowledgments / xi \\ 1 I have a job for life! / 1 \\ 2 The Crown Jewel / 12 \\ 3 Life at Murray Hill / 47 \\ 4 Looking for dung but finding gold / 93 \\ 5 Do we work for the same company? / 117 \\ 6 What are you doing for us? / 139 \\ 7 Bell Labs goes West / 163 \\ 8 Maps on us / 177 \\ 9 Most Fantastic Place! / 221 \\ Notes / 236 \\ Index / 252

entry:
@Book{Gehani:2003:BLL,
  author =       "Narain Gehani",
  title =        "{Bell Labs}: life in the crown jewel",
  publisher =    pub-SILICON,
  address =      pub-SILICON:adr,
  pages =        "xi + 258",
  year =         "2003",
  ISBN =         "0-929306-27-9",
  ISBN-13 =      "978-0-929306-27-8",
  LCCN =         "TK415.B45 G44 2003",
  bibdate =      "Sat May 12 06:43:17 MDT 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bstj2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/fy043/2002012730.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Electrical engineering; Research; United States;
                 Corporate culture",
  tableofcontents = "Preface / vii \\
                 Acknowledgments / xi \\
                 1 I have a job for life! / 1 \\
                 2 The Crown Jewel / 12 \\
                 3 Life at Murray Hill / 47 \\
                 4 Looking for dung but finding gold / 93 \\
                 5 Do we work for the same company? / 117 \\
                 6 What are you doing for us? / 139 \\
                 7 Bell Labs goes West / 163 \\
                 8 Maps on us / 177 \\
                 9 Most Fantastic Place! / 221 \\
                 Notes / 236 \\
                 Index / 252",
}


bibtype: book
filename: master.bib
label: Geiss:1975:RHC
author: Tony Geiss
title: Random House College Dictionary
publisher: Random House Reference
address: New York, NY, USA
pages: xxxii + 1568
year: 1975
ISBN: 0-394-43500-1 (hardcover) OR 0394435001 (hardcover)
ISBN13: 978-0-394-43500-8 (hardcover) OR 9780394435008 (hardcover)
LCCN: PE1625 .R34 1975
bibdate: Sat Dec 24 11:53:05 MST 2005
bibsource: Amazon; https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2005.12.24 11:53:05 MST
keywords: English language --- Dictionaries
acknowledgement: ack-nhfb
rawauthor: Tony Geiss
rawtitle: {Random House} College Dictionary
remark:
Based on the Random House dictionary of the English language, unabridged ed.. Published in 1968 under title: The Random House dictionary of the English language, college ed.

entry:
@Book{Geiss:1975:RHC,
  author =       "Tony Geiss",
  title =        "{Random House} College Dictionary",
  publisher =    "Random House Reference",
  address =      "New York, NY, USA",
  pages =        "xxxii + 1568",
  year =         "1975",
  ISBN =         "0-394-43500-1 (hardcover)",
  ISBN-13 =      "978-0-394-43500-8 (hardcover)",
  LCCN =         "PE1625 .R34 1975",
  bibdate =      "Sat Dec 24 11:53:05 MST 2005",
  bibsource =    "Amazon;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  category =     "Reference: Dictionaries \& Thesauruses: General",
  dateentered =  "2005-12-23",
  DEWEY =        "423",
  idnumber =     "528",
  keywords =     "English language --- Dictionaries",
  pubdate =      "August 12, 1975",
  remark =       "Based on the Random House dictionary of the English
                 language, unabridged ed.. Published in 1968 under
                 title: The Random House dictionary of the English
                 language, college ed.",
}


bibtype: book
filename: master.bib
label: Genstat:1993:GRR
author: Genstat 5 Committee
title: Genstat 5 release 3 reference manual
publisher: pub-CLARENDON
address: pub-CLARENDON:adr
pages: xvi + 796
year: 1993
ISBN: 0-19-852312-2 OR 0198523122
ISBN13: 978-0-19-852312-3 OR 9780198523123
LCCN: QA276.4 .G443 1993
bibdate: Tue Apr 11 11:03:16 2000
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2000.04.11 11:03:16 ???
note: Reprinted with corrections in 1994 and 1997.
acknowledgement: ack-nhfb
rawauthor: {Genstat 5 Committee}
rawnote: Reprinted with corrections in 1994 and 1997.
rawtitle: {Genstat 5} release 3 reference manual
TOC:
1: Introduction, terminology, and syntax 2: Data structures 3: Input and output 4: Data handling 5: Programming in Genstat 6: Graphical display 7: Basic Statistics 8: Regression analysis 9: Design and analysis of experiments 10: REML estimation of variance components and analysis of unbalanced designs 11: Multivariate and cluster analysis 12: Analysis of time series 13: Customizing and extending Genstat Appendix 1: List of Genstat directives Appendix 2: Release 3[1] of the Procedure Library

rawTOC:
1: Introduction, terminology, and syntax \\ 2: Data structures \\ 3: Input and output \\ 4: Data handling \\ 5: Programming in Genstat \\ 6: Graphical display \\ 7: Basic Statistics \\ 8: Regression analysis \\ 9: Design and analysis of experiments \\ 10: REML estimation of variance components and analysis of unbalanced designs \\ 11: Multivariate and cluster analysis \\ 12: Analysis of time series \\ 13: Customizing and extending Genstat \\ Appendix 1: List of Genstat directives \\ Appendix 2: Release 3[1] of the Procedure Library

entry:
@Book{Genstat:1993:GRR,
  author =       "{Genstat 5 Committee}",
  title =        "{Genstat 5} release 3 reference manual",
  publisher =    pub-CLARENDON,
  address =      pub-CLARENDON:adr,
  pages =        "xvi + 796",
  year =         "1993",
  ISBN =         "0-19-852312-2",
  ISBN-13 =      "978-0-19-852312-3",
  LCCN =         "QA276.4 .G443 1993",
  bibdate =      "Tue Apr 11 11:03:16 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted with corrections in 1994 and 1997.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "1: Introduction, terminology, and syntax \\
                 2: Data structures \\
                 3: Input and output \\
                 4: Data handling \\
                 5: Programming in Genstat \\
                 6: Graphical display \\
                 7: Basic Statistics \\
                 8: Regression analysis \\
                 9: Design and analysis of experiments \\
                 10: REML estimation of variance components and analysis
                 of unbalanced designs \\
                 11: Multivariate and cluster analysis \\
                 12: Analysis of time series \\
                 13: Customizing and extending Genstat \\
                 Appendix 1: List of Genstat directives \\
                 Appendix 2: Release 3[1] of the Procedure Library",
}


bibtype: book
filename: master.bib
label: George:1981:CSL
author: Alan George and Joseph W. Liu
title: Computer Solution of Large Sparse Positive Definite Systems
publisher: pub-PH
address: pub-PH:adr
pages: xii + 324
year: 1981
ISBN: 0-13-165274-5 OR 0131652745
ISBN13: 978-0-13-165274-3 OR 9780131652743
LCCN: QA188 .G46 1980
bibdate: Tue Dec 14 22:53:15 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:53:15 ???
series: Prentice-Hall Series in Computational Mathematics, Cleve Moler, Advisor
acknowledgement: ack-nhfb
rawauthor: Alan George and Joseph W. Liu
rawtitle: Computer Solution of Large Sparse Positive Definite Systems
entry:
@Book{George:1981:CSL,
  author =       "Alan George and Joseph W. Liu",
  title =        "Computer Solution of Large Sparse Positive Definite
                 Systems",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xii + 324",
  year =         "1981",
  ISBN =         "0-13-165274-5",
  ISBN-13 =      "978-0-13-165274-3",
  LCCN =         "QA188 .G46 1980",
  bibdate =      "Tue Dec 14 22:53:15 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Prentice-Hall Series in Computational Mathematics,
                 Cleve Moler, Advisor",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Gershenfeld:2000:PIT
author: Neil Gershenfeld
title: The Physics of Information Technology
publisher: pub-CAMBRIDGE
address: pub-CAMBRIDGE:adr
pages: xiv + 370
year: 2000
ISBN: 0-521-58044-7 OR 0521580447
ISBN13: 978-0-521-58044-1 OR 9780521580441
LCCN: TK5103 .G45 2000
bibdate: Wed May 30 15:46:16 2001
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2001.05.30 15:46:16 ???
series: Cambridge series on information and the natural sciences.
acknowledgement: ack-nhfb
rawauthor: Neil Gershenfeld
rawtitle: The Physics of Information Technology
abstract:
booktitle The Physics of Information Technology explores the familiar devices that we use to collect, transform, transmit, and interact with electronic information. Many such devices operate surprisingly close to very many fundamental physical limits. Understanding how such devices work, and how they can (and cannot) be improved, requires deep insight into the character of physical law as well as engineering practice. The book starts with an introduction to units, forces, and the probabilistic foundations of noise and signalling, then progresses through the electromagnetics of wired and wireless communications, and the quantum mechanics of electronic, optical, and magnetic materials, to discussions of mechanisms for computation, storage, sensing, and display. This self-contained volume will help both physical scientists and computer scientists see beyond the conventional division between hardware and software to understand the implications of physical theory for information manipulation.

TOC:
Introduction Interactions, units, and magnitudes Noise in physical systems Information in physical systems Electromagnetic fields and waves Circuits, transmission lines, and waveguides Antennas Optics Lensless imaging and inverse problems Semiconductor materials and devices Generating, detecting, and modulating light Magnetic storage Measurement and coding Transducers Quantum computing and communications

rawabstract:
\booktitle{The Physics of Information Technology} explores the familiar devices that we use to collect, transform, transmit, and interact with electronic information. Many such devices operate surprisingly close to very many fundamental physical limits. Understanding how such devices work, and how they can (and cannot) be improved, requires deep insight into the character of physical law as well as engineering practice. The book starts with an introduction to units, forces, and the probabilistic foundations of noise and signalling, then progresses through the electromagnetics of wired and wireless communications, and the quantum mechanics of electronic, optical, and magnetic materials, to discussions of mechanisms for computation, storage, sensing, and display. This self-contained volume will help both physical scientists and computer scientists see beyond the conventional division between hardware and software to understand the implications of physical theory for information manipulation.

rawTOC:
Introduction \\ Interactions, units, and magnitudes \\ Noise in physical systems \\ Information in physical systems \\ Electromagnetic fields and waves \\ Circuits, transmission lines, and waveguides \\ Antennas \\ Optics \\ Lensless imaging and inverse problems \\ Semiconductor materials and devices \\ Generating, detecting, and modulating light \\ Magnetic storage \\ Measurement and coding \\ Transducers \\ Quantum computing and communications

entry:
@Book{Gershenfeld:2000:PIT,
  author =       "Neil Gershenfeld",
  title =        "The Physics of Information Technology",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xiv + 370",
  year =         "2000",
  ISBN =         "0-521-58044-7",
  ISBN-13 =      "978-0-521-58044-1",
  LCCN =         "TK5103 .G45 2000",
  bibdate =      "Wed May 30 15:46:16 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Cambridge series on information and the natural
                 sciences.",
  abstract =     "\booktitle{The Physics of Information Technology}
                 explores the familiar devices that we use to collect,
                 transform, transmit, and interact with electronic
                 information. Many such devices operate surprisingly
                 close to very many fundamental physical limits.
                 Understanding how such devices work, and how they can
                 (and cannot) be improved, requires deep insight into
                 the character of physical law as well as engineering
                 practice. The book starts with an introduction to
                 units, forces, and the probabilistic foundations of
                 noise and signalling, then progresses through the
                 electromagnetics of wired and wireless communications,
                 and the quantum mechanics of electronic, optical, and
                 magnetic materials, to discussions of mechanisms for
                 computation, storage, sensing, and display. This
                 self-contained volume will help both physical
                 scientists and computer scientists see beyond the
                 conventional division between hardware and software to
                 understand the implications of physical theory for
                 information manipulation.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Introduction \\
                 Interactions, units, and magnitudes \\
                 Noise in physical systems \\
                 Information in physical systems \\
                 Electromagnetic fields and waves \\
                 Circuits, transmission lines, and waveguides \\
                 Antennas \\
                 Optics \\
                 Lensless imaging and inverse problems \\
                 Semiconductor materials and devices \\
                 Generating, detecting, and modulating light \\
                 Magnetic storage \\
                 Measurement and coding \\
                 Transducers \\
                 Quantum computing and communications",
}


bibtype: book
filename: master.bib
label: Gerwarth:2020:NGR
author: Robert Gerwarth
title: November 1918: The German Revolution
publisher: pub-OXFORD
address: pub-OXFORD:adr
pages: 329
year: 2020
LCCN: DD248 .G49 2020
bibdate: Thu Nov 11 18:22:55 MST 2021
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2021.11.11 18:22:55 MST
series: Making of the Modern World
acknowledgement: ack-nhfb
authordates: 1976--
rawauthor: Robert Gerwarth
rawtitle: {November 1918}: The {German} Revolution
ISBN:
0-19-260632-8 (electronic book), 0-19-260633-6 (electronic book), 0-19-954647-9 (hardcover) OR 0192606328 (electronic book), 0192606336 (electronic book), 0199546479 (hardcover)

ISBN13:
978-0-19-260632-7 (electronic book), 978-0-19-260633-4 (electronic book), 978-0-19-954647-3 (hardcover) OR 9780192606327 (electronic book), 9780192606334 (electronic book), 9780199546473 (hardcover)

abstract:
The German Revolution of November 1918 is nowadays largely forgotten outside Germany. It is generally regarded as a failure even by those who have heard of it, a missed opportunity which paved the way for the rise of the Nazis and the catastrophe to come. Robert Gerwarth argues here that to view the German Revolution in this way is a serious misjudgement. Not only did it bring down the authoritarian monarchy of the Hohenzollern, it also brought into being the first ever German democracy in an amazingly bloodless way. Focusing on the dramatic events between the last months of the First World War in 1918 and Hitler's Munich Putsch of 1923, Robert Gerwarth illuminates the fundamental and deep-seated ways in which the November Revolution changed Germany. In doing so, he reminds us that, while it is easy with the benefit of hindsight to write off the 1918 Revolution as a 'failure', this failure was not somehow pre-ordained. In 1918, the fate of the German Revolution remained very much an open book.

subject:
Allemagne; 1918 (Revolution); Histoire; revolution; 1910--1919; politiske forhold; historie; Weimarrepublikken; Tyskland; 1910--1919

TOC:
Preface / vii `Like a beautiful dream': introduction / 1 1917 and the revolution of expectations / 20 Hoping for victory / 45 Endgame / 62 The sailors' mutiny / 77 The revolution spreads / 90 Showdown in Berlin / 106 Making peace in the West / 122 Challenges for the young Republic / 130 Fighting radicalization / 139 The triumpth of liberalism / 160 Democracy besieged / 173 Undermining Weimar / 184 Epilogue: the defiant republic: Germany, 1919--1923 / 212 Notes / 223 Picture Acknowledgements / 275 Bibliography / 277 Index / 315

rawabstract:
The German Revolution of November 1918 is nowadays largely forgotten outside Germany. It is generally regarded as a failure even by those who have heard of it, a missed opportunity which paved the way for the rise of the Nazis and the catastrophe to come. Robert Gerwarth argues here that to view the German Revolution in this way is a serious misjudgement. Not only did it bring down the authoritarian monarchy of the Hohenzollern, it also brought into being the first ever German democracy in an amazingly bloodless way. Focusing on the dramatic events between the last months of the First World War in 1918 and Hitler's Munich Putsch of 1923, Robert Gerwarth illuminates the fundamental and deep-seated ways in which the November Revolution changed Germany. In doing so, he reminds us that, while it is easy with the benefit of hindsight to write off the 1918 Revolution as a 'failure', this failure was not somehow pre-ordained. In 1918, the fate of the German Revolution remained very much an open book.

rawTOC:
Preface / vii \\ `Like a beautiful dream': introduction / 1 \\ 1917 and the revolution of expectations / 20 \\ Hoping for victory / 45 \\ Endgame / 62 \\ The sailors' mutiny / 77 \\ The revolution spreads / 90 \\ Showdown in Berlin / 106 \\ Making peace in the West / 122 \\ Challenges for the young Republic / 130 \\ Fighting radicalization / 139 The triumpth of liberalism / 160 \\ Democracy besieged / 173 \\ Undermining Weimar / 184 \\ Epilogue: the defiant republic: Germany, 1919--1923 / 212 \\ Notes / 223 \\ Picture Acknowledgements / 275 \\ Bibliography / 277 \\ Index / 315

entry:
@Book{Gerwarth:2020:NGR,
  author =       "Robert Gerwarth",
  title =        "{November 1918}: The {German} Revolution",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "329",
  year =         "2020",
  ISBN =         "0-19-260632-8 (electronic book), 0-19-260633-6
                 (electronic book), 0-19-954647-9 (hardcover)",
  ISBN-13 =      "978-0-19-260632-7 (electronic book), 978-0-19-260633-4
                 (electronic book), 978-0-19-954647-3 (hardcover)",
  LCCN =         "DD248 .G49 2020",
  bibdate =      "Thu Nov 11 18:22:55 MST 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Making of the Modern World",
  abstract =     "The German Revolution of November 1918 is nowadays
                 largely forgotten outside Germany. It is generally
                 regarded as a failure even by those who have heard of
                 it, a missed opportunity which paved the way for the
                 rise of the Nazis and the catastrophe to come. Robert
                 Gerwarth argues here that to view the German Revolution
                 in this way is a serious misjudgement. Not only did it
                 bring down the authoritarian monarchy of the
                 Hohenzollern, it also brought into being the first ever
                 German democracy in an amazingly bloodless way.
                 Focusing on the dramatic events between the last months
                 of the First World War in 1918 and Hitler's Munich
                 Putsch of 1923, Robert Gerwarth illuminates the
                 fundamental and deep-seated ways in which the November
                 Revolution changed Germany. In doing so, he reminds us
                 that, while it is easy with the benefit of hindsight to
                 write off the 1918 Revolution as a 'failure', this
                 failure was not somehow pre-ordained. In 1918, the fate
                 of the German Revolution remained very much an open
                 book.",
  acknowledgement = ack-nhfb,
  author-dates = "1976--",
  subject =      "Allemagne; 1918 (R{\'e}volution); Histoire;
                 revolution; 1910--1919; politiske forhold; historie;
                 Weimarrepublikken; Tyskland; 1910--1919",
  tableofcontents = "Preface / vii \\
                 `Like a beautiful dream': introduction / 1 \\
                 1917 and the revolution of expectations / 20 \\
                 Hoping for victory / 45 \\
                 Endgame / 62 \\
                 The sailors' mutiny / 77 \\
                 The revolution spreads / 90 \\
                 Showdown in Berlin / 106 \\
                 Making peace in the West / 122 \\
                 Challenges for the young Republic / 130 \\
                 Fighting radicalization / 139 The triumpth of
                 liberalism / 160 \\
                 Democracy besieged / 173 \\
                 Undermining Weimar / 184 \\
                 Epilogue: the defiant republic: Germany, 1919--1923 /
                 212 \\
                 Notes / 223 \\
                 Picture Acknowledgements / 275 \\
                 Bibliography / 277 \\
                 Index / 315",
}


bibtype: book
filename: master.bib
label: Ghirardi:2005:SLG
author: G. C. Ghirardi
title: Sneaking a Look at God's Cards: Unraveling the Mysteries of Quantum Mechanics
publisher: pub-PRINCETON
address: pub-PRINCETON:adr
edition: Revised
pages: xix + 488
year: 2005
ISBN: 0-691-04934-3, 0-691-12139-7, 0-691-13037-X OR 0691049343, 0691121397, 069113037X
LCCN: Q173 .G4813 2004
bibdate: Wed Oct 8 15:06:08 MDT 2008
bibtimestamp: 2008.10.08 15:06:08 MDT
remark: Translated from the Italian by Gerald Malsbary.
subject: Science
acknowledgement: ack-nhfb
rawauthor: G. C. Ghirardi
rawtitle: Sneaking a Look at {God}'s Cards: Unraveling the Mysteries of Quantum Mechanics
ISBN13:
978-0-691-04934-2, 978-0-691-12139-0, 978-0-691-13037-8 OR 9780691049342, 9780691121390, 9780691130378

bibsource:
https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib; 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.bibsys.no:2100/BIBSYS

TOC:
Collapse of the ``classical'' world view Polarization of light Quanta, chance events, and indeterminism Superposition principle and the conceptual structure of the theory Visualization and scientific progress Interpretation of the theory Bohr--Einstein dialogue Bolt from the blue, the Einstein-Podolski-Rosen argument Hidden variables Bells' inequality and nonlocality Nonlocality and superluminal signals Quantum cryptography Quantum computers Systems of identical particles From microscopic to macroscopic In search of a coherent framework for all physical processes Spontaneous localization, properties, and perceptions Macrorealism and noninvasive measurements

rawTOC:
Collapse of the ``classical'' world view \\ Polarization of light \\ Quanta, chance events, and indeterminism \\ Superposition principle and the conceptual structure of the theory \\ Visualization and scientific progress \\ Interpretation of the theory \\ Bohr--Einstein dialogue \\ Bolt from the blue, the Einstein-Podolski-Rosen argument \\ Hidden variables \\ Bells' inequality and nonlocality \\ Nonlocality and superluminal signals \\ Quantum cryptography \\ Quantum computers \\ Systems of identical particles \\ From microscopic to macroscopic \\ In search of a coherent framework for all physical processes \\ Spontaneous localization, properties, and perceptions \\ Macrorealism and noninvasive measurements

entry:
@Book{Ghirardi:2005:SLG,
  author =       "G. C. Ghirardi",
  title =        "Sneaking a Look at {God}'s Cards: Unraveling the
                 Mysteries of Quantum Mechanics",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  edition =      "Revised",
  pages =        "xix + 488",
  year =         "2005",
  ISBN =         "0-691-04934-3, 0-691-12139-7, 0-691-13037-X",
  ISBN-13 =      "978-0-691-04934-2, 978-0-691-12139-0,
                 978-0-691-13037-8",
  LCCN =         "Q173 .G4813 2004",
  bibdate =      "Wed Oct 8 15:06:08 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 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.bibsys.no:2100/BIBSYS",
  acknowledgement = ack-nhfb,
  remark =       "Translated from the Italian by Gerald Malsbary.",
  subject =      "Science",
  tableofcontents = "Collapse of the ``classical'' world view \\
                 Polarization of light \\
                 Quanta, chance events, and indeterminism \\
                 Superposition principle and the conceptual structure of
                 the theory \\
                 Visualization and scientific progress \\
                 Interpretation of the theory \\
                 Bohr--Einstein dialogue \\
                 Bolt from the blue, the Einstein-Podolski-Rosen
                 argument \\
                 Hidden variables \\
                 Bells' inequality and nonlocality \\
                 Nonlocality and superluminal signals \\
                 Quantum cryptography \\
                 Quantum computers \\
                 Systems of identical particles \\
                 From microscopic to macroscopic \\
                 In search of a coherent framework for all physical
                 processes \\
                 Spontaneous localization, properties, and perceptions
                 \\
                 Macrorealism and noninvasive measurements",
}


bibtype: book
filename: master.bib
label: Ghizzetti:1970:QF
author: Aldo Ghizzetti and Alessandro Ossicini
title: Quadrature formulae
publisher: pub-ACADEMIC
address: pub-ACADEMIC:adr
pages: 192
year: 1970
ISBN: 0-12-281750-8 OR 0122817508
ISBN13: 978-0-12-281750-2 OR 9780122817502
LCCN: QA299.3 .G4813
bibdate: Sat Dec 24 15:53:15 MST 2005
bibsource: Amazon; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2005.12.24 15:53:15 MST
keywords: Numerical integration
acknowledgement: ack-nhfb
rawauthor: Aldo Ghizzetti and Alessandro Ossicini
rawtitle: Quadrature formulae
entry:
@Book{Ghizzetti:1970:QF,
  author =       "Aldo Ghizzetti and Alessandro Ossicini",
  title =        "Quadrature formulae",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "192",
  year =         "1970",
  ISBN =         "0-12-281750-8",
  ISBN-13 =      "978-0-12-281750-2",
  LCCN =         "QA299.3 .G4813",
  bibdate =      "Sat Dec 24 15:53:15 MST 2005",
  bibsource =    "Amazon;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  category =     "Numerical integration",
  DEWEY =        "517/.6",
  idnumber =     "542",
  keywords =     "Numerical integration",
  libnote =      "Not in my library.",
}


bibtype: book
filename: master.bib
label: Gianone:1990:UMK
author: Christine M. Gianone
title: Using MS-DOS KERMIT: connecting your PC to the Electronic World
publisher: pub-DP
address: pub-DP:adr
pages: xxv + 244
year: 1990
ISBN: 1-55558-048-3 OR 1555580483
ISBN13: 978-1-55558-048-3 OR 9781555580483
LCCN: TK5105.9 .G5 1990
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: Christine M. Gianone
rawtitle: Using {MS-DOS KERMIT}: connecting your {PC} to the Electronic World
entry:
@Book{Gianone:1990:UMK,
  author =       "Christine M. Gianone",
  title =        "Using {MS-DOS KERMIT}: connecting your {PC} to the
                 Electronic World",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  pages =        "xxv + 244",
  year =         "1990",
  ISBN =         "1-55558-048-3",
  ISBN-13 =      "978-1-55558-048-3",
  LCCN =         "TK5105.9 .G5 1990",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}


bibtype: book
filename: master.bib
label: Gianone:1992:UMK
author: Christine M. Gianone
title: Using MS-DOS KERMIT: Connecting Your PC to the Electronic World
publisher: pub-DP
address: pub-DP:adr
edition: Second
pages: xxviii + 354
year: 1992
ISBN: 1-55558-082-3 (book + diskette), 1-55558-048-3 OR 1555580823 (book + diskette), 1555580483
LCCN: TK5105.9 .G5 1992
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: Christine M. Gianone
rawtitle: Using {MS-DOS KERMIT}: Connecting Your {PC} to the Electronic World
ISBN13:
978-1-55558-082-7 (book + diskette), 978-1-55558-048-3 OR 9781555580827 (book + diskette), 9781555580483

abstract:
Using MS-DOS Kermit is a book/disk package designed to help both technical and non-technical PC users alike to link their IBM PCs, PS/2s, or compatibles to other computers and data services --- e.g., Dow Jones News/Retrieval, MCI Mail, databases like BBS, DIALOG or TYMNET, and any mainframe --- throughout the world. Based on the author's close involvement with development and distribution of the Kermit transfer protocol, the guide supplies easy-to-follow, step-by-step instructions, meticulously compiled tables, and at-a-glance information on important areas. The latest version of MS-DOS Kermit is included with the book and provides: * Communication support for serial ports, modems, and PC networks --- Novell, AT&T, IBM, TCP/IP, DECnet, and many more * DEC VT320, VT220, VT100, and other terminal emulations, with screen rollback and capture, colors, printer control, and flexible key mappings, plus Tektronix graphics * Reliable transfer of text and binary files * International character sets, including Cyrillic text file transfer * A powerful script language for automated operations * An easy-to-use dialing directory

rawabstract:
Using MS-DOS Kermit is a book/disk package designed to help both technical and non-technical PC users alike to link their IBM PCs, PS/2s, or compatibles to other computers and data services --- e.g., Dow Jones News/Retrieval, MCI Mail, databases like BBS, DIALOG or TYMNET, and any mainframe --- throughout the world. Based on the author's close involvement with development and distribution of the Kermit transfer protocol, the guide supplies easy-to-follow, step-by-step instructions, meticulously compiled tables, and at-a-glance information on important areas. The latest version of MS-DOS Kermit is included with the book and provides: * Communication support for serial ports, modems, and PC networks --- Novell, AT&T, IBM, TCP/IP, DECnet, and many more * DEC VT320, VT220, VT100, and other terminal emulations, with screen rollback and capture, colors, printer control, and flexible key mappings, plus Tektronix graphics * Reliable transfer of text and binary files * International character sets, including Cyrillic text file transfer * A powerful script language for automated operations * An easy-to-use dialing directory

entry:
@Book{Gianone:1992:UMK,
  author =       "Christine M. Gianone",
  title =        "Using {MS-DOS KERMIT}: Connecting Your {PC} to the
                 Electronic World",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  edition =      "Second",
  pages =        "xxviii + 354",
  year =         "1992",
  ISBN =         "1-55558-082-3 (book + diskette), 1-55558-048-3",
  ISBN-13 =      "978-1-55558-082-7 (book + diskette),
                 978-1-55558-048-3",
  LCCN =         "TK5105.9 .G5 1992",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$34.95",
  abstract =     "Using MS-DOS Kermit is a book/disk package designed to
                 help both technical and non-technical PC users alike to
                 link their IBM PCs, PS/2s, or compatibles to other
                 computers and data services --- e.g., Dow Jones
                 News/Retrieval, MCI Mail, databases like BBS, DIALOG or
                 TYMNET, and any mainframe --- throughout the world.
                 Based on the author's close involvement with
                 development and distribution of the Kermit transfer
                 protocol, the guide supplies easy-to-follow,
                 step-by-step instructions, meticulously compiled
                 tables, and at-a-glance information on important areas.
                 The latest version of MS-DOS Kermit is included with
                 the book and provides: * Communication support for
                 serial ports, modems, and PC networks --- Novell, AT&T,
                 IBM, TCP/IP, DECnet, and many more * DEC VT320, VT220,
                 VT100, and other terminal emulations, with screen
                 rollback and capture, colors, printer control, and
                 flexible key mappings, plus Tektronix graphics *
                 Reliable transfer of text and binary files *
                 International character sets, including Cyrillic text
                 file transfer * A powerful script language for
                 automated operations * An easy-to-use dialing
                 directory",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}


bibtype: book
filename: master.bib
label: Gibaldi:1996:MHW
author: Joseph Gibaldi
title: MLA Handbook for Writers of Research Papers
publisher: pub-MLAA
address: pub-MLAA:adr
edition: Fourth
pages: xviii + 293
year: 1996
ISBN: 0-87352-565-5 OR 0873525655
ISBN13: 978-0-87352-565-7 OR 9780873525657
LCCN: LB2369.G53 1995
bibdate: Sat Sep 28 17:22:14 1996
bibtimestamp: 1996.09.28 17:22:14 ???
acknowledgement: ack-nhfb
rawauthor: Joseph Gibaldi
rawtitle: {MLA} Handbook for Writers of Research Papers
abstract:
A style manual for preparing research papers. Includes information on citing electronic publications.

TOC:
Foreword / Phyllis Franklin Chapter 1: Research and Writing 1.1: Research Paper as a Form of Exploration 1.2: Research Paper as a Form of Writing 1.3: Selecting a Topic 1.4: Conducting Research 1.4.1: Modern Academic Library 1.4.2: Central Information System 1.4.3: Reference Works 1.4.4: Online Catalog of Library Holdings 1.4.5: Other Library Resources and Services 1.4.6: Internet Sources 1.5: Compiling a Working Bibliography 1.6: Evaluating Sources 1.6.1: Authorship and Authority 1.6.2: Accuracy and Verifiability 1.6.3: Currency 1.7: Taking Notes 1.8: Plagiarism 1.9: Outlining 1.9.1: Working Outline 1.9.2: Thesis Statement 1.9.3: Final Outline 1.10: Writing Drafts 1.11: Language and Style 1.12: Guides to Writing Chapter 2: Mechanics of Writing ldots [contents lost]

rawabstract:
A style manual for preparing research papers. Includes information on citing electronic publications.

shortTOC:
Research and writing The mechanics of writing The format of the research paper Documentation: preparing the list of works cited Documentation: citing sources in the text Abbreviations

rawshortTOC:
Research and writing \\ The mechanics of writing \\ The format of the research paper \\ Documentation: preparing the list of works cited \\ Documentation: citing sources in the text \\ Abbreviations

rawTOC:
Foreword / Phyllis Franklin \\ Chapter 1: Research and Writing \\ 1.1: Research Paper as a Form of Exploration \\ 1.2: Research Paper as a Form of Writing \\ 1.3: Selecting a Topic \\ 1.4: Conducting Research \\ 1.4.1: Modern Academic Library \\ 1.4.2: Central Information System \\ 1.4.3: Reference Works \\ 1.4.4: Online Catalog of Library Holdings \\ 1.4.5: Other Library Resources and Services \\ 1.4.6: Internet Sources \\ 1.5: Compiling a Working Bibliography \\ 1.6: Evaluating Sources \\ 1.6.1: Authorship and Authority \\ 1.6.2: Accuracy and Verifiability \\ 1.6.3: Currency \\ 1.7: Taking Notes \\ 1.8: Plagiarism \\ 1.9: Outlining \\ 1.9.1: Working Outline \\ 1.9.2: Thesis Statement \\ 1.9.3: Final Outline \\ 1.10: Writing Drafts \\ 1.11: Language and Style \\ 1.12: Guides to Writing \\ Chapter 2: Mechanics of Writing \\ \ldots{} [contents lost]

entry:
@Book{Gibaldi:1996:MHW,
  author =       "Joseph Gibaldi",
  title =        "{MLA} Handbook for Writers of Research Papers",
  publisher =    pub-MLAA,
  address =      pub-MLAA:adr,
  edition =      "Fourth",
  pages =        "xviii + 293",
  year =         "1996",
  ISBN =         "0-87352-565-5",
  ISBN-13 =      "978-0-87352-565-7",
  LCCN =         "LB2369.G53 1995",
  bibdate =      "Sat Sep 28 17:22:14 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  price =        "US\$16.75",
  abstract =     "A style manual for preparing research papers. Includes
                 information on citing electronic publications.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Research and writing \\
                 The mechanics of writing \\
                 The format of the research paper \\
                 Documentation: preparing the list of works cited \\
                 Documentation: citing sources in the text \\
                 Abbreviations",
  tableofcontents = "Foreword / Phyllis Franklin \\
                 Chapter 1: Research and Writing \\
                 1.1: Research Paper as a Form of Exploration \\
                 1.2: Research Paper as a Form of Writing \\
                 1.3: Selecting a Topic \\
                 1.4: Conducting Research \\
                 1.4.1: Modern Academic Library \\
                 1.4.2: Central Information System \\
                 1.4.3: Reference Works \\
                 1.4.4: Online Catalog of Library Holdings \\
                 1.4.5: Other Library Resources and Services \\
                 1.4.6: Internet Sources \\
                 1.5: Compiling a Working Bibliography \\
                 1.6: Evaluating Sources \\
                 1.6.1: Authorship and Authority \\
                 1.6.2: Accuracy and Verifiability \\
                 1.6.3: Currency \\
                 1.7: Taking Notes \\
                 1.8: Plagiarism \\
                 1.9: Outlining \\
                 1.9.1: Working Outline \\
                 1.9.2: Thesis Statement \\
                 1.9.3: Final Outline \\
                 1.10: Writing Drafts \\
                 1.11: Language and Style \\
                 1.12: Guides to Writing \\
                 Chapter 2: Mechanics of Writing \\
                 \ldots{} [contents lost]",
}


bibtype: book
filename: master.bib
label: Gibaldi:1999:MHW
author: Joseph Gibaldi
title: MLA Handbook for Writers of Research Papers
publisher: pub-MLAA
address: pub-MLAA:adr
edition: Fifth
pages: xviii + 332
year: 1999
ISBN: 0-87352-975-8 OR 0873529758
ISBN13: 978-0-87352-975-4 OR 9780873529754
LCCN: K94 .G53 1999; LB2369 .G53 1999
bibdate: Thu May 16 14:15:04 2002
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2002.05.16 14:15:04 ???
acknowledgement: ack-nhfb
rawauthor: Joseph Gibaldi
rawtitle: {MLA} Handbook for Writers of Research Papers
abstract:
The handbook takes readers through the research paper process step by step, and includes information on narrowing the topic, outlining, note taking, etc. Before dealing with such mechanics of writing as spelling, punctuation, and format, the manual covers the use of catalogs (online and paper), indexes, and databases in the library and offers a list of some standard print and electronic reference works. The sections on documentation in text and citations seem to include every type of source and possible variable. The work concludes with abbreviations for terms used in research, reference sources by subject, and some examples of other styles of documentation. Examples within each section are printed in a font different from the explanatory text, a feature that allows the user to easily find the appropriate format. Chapters are divided by subtopics with numeric denotation; an index makes topics easy to find.

TOC:
Foreword / Phyllis Franklin 1: Research and writing 2: Mechanics of writing 3: Format of the research paper 4: Documentation: preparing the list of works cited 5: Documentation: citing sources in the text 6: Abbreviations Appendix A: Selected reference works by field Appendix B: Other systems of documentation Sample pages of a research paper in MLA style Index

rawabstract:
The handbook takes readers through the research paper process step by step, and includes information on narrowing the topic, outlining, note taking, etc. Before dealing with such mechanics of writing as spelling, punctuation, and format, the manual covers the use of catalogs (online and paper), indexes, and databases in the library and offers a list of some standard print and electronic reference works. The sections on documentation in text and citations seem to include every type of source and possible variable. The work concludes with abbreviations for terms used in research, reference sources by subject, and some examples of other styles of documentation. Examples within each section are printed in a font different from the explanatory text, a feature that allows the user to easily find the appropriate format. Chapters are divided by subtopics with numeric denotation; an index makes topics easy to find.

rawTOC:
Foreword / Phyllis Franklin \\ 1: Research and writing \\ 2: Mechanics of writing \\ 3: Format of the research paper \\ 4: Documentation: preparing the list of works cited \\ 5: Documentation: citing sources in the text \\ 6: Abbreviations \\ Appendix A: Selected reference works by field \\ Appendix B: Other systems of documentation \\ Sample pages of a research paper in MLA style \\ Index

entry:
@Book{Gibaldi:1999:MHW,
  author =       "Joseph Gibaldi",
  title =        "{MLA} Handbook for Writers of Research Papers",
  publisher =    pub-MLAA,
  address =      pub-MLAA:adr,
  edition =      "Fifth",
  pages =        "xviii + 332",
  year =         "1999",
  ISBN =         "0-87352-975-8",
  ISBN-13 =      "978-0-87352-975-4",
  LCCN =         "K94 .G53 1999; LB2369 .G53 1999",
  bibdate =      "Thu May 16 14:15:04 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "The handbook takes readers through the research paper
                 process step by step, and includes information on
                 narrowing the topic, outlining, note taking, etc.
                 Before dealing with such mechanics of writing as
                 spelling, punctuation, and format, the manual covers
                 the use of catalogs (online and paper), indexes, and
                 databases in the library and offers a list of some
                 standard print and electronic reference works. The
                 sections on documentation in text and citations seem to
                 include every type of source and possible variable. The
                 work concludes with abbreviations for terms used in
                 research, reference sources by subject, and some
                 examples of other styles of documentation. Examples
                 within each section are printed in a font different
                 from the explanatory text, a feature that allows the
                 user to easily find the appropriate format. Chapters
                 are divided by subtopics with numeric denotation; an
                 index makes topics easy to find.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Foreword / Phyllis Franklin \\
                 1: Research and writing \\
                 2: Mechanics of writing \\
                 3: Format of the research paper \\
                 4: Documentation: preparing the list of works cited \\
                 5: Documentation: citing sources in the text \\
                 6: Abbreviations \\
                 Appendix A: Selected reference works by field \\
                 Appendix B: Other systems of documentation \\
                 Sample pages of a research paper in MLA style \\
                 Index",
}


bibtype: book
filename: master.bib
label: Gibson:1998:DCM
author: Jerry D. Gibson and Toby Berger and Tom Lookabaugh and David Lindbergh and Richard L. Baker
title: Digital Compression for Multimedia: Principles and Standards
publisher: pub-MORGAN-KAUFMANN
address: pub-MORGAN-KAUFMANN:adr
pages: xvii + 476
year: 1998
ISBN: 1-55860-369-7 OR 1558603697
ISBN13: 978-1-55860-369-1 OR 9781558603691
LCCN: QA76.575 .D535 1998
bibdate: Tue Feb 12 17:48:50 2002
bibtimestamp: 2002.02.12 17:48:50 ???
series: Morgan Kaufmann series in multimedia information and systems
acknowledgement: ack-nhfb
rawauthor: Jerry D. Gibson and Toby Berger and Tom Lookabaugh and David Lindbergh and Richard L. Baker
rawtitle: Digital Compression for Multimedia: Principles and Standards
bibsource:
https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

TOC:
1: Introduction to Data Compression 2: Lossless Source Coding 3: Universal Lossless Source Coding 4: Quantization 5: Predictive Coding 6: Linear Predictive Speech Coding Standards 7: Frequency Domain Coding 8: Frequency Domain Speech and Audio Coding Standards 9: JPEG Still-Image Compression Standard 10: Multimedia Conferencing Standards 11: MPEG Compression Appendix A: Speech Quality and Intelligibility Appendix B: Proof that Huffman Codes Minimize l Appendix C: Proof That Every UD Code Satisfies the Kraft Inequality Appendix D: Behavior of Approximations to Entropy Rate Appendix E: Proof of Forward March Property for LZY Appendix F: Efficient Coding of $L_k$ for LZ77

rawTOC:
1: Introduction to Data Compression \\ 2: Lossless Source Coding \\ 3: Universal Lossless Source Coding \\ 4: Quantization \\ 5: Predictive Coding \\ 6: Linear Predictive Speech Coding Standards \\ 7: Frequency Domain Coding \\ 8: Frequency Domain Speech and Audio Coding Standards \\ 9: JPEG Still-Image Compression Standard \\ 10: Multimedia Conferencing Standards \\ 11: MPEG Compression \\ Appendix A: Speech Quality and Intelligibility \\ Appendix B: Proof that Huffman Codes Minimize l \\ Appendix C: Proof That Every UD Code Satisfies the Kraft Inequality \\ Appendix D: Behavior of Approximations to Entropy Rate \\ Appendix E: Proof of Forward March Property for LZY \\ Appendix F: Efficient Coding of $L_k$ for LZ77

entry:
@Book{Gibson:1998:DCM,
  author =       "Jerry D. Gibson and Toby Berger and Tom Lookabaugh and
                 David Lindbergh and Richard L. Baker",
  title =        "Digital Compression for Multimedia: Principles and
                 Standards",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  pages =        "xvii + 476",
  year =         "1998",
  ISBN =         "1-55860-369-7",
  ISBN-13 =      "978-1-55860-369-1",
  LCCN =         "QA76.575 .D535 1998",
  bibdate =      "Tue Feb 12 17:48:50 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$74.95, CAN\$104.95, UK\pounds 49.95",
  series =       "Morgan Kaufmann series in multimedia information and
                 systems",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction to Data Compression \\
                 2: Lossless Source Coding \\
                 3: Universal Lossless Source Coding \\
                 4: Quantization \\
                 5: Predictive Coding \\
                 6: Linear Predictive Speech Coding Standards \\
                 7: Frequency Domain Coding \\
                 8: Frequency Domain Speech and Audio Coding Standards
                 \\
                 9: JPEG Still-Image Compression Standard \\
                 10: Multimedia Conferencing Standards \\
                 11: MPEG Compression \\
                 Appendix A: Speech Quality and Intelligibility \\
                 Appendix B: Proof that Huffman Codes Minimize l \\
                 Appendix C: Proof That Every UD Code Satisfies the
                 Kraft Inequality \\
                 Appendix D: Behavior of Approximations to Entropy Rate
                 \\
                 Appendix E: Proof of Forward March Property for LZY \\
                 Appendix F: Efficient Coding of $L_k$ for LZ77",
}


bibtype: book
filename: master.bib
label: Gibson:2019:SIH
author: Susannah Gibson
title: The Spirit of Inquiry: How One Extraordinary Society Shaped Modern Science
publisher: pub-OXFORD
address: pub-OXFORD:adr
pages: xxi + 377
year: 2019
ISBN: 0-19-883337-7 (hardcover) OR 0198833377 (hardcover)
ISBN13: 978-0-19-883337-6 (hardcover) OR 9780198833376 (hardcover)
LCCN: Q41.C194 G537 2019
bibdate: Sat Jun 1 13:51:09 MDT 2019
bibtimestamp: 2019.06.01 13:51:09 MDT
subject: 02.14 organization of science and culture; Science / General
acknowledgement: ack-nhfb
rawauthor: Susannah Gibson
rawtitle: The Spirit of Inquiry: How One Extraordinary Society Shaped Modern Science
bibsource:
fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/bibnet/authors/b/babbage-charles.bib; https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib; https://www.math.utah.edu/pub/bibnet/authors/c/clerk-maxwell-james.bib; https://www.math.utah.edu/pub/bibnet/authors/d/dirac-p-a-m.bib; https://www.math.utah.edu/pub/bibnet/authors/p/pauli-wolfgang.bib; https://www.math.utah.edu/pub/bibnet/authors/p/planck-max.bib; https://www.math.utah.edu/pub/bibnet/authors/r/rutherford-ernest.bib; https://www.math.utah.edu/pub/bibnet/authors/s/szilard-leo.bib; https://www.math.utah.edu/pub/bibnet/authors/w/wigner-eugene.bib; https://www.math.utah.edu/pub/tex/bib/einstein.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
Cambridge is now world-famous as a centre of science, but it wasn't always so. Before the nineteenth century, the sciences were of little importance in the University of Cambridge. But that began to change in 1819 when two young Cambridge fellows took a geological fieldtrip to the Isle of Wight. Adam Sedgwick and John Stevens Henslow spent their days there exploring, unearthing dazzling fossils, dreaming up elaborate theories about the formation of the earth, and bemoaning the lack of serious science in their ancient university. As they threw themselves into the exciting new science of geology --- conjuring millions of years of history from the evidence they found in the island's rocks --- they also began to dream of a new scientific society for Cambridge. This society would bring together like-minded young men who wished to learn of the latest science from overseas, and would encourage original research in Cambridge. It would be, they wrote, a society ``to keep alive the spirit of inquiry''. Their vision was realised when they founded the Cambridge Philosophical Society later that same year. Its founders could not have imagined the impact the Cambridge Philosophical Society would have: it was responsible for the first publication of Charles Darwin's scientific writings, and hosted some of the most heated debates about evolutionary theory in the nineteenth century; it saw the first announcement of X-ray diffraction by a young Lawrence Bragg --- a technique that would revolutionise the physical, chemical and life sciences; it published the first paper by C. T. R. Wilson on his cloud chamber --- a device that opened up a previously-unimaginable world of sub-atomic particles. 200 years on from the Society's foundation, this book reflects on the achievements of Sedgwick, Henslow, their peers, and their successors. Susannah Gibson explains how Cambridge moved from what Sedgwick saw as a ``death-like stagnation'' (really little more than a provincial training school for Church of England clergy) to being a world-leader in the sciences. And she shows how science, once a peripheral activity undertaken for interest by a small number of wealthy gentlemen, has transformed into an enormously well-funded activity that can affect every aspect of our lives.

TOC:
Acknowledgements / xi Foreword by Simon Conway Morris (FRS) / xiii Preface / xvii 1: The Fenland Philosophers / 1 2: The house on All Saints' Passage / 33 3: Letters from the south / 78 4: `A new prosperity' / 113 5: The misdeeds of Mr Crouch / 141 6: A workbench of one's own / 176 7: The laboratory in the library / 210 8: `May it never be of any use to anybody' / 238 9: Following the footsteps / 271 Endnotes / 283 Figure and Plate Credits / 339 Bibliography / 341 Index / 367

rawabstract:
Cambridge is now world-famous as a centre of science, but it wasn't always so. Before the nineteenth century, the sciences were of little importance in the University of Cambridge. But that began to change in 1819 when two young Cambridge fellows took a geological fieldtrip to the Isle of Wight. Adam Sedgwick and John Stevens Henslow spent their days there exploring, unearthing dazzling fossils, dreaming up elaborate theories about the formation of the earth, and bemoaning the lack of serious science in their ancient university. As they threw themselves into the exciting new science of geology --- conjuring millions of years of history from the evidence they found in the island's rocks --- they also began to dream of a new scientific society for Cambridge. This society would bring together like-minded young men who wished to learn of the latest science from overseas, and would encourage original research in Cambridge. It would be, they wrote, a society ``to keep alive the spirit of inquiry''. Their vision was realised when they founded the Cambridge Philosophical Society later that same year. Its founders could not have imagined the impact the Cambridge Philosophical Society would have: it was responsible for the first publication of Charles Darwin's scientific writings, and hosted some of the most heated debates about evolutionary theory in the nineteenth century; it saw the first announcement of X-ray diffraction by a young Lawrence Bragg --- a technique that would revolutionise the physical, chemical and life sciences; it published the first paper by C. T. R. Wilson on his cloud chamber --- a device that opened up a previously-unimaginable world of sub-atomic particles. 200 years on from the Society's foundation, this book reflects on the achievements of Sedgwick, Henslow, their peers, and their successors. Susannah Gibson explains how Cambridge moved from what Sedgwick saw as a ``death-like stagnation'' (really little more than a provincial training school for Church of England clergy) to being a world-leader in the sciences. And she shows how science, once a peripheral activity undertaken for interest by a small number of wealthy gentlemen, has transformed into an enormously well-funded activity that can affect every aspect of our lives.

rawTOC:
Acknowledgements / xi \\ Foreword by Simon Conway Morris (FRS) / xiii \\ Preface / xvii \\ 1: The Fenland Philosophers / 1 \\ 2: The house on All Saints' Passage / 33 \\ 3: Letters from the south / 78 \\ 4: `A new prosperity' / 113 \\ 5: The misdeeds of Mr Crouch / 141 \\ 6: A workbench of one's own / 176 \\ 7: The laboratory in the library / 210 \\ 8: `May it never be of any use to anybody' / 238 \\ 9: Following the footsteps / 271 \\ Endnotes / 283 \\ Figure and Plate Credits / 339 \\ Bibliography / 341 \\ Index / 367

entry:
@Book{Gibson:2019:SIH,
  author =       "Susannah Gibson",
  title =        "The Spirit of Inquiry: How One Extraordinary Society
                 Shaped Modern Science",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xxi + 377",
  year =         "2019",
  ISBN =         "0-19-883337-7 (hardcover)",
  ISBN-13 =      "978-0-19-883337-6 (hardcover)",
  LCCN =         "Q41.C194 G537 2019",
  bibdate =      "Sat Jun 1 13:51:09 MDT 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/b/babbage-charles.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/c/clerk-maxwell-james.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/d/dirac-p-a-m.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/p/pauli-wolfgang.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/p/planck-max.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/r/rutherford-ernest.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/szilard-leo.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/w/wigner-eugene.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Cambridge is now world-famous as a centre of science,
                 but it wasn't always so. Before the nineteenth century,
                 the sciences were of little importance in the
                 University of Cambridge. But that began to change in
                 1819 when two young Cambridge fellows took a geological
                 fieldtrip to the Isle of Wight. Adam Sedgwick and John
                 Stevens Henslow spent their days there exploring,
                 unearthing dazzling fossils, dreaming up elaborate
                 theories about the formation of the earth, and
                 bemoaning the lack of serious science in their ancient
                 university. As they threw themselves into the exciting
                 new science of geology --- conjuring millions of years
                 of history from the evidence they found in the island's
                 rocks --- they also began to dream of a new scientific
                 society for Cambridge. This society would bring
                 together like-minded young men who wished to learn of
                 the latest science from overseas, and would encourage
                 original research in Cambridge. It would be, they
                 wrote, a society ``to keep alive the spirit of
                 inquiry''. Their vision was realised when they founded
                 the Cambridge Philosophical Society later that same
                 year. Its founders could not have imagined the impact
                 the Cambridge Philosophical Society would have: it was
                 responsible for the first publication of Charles
                 Darwin's scientific writings, and hosted some of the
                 most heated debates about evolutionary theory in the
                 nineteenth century; it saw the first announcement of
                 X-ray diffraction by a young Lawrence Bragg --- a
                 technique that would revolutionise the physical,
                 chemical and life sciences; it published the first
                 paper by C. T. R. Wilson on his cloud chamber --- a
                 device that opened up a previously-unimaginable world
                 of sub-atomic particles. 200 years on from the
                 Society's foundation, this book reflects on the
                 achievements of Sedgwick, Henslow, their peers, and
                 their successors. Susannah Gibson explains how
                 Cambridge moved from what Sedgwick saw as a
                 ``death-like stagnation'' (really little more than a
                 provincial training school for Church of England
                 clergy) to being a world-leader in the sciences. And
                 she shows how science, once a peripheral activity
                 undertaken for interest by a small number of wealthy
                 gentlemen, has transformed into an enormously
                 well-funded activity that can affect every aspect of
                 our lives.",
  acknowledgement = ack-nhfb,
  subject =      "02.14 organization of science and culture; Science /
                 General",
  tableofcontents = "Acknowledgements / xi \\
                 Foreword by Simon Conway Morris (FRS) / xiii \\
                 Preface / xvii \\
                 1: The Fenland Philosophers / 1 \\
                 2: The house on All Saints' Passage / 33 \\
                 3: Letters from the south / 78 \\
                 4: `A new prosperity' / 113 \\
                 5: The misdeeds of Mr Crouch / 141 \\
                 6: A workbench of one's own / 176 \\
                 7: The laboratory in the library / 210 \\
                 8: `May it never be of any use to anybody' / 238 \\
                 9: Following the footsteps / 271 \\
                 Endnotes / 283 \\
                 Figure and Plate Credits / 339 \\
                 Bibliography / 341 \\
                 Index / 367",
}


bibtype: book
filename: master.bib
label: Gilchrist:1972:ORO
author: T. L. (Thomas Lonsdale) Gilchrist and R. C. Storr
title: Organic reactions and orbital symmetry
publisher: pub-CAMBRIDGE
address: pub-CAMBRIDGE:adr
pages: viii + 271
year: 1972
ISBN: 0-521-08249-8 (cloth), 0-521-09658-8 (paper) OR 0521082498 (cloth), 0521096588 (paper)
LCCN: QD476.G54
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: T. L. (Thomas Lonsdale) Gilchrist and R. C. Storr
rawtitle: Organic reactions and orbital symmetry
ISBN13:
978-0-521-08249-5 (cloth), 978-0-521-09658-4 (paper) OR 9780521082495 (cloth), 9780521096584 (paper)

entry:
@Book{Gilchrist:1972:ORO,
  author =       "T. L. (Thomas Lonsdale) Gilchrist and R. C. Storr",
  title =        "Organic reactions and orbital symmetry",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "viii + 271",
  year =         "1972",
  ISBN =         "0-521-08249-8 (cloth), 0-521-09658-8 (paper)",
  ISBN-13 =      "978-0-521-08249-5 (cloth), 978-0-521-09658-4 (paper)",
  LCCN =         "QD476.G54",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Gill:1981:PO
author: Philip E. Gill and Walter Murray and Margaret H. Wright
title: Practical Optimization
publisher: pub-ACADEMIC
address: pub-ACADEMIC:adr
pages: xvi + 401
year: 1981
LCCN: QA402.5 .G5 1981
bibdate: Tue Dec 14 22:53:24 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:53:24 ???
acknowledgement: ack-nhfb
rawauthor: Philip E. Gill and Walter Murray and Margaret H. Wright
rawtitle: Practical Optimization
ISBN:
0-12-283950-1 (hardcover), 0-12-283952-8 (paperback) OR 0122839501 (hardcover), 0122839528 (paperback)

ISBN13:
978-0-12-283950-4 (hardcover), 978-0-12-283952-8 (paperback) OR 9780122839504 (hardcover), 9780122839528 (paperback)

abstract:
Numerical optimization and parameter estimation are essential tools in a wide variety of applications, such as engineering, science, medicine, sociology and economics. For these optimization techniques to be exploited effectively, problem solvers need to be fully informed of the scope and organization of software for both the specialist and non-specialist; the underlying numerical methods; the aspects of problem formulation that affect performance; the assessment of computer results and the resolution of difficulties that may occur during the solution process. These topics form the basis of the organization of Practical Optimization. Much of the material about the estimation of results and the preparation of the problem has not been previously published. The book contains a description of methods for numerical optimization to a level which should make it a useful course text. It is intended that the book should be self-contained. Consequently, those elements of calculus, linear algebra and numerical analysis pertinent to optimization are reviewed in the opening chapters. This is the first book on optimization which discusses not only the methods but also the analysis of computed results and the preparation of problems before solution.

TOC:
1: Introduction / 1 1.1. Definition of Optimization Problems / 1 1.2. Classification of Optimization Problems / 3 1.3. Overview of Topics / 5 2: Fundamentals / 7 2.1. Introduction to Errors in Numerical Computation / 7 2.1.1. Measurement of Error / 7 2.1.2. Number Representation on a Computer / 8 2.1.3. Rounding Errors / 9 2.1.4. Errors Incurred during Arithmetic Operations / 11 2.1.5. Cancellation Error / 11 2.1.6. Accuracy in a Sequence of Calculations / 13 2.1.7. Error Analysis of Algorithms / 13 Notes and Selected Bibliography for Section 2.1 / 14 2.2. Introduction to Numerical Linear Algebra / 14 2.2.1. Preliminaries / 14 2.2.1.1. Scalars / 14 2.2.1.2. Vectors / 14 2.2.1.3. Matrices / 15 2.2.1.4. Operations with vectors and matrices / 16 2.2.1.5. Matrices with special structure / 18 2.2.2. Vector Spaces / 19 2.2.2.1. Linear combinations / 19 2.2.2.2. Linear dependence and independence / 20 2.2.2.3. Vector spaces; subspaces; basis / 21 2.2.2.4. The null space / 22 2.2.3. Linear Transformations / 23 2.2.3.1. Matrices as transformations / 23 2.2.3.2. Properties of linear transformations / 23 2.2.3.3. Inverses / 24 2.2.3.4. Eigenvalues; eigenvectors / 24 2.2.3.5. Definiteness / 25 2.2.4. Linear Equations / 25 2.2.4.1. Properties of linear equations / 25 2.2.4.2. Vector and matrix norms / 27 2.2.4.3. Perturbation theory; condition number / 28 2.2.4.4. Triangular linear systems / 30 2.2.4.5. Error analysis / 31 2.2.5. Matrix Factorizations / 32 2.2.5.1. The LU factorization; Gaussian elimination / 33 2.2.5.2. The LDLT and Cholesky factorizations / 36 2.2.5.3. The QR factorization / 37 2.2.5.4. The spectral decomposition of a symmetric matrix / 40 2.2.5.5. Singular-value decomposition / 40 2.2.5.6. The pseudo-inverse / 41 2.2.5.7. Updating matrix factorizations / 41 2.2.6. Multi-dimensional Geometry / 43 Notes and Selected Bibliography for Section 2.2 / 45 2.3. Elements of Multivariate Analysis / 45 2.3.1. Functions of Many Variables; Contour Plots / 45 2.3.2. Continuous Functions and their Derivatives / 46 2.3.3. Order Notation / 52 2.3.4. Taylor's Theorem / 52 2.3.5. Finite-Difference Approximations to Derivatives / 54 2.3.6. Rates of Convergence of Iterative Sequences / 56 Notes and Selected Bibliography for Section 2.3 / 58 3: Optimality Conditions / 59 3.1. Characterization of a Minimum / 59 3.2. Unconstrained Optimization / 61 3.2.1. The Univariate Case / 61 3.2.2. The Multivariate Case / 63 3.2.3. Properties of Quadratic Functions / 65 3.3. Linearly Constrained Optimization / 67 3.3.1. Linear Equality Constraints / 68 3.3.2. Linear Inequality Constraints / 71 3.3.2.1. General optimality conditions / 71 3.3.2.2. Linear programming / 75 3.3.2.3. Quadratic programming / 76 3.3.2.4. Optimization subject to bounds / 77 3.4. Nonlinearly Constrained Optimization / 77 3.4.1. Nonlinear Equality Constraints / 78 3.4.2. Nonlinear Inequality Constraints / 81 Notes and Selected Bibliography for Section 3.4 / 82 4: Unconstrained Methods / 83 4.1. Methods for Univariate Functions / 83 4.1.1. Finding a Zero of a Univariate Function / 83 4.1.1.1. The method of bisection / 84 4.1.1.2. Newton's method / 84 4.1.1.3. Secant and regula falsi methods / 85 *4.1.1.4. Rational interpolation and higher-order methods / 87 4.1.1.5. Safeguarded zero-finding algorithms / 87 4.1.2. Univariate Minimization / 88 4.1.2.1. Fibonacci search / 89 4.1.2.2. Golden section search / 90 4.1.2.3. Polynomial interpolation / 91 4.1.2.4. Safeguarded polynomial interpolation / 92 Notes and Selected Bibliography for Section 4.1 / 92 4.2. Methods for Multivariate Non-Smooth Functions / 93 4.2.1. Use of Function Comparison Methods / 93 4.2.2. The Polytope Algorithm / 94 *4.2.3. Composite Non-Differentiable Functions / 96 Notes and Selected Bibliography for Section 4.2 / 98 4.3. Methods for Multivariate Smooth Functions / 99 4.3.1. A Model Algorithm for Smooth Functions / 99 4.3.2. Convergence of the Model Algorithm / 99 4.3.2.1. Computing the step length / 100 4.3.2.2. Computing the direction of search / 102 Notes and Selected Bibliography for Section 4.3 / 104 4.4. Second Derivative Methods / 105 4.4.1. Newton's Method / 105 4.4.2. Strategies for an Indefinite Hessian / 107 4.4.2.1. A method based on the spectral decomposition / 107 *4.4.2.2. Methods based on the Cholesky factorization / 108 Notes and Selected Bibliography for Section 4.4 / 111 4.5. First Derivative Methods / 115 4.5.1. Discrete Newton Methods / 115 4.5.2. Quasi-Newton Methods / 116 4.5.2.1. Theory / 116 4.5.2.2. Implementation / 122 *4.5.2.3. Convergence; least-change characterization / 123 Notes and Selected Bibliography for Section 4.5 / 125 4.6. Non-Derivative Methods for Smooth Functions / 127 4.6.1. Finite-Difference Approximations to First Derivatives / 127 4.6.1.1. Errors in a forward-difference approximation / 127 4.6.1.2. Choice of the finite-difference interval / 128 4.6.1.3. Estimation of a set of finite-difference intervals / 129 4.6.1.4. The choice of finite-difference formulae / 130 4.6.2. Non-Derivative Quasi-Newton Methods / 131 Notes and Selected Bibliography for Section 4.6 / 131 4.7. Methods for Sums of Squares / 133 4.7.1. Origin of Least-Squares Problems; the Reason for Special Methods / 133 4.7.2. The Gauss--Newton Method / 134 4.7.3. The Levenberg--Marquardt Method / 136 *4.7.4. Quasi-Newton Approximations / 137 *4.7.5. The Corrected Gauss--Newton Method / 138 *4.7.6. Nonlinear Equations / 139 Notes and Selected Bibliography for Section 4.7 / 140 4.8. Methods for Large-Scale Problems / 141 4.8.1. Sparse Discrete Newton Methods / 141 *4.8.2. Sparse Quasi-Newton Methods / 143 4.8.3. Conjugate-Gradient Methods / 144 4.8.3.1. Quadratic functions / 144 4.8.3.2. The linear conjugate-gradient method / 146 4.8.3.3. General nonlinear functions / 147 *4.8.3.4. Conjugate-gradient methods with restarts / 149 *4.8.3.5. Convergence / 149 *4.8.4. Limited-Memory Quasi-Newton Methods / 150 *4.8.5. Preconditioned Conjugate-Gradient Methods / 151 *4.8.5.1. Quadratic functions / 151 *4.8.5.2. Nonlinear functions / 152 *4.8.6. Solving the Newton Equation by Linear Conjugate-Gradients / 153 Notes and Selected Bibliography for Section 4.8 / 153 5: Linear Constraints / 155 5.1. Methods for Linear Equality Constraints / 155 5.1.1. The Formulation of Algorithms / 156 5.1.1.1. The effect of linear equality constraints / 156 5.1.1.2. A model algorithm / 157 5.1.2. Computation of the Search Direction / 158 5.1.2.1. Methods of steepest descent / 158 5.1.2.2. Second derivative methods / 159 5.1.2.3. Discrete Newton methods / 160 5.1.2.4. Quasi-Newton methods / 160 5.1.2.5. Conjugate-gradient-related methods / 161 5.1.3. Representation of the Null Space of the Constraints / 162 5.1.3.1. The LQ factorization / 162 5.1.3.2. The variable-reduction technique / 163 5.1.4. Special Forms of the Objective Function / 163 5.1.4.1. Linear objective function / 163 5.1.4.2. Quadratic objective function / 164 5.1.5. Lagrange Multiplier Estimates / 164 5.1.5.1. First-order multiplier estimates / 165 5.1.5.2. Second-order multiplier estimates / 166 Notes and Selected Bibliography for Section 5.1 / 166 5.2. Active Set Methods for Linear Inequality Constraints / 167 5.2.1. A Model Algorithm / 168 5.2.2. Computation of the Search Direction and Step Length / 169 5.2.3. Interpretation of Lagrange Multiplier Estimates / 170 *5.2.4. Changes in the Working Set / 172 *5.2.4.1. Modification of Z / 172 *5.2.4.2. Modification of other matrices / 173 Notes and Selected Bibliography for Section 5.2 / 174 5.3. Special Problem Categories / 176 5.3.1. Linear Programming / 176 5.3.2. Quadratic Programming / 177 5.3.2.1. Positive-definite quadratic programming / 177 5.3.2.2. Indefinite quadratic programming / 178 *5.3.3. Linear Least-Squares with Linear Constraints / 180 Notes and Selected Bibliography for Section 5.3 / 181 *5.4. Problems with Few General Linear Constraints / 182 *5.4.1. Positive-Definite Quadratic Programming / 183 *5.4.2. Second Derivative Methods / 184 *5.4.2.1. A method based on positive-definite quadratic programming / 184 *5.4.2.2. A method based on an approximation of the projected Hessian / 185 Notes and Selected Bibliography for Section 5.4 / 185 5.5. Special Forms of the Constraints / 186 5.5.1. Minimization Subject to Simple Bounds / 186 *5.5.2. Problems with Mixed General Linear Constraints and Bounds / 188 Notes and Selected Bibliography for Section 5.5 / 190 5.6. Large-Scale Linearly Constrained Optimization / 190 5.6.1. Large-scale Linear Programming / 190 5.6.2. General large-scale linearly constrained optimization / 193 *5.6.2.1. Computation of the change in the superbasic variables / 194 *5.6.2.2. Changes in the active set / 195 Notes and Selected Bibliography for Section 5.6 / 196 *5.7. Finding an Initial Feasible Point / 198 Notes and Selected Bibliography for Section 5.7 / 199 *5.8. Implementation of Active Set Methods / 199 *5.8.1. Finding the Initial Working Set / 199 *5.8.2. Linearly Dependent Constraints / 201 *5.8.3. Zero Lagrange Multipliers / 201 Notes and Selected Bibliography for Section 5.8 / 203 6: Nonlinear Constraints / 205 6.1. The Formulation of Algorithms / 206 6.1.1. The Definition of a Merit Function / 206 6.1.2. The Nature of Subproblems / 206 6.1.2.1. Adaptive and deterministic subproblems / 206 6.1.2.2. Valid and defective subproblems / 207 6.2. Penalty and Barrier Function Methods / 207 6.2.1. Differentiable Penalty and Barrier Function Methods / 207 6.2.1.1. The quadratic penalty function / 208 6.2.1.2. The logarithmic barrier function / 212 6.2.2. Non-Differentiable Penalty Function Methods / 214 6.2.2.1. The absolute value penalty function / 215 6.2.2.2. A method for general non-differentiable problems / 217 Notes and Selected Bibliography for Section 6.2 / 218 6.3. Reduced-Gradient and Gradient-Projection Methods / 219 6.3.1. Motivation for Reduced-Gradient-Type Methods / 219 6.3.2. Definition of a Reduced-Gradient-Type Method / 220 6.3.2.1. Definition of the null-space component / 220 6.3.2.2. Restoration of feasibility / 222 6.3.2.3. Reduction of the objective function / 222 6.3.2.4. Properties of reduced-gradient-type methods / 223 6.3.3. Determination of the Working Set / 223 Notes and Selected Bibliography for Section 6.3 / 224 6.4. Augmented Lagrangian Methods / 225 6.4.1. Formulation of an Augmented Lagrangian Function / 225 6.4.2. An Augmented Lagrangian Algorithm / 226 6.4.2.1. A model algorithm / 227 6.4.2.2. Properties of the augmented Lagrangian function / 228 *6.4.3. Variations in Strategy / 230 Notes and Selected Bibliography for Section 6.4 / 231 6.5. Projected Lagrangian Methods / 233 6.5.1. Motivation for a Projected Lagrangian Method / 233 6.5.1.1. Formulation of a linearly constrained subproblem / 233 6.5.1.2. Definition of the subproblem / 233 6.5.2. A General Linearly Constrained Subproblem / 234 6.5.2.1. Formulation of the objective function / 234 6.5.2.2. A simplified model algorithm / 235 *6.5.2.3. Improvements to the model algorithm / 236 6.5.3. A Quadratic Programming Subproblem / 237 6.5.3.1. Motivation / 237 6.5.3.2. A simplified model algorithm / 238 6.5.3.3. Use of a merit function / 240 *6.5.3.4. Other formulations of the subproblem / 241 *6.5.4. Strategies for a Defective Subproblem / 242 *6.5.4.1. Incompatible linear constraints / 242 *6.5.4.2. Poor approximation of the Lagrangian function / 243 *6.5.5. Determination of the Active Set / 243 *6.5.5.1. An equality-constrained subproblem / 244 *6.5.5.2. An inequality-constrained subproblem / 244 Notes and Selected Bibliography for Section 6.5 / 245 6.6. Lagrange Multiplier Estimates / 247 6.6.1. First-Order Multiplier Estimates / 248 6.6.2. Second-Order Multiplier Estimates / 248 *6.6.3. Multiplier Estimates for Inequality Constraints / 250 6.6.4. Consistency Checks / 250 Notes and Selected Bibliography for Section 6.6 / 251 *6.7. Large-Scale Nonlinearly Constrained Optimization / 251 *6.7.1. The Use of a Linearly Constrained Subproblem / 252 *6.7.2. The Use of a QP Subproblem / 253 *6.7.2.1. Representing the basis inverse / 254 *6.7.2.2. The search direction for the superbasic variables / 255 Notes and Selected Bibliography for Section 6.7 / 256 6.8. Special Problem Categories / 256 6.8.1. Special Non-Differentiable Functions / 257 6.8.2. Special Constrained Problems / 257 6.8.2.1. Convex programming / 257 6.8.2.2. Separable programming / 258 6.8.2.3. Geometric programming / 258 Notes and Selected Bibliography for Section 6.8 / 259 7: Modelling / 261 7.1. Introduction / 261 7.2. Classification of Optimization Problems / 262 7.3. Avoiding Unnecessary Discontinuities / 263 7.3.1. The Role of Accuracy in Model Functions / 263 7.3.2. Approximation by Series or Table Look-Up / 265 7.3.3. Subproblems Based on Iteration / 266 Notes and Selected Bibliography for Section 7.3 / 267 7.4. Problem Transformations / 267 7.4.1. Simplifying or Eliminating Constraints / 267 7.4.1.1. Elimination of simple bounds / 268 7.4.1.2. Elimination of inequality constraints / 269 7.4.1.3. General difficulties with transformations / 270 7.4.1.4. Trigonometric transformations / 271 7.4.2. Problems Where the Variables are Continuous Functions / 272 Notes and Selected Bibliography for Section 7.4 / 273 7.5. Scaling / 273 7.5.1. Scaling by Transformation of Variables / 273 7.5.2. Scaling Nonlinear Least-Squares Problems / 275 7.6. Formulation of Constraints / 276 7.6.1. Indeterminacy in Constraint Formulation / 276 7.6.2. The Use of Tolerance Constraints / 277 Notes and Selected Bibliography for Section 7.6 / 280 7.7. Problems with Discrete or Integer Variables / 281 7.7.1. Pseudo-Discrete Variables / 281 7.7.2. Integer Variables / 282 Notes and Selected Bibliography for Section 7.7 / 283 8: Practicalities / 285 8.1. Use of Software / 285 8.1.1. Selecting a Method / 285 8.1.1.1. Selecting an unconstrained method / 286 8.1.1.2. Selecting a method for linear constraints / 287 8.1.1.3. Selecting a method for nonlinear constraints / 290 8.1.2. The User Interface / 290 8.1.2.1. Default parameters / 291 8.1.2.2. Service routines / 291 8.1.3. Provision of User-Defined Parameters / 292 8.1.3.1. The precision of the problem functions / 292 8.1.3.2. Choice of step-length algorithm / 293 8.1.3.3. Step-length accuracy / 294 8.1.3.4. Maximum step length / 294 8.1.3.5. A bound on the number of function evaluations / 295 8.1.3.6. Local search / 295 8.1.3.7. The penalty parameter in an augmented Lagrangian method / 295 8.1.3.8. The penalty parameter for a non-smooth problem / 296 8.1.4. Solving the Correct Problem / 296 8.1.4.1. Errors in evaluating the function / 296 8.1.4.2. Errors in computing derivatives / 297 8.1.5. Making the Best of the Available Software / 298 8.1.5.1. Nonlinear least-squares problems / 298 8.1.5.2. Missing derivatives / 298 8.1.5.3. Solving constrained problems with an unconstrained routine / 299 8.1.5.4. Treatment of linear and nonlinear constraints / 299 8.1.5.5. Nonlinear equations / 299 Notes and Selected Bibliography for Section 8.1 / 300 8.2. Properties of the Computed Solution / 300 8.2.1. What is a Correct Answer? / 300 8.2.2. The Accuracy of the Solution / 301 8.2.2.1. Unconstrained problems / 301 8.2.2.2. Accuracy in constrained problems / 303 8.2.3. Termination Criteria / 305 8.2.3.1. The need for termination criteria / 305 8.2.3.2. Termination criteria for unconstrained optimization / 306 8.2.3.3. Termination criteria for linearly constrained optimization / 308 8.2.3.4. Termination criteria for nonlinearly constrained optimization / 308 8.2.3.5. Conditions for abnormal termination / 309 8.2.3.6. The selection of termination criteria / 310 Notes and Selected Bibliography for Section 8.2 / 312 8.3. Assessment of Results / 312 8.3.1. Assessing the Validity of the Solution / 312 8.3.1.1. The unconstrained case / 312 8.3.1.2. The constrained case / 315 8.3.2. Some Other Ways to Verify Optimality / 319 8.3.2.1. Varying the parameters of the algorithm / 319 8.3.2.2. Using a different method / 319 8.3.2.3. Changing the problem / 320 8.3.3. Sensitivity Analysis / 320 8.3.3.1. The role of the Hessian / 320 8.3.3.2. Estimating the condition number of the Hessian / 320 8.3.3.3. Sensitivity of the constraints / 323 Notes and Selected Bibliography for Section 8.3 / 323 8.4. What Can Go Wrong (and What To Do About It) / 324 8.4.1. Overflow in the User-Defined Problem Functions / 324 8.4.2. Insufficient Decrease in the Merit Function / 324 8.4.2.1. Errors in programming / 325 8.4.2.2. Poor scaling / 325 8.4.2.3. Overly-stringent termination criteria / 327 8.4.2.4. Inaccuracy in a finite-difference approximation / 327 8.4.3. Consistent Lack of Progress / 328 8.4.3.1. Unconstrained optimization / 328 8.4.3.2. Linearly constrained optimization / 328 8.4.3.3. Nonlinearly constrained optimization / 328 8.4.4. Maximum Number of Function Evaluations or Iterations / 329 8.4.5. Failure to Achieve the Expected Convergence Rate / 329 8.4.6. Failure to Obtain a Descent Direction / 330 8.5. Estimating the Accuracy of the Problem Functions / 331 8.5.1. The Role of Accuracy / 331 8.5.1.1. A definition of accuracy / 331 8.5.1.2. How accuracy estimates affect optimization algorithms / 331 8.5.1.3. The expected accuracy / 332 8.5.2. Estimating the Accuracy / 333 8.5.2.1. Estimating the accuracy when higher precision is available / 333 8.5.2.2. Estimating the accuracy when derivatives are available / 334 8.5.2.3. Estimating the accuracy when only function values are available / 335 8.5.2.4. Numerical examples / 336 8.5.3. Re-Estimation of the Accuracy / 338 Notes and Selected Bibliography for Section 8.5 / 339 8.6. Computing Finite Differences / 339 8.6.1. Errors in Finite-Difference Approximations; The Well-Scaled Case / 339 8.6.1.1. The forward-difference formula / 339 8.6.1.2. The central-difference formula / 340 8.6.1.3. Second-order differences / 341 8.6.2. A Procedure for Automatic Estimation of Finite-Difference Intervals / 341 8.6.2.1. Motivation for the procedure / 342 8.6.2.2. Statement of the algorithm / 343 8.6.2.3. Numerical examples / 344 8.6.2.4. Estimating the finite-difference interval at an arbitrary point / 344 8.6.2.5. Finite-difference approximations in constrained problems / 345 Notes and Selected Bibliography for Section 8.6 / 346 8.7. More About Scaling / 346 8.7.1. Scaling the Variables / 346 8.7.1.1. Scale-invariance of an algorithm / 346 8.7.1.2. The conditioning of the Hessian matrix / 347 8.7.1.3. Obtaining well-scaled derivatives / 348 8.7.2. Scaling the Objective Function / 351 8.7.3. Scaling the Constraints / 352 8.7.3.1. Some effects of constraint scaling / 352 8.7.3.2. Methods for scaling linear constraints / 353 8.7.3.3. Methods for scaling nonlinear constraints / 354 Notes and Selected Bibliography for Section 8.7 / 354 Questions and Answers / 357 Bibliography / 363 Index / 389

rawabstract:
Numerical optimization and parameter estimation are essential tools in a wide variety of applications, such as engineering, science, medicine, sociology and economics. For these optimization techniques to be exploited effectively, problem solvers need to be fully informed of the scope and organization of software for both the specialist and non-specialist; the underlying numerical methods; the aspects of problem formulation that affect performance; the assessment of computer results and the resolution of difficulties that may occur during the solution process. These topics form the basis of the organization of Practical Optimization. Much of the material about the estimation of results and the preparation of the problem has not been previously published. The book contains a description of methods for numerical optimization to a level which should make it a useful course text. It is intended that the book should be self-contained. Consequently, those elements of calculus, linear algebra and numerical analysis pertinent to optimization are reviewed in the opening chapters. This is the first book on optimization which discusses not only the methods but also the analysis of computed results and the preparation of problems before solution.

shortTOC:
1: Introduction / 1 2: Fundamentals / 7 3: Optimality Conditions / 59 4: Unconstrained Methods / 83 5: Linear Constraints / 155 6: Nonlinear Constraints / 205 7: Modelling / 261 8: Practicalities / 285 Questions and Answers / 357 Bibliography / 363 Index / 389

rawshortTOC:
1: Introduction / 1 \\ 2: Fundamentals / 7 \\ 3: Optimality Conditions / 59 \\ 4: Unconstrained Methods / 83 \\ 5: Linear Constraints / 155 \\ 6: Nonlinear Constraints / 205 \\ 7: Modelling / 261 \\ 8: Practicalities / 285 \\ Questions and Answers / 357 \\ Bibliography / 363 \\ Index / 389

rawTOC:
1: Introduction / 1 \\ 1.1. Definition of Optimization Problems / 1 \\ 1.2. Classification of Optimization Problems / 3 \\ 1.3. Overview of Topics / 5 \\ 2: Fundamentals / 7 \\ 2.1. Introduction to Errors in Numerical Computation / 7 \\ 2.1.1. Measurement of Error / 7 \\ 2.1.2. Number Representation on a Computer / 8 \\ 2.1.3. Rounding Errors / 9 \\ 2.1.4. Errors Incurred during Arithmetic Operations / 11 \\ 2.1.5. Cancellation Error / 11 \\ 2.1.6. Accuracy in a Sequence of Calculations / 13 \\ 2.1.7. Error Analysis of Algorithms / 13 \\ Notes and Selected Bibliography for Section 2.1 / 14 \\ 2.2. Introduction to Numerical Linear Algebra / 14 \\ 2.2.1. Preliminaries / 14 \\ 2.2.1.1. Scalars / 14 \\ 2.2.1.2. Vectors / 14 \\ 2.2.1.3. Matrices / 15 \\ 2.2.1.4. Operations with vectors and matrices / 16 \\ 2.2.1.5. Matrices with special structure / 18 \\ 2.2.2. Vector Spaces / 19 \\ 2.2.2.1. Linear combinations / 19 \\ 2.2.2.2. Linear dependence and independence / 20 \\ 2.2.2.3. Vector spaces; subspaces; basis / 21 \\ 2.2.2.4. The null space / 22 \\ 2.2.3. Linear Transformations / 23 \\ 2.2.3.1. Matrices as transformations / 23 \\ 2.2.3.2. Properties of linear transformations / 23 \\ 2.2.3.3. Inverses / 24 \\ 2.2.3.4. Eigenvalues; eigenvectors / 24 \\ 2.2.3.5. Definiteness / 25 \\ 2.2.4. Linear Equations / 25 \\ 2.2.4.1. Properties of linear equations / 25 \\ 2.2.4.2. Vector and matrix norms / 27 \\ 2.2.4.3. Perturbation theory; condition number / 28 \\ 2.2.4.4. Triangular linear systems / 30 \\ 2.2.4.5. Error analysis / 31 \\ 2.2.5. Matrix Factorizations / 32 \\ 2.2.5.1. The LU factorization; Gaussian elimination / 33 \\ 2.2.5.2. The LDLT and Cholesky factorizations / 36 \\ 2.2.5.3. The QR factorization / 37 \\ 2.2.5.4. The spectral decomposition of a symmetric matrix / 40 \\ 2.2.5.5. Singular-value decomposition / 40 \\ 2.2.5.6. The pseudo-inverse / 41 \\ 2.2.5.7. Updating matrix factorizations / 41 \\ 2.2.6. Multi-dimensional Geometry / 43 \\ Notes and Selected Bibliography for Section 2.2 / 45 \\ 2.3. Elements of Multivariate Analysis / 45 \\ 2.3.1. Functions of Many Variables; Contour Plots / 45 \\ 2.3.2. Continuous Functions and their Derivatives / 46 \\ 2.3.3. Order Notation / 52 \\ 2.3.4. Taylor's Theorem / 52 \\ 2.3.5. Finite-Difference Approximations to Derivatives / 54 \\ 2.3.6. Rates of Convergence of Iterative Sequences / 56 \\ Notes and Selected Bibliography for Section 2.3 / 58 \\ 3: Optimality Conditions / 59 \\ 3.1. Characterization of a Minimum / 59 \\ 3.2. Unconstrained Optimization / 61 \\ 3.2.1. The Univariate Case / 61 \\ 3.2.2. The Multivariate Case / 63 \\ 3.2.3. Properties of Quadratic Functions / 65 \\ 3.3. Linearly Constrained Optimization / 67 \\ 3.3.1. Linear Equality Constraints / 68 \\ 3.3.2. Linear Inequality Constraints / 71 \\ 3.3.2.1. General optimality conditions / 71 \\ 3.3.2.2. Linear programming / 75 \\ 3.3.2.3. Quadratic programming / 76 \\ 3.3.2.4. Optimization subject to bounds / 77 \\ 3.4. Nonlinearly Constrained Optimization / 77 \\ 3.4.1. Nonlinear Equality Constraints / 78 \\ 3.4.2. Nonlinear Inequality Constraints / 81 \\ Notes and Selected Bibliography for Section 3.4 / 82 \\ 4: Unconstrained Methods / 83 \\ 4.1. Methods for Univariate Functions / 83 \\ 4.1.1. Finding a Zero of a Univariate Function / 83 \\ 4.1.1.1. The method of bisection / 84 \\ 4.1.1.2. Newton's method / 84 \\ 4.1.1.3. Secant and regula falsi methods / 85 \\ *4.1.1.4. Rational interpolation and higher-order methods / 87 \\ 4.1.1.5. Safeguarded zero-finding algorithms / 87 \\ 4.1.2. Univariate Minimization / 88 \\ 4.1.2.1. Fibonacci search / 89 \\ 4.1.2.2. Golden section search / 90 \\ 4.1.2.3. Polynomial interpolation / 91 \\ 4.1.2.4. Safeguarded polynomial interpolation / 92 \\ Notes and Selected Bibliography for Section 4.1 / 92 \\ 4.2. Methods for Multivariate Non-Smooth Functions / 93 \\ 4.2.1. Use of Function Comparison Methods / 93 \\ 4.2.2. The Polytope Algorithm / 94 \\ *4.2.3. Composite Non-Differentiable Functions / 96 \\ Notes and Selected Bibliography for Section 4.2 / 98 \\ 4.3. Methods for Multivariate Smooth Functions / 99 \\ 4.3.1. A Model Algorithm for Smooth Functions / 99 \\ 4.3.2. Convergence of the Model Algorithm / 99 \\ 4.3.2.1. Computing the step length / 100 \\ 4.3.2.2. Computing the direction of search / 102 \\ Notes and Selected Bibliography for Section 4.3 / 104 \\ 4.4. Second Derivative Methods / 105 \\ 4.4.1. Newton's Method / 105 \\ 4.4.2. Strategies for an Indefinite Hessian / 107 \\ 4.4.2.1. A method based on the spectral decomposition / 107 \\ *4.4.2.2. Methods based on the Cholesky factorization / 108 \\ Notes and Selected Bibliography for Section 4.4 / 111 \\ 4.5. First Derivative Methods / 115 \\ 4.5.1. Discrete Newton Methods / 115 \\ 4.5.2. Quasi-Newton Methods / 116 \\ 4.5.2.1. Theory / 116 \\ 4.5.2.2. Implementation / 122 \\ *4.5.2.3. Convergence; least-change characterization / 123 \\ Notes and Selected Bibliography for Section 4.5 / 125 \\ 4.6. Non-Derivative Methods for Smooth Functions / 127 \\ 4.6.1. Finite-Difference Approximations to First Derivatives / 127 \\ 4.6.1.1. Errors in a forward-difference approximation / 127 \\ 4.6.1.2. Choice of the finite-difference interval / 128 \\ 4.6.1.3. Estimation of a set of finite-difference intervals / 129 \\ 4.6.1.4. The choice of finite-difference formulae / 130 \\ 4.6.2. Non-Derivative Quasi-Newton Methods / 131 \\ Notes and Selected Bibliography for Section 4.6 / 131 \\ 4.7. Methods for Sums of Squares / 133 \\ 4.7.1. Origin of Least-Squares Problems; the Reason for Special Methods / 133 \\ 4.7.2. The Gauss--Newton Method / 134 \\ 4.7.3. The Levenberg--Marquardt Method / 136 \\ *4.7.4. Quasi-Newton Approximations / 137 \\ *4.7.5. The Corrected Gauss--Newton Method / 138 \\ *4.7.6. Nonlinear Equations / 139 \\ Notes and Selected Bibliography for Section 4.7 / 140 \\ 4.8. Methods for Large-Scale Problems / 141 \\ 4.8.1. Sparse Discrete Newton Methods / 141 \\ *4.8.2. Sparse Quasi-Newton Methods / 143 \\ 4.8.3. Conjugate-Gradient Methods / 144 \\ 4.8.3.1. Quadratic functions / 144 \\ 4.8.3.2. The linear conjugate-gradient method / 146 \\ 4.8.3.3. General nonlinear functions / 147 \\ *4.8.3.4. Conjugate-gradient methods with restarts / 149 \\ *4.8.3.5. Convergence / 149 \\ *4.8.4. Limited-Memory Quasi-Newton Methods / 150 \\ *4.8.5. Preconditioned Conjugate-Gradient Methods / 151 \\ *4.8.5.1. Quadratic functions / 151 \\ *4.8.5.2. Nonlinear functions / 152 \\ *4.8.6. Solving the Newton Equation by Linear Conjugate-Gradients / 153 \\ Notes and Selected Bibliography for Section 4.8 / 153 \\ 5: Linear Constraints / 155 \\ 5.1. Methods for Linear Equality Constraints / 155 \\ 5.1.1. The Formulation of Algorithms / 156 \\ 5.1.1.1. The effect of linear equality constraints / 156 \\ 5.1.1.2. A model algorithm / 157 \\ 5.1.2. Computation of the Search Direction / 158 \\ 5.1.2.1. Methods of steepest descent / 158 \\ 5.1.2.2. Second derivative methods / 159 \\ 5.1.2.3. Discrete Newton methods / 160 \\ 5.1.2.4. Quasi-Newton methods / 160 \\ 5.1.2.5. Conjugate-gradient-related methods / 161 \\ 5.1.3. Representation of the Null Space of the Constraints / 162 \\ 5.1.3.1. The LQ factorization / 162 \\ 5.1.3.2. The variable-reduction technique / 163 \\ 5.1.4. Special Forms of the Objective Function / 163 \\ 5.1.4.1. Linear objective function / 163 \\ 5.1.4.2. Quadratic objective function / 164 \\ 5.1.5. Lagrange Multiplier Estimates / 164 \\ 5.1.5.1. First-order multiplier estimates / 165 \\ 5.1.5.2. Second-order multiplier estimates / 166 \\ Notes and Selected Bibliography for Section 5.1 / 166 \\ 5.2. Active Set Methods for Linear Inequality Constraints / 167 \\ 5.2.1. A Model Algorithm / 168 \\ 5.2.2. Computation of the Search Direction and Step Length / 169 \\ 5.2.3. Interpretation of Lagrange Multiplier Estimates / 170 \\ *5.2.4. Changes in the Working Set / 172 \\ *5.2.4.1. Modification of Z / 172 \\ *5.2.4.2. Modification of other matrices / 173 \\ Notes and Selected Bibliography for Section 5.2 / 174 \\ 5.3. Special Problem Categories / 176 \\ 5.3.1. Linear Programming / 176 \\ 5.3.2. Quadratic Programming / 177 \\ 5.3.2.1. Positive-definite quadratic programming / 177 \\ 5.3.2.2. Indefinite quadratic programming / 178 \\ *5.3.3. Linear Least-Squares with Linear Constraints / 180 \\ Notes and Selected Bibliography for Section 5.3 / 181 \\ *5.4. Problems with Few General Linear Constraints / 182 \\ *5.4.1. Positive-Definite Quadratic Programming / 183 \\ *5.4.2. Second Derivative Methods / 184 \\ *5.4.2.1. A method based on positive-definite quadratic programming / 184 \\ *5.4.2.2. A method based on an approximation of the projected Hessian / 185 \\ Notes and Selected Bibliography for Section 5.4 / 185 \\ 5.5. Special Forms of the Constraints / 186 \\ 5.5.1. Minimization Subject to Simple Bounds / 186 \\ *5.5.2. Problems with Mixed General Linear Constraints and Bounds / 188 \\ Notes and Selected Bibliography for Section 5.5 / 190 \\ 5.6. Large-Scale Linearly Constrained Optimization / 190 \\ 5.6.1. Large-scale Linear Programming / 190 \\ 5.6.2. General large-scale linearly constrained optimization / 193 \\ *5.6.2.1. Computation of the change in the superbasic variables / 194 \\ *5.6.2.2. Changes in the active set / 195 \\ Notes and Selected Bibliography for Section 5.6 / 196 \\ *5.7. Finding an Initial Feasible Point / 198 \\ Notes and Selected Bibliography for Section 5.7 / 199 \\ *5.8. Implementation of Active Set Methods / 199 \\ *5.8.1. Finding the Initial Working Set / 199 \\ *5.8.2. Linearly Dependent Constraints / 201 \\ *5.8.3. Zero Lagrange Multipliers / 201 \\ Notes and Selected Bibliography for Section 5.8 / 203 \\ 6: Nonlinear Constraints / 205 \\ 6.1. The Formulation of Algorithms / 206 \\ 6.1.1. The Definition of a Merit Function / 206 \\ 6.1.2. The Nature of Subproblems / 206 \\ 6.1.2.1. Adaptive and deterministic subproblems / 206 \\ 6.1.2.2. Valid and defective subproblems / 207 \\ 6.2. Penalty and Barrier Function Methods / 207 \\ 6.2.1. Differentiable Penalty and Barrier Function Methods / 207 \\ 6.2.1.1. The quadratic penalty function / 208 \\ 6.2.1.2. The logarithmic barrier function / 212 \\ 6.2.2. Non-Differentiable Penalty Function Methods / 214 \\ 6.2.2.1. The absolute value penalty function / 215 \\ 6.2.2.2. A method for general non-differentiable problems / 217 \\ Notes and Selected Bibliography for Section 6.2 / 218 \\ 6.3. Reduced-Gradient and Gradient-Projection Methods / 219 \\ 6.3.1. Motivation for Reduced-Gradient-Type Methods / 219 \\ 6.3.2. Definition of a Reduced-Gradient-Type Method / 220 \\ 6.3.2.1. Definition of the null-space component / 220 \\ 6.3.2.2. Restoration of feasibility / 222 \\ 6.3.2.3. Reduction of the objective function / 222 \\ 6.3.2.4. Properties of reduced-gradient-type methods / 223 \\ 6.3.3. Determination of the Working Set / 223 \\ Notes and Selected Bibliography for Section 6.3 / 224 \\ 6.4. Augmented Lagrangian Methods / 225 \\ 6.4.1. Formulation of an Augmented Lagrangian Function / 225 \\ 6.4.2. An Augmented Lagrangian Algorithm / 226 \\ 6.4.2.1. A model algorithm / 227 \\ 6.4.2.2. Properties of the augmented Lagrangian function / 228 \\ *6.4.3. Variations in Strategy / 230 \\ Notes and Selected Bibliography for Section 6.4 / 231 \\ 6.5. Projected Lagrangian Methods / 233 \\ 6.5.1. Motivation for a Projected Lagrangian Method / 233 \\ 6.5.1.1. Formulation of a linearly constrained subproblem / 233 \\ 6.5.1.2. Definition of the subproblem / 233 \\ 6.5.2. A General Linearly Constrained Subproblem / 234 \\ 6.5.2.1. Formulation of the objective function / 234 \\ 6.5.2.2. A simplified model algorithm / 235 \\ *6.5.2.3. Improvements to the model algorithm / 236 \\ 6.5.3. A Quadratic Programming Subproblem / 237 \\ 6.5.3.1. Motivation / 237 \\ 6.5.3.2. A simplified model algorithm / 238 \\ 6.5.3.3. Use of a merit function / 240 \\ *6.5.3.4. Other formulations of the subproblem / 241 \\ *6.5.4. Strategies for a Defective Subproblem / 242 \\ *6.5.4.1. Incompatible linear constraints / 242 \\ *6.5.4.2. Poor approximation of the Lagrangian function / 243 \\ *6.5.5. Determination of the Active Set / 243 \\ *6.5.5.1. An equality-constrained subproblem / 244 \\ *6.5.5.2. An inequality-constrained subproblem / 244 \\ Notes and Selected Bibliography for Section 6.5 / 245 \\ 6.6. Lagrange Multiplier Estimates / 247 \\ 6.6.1. First-Order Multiplier Estimates / 248 \\ 6.6.2. Second-Order Multiplier Estimates / 248 \\ *6.6.3. Multiplier Estimates for Inequality Constraints / 250 \\ 6.6.4. Consistency Checks / 250 \\ Notes and Selected Bibliography for Section 6.6 / 251 \\ *6.7. Large-Scale Nonlinearly Constrained Optimization / 251 \\ *6.7.1. The Use of a Linearly Constrained Subproblem / 252 \\ *6.7.2. The Use of a QP Subproblem / 253 \\ *6.7.2.1. Representing the basis inverse / 254 \\ *6.7.2.2. The search direction for the superbasic variables / 255 \\ Notes and Selected Bibliography for Section 6.7 / 256 \\ 6.8. Special Problem Categories / 256 \\ 6.8.1. Special Non-Differentiable Functions / 257 \\ 6.8.2. Special Constrained Problems / 257 \\ 6.8.2.1. Convex programming / 257 \\ 6.8.2.2. Separable programming / 258 \\ 6.8.2.3. Geometric programming / 258 \\ Notes and Selected Bibliography for Section 6.8 / 259 \\ 7: Modelling / 261 \\ 7.1. Introduction / 261 \\ 7.2. Classification of Optimization Problems / 262 \\ 7.3. Avoiding Unnecessary Discontinuities / 263 \\ 7.3.1. The Role of Accuracy in Model Functions / 263 \\ 7.3.2. Approximation by Series or Table Look-Up / 265 \\ 7.3.3. Subproblems Based on Iteration / 266 \\ Notes and Selected Bibliography for Section 7.3 / 267 \\ 7.4. Problem Transformations / 267 \\ 7.4.1. Simplifying or Eliminating Constraints / 267 \\ 7.4.1.1. Elimination of simple bounds / 268 \\ 7.4.1.2. Elimination of inequality constraints / 269 \\ 7.4.1.3. General difficulties with transformations / 270 \\ 7.4.1.4. Trigonometric transformations / 271 \\ 7.4.2. Problems Where the Variables are Continuous Functions / 272 \\ Notes and Selected Bibliography for Section 7.4 / 273 \\ 7.5. Scaling / 273 \\ 7.5.1. Scaling by Transformation of Variables / 273 \\ 7.5.2. Scaling Nonlinear Least-Squares Problems / 275 \\ 7.6. Formulation of Constraints / 276 \\ 7.6.1. Indeterminacy in Constraint Formulation / 276 \\ 7.6.2. The Use of Tolerance Constraints / 277 \\ Notes and Selected Bibliography for Section 7.6 / 280 \\ 7.7. Problems with Discrete or Integer Variables / 281 \\ 7.7.1. Pseudo-Discrete Variables / 281 \\ 7.7.2. Integer Variables / 282 \\ Notes and Selected Bibliography for Section 7.7 / 283 \\ 8: Practicalities / 285 \\ 8.1. Use of Software / 285 \\ 8.1.1. Selecting a Method / 285 \\ 8.1.1.1. Selecting an unconstrained method / 286 \\ 8.1.1.2. Selecting a method for linear constraints / 287 \\ 8.1.1.3. Selecting a method for nonlinear constraints / 290 \\ 8.1.2. The User Interface / 290 \\ 8.1.2.1. Default parameters / 291 \\ 8.1.2.2. Service routines / 291 \\ 8.1.3. Provision of User-Defined Parameters / 292 \\ 8.1.3.1. The precision of the problem functions / 292 \\ 8.1.3.2. Choice of step-length algorithm / 293 \\ 8.1.3.3. Step-length accuracy / 294 \\ 8.1.3.4. Maximum step length / 294 \\ 8.1.3.5. A bound on the number of function evaluations / 295 \\ 8.1.3.6. Local search / 295 \\ 8.1.3.7. The penalty parameter in an augmented Lagrangian method / 295 \\ 8.1.3.8. The penalty parameter for a non-smooth problem / 296 \\ 8.1.4. Solving the Correct Problem / 296 \\ 8.1.4.1. Errors in evaluating the function / 296 \\ 8.1.4.2. Errors in computing derivatives / 297 \\ 8.1.5. Making the Best of the Available Software / 298 \\ 8.1.5.1. Nonlinear least-squares problems / 298 \\ 8.1.5.2. Missing derivatives / 298 \\ 8.1.5.3. Solving constrained problems with an unconstrained routine / 299 \\ 8.1.5.4. Treatment of linear and nonlinear constraints / 299 \\ 8.1.5.5. Nonlinear equations / 299 \\ Notes and Selected Bibliography for Section 8.1 / 300 \\ 8.2. Properties of the Computed Solution / 300 \\ 8.2.1. What is a Correct Answer? / 300 \\ 8.2.2. The Accuracy of the Solution / 301 \\ 8.2.2.1. Unconstrained problems / 301 \\ 8.2.2.2. Accuracy in constrained problems / 303 \\ 8.2.3. Termination Criteria / 305 \\ 8.2.3.1. The need for termination criteria / 305 \\ 8.2.3.2. Termination criteria for unconstrained optimization / 306 \\ 8.2.3.3. Termination criteria for linearly constrained optimization / 308 \\ 8.2.3.4. Termination criteria for nonlinearly constrained optimization / 308 \\ 8.2.3.5. Conditions for abnormal termination / 309 \\ 8.2.3.6. The selection of termination criteria / 310 \\ Notes and Selected Bibliography for Section 8.2 / 312 \\ 8.3. Assessment of Results / 312 \\ 8.3.1. Assessing the Validity of the Solution / 312 \\ 8.3.1.1. The unconstrained case / 312 \\ 8.3.1.2. The constrained case / 315 \\ 8.3.2. Some Other Ways to Verify Optimality / 319 \\ 8.3.2.1. Varying the parameters of the algorithm / 319 \\ 8.3.2.2. Using a different method / 319 \\ 8.3.2.3. Changing the problem / 320 \\ 8.3.3. Sensitivity Analysis / 320 \\ 8.3.3.1. The role of the Hessian / 320 \\ 8.3.3.2. Estimating the condition number of the Hessian / 320 \\ 8.3.3.3. Sensitivity of the constraints / 323 \\ Notes and Selected Bibliography for Section 8.3 / 323 \\ 8.4. What Can Go Wrong (and What To Do About It) / 324 \\ 8.4.1. Overflow in the User-Defined Problem Functions / 324 \\ 8.4.2. Insufficient Decrease in the Merit Function / 324 \\ 8.4.2.1. Errors in programming / 325 \\ 8.4.2.2. Poor scaling / 325 \\ 8.4.2.3. Overly-stringent termination criteria / 327 \\ 8.4.2.4. Inaccuracy in a finite-difference approximation / 327 \\ 8.4.3. Consistent Lack of Progress / 328 \\ 8.4.3.1. Unconstrained optimization / 328 \\ 8.4.3.2. Linearly constrained optimization / 328 \\ 8.4.3.3. Nonlinearly constrained optimization / 328 \\ 8.4.4. Maximum Number of Function Evaluations or Iterations / 329 \\ 8.4.5. Failure to Achieve the Expected Convergence Rate / 329 \\ 8.4.6. Failure to Obtain a Descent Direction / 330 \\ 8.5. Estimating the Accuracy of the Problem Functions / 331 \\ 8.5.1. The Role of Accuracy / 331 \\ 8.5.1.1. A definition of accuracy / 331 \\ 8.5.1.2. How accuracy estimates affect optimization algorithms / 331 \\ 8.5.1.3. The expected accuracy / 332 \\ 8.5.2. Estimating the Accuracy / 333 \\ 8.5.2.1. Estimating the accuracy when higher precision is available / 333 \\ 8.5.2.2. Estimating the accuracy when derivatives are available / 334 \\ 8.5.2.3. Estimating the accuracy when only function values are available / 335 \\ 8.5.2.4. Numerical examples / 336 \\ 8.5.3. Re-Estimation of the Accuracy / 338 \\ Notes and Selected Bibliography for Section 8.5 / 339 \\ 8.6. Computing Finite Differences / 339 \\ 8.6.1. Errors in Finite-Difference Approximations; The Well-Scaled Case / 339 \\ 8.6.1.1. The forward-difference formula / 339 \\ 8.6.1.2. The central-difference formula / 340 \\ 8.6.1.3. Second-order differences / 341 \\ 8.6.2. A Procedure for Automatic Estimation of Finite-Difference Intervals / 341 \\ 8.6.2.1. Motivation for the procedure / 342 \\ 8.6.2.2. Statement of the algorithm / 343 \\ 8.6.2.3. Numerical examples / 344 \\ 8.6.2.4. Estimating the finite-difference interval at an arbitrary point / 344 \\ 8.6.2.5. Finite-difference approximations in constrained problems / 345 \\ Notes and Selected Bibliography for Section 8.6 / 346 \\ 8.7. More About Scaling / 346 \\ 8.7.1. Scaling the Variables / 346 \\ 8.7.1.1. Scale-invariance of an algorithm / 346 \\ 8.7.1.2. The conditioning of the Hessian matrix / 347 \\ 8.7.1.3. Obtaining well-scaled derivatives / 348 \\ 8.7.2. Scaling the Objective Function / 351 \\ 8.7.3. Scaling the Constraints / 352 \\ 8.7.3.1. Some effects of constraint scaling / 352 \\ 8.7.3.2. Methods for scaling linear constraints / 353 \\ 8.7.3.3. Methods for scaling nonlinear constraints / 354 \\ Notes and Selected Bibliography for Section 8.7 / 354 \\ Questions and Answers / 357 \\ Bibliography / 363 \\ Index / 389

entry:
@Book{Gill:1981:PO,
  author =       "Philip E. Gill and Walter Murray and Margaret H.
                 Wright",
  title =        "Practical Optimization",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xvi + 401",
  year =         "1981",
  ISBN =         "0-12-283950-1 (hardcover), 0-12-283952-8 (paperback)",
  ISBN-13 =      "978-0-12-283950-4 (hardcover), 978-0-12-283952-8
                 (paperback)",
  LCCN =         "QA402.5 .G5 1981",
  bibdate =      "Tue Dec 14 22:53:24 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Numerical optimization and parameter estimation are
                 essential tools in a wide variety of applications, such
                 as engineering, science, medicine, sociology and
                 economics. For these optimization techniques to be
                 exploited effectively, problem solvers need to be fully
                 informed of the scope and organization of software for
                 both the specialist and non-specialist; the underlying
                 numerical methods; the aspects of problem formulation
                 that affect performance; the assessment of computer
                 results and the resolution of difficulties that may
                 occur during the solution process. These topics form
                 the basis of the organization of Practical
                 Optimization. Much of the material about the estimation
                 of results and the preparation of the problem has not
                 been previously published. The book contains a
                 description of methods for numerical optimization to a
                 level which should make it a useful course text. It is
                 intended that the book should be self-contained.
                 Consequently, those elements of calculus, linear
                 algebra and numerical analysis pertinent to
                 optimization are reviewed in the opening chapters. This
                 is the first book on optimization which discusses not
                 only the methods but also the analysis of computed
                 results and the preparation of problems before
                 solution.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1: Introduction / 1 \\
                 2: Fundamentals / 7 \\
                 3: Optimality Conditions / 59 \\
                 4: Unconstrained Methods / 83 \\
                 5: Linear Constraints / 155 \\
                 6: Nonlinear Constraints / 205 \\
                 7: Modelling / 261 \\
                 8: Practicalities / 285 \\
                 Questions and Answers / 357 \\
                 Bibliography / 363 \\
                 Index / 389",
  tableofcontents = "1: Introduction / 1 \\
                 1.1. Definition of Optimization Problems / 1 \\
                 1.2. Classification of Optimization Problems / 3 \\
                 1.3. Overview of Topics / 5 \\
                 2: Fundamentals / 7 \\
                 2.1. Introduction to Errors in Numerical Computation /
                 7 \\
                 2.1.1. Measurement of Error / 7 \\
                 2.1.2. Number Representation on a Computer / 8 \\
                 2.1.3. Rounding Errors / 9 \\
                 2.1.4. Errors Incurred during Arithmetic Operations /
                 11 \\
                 2.1.5. Cancellation Error / 11 \\
                 2.1.6. Accuracy in a Sequence of Calculations / 13 \\
                 2.1.7. Error Analysis of Algorithms / 13 \\
                 Notes and Selected Bibliography for Section 2.1 / 14
                 \\
                 2.2. Introduction to Numerical Linear Algebra / 14 \\
                 2.2.1. Preliminaries / 14 \\
                 2.2.1.1. Scalars / 14 \\
                 2.2.1.2. Vectors / 14 \\
                 2.2.1.3. Matrices / 15 \\
                 2.2.1.4. Operations with vectors and matrices / 16 \\
                 2.2.1.5. Matrices with special structure / 18 \\
                 2.2.2. Vector Spaces / 19 \\
                 2.2.2.1. Linear combinations / 19 \\
                 2.2.2.2. Linear dependence and independence / 20 \\
                 2.2.2.3. Vector spaces; subspaces; basis / 21 \\
                 2.2.2.4. The null space / 22 \\
                 2.2.3. Linear Transformations / 23 \\
                 2.2.3.1. Matrices as transformations / 23 \\
                 2.2.3.2. Properties of linear transformations / 23 \\
                 2.2.3.3. Inverses / 24 \\
                 2.2.3.4. Eigenvalues; eigenvectors / 24 \\
                 2.2.3.5. Definiteness / 25 \\
                 2.2.4. Linear Equations / 25 \\
                 2.2.4.1. Properties of linear equations / 25 \\
                 2.2.4.2. Vector and matrix norms / 27 \\
                 2.2.4.3. Perturbation theory; condition number / 28 \\
                 2.2.4.4. Triangular linear systems / 30 \\
                 2.2.4.5. Error analysis / 31 \\
                 2.2.5. Matrix Factorizations / 32 \\
                 2.2.5.1. The LU factorization; Gaussian elimination /
                 33 \\
                 2.2.5.2. The LDLT and Cholesky factorizations / 36 \\
                 2.2.5.3. The QR factorization / 37 \\
                 2.2.5.4. The spectral decomposition of a symmetric
                 matrix / 40 \\
                 2.2.5.5. Singular-value decomposition / 40 \\
                 2.2.5.6. The pseudo-inverse / 41 \\
                 2.2.5.7. Updating matrix factorizations / 41 \\
                 2.2.6. Multi-dimensional Geometry / 43 \\
                 Notes and Selected Bibliography for Section 2.2 / 45
                 \\
                 2.3. Elements of Multivariate Analysis / 45 \\
                 2.3.1. Functions of Many Variables; Contour Plots / 45
                 \\
                 2.3.2. Continuous Functions and their Derivatives / 46
                 \\
                 2.3.3. Order Notation / 52 \\
                 2.3.4. Taylor's Theorem / 52 \\
                 2.3.5. Finite-Difference Approximations to Derivatives
                 / 54 \\
                 2.3.6. Rates of Convergence of Iterative Sequences / 56
                 \\
                 Notes and Selected Bibliography for Section 2.3 / 58
                 \\
                 3: Optimality Conditions / 59 \\
                 3.1. Characterization of a Minimum / 59 \\
                 3.2. Unconstrained Optimization / 61 \\
                 3.2.1. The Univariate Case / 61 \\
                 3.2.2. The Multivariate Case / 63 \\
                 3.2.3. Properties of Quadratic Functions / 65 \\
                 3.3. Linearly Constrained Optimization / 67 \\
                 3.3.1. Linear Equality Constraints / 68 \\
                 3.3.2. Linear Inequality Constraints / 71 \\
                 3.3.2.1. General optimality conditions / 71 \\
                 3.3.2.2. Linear programming / 75 \\
                 3.3.2.3. Quadratic programming / 76 \\
                 3.3.2.4. Optimization subject to bounds / 77 \\
                 3.4. Nonlinearly Constrained Optimization / 77 \\
                 3.4.1. Nonlinear Equality Constraints / 78 \\
                 3.4.2. Nonlinear Inequality Constraints / 81 \\
                 Notes and Selected Bibliography for Section 3.4 / 82
                 \\
                 4: Unconstrained Methods / 83 \\
                 4.1. Methods for Univariate Functions / 83 \\
                 4.1.1. Finding a Zero of a Univariate Function / 83 \\
                 4.1.1.1. The method of bisection / 84 \\
                 4.1.1.2. Newton's method / 84 \\
                 4.1.1.3. Secant and regula falsi methods / 85 \\
                 *4.1.1.4. Rational interpolation and higher-order
                 methods / 87 \\
                 4.1.1.5. Safeguarded zero-finding algorithms / 87 \\
                 4.1.2. Univariate Minimization / 88 \\
                 4.1.2.1. Fibonacci search / 89 \\
                 4.1.2.2. Golden section search / 90 \\
                 4.1.2.3. Polynomial interpolation / 91 \\
                 4.1.2.4. Safeguarded polynomial interpolation / 92 \\
                 Notes and Selected Bibliography for Section 4.1 / 92
                 \\
                 4.2. Methods for Multivariate Non-Smooth Functions / 93
                 \\
                 4.2.1. Use of Function Comparison Methods / 93 \\
                 4.2.2. The Polytope Algorithm / 94 \\
                 *4.2.3. Composite Non-Differentiable Functions / 96 \\
                 Notes and Selected Bibliography for Section 4.2 / 98
                 \\
                 4.3. Methods for Multivariate Smooth Functions / 99 \\
                 4.3.1. A Model Algorithm for Smooth Functions / 99 \\
                 4.3.2. Convergence of the Model Algorithm / 99 \\
                 4.3.2.1. Computing the step length / 100 \\
                 4.3.2.2. Computing the direction of search / 102 \\
                 Notes and Selected Bibliography for Section 4.3 / 104
                 \\
                 4.4. Second Derivative Methods / 105 \\
                 4.4.1. Newton's Method / 105 \\
                 4.4.2. Strategies for an Indefinite Hessian / 107 \\
                 4.4.2.1. A method based on the spectral decomposition /
                 107 \\
                 *4.4.2.2. Methods based on the Cholesky factorization /
                 108 \\
                 Notes and Selected Bibliography for Section 4.4 / 111
                 \\
                 4.5. First Derivative Methods / 115 \\
                 4.5.1. Discrete Newton Methods / 115 \\
                 4.5.2. Quasi-Newton Methods / 116 \\
                 4.5.2.1. Theory / 116 \\
                 4.5.2.2. Implementation / 122 \\
                 *4.5.2.3. Convergence; least-change characterization /
                 123 \\
                 Notes and Selected Bibliography for Section 4.5 / 125
                 \\
                 4.6. Non-Derivative Methods for Smooth Functions / 127
                 \\
                 4.6.1. Finite-Difference Approximations to First
                 Derivatives / 127 \\
                 4.6.1.1. Errors in a forward-difference approximation /
                 127 \\
                 4.6.1.2. Choice of the finite-difference interval / 128
                 \\
                 4.6.1.3. Estimation of a set of finite-difference
                 intervals / 129 \\
                 4.6.1.4. The choice of finite-difference formulae / 130
                 \\
                 4.6.2. Non-Derivative Quasi-Newton Methods / 131 \\
                 Notes and Selected Bibliography for Section 4.6 / 131
                 \\
                 4.7. Methods for Sums of Squares / 133 \\
                 4.7.1. Origin of Least-Squares Problems; the Reason for
                 Special Methods / 133 \\
                 4.7.2. The Gauss--Newton Method / 134 \\
                 4.7.3. The Levenberg--Marquardt Method / 136 \\
                 *4.7.4. Quasi-Newton Approximations / 137 \\
                 *4.7.5. The Corrected Gauss--Newton Method / 138 \\
                 *4.7.6. Nonlinear Equations / 139 \\
                 Notes and Selected Bibliography for Section 4.7 / 140
                 \\
                 4.8. Methods for Large-Scale Problems / 141 \\
                 4.8.1. Sparse Discrete Newton Methods / 141 \\
                 *4.8.2. Sparse Quasi-Newton Methods / 143 \\
                 4.8.3. Conjugate-Gradient Methods / 144 \\
                 4.8.3.1. Quadratic functions / 144 \\
                 4.8.3.2. The linear conjugate-gradient method / 146 \\
                 4.8.3.3. General nonlinear functions / 147 \\
                 *4.8.3.4. Conjugate-gradient methods with restarts /
                 149 \\
                 *4.8.3.5. Convergence / 149 \\
                 *4.8.4. Limited-Memory Quasi-Newton Methods / 150 \\
                 *4.8.5. Preconditioned Conjugate-Gradient Methods / 151
                 \\
                 *4.8.5.1. Quadratic functions / 151 \\
                 *4.8.5.2. Nonlinear functions / 152 \\
                 *4.8.6. Solving the Newton Equation by Linear
                 Conjugate-Gradients / 153 \\
                 Notes and Selected Bibliography for Section 4.8 / 153
                 \\
                 5: Linear Constraints / 155 \\
                 5.1. Methods for Linear Equality Constraints / 155 \\
                 5.1.1. The Formulation of Algorithms / 156 \\
                 5.1.1.1. The effect of linear equality constraints /
                 156 \\
                 5.1.1.2. A model algorithm / 157 \\
                 5.1.2. Computation of the Search Direction / 158 \\
                 5.1.2.1. Methods of steepest descent / 158 \\
                 5.1.2.2. Second derivative methods / 159 \\
                 5.1.2.3. Discrete Newton methods / 160 \\
                 5.1.2.4. Quasi-Newton methods / 160 \\
                 5.1.2.5. Conjugate-gradient-related methods / 161 \\
                 5.1.3. Representation of the Null Space of the
                 Constraints / 162 \\
                 5.1.3.1. The LQ factorization / 162 \\
                 5.1.3.2. The variable-reduction technique / 163 \\
                 5.1.4. Special Forms of the Objective Function / 163
                 \\
                 5.1.4.1. Linear objective function / 163 \\
                 5.1.4.2. Quadratic objective function / 164 \\
                 5.1.5. Lagrange Multiplier Estimates / 164 \\
                 5.1.5.1. First-order multiplier estimates / 165 \\
                 5.1.5.2. Second-order multiplier estimates / 166 \\
                 Notes and Selected Bibliography for Section 5.1 / 166
                 \\
                 5.2. Active Set Methods for Linear Inequality
                 Constraints / 167 \\
                 5.2.1. A Model Algorithm / 168 \\
                 5.2.2. Computation of the Search Direction and Step
                 Length / 169 \\
                 5.2.3. Interpretation of Lagrange Multiplier Estimates
                 / 170 \\
                 *5.2.4. Changes in the Working Set / 172 \\
                 *5.2.4.1. Modification of Z / 172 \\
                 *5.2.4.2. Modification of other matrices / 173 \\
                 Notes and Selected Bibliography for Section 5.2 / 174
                 \\
                 5.3. Special Problem Categories / 176 \\
                 5.3.1. Linear Programming / 176 \\
                 5.3.2. Quadratic Programming / 177 \\
                 5.3.2.1. Positive-definite quadratic programming / 177
                 \\
                 5.3.2.2. Indefinite quadratic programming / 178 \\
                 *5.3.3. Linear Least-Squares with Linear Constraints /
                 180 \\
                 Notes and Selected Bibliography for Section 5.3 / 181
                 \\
                 *5.4. Problems with Few General Linear Constraints /
                 182 \\
                 *5.4.1. Positive-Definite Quadratic Programming / 183
                 \\
                 *5.4.2. Second Derivative Methods / 184 \\
                 *5.4.2.1. A method based on positive-definite quadratic
                 programming / 184 \\
                 *5.4.2.2. A method based on an approximation of the
                 projected Hessian / 185 \\
                 Notes and Selected Bibliography for Section 5.4 / 185
                 \\
                 5.5. Special Forms of the Constraints / 186 \\
                 5.5.1. Minimization Subject to Simple Bounds / 186 \\
                 *5.5.2. Problems with Mixed General Linear Constraints
                 and Bounds / 188 \\
                 Notes and Selected Bibliography for Section 5.5 / 190
                 \\
                 5.6. Large-Scale Linearly Constrained Optimization /
                 190 \\
                 5.6.1. Large-scale Linear Programming / 190 \\
                 5.6.2. General large-scale linearly constrained
                 optimization / 193 \\
                 *5.6.2.1. Computation of the change in the superbasic
                 variables / 194 \\
                 *5.6.2.2. Changes in the active set / 195 \\
                 Notes and Selected Bibliography for Section 5.6 / 196
                 \\
                 *5.7. Finding an Initial Feasible Point / 198 \\
                 Notes and Selected Bibliography for Section 5.7 / 199
                 \\
                 *5.8. Implementation of Active Set Methods / 199 \\
                 *5.8.1. Finding the Initial Working Set / 199 \\
                 *5.8.2. Linearly Dependent Constraints / 201 \\
                 *5.8.3. Zero Lagrange Multipliers / 201 \\
                 Notes and Selected Bibliography for Section 5.8 / 203
                 \\
                 6: Nonlinear Constraints / 205 \\
                 6.1. The Formulation of Algorithms / 206 \\
                 6.1.1. The Definition of a Merit Function / 206 \\
                 6.1.2. The Nature of Subproblems / 206 \\
                 6.1.2.1. Adaptive and deterministic subproblems / 206
                 \\
                 6.1.2.2. Valid and defective subproblems / 207 \\
                 6.2. Penalty and Barrier Function Methods / 207 \\
                 6.2.1. Differentiable Penalty and Barrier Function
                 Methods / 207 \\
                 6.2.1.1. The quadratic penalty function / 208 \\
                 6.2.1.2. The logarithmic barrier function / 212 \\
                 6.2.2. Non-Differentiable Penalty Function Methods /
                 214 \\
                 6.2.2.1. The absolute value penalty function / 215 \\
                 6.2.2.2. A method for general non-differentiable
                 problems / 217 \\
                 Notes and Selected Bibliography for Section 6.2 / 218
                 \\
                 6.3. Reduced-Gradient and Gradient-Projection Methods /
                 219 \\
                 6.3.1. Motivation for Reduced-Gradient-Type Methods /
                 219 \\
                 6.3.2. Definition of a Reduced-Gradient-Type Method /
                 220 \\
                 6.3.2.1. Definition of the null-space component / 220
                 \\
                 6.3.2.2. Restoration of feasibility / 222 \\
                 6.3.2.3. Reduction of the objective function / 222 \\
                 6.3.2.4. Properties of reduced-gradient-type methods /
                 223 \\
                 6.3.3. Determination of the Working Set / 223 \\
                 Notes and Selected Bibliography for Section 6.3 / 224
                 \\
                 6.4. Augmented Lagrangian Methods / 225 \\
                 6.4.1. Formulation of an Augmented Lagrangian Function
                 / 225 \\
                 6.4.2. An Augmented Lagrangian Algorithm / 226 \\
                 6.4.2.1. A model algorithm / 227 \\
                 6.4.2.2. Properties of the augmented Lagrangian
                 function / 228 \\
                 *6.4.3. Variations in Strategy / 230 \\
                 Notes and Selected Bibliography for Section 6.4 / 231
                 \\
                 6.5. Projected Lagrangian Methods / 233 \\
                 6.5.1. Motivation for a Projected Lagrangian Method /
                 233 \\
                 6.5.1.1. Formulation of a linearly constrained
                 subproblem / 233 \\
                 6.5.1.2. Definition of the subproblem / 233 \\
                 6.5.2. A General Linearly Constrained Subproblem / 234
                 \\
                 6.5.2.1. Formulation of the objective function / 234
                 \\
                 6.5.2.2. A simplified model algorithm / 235 \\
                 *6.5.2.3. Improvements to the model algorithm / 236 \\
                 6.5.3. A Quadratic Programming Subproblem / 237 \\
                 6.5.3.1. Motivation / 237 \\
                 6.5.3.2. A simplified model algorithm / 238 \\
                 6.5.3.3. Use of a merit function / 240 \\
                 *6.5.3.4. Other formulations of the subproblem / 241
                 \\
                 *6.5.4. Strategies for a Defective Subproblem / 242 \\
                 *6.5.4.1. Incompatible linear constraints / 242 \\
                 *6.5.4.2. Poor approximation of the Lagrangian function
                 / 243 \\
                 *6.5.5. Determination of the Active Set / 243 \\
                 *6.5.5.1. An equality-constrained subproblem / 244 \\
                 *6.5.5.2. An inequality-constrained subproblem / 244
                 \\
                 Notes and Selected Bibliography for Section 6.5 / 245
                 \\
                 6.6. Lagrange Multiplier Estimates / 247 \\
                 6.6.1. First-Order Multiplier Estimates / 248 \\
                 6.6.2. Second-Order Multiplier Estimates / 248 \\
                 *6.6.3. Multiplier Estimates for Inequality Constraints
                 / 250 \\
                 6.6.4. Consistency Checks / 250 \\
                 Notes and Selected Bibliography for Section 6.6 / 251
                 \\
                 *6.7. Large-Scale Nonlinearly Constrained Optimization
                 / 251 \\
                 *6.7.1. The Use of a Linearly Constrained Subproblem /
                 252 \\
                 *6.7.2. The Use of a QP Subproblem / 253 \\
                 *6.7.2.1. Representing the basis inverse / 254 \\
                 *6.7.2.2. The search direction for the superbasic
                 variables / 255 \\
                 Notes and Selected Bibliography for Section 6.7 / 256
                 \\
                 6.8. Special Problem Categories / 256 \\
                 6.8.1. Special Non-Differentiable Functions / 257 \\
                 6.8.2. Special Constrained Problems / 257 \\
                 6.8.2.1. Convex programming / 257 \\
                 6.8.2.2. Separable programming / 258 \\
                 6.8.2.3. Geometric programming / 258 \\
                 Notes and Selected Bibliography for Section 6.8 / 259
                 \\
                 7: Modelling / 261 \\
                 7.1. Introduction / 261 \\
                 7.2. Classification of Optimization Problems / 262 \\
                 7.3. Avoiding Unnecessary Discontinuities / 263 \\
                 7.3.1. The Role of Accuracy in Model Functions / 263
                 \\
                 7.3.2. Approximation by Series or Table Look-Up / 265
                 \\
                 7.3.3. Subproblems Based on Iteration / 266 \\
                 Notes and Selected Bibliography for Section 7.3 / 267
                 \\
                 7.4. Problem Transformations / 267 \\
                 7.4.1. Simplifying or Eliminating Constraints / 267 \\
                 7.4.1.1. Elimination of simple bounds / 268 \\
                 7.4.1.2. Elimination of inequality constraints / 269
                 \\
                 7.4.1.3. General difficulties with transformations /
                 270 \\
                 7.4.1.4. Trigonometric transformations / 271 \\
                 7.4.2. Problems Where the Variables are Continuous
                 Functions / 272 \\
                 Notes and Selected Bibliography for Section 7.4 / 273
                 \\
                 7.5. Scaling / 273 \\
                 7.5.1. Scaling by Transformation of Variables / 273 \\
                 7.5.2. Scaling Nonlinear Least-Squares Problems / 275
                 \\
                 7.6. Formulation of Constraints / 276 \\
                 7.6.1. Indeterminacy in Constraint Formulation / 276
                 \\
                 7.6.2. The Use of Tolerance Constraints / 277 \\
                 Notes and Selected Bibliography for Section 7.6 / 280
                 \\
                 7.7. Problems with Discrete or Integer Variables / 281
                 \\
                 7.7.1. Pseudo-Discrete Variables / 281 \\
                 7.7.2. Integer Variables / 282 \\
                 Notes and Selected Bibliography for Section 7.7 / 283
                 \\
                 8: Practicalities / 285 \\
                 8.1. Use of Software / 285 \\
                 8.1.1. Selecting a Method / 285 \\
                 8.1.1.1. Selecting an unconstrained method / 286 \\
                 8.1.1.2. Selecting a method for linear constraints /
                 287 \\
                 8.1.1.3. Selecting a method for nonlinear constraints /
                 290 \\
                 8.1.2. The User Interface / 290 \\
                 8.1.2.1. Default parameters / 291 \\
                 8.1.2.2. Service routines / 291 \\
                 8.1.3. Provision of User-Defined Parameters / 292 \\
                 8.1.3.1. The precision of the problem functions / 292
                 \\
                 8.1.3.2. Choice of step-length algorithm / 293 \\
                 8.1.3.3. Step-length accuracy / 294 \\
                 8.1.3.4. Maximum step length / 294 \\
                 8.1.3.5. A bound on the number of function evaluations
                 / 295 \\
                 8.1.3.6. Local search / 295 \\
                 8.1.3.7. The penalty parameter in an augmented
                 Lagrangian method / 295 \\
                 8.1.3.8. The penalty parameter for a non-smooth problem
                 / 296 \\
                 8.1.4. Solving the Correct Problem / 296 \\
                 8.1.4.1. Errors in evaluating the function / 296 \\
                 8.1.4.2. Errors in computing derivatives / 297 \\
                 8.1.5. Making the Best of the Available Software / 298
                 \\
                 8.1.5.1. Nonlinear least-squares problems / 298 \\
                 8.1.5.2. Missing derivatives / 298 \\
                 8.1.5.3. Solving constrained problems with an
                 unconstrained routine / 299 \\
                 8.1.5.4. Treatment of linear and nonlinear constraints
                 / 299 \\
                 8.1.5.5. Nonlinear equations / 299 \\
                 Notes and Selected Bibliography for Section 8.1 / 300
                 \\
                 8.2. Properties of the Computed Solution / 300 \\
                 8.2.1. What is a Correct Answer? / 300 \\
                 8.2.2. The Accuracy of the Solution / 301 \\
                 8.2.2.1. Unconstrained problems / 301 \\
                 8.2.2.2. Accuracy in constrained problems / 303 \\
                 8.2.3. Termination Criteria / 305 \\
                 8.2.3.1. The need for termination criteria / 305 \\
                 8.2.3.2. Termination criteria for unconstrained
                 optimization / 306 \\
                 8.2.3.3. Termination criteria for linearly constrained
                 optimization / 308 \\
                 8.2.3.4. Termination criteria for nonlinearly
                 constrained optimization / 308 \\
                 8.2.3.5. Conditions for abnormal termination / 309 \\
                 8.2.3.6. The selection of termination criteria / 310
                 \\
                 Notes and Selected Bibliography for Section 8.2 / 312
                 \\
                 8.3. Assessment of Results / 312 \\
                 8.3.1. Assessing the Validity of the Solution / 312 \\
                 8.3.1.1. The unconstrained case / 312 \\
                 8.3.1.2. The constrained case / 315 \\
                 8.3.2. Some Other Ways to Verify Optimality / 319 \\
                 8.3.2.1. Varying the parameters of the algorithm / 319
                 \\
                 8.3.2.2. Using a different method / 319 \\
                 8.3.2.3. Changing the problem / 320 \\
                 8.3.3. Sensitivity Analysis / 320 \\
                 8.3.3.1. The role of the Hessian / 320 \\
                 8.3.3.2. Estimating the condition number of the Hessian
                 / 320 \\
                 8.3.3.3. Sensitivity of the constraints / 323 \\
                 Notes and Selected Bibliography for Section 8.3 / 323
                 \\
                 8.4. What Can Go Wrong (and What To Do About It) / 324
                 \\
                 8.4.1. Overflow in the User-Defined Problem Functions /
                 324 \\
                 8.4.2. Insufficient Decrease in the Merit Function /
                 324 \\
                 8.4.2.1. Errors in programming / 325 \\
                 8.4.2.2. Poor scaling / 325 \\
                 8.4.2.3. Overly-stringent termination criteria / 327
                 \\
                 8.4.2.4. Inaccuracy in a finite-difference
                 approximation / 327 \\
                 8.4.3. Consistent Lack of Progress / 328 \\
                 8.4.3.1. Unconstrained optimization / 328 \\
                 8.4.3.2. Linearly constrained optimization / 328 \\
                 8.4.3.3. Nonlinearly constrained optimization / 328 \\
                 8.4.4. Maximum Number of Function Evaluations or
                 Iterations / 329 \\
                 8.4.5. Failure to Achieve the Expected Convergence Rate
                 / 329 \\
                 8.4.6. Failure to Obtain a Descent Direction / 330 \\
                 8.5. Estimating the Accuracy of the Problem Functions /
                 331 \\
                 8.5.1. The Role of Accuracy / 331 \\
                 8.5.1.1. A definition of accuracy / 331 \\
                 8.5.1.2. How accuracy estimates affect optimization
                 algorithms / 331 \\
                 8.5.1.3. The expected accuracy / 332 \\
                 8.5.2. Estimating the Accuracy / 333 \\
                 8.5.2.1. Estimating the accuracy when higher precision
                 is available / 333 \\
                 8.5.2.2. Estimating the accuracy when derivatives are
                 available / 334 \\
                 8.5.2.3. Estimating the accuracy when only function
                 values are available / 335 \\
                 8.5.2.4. Numerical examples / 336 \\
                 8.5.3. Re-Estimation of the Accuracy / 338 \\
                 Notes and Selected Bibliography for Section 8.5 / 339
                 \\
                 8.6. Computing Finite Differences / 339 \\
                 8.6.1. Errors in Finite-Difference Approximations; The
                 Well-Scaled Case / 339 \\
                 8.6.1.1. The forward-difference formula / 339 \\
                 8.6.1.2. The central-difference formula / 340 \\
                 8.6.1.3. Second-order differences / 341 \\
                 8.6.2. A Procedure for Automatic Estimation of
                 Finite-Difference Intervals / 341 \\
                 8.6.2.1. Motivation for the procedure / 342 \\
                 8.6.2.2. Statement of the algorithm / 343 \\
                 8.6.2.3. Numerical examples / 344 \\
                 8.6.2.4. Estimating the finite-difference interval at
                 an arbitrary point / 344 \\
                 8.6.2.5. Finite-difference approximations in
                 constrained problems / 345 \\
                 Notes and Selected Bibliography for Section 8.6 / 346
                 \\
                 8.7. More About Scaling / 346 \\
                 8.7.1. Scaling the Variables / 346 \\
                 8.7.1.1. Scale-invariance of an algorithm / 346 \\
                 8.7.1.2. The conditioning of the Hessian matrix / 347
                 \\
                 8.7.1.3. Obtaining well-scaled derivatives / 348 \\
                 8.7.2. Scaling the Objective Function / 351 \\
                 8.7.3. Scaling the Constraints / 352 \\
                 8.7.3.1. Some effects of constraint scaling / 352 \\
                 8.7.3.2. Methods for scaling linear constraints / 353
                 \\
                 8.7.3.3. Methods for scaling nonlinear constraints /
                 354 \\
                 Notes and Selected Bibliography for Section 8.7 / 354
                 \\
                 Questions and Answers / 357 \\
                 Bibliography / 363 \\
                 Index / 389",
}


